An Atemporal Model of Physical Complexity
arXiv:1807.11137 · doi:10.4204/EPTCS.273.4
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.
In Proceedings PC 2018, arXiv:1807.10563