Scott commented on the Turing Machine vs lambda calculus approaches in: http://www.scottaaronson.com/blog/?p=2725#comment-1085117 http://www.scottaaronson.com/

Scott commented on the Turing Machine vs lambda calculus approaches in: http://www.scottaaronson.com/blog/?p=2725#comment-1085117 http://www.scottaaronson.com/blog/?p=2725#comment-1085117 showing a clear preference for the "physical" operation of Turing Machines. In the end, complexities are not that far apart, considering that https://gist.github.com/anonymous/a64213f391339236c2fe31f8749a0df6 https://gist.github.com/anonymous/a64213f391339236c2fe31f874... describes a 27 state Goldbach checking TM, which takes no more than 378 bits to encode, while https://github.com/tromp/AIT/blob/master/goldbach.lam https://github.com/tromp/AIT/blob/master/goldbach.lam describes an equivalent 267 bit Lambda Calculus term, which can also be represented as this https://github.com/tromp/AIT/blob/master/goldbach.gif https://github.com/tromp/AIT/blob/master/goldbach.gif lambda diagram, as explained in http://tromp.github.io/cl/diagrams.html http://tromp.github.io/cl/diagrams.html