Sujet : Another Halting Problem Question (very difficult)
De : wyniijj5 (at) *nospam* gmail.com (wij)
Groupes : comp.theoryDate : 28. May 2024, 23:37:31
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <e59d06e61850db2c77d1a784abce13dc84067079.camel@gmail.com>
User-Agent : Evolution 3.50.2 (3.50.2-1.fc39)
Everybody knows the Halting Problem is undecidable (liars also know). But if we
restrict the condition a little bit: Does there exists a decision function h, h
determines whether or not an arbitrary function void f() (given as the argument
of h) terminates or not (h,f∈O(2^N)) ? IOW, h(f)==true iff f() terminates.
Another Halting Problem Question (very difficult)
Re: Another Halting Problem Question (very difficult)