AI Chat AI Image Generator AI Video Text to Speech

A Formal Axiomatization of Computation

07/04/2019
∙
by   Rasoul Ramezanian, et al.
∙
0
∙

We introduce a set of axioms for the notion of computation, and show that P= NP is not derivable from this set of axioms.

READ FULL TEXT

page 1

page 2

page 3

page 4

Related Research

research
∙ 12/10/2020

Quantified X3SAT: P = NP = PSPACE

This paper shows that P = NP via one-in-three (or exactly-1) 3SAT, and t...
0 Latif Salum, et al. ∙
research
∙ 09/25/2017

Intensional Constructed Numbers: Towards Formalizing the Notion of Algorithm

This work is meant to be a step towards the formal definition of the not...
0 Fritz Müller, et al. ∙
research
∙ 12/07/2019

How to Distribute Computation in Networks

We study the function computation problem in a communications network. T...
0 Derya Malak, et al. ∙
research
∙ 07/02/2018

Well-Scaling Procedure for Deciding Gammoid Class-Membership of Matroids

We introduce a procedure that solves the decision problem whether a give...
0 Immanuel Albrecht, et al. ∙
research
∙ 10/03/2019

Orbit Computation for Atomically Generated Subgroups of Isometries of Z^n

Isometries and their induced symmetries are ubiquitous in the world. Tak...
0 Haizi Yu, et al. ∙
research
∙ 08/01/2018

Overarching Computation Model (OCM)

Existing models of computation, such as a Turing machine (hereafter, TM)...
0 Henok Ghebrechristos, et al. ∙
research
∙ 08/03/2019

Topological Interpretation of Interactive Computation

It is a great pleasure to write this tribute in honor of Scott A. Smolka...
0 Emanuela Merelli, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal