The solution of the 3RD clay millennium problem. A short proof that P≠NP=EXPTIME in the context of Zermelo-Frankel set theory
| Main Author: | Kyritsis, Constantinos |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2017
|
| Subjects: | |
| Online Access: |
http://cris.teiep.gr/jspui/handle/123456789/1560 |
| id |
cris-123456789-1560 |
|---|---|
| recordtype |
dspacecris |
| spelling |
cris-123456789-15602018-02-14T11:01:49Z The solution of the 3RD clay millennium problem. A short proof that P≠NP=EXPTIME in the context of Zermelo-Frankel set theory Kyritsis, Constantinos Computational Complexity Υπολογιστική πολυπλοκότητα 3rd Clay Millennium problem EXPTIME-complete problems NP-complexity P-complexity In this paper I provide a very short but decisive proof that P ≠ NP, anf NP=EXPTIME in the context of the ZF set theory and deterministic Turing machines. We discuss also the subtle implications of considering the P versus NP problem, in different axiomatic theories! The results of the current paper definitely solve the 3rd Clay Millennium problem P versus NP, in a simple and transparent away that the general scientific community, but also the experts of the area, can follow, understand and therefore become able to accept. 2017-08-10 Άρθρο http://cris.teiep.gr/jspui/handle/123456789/1560 en p.p.12 Athens, Greece |
| institution |
T.E.I. of Epirus |
| collection |
DSpace CRIS |
| language |
English |
| topic |
Computational Complexity Υπολογιστική πολυπλοκότητα 3rd Clay Millennium problem EXPTIME-complete problems NP-complexity P-complexity |
| spellingShingle |
Computational Complexity Υπολογιστική πολυπλοκότητα 3rd Clay Millennium problem EXPTIME-complete problems NP-complexity P-complexity Kyritsis, Constantinos The solution of the 3RD clay millennium problem. A short proof that P≠NP=EXPTIME in the context of Zermelo-Frankel set theory |
| abstract |
In this paper I provide a very short but decisive proof that P ≠ NP, anf NP=EXPTIME
in the context of the ZF set theory and deterministic Turing machines. We discuss also the
subtle implications of considering the P versus NP problem, in different axiomatic theories!
The results of the current paper definitely solve the 3rd Clay Millennium problem P versus
NP, in a simple and transparent away that the general scientific community, but also the
experts of the area, can follow, understand and therefore become able to accept. |
| format |
Άρθρο |
| author |
Kyritsis, Constantinos |
| author-letter |
Kyritsis, Constantinos |
| title |
The solution of the 3RD clay millennium problem. A short proof that P≠NP=EXPTIME in the context of Zermelo-Frankel set theory |
| title_short |
The solution of the 3RD clay millennium problem. A short proof that P≠NP=EXPTIME in the context of Zermelo-Frankel set theory |
| title_full |
The solution of the 3RD clay millennium problem. A short proof that P≠NP=EXPTIME in the context of Zermelo-Frankel set theory |
| title_fullStr |
The solution of the 3RD clay millennium problem. A short proof that P≠NP=EXPTIME in the context of Zermelo-Frankel set theory |
| title_full_unstemmed |
The solution of the 3RD clay millennium problem. A short proof that P≠NP=EXPTIME in the context of Zermelo-Frankel set theory |
| title_sort |
solution of the 3rd clay millennium problem. a short proof that p≠np=exptime in the context of zermelo-frankel set theory |
| publisherplace |
Athens, Greece |
| publishDate |
2017 |
| url |
http://cris.teiep.gr/jspui/handle/123456789/1560 |
| physical |
p.p.12 |
| _version_ |
1646089692090728448 |
| score |
11.365018 |