To me, binary combinatory logic and binary lambda calculus seem like much more sensible languages for performing these kinds of algorithmic information theory experiments.
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/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
describes an equivalent 267 bit Lambda Calculus term, which can also be represented as this
https://github.com/tromp/AIT/blob/master/goldbach.gif
lambda diagram, as explained in
The Goldbach Conjecture example is just a program to loop through and test that each successive even integer can be reached as the sum of two prime numbers. If there is a counterexample to the conjecture, then theoretically this program will eventually find it. For these purposes, the authors don't care if the program calculates efficiently, but are interested in the length of the program. So brute force is fine.
The Riemann Hypothesis and ZFC programs similarly are just brute force searching for counterexamples.
The existence of programs to search for counterexamples is not new or surprising. I am not so sure what part of this work is new. I guess it is the discussion of philisophical implications.