@vzn This is a really great question!! I mean this one: "Is there any demonstrably uncomputable concrete problem which does not rely on diagonalization?" :)

@MichaelWehar :) thx, am getting dinged in comments on the undecidability oracle construction "exception" but think it is actually also a kind of "reduction" in the sense that induction general cases "reduce" to a base case. think this should all be written up by someone in a paper someday...

→ rumor of a machine learning prj on standard model particle unification by sebastian thrun/ new yorker mag rjlipton.wordpress.com/2017/04/01/the-end-of-human-science

@vzn :)