A Stronger Foundation for Computer Science and P=NP
This article describes a Turing machine which can solve for $\beta^{'}$ which is RE-complete. RE-complete problems are proven to be undecidable by Turing's accepted proof on the Entscheidungsproblem. Thus, constructing a machine which decides over $\beta^{'}$ implies inconsistency in ZFC. We then discover that unrestricted use of the axiom of substitution can lead to hidden assumptions in a certain class of proofs by contradiction. These hidden assumptions create an implied axiom of incompleteness for ZFC. Later, we offer a restriction on the axiom of substitution by introducing a new axiom which prevents impredicative tautologies from producing theorems. Our discovery in regards to these foundational arguments, disproves the SPACE hierarchy theorem which allows us to solve the P vs NP problem using a TIME-SPACE equivalence oracle.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
On logic and generative AI
A hundred years ago, logic was almost synonymous with foundational studies. The ongoing AI revolution raises many deep foundational problems involving neuroscience, philosophy, computer science, and logic. The goal of th…
PhilosophyThe Rapid Growth of AI Foundation Model Usage in Science
We present the first large-scale analysis of AI foundation model usage in science - not just citations or keywords. We find that adoption has grown rapidly, at nearly-exponential rates, with the highest uptake in Linguis…
The Impact of International Collaborations with Highly Publishing Countries in Computer Science
This paper analyzes international collaborations in Computer Science, focusing on three major players: China, the European Union, and the United States. Drawing from a comprehensive literature review, we examine collabor…
Cross-Domain Foundation Model Adaptation: Pioneering Computer Vision Models for Geophysical Data Analysis
We explore adapting foundation models (FMs) from the computer vision domain to geoscience. FMs, large neural networks trained on massive datasets, excel in diverse tasks with remarkable adaptability and generality. Howev…
Logic Programming for an Introductory Computer Science Course for High School Students
This paper investigates how high school students approach computing through an introductory computer science course situated in the Logic Programming (LP) paradigm. This study shows how novice students operate within the…