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. tromp+M79[view] [source] 2023-09-20 12:07:06
>>arethu+p69
Note that a Busy Beaver function is even more simply defined for the lambda calculus, and since it's measured in the more natural unit of bits rather than states, more values can be computed [1].

[1] https://oeis.org/A333479

[go to top]