Overarching Computation Model (OCM)

08/01/2018
by   Henok Ghebrechristos, et al.
0

Existing models of computation, such as a Turing machine (hereafter, TM), do not consider the agent involved in interpreting the outcome of the computation. We argue that a TM, or any other computation model, has no significance if its output is not interpreted by some agent. Furthermore, we argue that including the interpreter in the model definition sheds light on some of the difficult problems faced in computation and mathematics. We provide an analytic process framework to address this limitation. The framework can be overlaid on existing concepts of computation to address many practical and philosophical concerns such as the P vs NP problem. In addition, we provide constructive proof for the P vs NP problem under the assumption that the class NP comprises of problems solvable by non-deterministic algorithms. We utilize the observation that deterministic computational procedures lack fundamental capacity to fully simulate their non-deterministic variant.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

03/19/2016

Philosophical Solution to P=?NP: P is Equal to NP

The P=?NP problem is philosophically solved by showing P is equal to NP ...
02/28/2019

Interpretation of NDTM in the definition of NP

In this paper, we interpret NDTM (NonDeterministic Turing Machine) used ...
07/04/2019

A Formal Axiomatization of Computation

We introduce a set of axioms for the notion of computation, and show tha...
04/30/2020

A class of examples demonstrating that P is different from NP in the "P vs NP" problem

The CMI Millennium "P vs NP Problem" can be resolved e.g. if one shows a...
04/30/2018

Two theorems about the P versus NP problem

Two theorems about the P versus NP problem be proved in this article (1)...
05/09/2012

Deterministic POMDPs Revisited

We study a subclass of POMDPs, called Deterministic POMDPs, that is char...
03/02/2020

Descriptive complexity of real computation and probabilistic independence logic

We introduce a novel variant of BSS machines called Separate Branching B...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.