Sunday, December 20, 2015

[jmpornoj] Busy Beaver in other languages

Turing Machine is an arcane unwieldy computer language.  What is the largest number that can be computed by very small terminating programs in other languages?  Perhaps lambda calculus with only a zero and successor function arithmetic atoms, which is what the Ackermann function relies on.

No comments :