Chapter 1 & all course notes
Main questions & lots of detailing
Gives result to a given input
Functions -> Computable -> Turing Computable
Qi (instruction), Si (seeing) , A(what to do), Q(which state to go
Long tape of set instructions.
There exists universal Turing Machines
There are incomputable functions. Ex: g (x)=fx (x)+1
Concept of computability – Turing computable
“Everything computable is also Turing computable.”
Familiar with the workings of Turing machines
If the function is not defined then the machine won’t stop.
In Turing’s time, a Universal Turing machine was simply a list of
quadruples. Today it’s a laptop for example.
Relationship between Church’s theories.
Mind is a