Introduzione alle Macchine di Turing | Search for a title, author or keyword | ||||||||
Introduzione alle Macchine di Turing By Antonio Brogi, Antonio Cisternino and Francesco Romani, Pisa ( Italy ) University, Computer Science Department. An italian description about how a Turing machine works. Turing machines are basic abstract symbol-manipulating devices which, despite their simplicity, can be adapted to simulate the logic of any computer algorithm. They were described in 1936 by Alan Turing: an infinite memory capacity obtained in the form of an infinite tape marked out into squares on each of which a symbol could be printed. At any moment there is one symbol in the machine; it is called the scanned symbol. The machine can alter the scanned symbol and its behavior is in part determined by that symbol, but the symbols on the tape elsewhere do not affect the behavior of the machine. However, the tape can be moved back and forth through the machine, this being one of the elementary operations of the machine. Any symbol on the tape may therefore eventually have an innings ( Turing, 1948 ).
|
|||||||||
Introduzione alle Macchine di Turing | Disclaimer: this link points to content provided by other sites. |