On Dec 6, 6:24 pm, Robert McIntyre <r...@mit.edu> wrote: > @javajosh You're speaking of the Turing description of computation, > you might be interested in Church's lambda calculus description which > works just as well and doesn't use mutability to describe computation,
Thanks, I'll look into that. Is there a difference in the "simplest possible physical representation" of a "Church" vs. a "Turing" machine? -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en
