Sujet : Re: Unpartial Halt Decider 4.0
De : richard (at) *nospam* damon-family.org (Richard Damon)
Groupes : comp.theoryDate : 19. Apr 2025, 00:09:26
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <49e2dfaf11da51fd494abdc3a5b590fb3fef8d97@i2pn2.org>
References : 1 2 3 4 5 6 7
User-Agent : Mozilla Thunderbird
On 4/18/25 5:28 PM, Mr Flibble wrote:
On Fri, 18 Apr 2025 17:15:40 -0400, Richard Damon wrote:
>
And the rules of the game are that deciders must answer in finite time.
Your perspective is:
Epistemic: knowledge must be actionable, and thus based on finite
computation.
Pragmatic: we need results in time, so knowing whether we’re in a loop is
more valuable than being able to analyze an infinite thing in an infinite
way.
This is totally reasonable — but my perspective is:
Not speaking about physical feasibility. I'm working in the theoretical
realm — just as Turing did.
/Flibble
But the problems still need the finiteness to have use.
Even in the theoretial, "proof" is still required to be finite, as are deciders.
That is the basic rules of the theoretical system.