Machine Life Views
F And on a completely different note, awhile back I alluded to the possibility that the Greet Machine would soon cease to exist and that changes in my life could be coming. Well, you'll be happy (maybe not?) to know that neither will be happening. In November I applied for a new position at the University of St. Thomas. I had an interview at the beginning of February, but in the interview I think we could both tell that it just wasn't the right fit. I found out last Friday that I didn't get the job.
While at church, the intrigue got to me. Is it really a bottle on top of my chimney? And if not, what is it? So, after I got home I climbed up on top of the roof to take a look. Now keep in mind that it had just snowed heavily so my roof was a dangerous place to be, to say the least. Truthfully, I almost fell off several times as my feet tried to find purchase on the newly fallen snow. This, dear readers, is what I do for you. In order to bring you the most interesting Greet Machine I can, I will risk my life to bring you the story you deserve.
What's new 23/03/11 Full Universal Version created. The new stack has been integrated with the Finite State Machine and the Stack Constructor to create a truly universal turing machine. 16/11/10 Stack Constructor created. A new stack design with a constructor pattern which adds cells continuously. 02/03/10 Universal Version created. 12/01/05 I am starting to investigate a stack generator. The first stage is a simple program to assemble life patterns See Stack Constructor. 25/08/00 Added colour annotation to the picture for the OUT Gate and updated In Gate 13/06/00 Added colour annotation to the picture for the In Gate
As with all Turing Machines the tape can be arbitrarily long. In practice the size can be set by the maximum number of cycles the machine will be run. An alternative design for a universal computing machine is Marvin Minsky's register machine. This stores arbitrary large numbers by pushing blocks into empty space. A design for the registers was constructed in Conway's Game of Life by Dean Hickinson in 1990 In 2002 Paul Chapman used this to implemented a complete register machine that demonstrates universal capability