Dynamic Level Sets

Read full text
Authors: Michael Stephen Fiske
Cited by: 0

Abstract

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, Manchester). The concept, called dynamic level sets, is distinct from mathematical concepts in the standard literature on dynamical systems, topology, and computability theory. A new mathematical object is explained and why it may have escaped prior characterizations, including the classical result of de Leeuw, Moore, Shannon, and Shapiro that probabilistic Turing machines (with bias $p$ where $p$ is Turing computable) compute no more than deterministic ones. A key mechanism underlying the concept is the Principle of Self-Modifiability, whereby the physical realization of an invariant logical level set is reconfigured at each computational step by an incomputable physical process.

Fields of Study & Subjects

Computability Logic AI Algorithms Cellular Automata and Applications semigroups and automata theory

Publication details

Journal / source
arXiv (Cornell University)
Publication date
26 February 2026
Language
EN
Document type
Preprint