Turing Machine II by bimmo_devices

bimmo_devices

44 / 3

17th Jun 2013

18th Jun 2013

More compact. Similar programming. Better bomb. Still FREE TO COPY. State 7 = system crash. Comment if you want instructions. Current Program: the 3 state, 2 word busy beaver!

setcomplete fish turing machine electronic computer programmable

Comments

• 

  sentinal-5 17th Jun 2013
  or rather, it COULD compute any alogrithm, A; if everyone could write in the correct format, and B; if the bloomin' window was bigger! (to allow for more complex alogrithms.) and C; if there was room for a better display. +1 for recreating the one of the greatest inventions in computing ever! (not including the difference engine and the transistor switch)
• 

  billion57 17th Jun 2013
  If only I had a doctorate in Computer Science... @-Tra-Ranger This is THE computer. It is set-complete, meaning it can compute any algorithm. It was invented by Alan Turing, who revolutionized computing.
• 

  billion57 17th Jun 2013
  OHMIGOD It's a Turing Machine! I would make a primality checker, but I have no idea how to!
• 

  -Tra-Ranger 17th Jun 2013
  ok so wait. what is the point of this?
• 

  AlexSkr 17th Jun 2013
  okey ....
• 

  bimmo_devices 17th Jun 2013
  just follow the link on each subsequent page: 'other free stuff / TPT TM / Program Examples' or something like that
• 

  AlexSkr 17th Jun 2013
  okey ..
• 

  bimmo_devices 17th Jun 2013
  in the classical example, the turing machine tape moves rather than the read/write head. (or in this case, the switch cursor).
• 

  bimmo_devices 17th Jun 2013
  oh, go to my home page then to turing machine 1. you could convert some code to the new grid format.
• 

  AlexSkr 17th Jun 2013
  yes google but you said it has a small library of algorithms ...