Contact with other researchers working in the field of surreal numbers, and in particular of their application to computation, and to physics, is sought. An outline research paper on surreal models of arithmetic is presented as an invitation to workers in cybernetics and systems to participate in the study. The extension to Turing computability provided by the surreal models of arithmetic is provably, without any loss of mathematical generality, polynomially complex so that Psurreal = NP surreal. It is shown that these models could have widespread practical application in safety‐critical systems, and that they demonstrably determine régimes for computation in a minimum number of ways.
CitationDownload as .RIS
MCB UP Ltd
Copyright © 1991, MCB UP Limited