An Atemporal Model of Physical Complexity

TL;DR

This paper introduces the FFOT machine, an atemporal model of computation, and explores its complexity class, showing it can decide problems in NP intersect co-NP with polynomial resources.

Contribution

The paper proposes the FFOT machine as a novel atemporal computational model and characterizes its decision problem complexity class.

Findings

FFOT machine provides an atemporal framework for computation.

Decidable problems by FFOT with polynomial resources are in NP intersect co-NP.

Establishes a link between atemporal models and classical complexity classes.

Abstract

We present the finite first-order theory (FFOT) machine, which provides an atemporal description of computation. We then develop a concept of complexity for the FFOT machine, and prove that the class of problems decidable by a FFOT machine with polynomial resources is NP intersect co-NP.