How functional programming using lambda calculus is analogous to construction of Turing machine as per computational aspects?
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
1
The short answer is that every computation describable in lambda calculus can be computed on a turing machine, at the same time every Turing machine program can be converted into a lambda calculus.
The long answer would include proofs that both of those statements are true but that's a bit out of scope for this site.
answered Feb 23 at 10:37
-
$\begingroup$ That gives me some intuition .Thanks. $\endgroup$ Commented Feb 28 at 16:12