Super Turing Machines



QAI SPECTRE™ Super Turing analog machines provide solutions beyond the Turing limit, where exponentially difficult NP-Hard problems are solved in linear time. The QAI SPECTRE™ super Turing machines exceed the Turing computation P-Space limit and can compute decision problems that both current and future scalable quantum computers cannot solve.

Current computation is defined by the Church-Turing hypothesis. This results in the Turing limit, which restricts the computational complexity that any Turing machine can compute. In computational complexity theory, P-Space is the set of all decision problems that can be solved by a Turing machine using a polynomial amount of space. All Turing machines are said to be P-Space reducible as they are fundamentally constrained by the Turing limit, no mater if they are current or scalable quantum computers since they are both P-Space reducible machines and likewise restricted to the Turing limit.