DeepAI AI Chat
Log In Sign Up

P vs NP

09/30/2022
by   Jian-Gang Tang, et al.
NetEase, Inc
0

In this paper, we discuss the 𝒩𝒫 problem using the Henkin's Theory and the Herbrand Theory in the first-order logic, and prove that 𝒫 is a proper subset of 𝒩𝒫.

READ FULL TEXT

page 1

page 2

page 3

page 4

03/09/2018

A theory of NP-completeness and ill-conditioning for approximate real computations

We develop a complexity theory for approximate real computations. We fir...
03/28/2022

Information Theory and Point Processes

This paper addresses theoretically correct vs. incorrect ways to apply i...
02/22/2022

P-class is a proper subclass of NP-class; and more

We may give rise to some questions related to the mathematical structure...
10/21/2014

Towards a Model Theory for Distributed Representations

Distributed representations (such as those based on embeddings) and disc...
06/20/2019

Computer-Simulation Model Theory (P= NP is not provable)

The simulation hypothesis says that all the materials and events in the ...
09/04/2017

A Computer Composes A Fabled Problem: Four Knights vs. Queen

We explain how the prototype automatic chess problem composer, Chestheti...
01/27/2020

Formalization of Forcing in Isabelle/ZF

We formalize the theory of forcing in the set theory framework of Isabel...