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