next up previous
Next: Turing-Acceptability Up: Some Key Definitions Previous: Some Key Definitions

Turing-Decidability

Let be some alphabet. A language is Turing-decidable iff the function

is Turing-computable.


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