• P is not equal to NP

Treffer: P is not equal to NP

Title:
P is not equal to NP
Authors:
Tärnlund, Sten-Åke
Publisher Information:
Uppsala universitet, Institutionen för informatik och media
Publication Year:
2019
Collection:
Uppsala University: Publications (DiVA)
Subject Terms:
P is not equal to NP, computing complexity, Computer Sciences, Datavetenskap (datalogi)
Document Type:
Report report
File Description:
application/pdf
Language:
English
Availability:
http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-400621
Rights:
info:eu-repo/semantics/openAccess
Accession Number:
edsbas.9AD30733
Database:
BASE

Weitere Informationen

Axiom 1, a universal Turing machine, extends Turing's first order theory of computing - computations are Robinson resolution deductions. This gives: SAT is not in P. Therefore: P is not equal to NP.