steve_bank
Diabetic retinopathy and poor eyesight. Typos ...
https://en.wikipedia.org/wiki/Turing_machine
The Turubg Machune was a pre digital electronics general computational model. In computer sciEnce computation means algorithms, not numerical calculation.
Turing imagined an ifinite paper tape divided into cells. A read/write head could index the tape backwards and forwards, read a symbol, and write a symbol. The symbols are arbitrary. The read/write head executes an algorithm on the symbols, today we say software. Paper tape Teletype machines were in existence, probably where got the inspiration in part. A recipe for a cake is an algorithm.
It is stated without proof that for a problem to be solvable it must be Turing Computable. In Theory Of Computaion you start with logic trees and graphs, and get to the point where there a classes of problems that can not be solved with logic alone. Memoery is required. In CS it is called push down automata, in the modern processor a stack.
The modern processor is a Turing Machine without infinite memory. Symbols in the form of digital bits are written and read from memory. The TM tape head becomes the processor. The paper tape becomes sequential random access memory.
Turing created the modern computer model. He was hounded and jailed by the British govt for being gay even though he was key to the WWII code breaking team. He was given a posthumus pardon in the 90s I think.
The Turubg Machune was a pre digital electronics general computational model. In computer sciEnce computation means algorithms, not numerical calculation.
Turing imagined an ifinite paper tape divided into cells. A read/write head could index the tape backwards and forwards, read a symbol, and write a symbol. The symbols are arbitrary. The read/write head executes an algorithm on the symbols, today we say software. Paper tape Teletype machines were in existence, probably where got the inspiration in part. A recipe for a cake is an algorithm.
It is stated without proof that for a problem to be solvable it must be Turing Computable. In Theory Of Computaion you start with logic trees and graphs, and get to the point where there a classes of problems that can not be solved with logic alone. Memoery is required. In CS it is called push down automata, in the modern processor a stack.
The modern processor is a Turing Machine without infinite memory. Symbols in the form of digital bits are written and read from memory. The TM tape head becomes the processor. The paper tape becomes sequential random access memory.
Turing created the modern computer model. He was hounded and jailed by the British govt for being gay even though he was key to the WWII code breaking team. He was given a posthumus pardon in the 90s I think.