Re:What’s New in Python 3.0
by eru on Saturday June 21, 2008 @12:21PM
(#223732)
Turing's machines are clunky. Do lambda calculus or grammars instead.
[ Parent
| on HN ]
Lambda calculus is beautiful, but modern computers are not lambda machines.
Is there a problem which can be solved in Lambda Calculus that cannot be solved in a Turing Machine?
A Lambda machine can be implemented using a Turing machine, but not the other way around, which means, Lambda calculus is a subset. Correct me if I'm wrong.
Re:What’s New in Python 3.0
by staticshock on Saturday June 21, 2008 @03:58PM
(#223822)
nope, they're turing equivalent. read up on the church-turing thesis.