The Powder Toy

Turing Machine II by bimmo_devices

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

  • bimmo_devices
    bimmo_devices     17th Jun 2013
    Google is your friend!
  • bimmo_devices
    bimmo_devices     17th Jun 2013
    well, my first machine had a small library of stuff. But to implement the collatz algorithm, you need something like 30 states. this is just a very small version of the Turing Machine. I will see if I can implement multiplication. It is possible to make a reversing algorithm: 12112|3| -> |3|21121. I might post some programs some time.
  • AlexSkr
    AlexSkr     17th Jun 2013
    any examples to calculate something?
  • bimmo_devices
    bimmo_devices     17th Jun 2013
    this could take a while- the machine is always in a state (the vertical of the grid, 1 at top, 0 is halt) and a word from the tape (the horizontal of the grid, 000 at left). the place in the grid where the current state and word intersect decides the action to take. this action includes 1) the new state; 2) the word to write; and 3) the direction to move (left, right, none and both = crash). the machine starts in state 1 and halts in state 0 (in this machine, state 7 is a crash state). the commands (the action in each grid cell) contain 3 bits for state to move to, 3 bits for word to write to the tape and 2 bits for direction (00 is don't move, 10 left and 01 right etc.) in that order left to right. a peice of insl in the grid cell means 0, and no pixel of insl means 1. each tape cell contains a 3 bit word and the green switch shows the current tape cell in consideration.
  • AlexSkr
    AlexSkr     17th Jun 2013
    intresting but 1st how it works and how to compute something with this?
  • AlexSkr
    AlexSkr     17th Jun 2013
    Yeah finally worked but i dont understand whats this machine for? ?
  • bimmo_devices
    bimmo_devices     17th Jun 2013
    Did You Know: A. Turing proved that a similar machine with an infinite tape length and limitless program grid could compute any computable algorithm.
  • AlexSkr
    AlexSkr     17th Jun 2013
    yes thank you for good description to crash it +1
  • bimmo_devices
    bimmo_devices     17th Jun 2013
    oh, sorry, it is a bit vague. see the little program cell example to the right? the gold in that cell is the program command. clear the similar area (it is insl) out of the top left cell. spark the big keypad on the zero - setting the current tape cell (with the active switch) to zero. when the machine starts it will read zero from the tape, compare it to the default state, 1, and because both of the directions to move are given, the machine will crash. it's a bit complicated.
  • AlexSkr
    AlexSkr     17th Jun 2013
    so how to do what you said :D