Category:Uncomputable
From Esolanging
Jump to navigationJump to search
Languages which cannot be computed by a Turing machine. This is not mutually exclusive with Turing-completeness, for example one could have a language that is simply Python but with a halting oracle. Since Python is Turing-complete, that language would also be Turing-complete, but it itself would not be able to be simulated by another Turing-complete system.
Pages in category "Uncomputable"
The following 2 pages are in this category, out of 2 total.
