- 3,317 views, 1 today
- 97 downloads, 0 today
5
A redstone Turing Machine, it's tape can be made as long as you like up to filling the entire loaded area (up to your view distance in single player). It's also very fast, it runs on a 10 tick clock right now, sadly it only has 8 states and a 4 symbol tape alphabet, so I don't think it can be programmed to be universal. I can add more states but I'd have to slow the clock down by at least 2 ticks, possibly more.
The tape is made of modified Bazilflops.
This thing is VERY update intense, and gets more so as you add more tape to it, at the moment starting the thing running causes my framerate to drop to something like 10-15fps, but I'm planning to buy a new laptop soon, so hopefully once I get that I'll be able to record a video of it running and I'll upload an explanation video then.
Currently needs more signs and I plan to eventually do a video explaining how stuff in it works.
EDIT: according to wikipedia there is in fact at least two universal machines that could be programmed into this one, so that's just awesome.
If you don't know what a Turing Machine is see wikipedia
The tape is made of modified Bazilflops.
This thing is VERY update intense, and gets more so as you add more tape to it, at the moment starting the thing running causes my framerate to drop to something like 10-15fps, but I'm planning to buy a new laptop soon, so hopefully once I get that I'll be able to record a video of it running and I'll upload an explanation video then.
Currently needs more signs and I plan to eventually do a video explaining how stuff in it works.
EDIT: according to wikipedia there is in fact at least two universal machines that could be programmed into this one, so that's just awesome.
If you don't know what a Turing Machine is see wikipedia
| Progress | 85% complete |
| Tags |
3 Update Logs
Update #3 : by Spudd86 03/25/2017 4:18:51 pmMar 25th, 2017
Fixed a bunch of stuff
- a redstone wire was too long in the state decoder
- a bunch of pistons broke when the world was update
- some pistons were quasi-connected to other signal lines
- set the state transition rules to be the 3 state, 2 symbol busy beaver by default.
Added a scoreboard based counter of how many times the TM's clock has run since you pushed the start button
useful to know if your computation has run longer than it was supposed to.
Also changed how the machine halts, now you simply set a torch on the previously unused data slot to indicate that a certain transition should cause a halt. This means that state 0 is less special, it's only specialness is in being the start state so all 8 states can be used during computation now.
- a redstone wire was too long in the state decoder
- a bunch of pistons broke when the world was update
- some pistons were quasi-connected to other signal lines
- set the state transition rules to be the 3 state, 2 symbol busy beaver by default.
Added a scoreboard based counter of how many times the TM's clock has run since you pushed the start button
useful to know if your computation has run longer than it was supposed to.
Also changed how the machine halts, now you simply set a torch on the previously unused data slot to indicate that a certain transition should cause a halt. This means that state 0 is less special, it's only specialness is in being the start state so all 8 states can be used during computation now.
LOAD MORE LOGS
tools/tracking
635268
2
turing-machine
Calandor
ScotsMiser
sniffercraft34
nasauer
Escapazition
PsyChNOdelic
Bertoxx
Smugi
Aulon
Create an account or sign in to comment.
Some great work here !, and yes it definatly is computationally universal !
A 2-state 3-symbol system has been proven universal.
Especially nice work on the clock, 10-tick might put your machine well infront as the fastest turing complete redstone machine.
Ofcoarse speed is not equal to power in this case; indeed, even an 8-colored single tape device is very difficult to program.
Brilliant work once again !, thanks for the additional pictures.... and welcome to PlanetMinecraft !
The set of transition-rules number is 596440 and it looks like this.
In written form:
{{1, 2} -> {1, 1, -1}, {1, 1} -> {1, 2, -1}, {1, 0} -> {2, 1, 1},
{2, 2} -> {1, 0, 1}, {2, 1} -> {2, 2, 1}, {2, 0} -> {1, 2, -1}}
using format: {state, color} -> {state, color, offset}
Hehe, yes, this machine is only universal assuming a massive specific uniform pattern fills the tape... and even then... it would take NP time to do much anything.
A nice thought experiment tho.
I like that one because not only does it fit but I could make my state 7 into a reject state (well really just a second halt state it's up to you weather state 0 or 7 is reject or accept) and have it also work as a decision type machine.