zlacker

[return to "Show HN: A reference implementation of Turing's paper “On Computable Numbers”"]
1. arethu+p69[view] [source] 2023-09-20 11:57:05
>>jekude+(OP)
I had been fascinated with the Busy Beaver function for a few months and as my wife has been away for a few days and it was raining at the weekend so I spent a couple of hours writing a BB TM simulator and running a few machines - mostly so I can gaze in wonder as to what on Earth they are doing....

I'd love to see how far you have got - I had more of an interest in lambda calculus (and particularly combinators) but I have now developed a serious fascination with TMs. And yes the CS course I did covered them - but that was a long time ago!

◧◩
2. jekude+9i9[view] [source] 2023-09-20 13:24:28
>>arethu+p69
I embarrassingly don't actually know too much about Busy Beaver functions. If I have a free night this week I will play around and implement them!
◧◩◪
3. arethu+Aj9[view] [source] 2023-09-20 13:32:21
>>jekude+9i9
Here is the YouTube video that I watched and grabbed my interest:

https://www.youtube.com/watch?v=kmAc1nDizu0

Also the BB Challenge site - where I've been getting definitions of TMs to run:

https://bbchallenge.org

e.g.

1RB0LD_1RC0RF_1LC1LA_0LE1RZ_1LF0RB_0RC0RE

I've ran that one even though there is no hope of me ever seeing it terminate

https://bbchallenge.org/1RB0LD_1RC0RF_1LC1LA_0LE1RZ_1LF0RB_0...

[go to top]