Is the universe a colossal Turing machine?

September 24, 2009 by Macbeth · 2 Comments
Filed under: Hardware , Software

A MT is a formal model of the concept of algorithm we can imagine how a device can read / write symbols from / to a tape, and move through it (or cause the tape to move, which gives it a thing as other). The tape can imagine the unlimited length, and divided into squares, each of which may be a symbol. The MT is at all times in a certain state
internal (from a certain set of possible states) and has an internal transition function that tells you what to write, how to move, and how to change the internal state based on the current state and what they are reading in each time of the tape. The definition of TM is incomplete if we indicate the alphabet A that contains all the symbols that can be read / write, the set of possible states Q, the
q0 initial state and the transition function d. The operation of the MT terminates when it reaches a stop state. The initial contents of the tape corresponding to the input of the algorithm, and the contents to its output end.

erase-lo-previo

Decoding the Universe, Charles Seife (for whom it was anime)
Programming the Universe, Seth Lloyd (for those who do not get discouraged)

Source: Microserfs


Close
Mail