Talk:Turing Completer

computability of turing-completeness

it's interesting to note in the context of this language that whether or not a language is turing-complete is probably uncomputable in general. a description of a language such as might be provided to the Potential Completer can be thought of as a program that implements that language, and whether the language so implemented is turing-complete is a semantic property, so rice's theorem applies right? the fact that we know the program must implement a language doesn't help because all programs can be said to implement some language