4 papers · 1 filter
Dynamic Level Sets
Michael Stephen Fiske
A mathematical concept is identified and analyzed that is implicit in the 2012 paper Turing Incomputable Computation, presented at the Alan Turing Centenary Conference (Turing-100,…
A Turing Incomputable Coloring Function
Michael Stephen Fiske
This paper describes a sequence of natural numbers that grows faster than any Turing computable function. This sequence is generated from a version of the tiling problem, called a…
Prime Clocks
Michael Stephen Fiske
Physical implementations of digital computers began in the latter half of the 1930's and were first constructed from various forms of logic gates. Based on the prime numbers, we in…
Quantum Random Self-Modifiable Computation
Michael Stephen Fiske
Among the fundamental questions in computer science, at least two have a deep impact on mathematics. What can computation compute? How many steps does a computation require to solv…