Revision as of 03:48, 9 August 2003 edit Doradus (talk \| contribs) Extended confirmed users, Pending changes reviewers 6,033 edits Never mind about cond ← Previous edit		Revision as of 03:49, 24 August 2003 edit undo CYD (talk \| contribs) 2,398 edits No edit summary Next edit →
Line 80: :::::Incidentally, CYD, do you think a Turing machine could implement an interpreter for cond, including the syntax? If so, lambda calculus can do it too, because lambda calculus is Turing-equivalent. --[[User:P3d0\|P3d0]] 03:48, 9 Aug 2003 (UTC) ::::::My point is that it is probably syntactically impossible, since cond uses some special syntactic rules that are treated specially by the Lisp interpreter. In other words, you'd have a problem getting the input into your "Turing machine" without encountering an interpreter error. Of course, I'd be happy to agree that you were correct if you can show us how to implement cond with lambda. -- [[User:CYD\|CYD]]

Talk:Lisp (programming language): Difference between revisions