Dynamic Level Sets

Michael Stephen Fiske
2/26/2026
cs.CCcs.CLmath-ph

No confident code implementation found for this paper. 2 possible matches can be shown below.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{fiske2026dynamic,
  title  = {Dynamic Level Sets},
  author = {Michael Stephen Fiske},
  year   = {2026},
  eprint = {2602.22530},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2602.22530v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2602.22530.svg)](https://codeofpaper.com/paper/2602.22530)

Discussion