Computability theory: concepts and applications

Choice Reviews Online · 1992

Turing machines turing machines as recognisers universality undecidability alternative models post's correspondence problem recursive function theory formal models of arithmetic Godel's incompleteness theorem computer science and computability theory.

Read the paper · More papers on PaperTik