3.1
A Turing machine is a 7-tuple(states, input alphabet, tape alphabet, transition function, start state, accept state, reject state)
Call a language is Turing-recognizable if some Turing machine recognize it.
Call a language is Turing-decidable if some Turing machine decides it.
3.2
Multiple Turing Machines
Non-deterministic Turing Machines
Enumerators
3.3
Hilbert’s 10th problem requires a precise definition of algorithm.
Church use the notational system called the l-calculus to defined algorithms and Turing did it with his “machines”. There two definitions are shown to be equivalent.
This connection between the informal notion of algorithm and the precise definition has come to be called the Church-Turing thesis.