-
2008
-
November
-
Busy Beavers and Universal Machines
11/07/08
Alain ColmerauerAlain Colmerauer has observed the following property of universal Turing machines. Given a universal Turing machine U, a Turing machine M and an input w to M, the operation of U on code(M)code(w) should simulate that of M on w (where code() is an encoding of Turing machines and their -
The Busy Beaver, the Placid Playpus and Other Crazy Creatures ...
11/04/08
Welcome! This blog is related to the busy beaver, the placid platypus and related topics. For a primer on these, please see this website More recent thoughts, often not yet fully formed, are discussed in this blog. Of course, comments are most welcome.
-
Busy Beavers and Universal Machines
-
November

Calendar



