Validation of the Siegelmann-Sontag Super Turing Computation Hypothesis

A single cell amoeba solves the NP-Complete TSP in polynomial time since it implements analog super Turing processing as described in the Siegelmann-Sontag 1993 thesis upon which the QAI SPECTRE™ super Turing neural machines are based. Amazingly the researchers that conducted this study admit they have no idea why this is possible. It’s truly amazing how people blindly follow both digital computation and quantum computing (both P-Space reducible so both Turing machine architectures) because they think there is no other way. #QAI #QAISPECTRE Full paper is here: