1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.LO2018
An Atemporal Model of Physical Complexity
Richard Whyman
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 p…
cs.CC2016★ 1 cited
Physical Computation, P/poly and P/log*
Richard Whyman
In this paper we give a framework for describing how abstract systems can be used to compute if no randomness or error is involved. Using this we describe a class of classical "phy…