Liste des Groupes | Revenir à theory |
On 7/11/2025 3:40 AM, Mikko wrote:That does not change the last sentence of the proof. Therefore theOn 2025-07-10 14:35:11 +0000, olcott said:It fails to prove undecidability when the decider
On 7/10/2025 5:54 AM, Fred. Zwarts wrote:Proofs don't understand. They prove.Op 09.jul.2025 om 15:02 schreef olcott:>*From the bottom of page 319 has been adapted to this*All Turing machine deciders only compute the mappingAt least one thing you understand.
from their actual inputs. This entails that they never
compute any mapping from non-inputs.
https://www.liarparadox.org/Peter_Linz_HP_317-320.pdf
*The Linz proof does not understand this*
correctly excludes directly executed Turing machines
from its domain.
Les messages affichés proviennent d'usenet.