This is the longest running 4 state 2 symbol busy beaver, 1RB 1LB 1LA 0LC 1RH 1LD 1RD 0RA. The longest running 5 state 2 symbol, 6 state 2 symbol, 3 state 3 symbol, 2 state 4 symbol, etc. busy beavers have yet to be found.
Update: the 5-state has been found. [B1L C1R C1L B1L D1L E0R A1R D1R H1L A0R] runs for 47,176,870 steps and is the longest-running halting 5,2 machine.
Knowing the maximum number of steps could be important...if you design a machine that could solve an important mathematical result, you would have an upper bound on the number of steps...I acknowledge the numbers are very big.
The "application of this video" is simply being cool. A mechanical Turing machine is really cool! And as for your first confusion, I'm pretty sure there's no way to generalize the relationship between states and the number of steps, other than 'bigger state = larger possible step amount'. If you find one such generalization, many people will be glad to hear about it!
i dont know why but this machine is just adorable
This is the longest running 4 state 2 symbol busy beaver, 1RB 1LB 1LA 0LC 1RH 1LD 1RD 0RA. The longest running 5 state 2 symbol, 6 state 2 symbol, 3 state 3 symbol, 2 state 4 symbol, etc. busy beavers have yet to be found.
Update: the 5-state has been found. [B1L C1R C1L B1L D1L E0R A1R D1R H1L A0R] runs for 47,176,870 steps and is the longest-running halting 5,2 machine.
@@codegeek98 nice
This is like the great-great-grandmother of Skynet
do you have a normal speed version or a livestream to watch this?
One must imagine automata happy
i thought that was a permanent marker at first, and it was being erased by sanding down the paper
I'm confused on the relationship between 4 states and 107. And what the application of this is. Help?
107 is the maximum number of steps a halting 4 state Turing machine can take.
@@computercat8694 it's the most number of 1's put down not most steps while haulting
@@privateaccount4460 The maximum number of 1s from a 4-state machine is 13 en.wikipedia.org/wiki/Busy_beaver#Examples
Knowing the maximum number of steps could be important...if you design a machine that could solve an important mathematical result, you would have an upper bound on the number of steps...I acknowledge the numbers are very big.
The "application of this video" is simply being cool.
A mechanical Turing machine is really cool!
And as for your first confusion, I'm pretty sure there's no way to generalize the relationship between states and the number of steps, other than 'bigger state = larger possible step amount'.
If you find one such generalization, many people will be glad to hear about it!
Bravo!💙💙💙
Why haven't you made busy beavers 5-state?
It can't be a video, but a live. I don't know if RUclips will last for the output.
@@Caracazz2 I Guess Your right Cause I'm Pretty sure Busy-Beaver(5) = 4096
hmm i´m trying to write a coding for a busy beaver...you said 4 steps? ok that could be a hint for me....i hope so, it´s frustrating you know...-.-
I like the eraser.
Try applying an infinite one yourself then !
Now try giving it 748 states!!!