Quanta Abstractions

How to Build an Origami Computer

Two mathematicians have shown that origami can, in principle, be used to perform any possible computation. The post How to Build an Origami Computer first appeared on Quanta Magazine

In 1936, the British mathematician Alan Turing came up with an idea for a universal computer. It was a simple device: an infinite strip of tape covered in zeros and ones, together with a machine that could move back and forth along the tape, changing zeros to ones and vice versa according to some set of rules. He showed that such a device could be used to perform any computation.

Source

Originally published in Quanta Abstractions.

More from Quanta

Quanta1 min read
Avi Wigderson, Complexity Theory Pioneer, Wins Turing Award
The prolific researcher found deep connections between randomness and computation and spent a career influencing cryptographers, complexity researchers and more. The post Avi Wigderson, Complexity Theory Pioneer, Wins Turing Award first ap
Quanta1 min read
Mathematicians Marvel at ‘Crazy’ Cuts Through Four Dimensions
Topologists prove two new results that bring some order to the confoundingly difficult study of four-dimensional shapes. The post Mathematicians Marvel at ‘Crazy’ Cuts Through Four Dimensions first appeared on Quanta Magazine
Quanta1 min read
Michel Talagrand Wins Abel Prize for Work Wrangling Randomness
The French mathematician spent decades developing a set of tools now widely used for taming random processes. The post Michel Talagrand Wins Abel Prize for Work Wrangling Randomness first appeared on Quanta Magazine

Related Books & Audiobooks