next up previous
Next: Arguments For Church-Turing Thesis Up: No Title Previous: Off-line TMs

CHURCH - TURING HYPOTHESIS

ANY "COMPUTABLE" FUNCTION IS A PARTIAL RECURSIVE FUNCTION.
tex2html_wrap_inline469 ANY "COMPUTABLE" FUNCTION HAS A TM TO COMPUTE IT.



Sushil Prasad
Thu Jul 30 17:32:57 EDT 1998