<- previous    index     next ->

Lecture 28 Church Turing Thesis 


  This is a mathematically unprovable belief that a reasonable intuitive
  definition of "computable" is equivalent to the list provably equivalent
  formal models of computation:

  Turing machines

  Lambda Calculus

  Post Formal Systems

  Partial Recursive Functions

  Unrestricted Grammars

  Recursively Enumerable Languages (decision problems)


  and intuitively what is computable by a computer program written in any
  reasonable programming language.


    <- previous    index     next ->

Other links

Go to top