next up previous
Next: The Relevant Theorems Up: Some Key Definitions Previous: Turing-Decidability


Let be some alphabet. A TM M accepts a string iff M halts on input u. A TM M accepts a language iff . A language is Turing-acceptable iff there is some TM that accepts it.

Selmer Bringsjord
Thu Apr 25 14:15:16 EDT 1996