## User login## Navigation |
## Binary Lambda Calculus and Combinatory LogicWhile Anton was waxing about Church & Turing, I figured that Occam's Razor would be the type of proof one would postulate when giving the nod to Lambda Calculus over Universal Turing Machines. This leads inexorably to the question of what is the smallest (as measured in binary bits) Turing Machine that can possibly be constructed. John Tromp provides an answer to this question in his always fun Lambda Calculus and Combinatory Logic Playground:
Interestingly, the version based on the Lambda Calculus is smaller than the one on Combinators. A statement I found of interest in the paper about PL's:
Not sure if that statement means that PL research is ultimately doomed. :-) |
## Browse archives## Active forum topics |

## Recent comments

3 hours 51 min ago

6 hours 11 sec ago

13 hours 14 min ago

18 hours 14 min ago

18 hours 25 min ago

20 hours 30 min ago

1 day 3 hours ago

1 day 4 hours ago

1 day 7 hours ago

1 day 8 hours ago