Sujet : Re: Can Flibble’s neos-based solution still be Turing Complete?
De : mikko.levanto (at) *nospam* iki.fi (Mikko)
Groupes : comp.theoryDate : 25. May 2025, 07:18:48
Autres entêtes
Organisation : -
Message-ID : <100uco8$182pt$1@dont-email.me>
References : 1 2
User-Agent : Unison/2.2
On 2025-05-24 16:02:41 +0000, olcott said:
On 5/23/2025 9:20 PM, Mr Flibble wrote:
Yes, **Flibble’s neos-based solution can still be Turing Complete as a
whole**, even though it **disallows programs from referencing the
decider**.
Let’s break this down precisely.
A more useful application of the term Turing Complete would be that
...
The only useful meaning is what the term actually means. Any other
meaning is harmful.
-- Mikko
Re: Can Flibble’s neos-based solution still be Turing Complete?
Re: Can Flibble’s neos-based solution still be Turing Complete?
