Mathematik
January 10, 2004 7:53 PM Subscribe
[this is good]
posted by Orange Goblin at 2:32 AM on January 11, 2004
posted by Orange Goblin at 2:32 AM on January 11, 2004
Okay, I have a question about the Turing Machine section. The site states that "A challenging sport is to find among all Turing machines with n states the 'busy beaver,' the program, which produces from the empty band a maximum number of consecutive 1's before it halts."
It seems to me that just setting all the rules to 1R1 will move along the tape infinitely, setting each memory location to 1 as it goes. By saying "before it halts," does that mean that the program needs to come to a halt eventually to satisfy the problem?
posted by patgas at 8:58 AM on January 11, 2004
It seems to me that just setting all the rules to 1R1 will move along the tape infinitely, setting each memory location to 1 as it goes. By saying "before it halts," does that mean that the program needs to come to a halt eventually to satisfy the problem?
posted by patgas at 8:58 AM on January 11, 2004
patgas: yes. Note that this problem becomes uncomputable very quickly.
posted by fvw at 12:16 PM on January 11, 2004
posted by fvw at 12:16 PM on January 11, 2004
« Older AsimovLite | When Running is Outlawed, Only Outlaws Will Run Newer »
This thread has been archived and is closed to new comments
Many of these are open Hamiltonian problems and the models are approximations.
Curiously, the matter of whether our own solar system is stable is still really an open problem (though it is likely chaotic but bounded)
posted by vacapinta at 1:02 AM on January 11, 2004