Liste des Groupes | Revenir à theory |
Am Fri, 08 Nov 2024 09:01:47 -0600 schrieb olcott:On 11/8/2024 4:54 AM, joes wrote:Am Thu, 07 Nov 2024 21:54:05 -0600 schrieb olcott:On 11/7/2024 9:10 PM, Richard Damon wrote:On 11/7/24 11:39 AM, olcott wrote:On 11/7/2024 3:56 AM, Mikko wrote:On 2024-11-06 15:26:06 +0000, olcott said:On 11/6/2024 8:39 AM, Mikko wrote:On 2024-11-05 13:18:43 +0000, olcott said:On 11/5/2024 3:01 AM, Mikko wrote:On 2024-11-03 15:13:56 +0000, olcott said:On 11/3/2024 7:04 AM, Mikko wrote:On 2024-11-02 12:24:29 +0000, olcott said:It has always only been about the behavior that the INPUT Specifies.Silly distinction that buys you nothing.It should be noted that the problem STARTS with a program, which getsNo that it incorrect. It never starts with a program. A TM cannot
represented with a finite string,
handle another TM as its input. It starts with an encoding that has
associated semantics.
NON-INPUTS HAVE ALWAYS BEEN OFF THE TABLE.
What non-input do you have in mind? The TM the encoding of which we’reThe directly executed DDD() is not any freaking input to any damn thing.
feeding to HHH to simulate?
That is WRONG FREAKING ONE.Whatever those are.It is common knowledge that nobody is giving actual(?) TMs as input.and that string might be different for different deciders, as theIt is much dumber to think that a TM takes another actual TM as input.
problem doesn't define a specific encoding method.
Your insistance that the problem starts with a finite-string just
shows your ignorance.
It is common knowledge that this is not the case.
No, I mean the DDD that the outermostDDD emulated by HHH never reaches its own final state EVEN IF GODYou are confusing your simulation levels here.Now you are back to stupidly saying that DDD emulated by HHH reachesDDD specifies a non-halting computation to HHH because DDD calls HHHNo, because the HHH that DDD calls is programmed to break that
in recursive simulation.
recursive simulation, and thus make the results finite.
its final halt state because it is aborted.
Not because itself is aborted, but because the HHH that it calls
aborts.
COMMANDS IT!!!
If God commands it then God is INCORRECT.Yes, you are incorrect.
Maybe it would have, but ok.int main()You know that DDD emulated by HHH cannot possibly reach its own finalWhen HHH aborts, it halts and returns.
state (whether HHH ever aborts or not) and seem to believe that this
is irrelevant.
{
HHH(DDD); // When HHH aborts its emulated DDD
// this emulated DDD does not return
DDD(); // When DDD calls HHH(DDD)What about this DDD though?
// this emulated DDD never returns
}
Surprising relationship, considering your own pathology.The selfreference of HHH seems to be above your intellectual capacity.If you change HHH to not abort, then DDD does become non-halting, butThe infinite set of each HHH that emulates DDD (that aborts at some
point or not) is not above your educational or intellectual capacity.
No, we are talking about HHH halting either way.HHH doesn't give the right answer. That is a DIFFERENT HHH, and thus*We are not even talking about HHH giving the right answer yet*
a DIFFERENT DDD (as DDD to be a program includes ALL the code it
uses, so it includes the code of HHH, which you changed)
For N = 0 to ∞(a) DDD emulated by every HHH that aborts at some pointYou mean, if DDD called a fixed simulator that didn’t change along with
or not never reaches its final state.
the one simulating DDD.
each instance of HHH that emulate DDD N number of times DDD fails to
reach its final state and halts.
Only if DDD actually calls the strict simulator HHH1 instead of theIT CONTINUES TO BE MORONICALLY STUPID TO TRY TO
aborting HHH.
Les messages affichés proviennent d'usenet.