cs.CCFeb 26, 2026

Dynamic Level Sets

Authors: Michael Stephen Fiske

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 pp where pp 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.

Explore similar work

CardsList
  1. Can a Dynamic Internal Field Govern a Transformer's Cognition? Certifiability, not Superiority, in Homeostatic Compute Control

    Aug 25, 2026Francisco M. Arrabal-Campos, Ignacio Fernandez, Francisco G. Montoya +1Adaptive Computation

  2. Computation, Condensation, and the Incompleteness Between Them: A Coupled Foundation of Intelligence

    Mar 7, 2023Xin Li

  3. Turing or Cantor: That is the Question

    Apr 12, 2026Eugene EberbachOracle Complexity