Liste des Groupes | Revenir à theory |
On 5/13/2025 12:06 PM, Richard Heathfield wrote:No, we couldn't.On 13/05/2025 17:21, dbush wrote:Sure and we could achieve the same thing byOn 5/13/2025 12:01 PM, olcott wrote:>
<snip>
>>The actual reasoning why HHH is supposed to report>
on the behavior of the direct execution of DD()
instead of the actual behavior that the finite
string of DD specifies:
Quite simply, it's the behavior of the direct execution that we want to know about.
Why?
>
DDD doesn't do anything interesting.
>
If it were a universal halt decider we'd have a reason to care, because its very existence would overturn pretty much the whole of computability theory and enable us to clean up many of the unsolved problems of mathematics.
>
simply hard-coding the actual all-knowing
mind of God into a formal system.
The question is not about any universal haltYes, it is.
decider
that must be literally all knowing.That sounds like hyperbole, but it's actually not far off. It could, at least, be used as an oracle; you'd just need to find a way to express your question as a YNA program.
It has always actually only been about thingsNo, it's all about demonstrating that some computational problems can't be solved. The whole halting thing is just a vehicle that can be used as an example of an undecidable computation.
that could prevent consistently determining
the halt status of conventional programs.
Right.But it /isn't/ a universal halt decider, so who (apart from Mr Olcott) gives a damn whether it stops? About the only reason I can think of for caring is to set Mr Olcott straight, but he has made it abundantly clear that he's unsettable straightable.There is no time that we are ever going to directly
>
encode omniscience into a computer program.
TheThere's nothing screwy about proving that such a program can't be written.
screwy idea of a universal halt decider that is
literally ALL KNOWING is just a screwy idea.
Les messages affichés proviennent d'usenet.