3 ms·
What is "really bad faith" about saying "An ON bit indicates the value 'googolplex'?" Computing is fundamentally about decoding bit strings as different arbitr
by pphysch 3y ago
What is "really bad faith" about saying "An ON bit indicates the value 'googolplex'?"
Computing is fundamentally about decoding bit strings as different arbitrary representations that are meaningful to humans.
- tromp 3y agoEven the word "googolplex" is quite a bit longer than the lambda calculus program in question...
- 8note 3y agoThe actual bit is just 1 though, the word "googolplex" is in the accompanying documents for interpreting the bit. The course on reading and using lambda calculus is similarly longer than than the actual lambda calculus expression
- chriswarbo 3y ago> The course on reading and using lambda calculus is similarly longer than than the actual lambda calculus expression I'm not sure what a "course on reading and using" has to do with description complexity? In any case, it takes 206 bits to implement a binary lambda calculus interpreter (that's Theorem 1 in http://tromp.github.io/cl/LC.pdf http://tromp.github.io/cl/LC.pdf )