Computable
Jump to navigation
Jump to search
- This article is not detailed enough and needs to be expanded. Please help us by adding some more information.
Computable languages are languages that can be simulated by Turing machines.
Examples of uncomputable languages
- Some languages that are able to solve the halting problem are uncomputable, like ^ and Oracle.
- Ambiguous languages are uncomputable, like Brain:D.
- Many joke languages are uncomputable because they have crazy commands, like Ifthen and User talk:/w/wiki/index.php/Talk:index.php/Main page.