Hacker News new | past | comments | ask | show | jobs | submit login

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.


nope, they're turing equivalent. read up on the church-turing thesis.


They are lambda isomorph.




Consider applying for YC's Spring batch! Applications are open till Feb 11.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: