An Atemporal Model of Physical Complexity
Logic in Computer Science
2018-07-31 v1 Computational Complexity
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.
Cite
@article{arxiv.1807.11137,
title = {An Atemporal Model of Physical Complexity},
author = {Richard Whyman},
journal= {arXiv preprint arXiv:1807.11137},
year = {2018}
}
Comments
In Proceedings PC 2018, arXiv:1807.10563