Another problem with Alan's Turing halting problem theory: Time Travel

Nov 03, 2021 1 Replies

Here is another fun solution to the halting problem:



Machine F time travels to future, catches Alan building G, kills Alan, blows up G, G never came to be and that rhymes.



PROBLEM SOLVED LOL.



Time travel is very real in virtual machines, check VMWare and it's snap shotting features and it's VM Deletion feature ! =D



Bye, Skybuck.



P.S.: The moral of the story, if Alan is allowed to time travel and build G after F then F is allowed to time travel too ! =D HAHAHAHAHA.


From now on when people start this alan turing horse s*it, you tell them this to scare their pants off, great fun:

Logic is time dependent, you also underestimate the possibilities of the machine H, the machine H will be the terminator send through time to blow you up and the H+ HAHAHAHAHA. This is completely valid logic, try it with VMWare for all I care. The point being after H+ is blown up by the terminator H the H+ has HALTED LOLOLOLOLOLOLOLOL. Leave logic to real programmers. The terminator H is intelligent enough to spot the fake H+, through time as well, he has time vision ! HAHAHAHAHA. Do you really believe Terminator H cannot detect when he is enclosed in a BOX H+. THINK MAN. Do you really believe he cannot detect himself or an altered version. THINK MAN. HAHAHAHAHA. As soon as you tried to encapsulate TERMINATOR H he will RIP YOUR HEAD OFF. Do not f*ck with logic.

Bye, Skybuck.

Join the Discussion

Have something to add? Share your thoughts — no account required.

Didn't find your answer?

Ask the community — no account required