Turing machines; partial-recursive functions; equivalence of computing paradigms; Church-Turing thesis; undecidability; intractability. Four hours lecture
This lecture forms part of the "Turing Machines" topic of the Computer Science Concepts module
Optimization and decision problems, Reductions, Turing Machine as an acceptor and as an enumerator—T... Read more
CS 3200/5200 is an introduction to (a) formal language and automata theory and (b) computability. Fo... Read more
This course is an introduction to one of the fundamental topics in the theory of computer science: c... Read more
Add to ORKG