Turing Incomputable Computation

26 pages•Published: June 22, 2012

Abstract

A new computing model, called the active element machine (AEM), is presented that demonstrates Turing incomputable computation using quantum random input. The AEM deterministically executes a universal Turing machine (UTM) program η with random active element firing patterns. These firing patterns are Turing incomputable when the AEM executes a UTM having an unbounded number of computable steps. For an unbounded number of computable steps, if zero information is revealed to an adversary about the AEM’s representation of the UTM’s state and tape and the quantum random bits that help determine η’s computation and zero information is revealed about the dynamic connections between the active elements, then there does not exist a “reverse engineer” Turing machine that can map the random firing patterns back to the sequence of UTM instructions. This casts a new light on Turing’s notion of a computational procedure. In practical terms, these methods present an opportunity to build a new class of computing machines where the program’s computational steps are hidden. This non-Turing computing behavior may be useful in cybersecurity and in other areas such as machine learning where multiple, dynamic interpretations of firing patterns may be applicable.

Keyphrases: active element, boolean function, firing pattern, hypercomputation, incomputable, level set, quantum random, time, turing machine

In: Andrei Voronkov (editor). Turing-100. The Alan Turing Centenary, vol 10, pages 66-91.

Links:	https://easychair.org/publications/paper/Jxss
	https://doi.org/10.29007/x5g2