4 ms·
There is a program, G, which will take as input the source code of the program, P (in some fixed language) and output Turing machine, T which doesnt halt, such
by enugu 9y ago
There is a program, G, which will take as input the source code of the program, P (in some fixed language) and output Turing machine, T which doesnt halt, such that either P will fail to say T doesnt halt, or P has mistakes(claims halting for some Turing machines when they dont halt). Some programs P can algorithmically run P', P'' etc, but as long as that process is part of the source code of P, G will work.
- lisper 9y agoSure. So? How does that in any way refute what I said?
- enugu 9y agoPoint in my first post was that G is algorithmic. What you are referring to is the repeated extension of G which gets into issues of ordinals.
- lisper 9y agoYes, but I'm the one who made the original claim that "there is no algorithm for constructing a Godel sentence". So I'm the one who gets to say what I meant by that :-)