DeepAI AI Chat

An Atemporal Model of Physical Complexity

07/30/2018

∙

by Richard Whyman, et al.

∙

∙

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.

page 1

page 2

page 3

page 4

∙ 07/26/2017

Composition problems for braids: Membership, Identity and Freeness

In this paper we investigate the decidability and complexity of problems...

0 Sang-Ki Ko, et al. ∙

∙ 03/09/2018

A theory of NP-completeness and ill-conditioning for approximate real computations

We develop a complexity theory for approximate real computations. We fir...

0 Gregorio Malajovich, et al. ∙

∙ 03/02/2020

Descriptive complexity of real computation and probabilistic independence logic

We introduce a novel variant of BSS machines called Separate Branching B...

0 Miika Hannula, et al. ∙

∙ 11/01/1998

Writing and Editing Complexity Theory: Tales and Tools

Each researcher should have a full shelf—physical or virtual—of books on...

0 Lane A. Hemaspaandra, et al. ∙

∙ 02/22/2022

P-class is a proper subclass of NP-class; and more

We may give rise to some questions related to the mathematical structure...

0 JongJin Kim, et al. ∙

∙ 11/08/2021

Differential information theory

This paper presents a new foundational approach to information theory ba...

0 Pieter Adriaans, et al. ∙

∙ 11/13/2018

Very Hard Electoral Control Problems

It is important to understand how the outcome of an election can be modi...

0 Zack Fitzsimmons, et al. ∙