Searcharxiv⌕ Search

arXiv · 2611.15773

A negative answer to the final question in "Les petits cailloux"

Abstract

We consider polynomial-time computation over arbitrary structures, with unit cost for the primitive operations and relations and with nondeterministic witnesses consisting of arbitrary structure elements. We prove that every finite-signature structure with two distinct available elements and containing a binary operation $*$ and total unary operations $L,R$ such that $L(x*y)=x$ and $R(x*y)=y$ satisfies $P\ne NP$. The proof encodes an exponentially long computation in one element. An incorrect transition has a polynomial-size binary address, and hence the existence of an error is an $NBP$ problem. Existence of a correct accepting trace belongs to the mixed second level $Σ_2^{S,B}$, with an arbitrary-element existential block followed by a binary universal block. We obtain $EXP\subseteqΣ_2^{S,B}\subseteq PH$. A hypothetical equality $P=NP$ would collapse this hierarchy to $P$ and imply $P=EXP$, contradicting a direct deterministic diagonalization over the same structure. A simulation by function graphs extends the obstruction to every jointly injective binary primitive under the same assumptions on equality and available elements. Consequently no unary predicate on Malcev's free binary-tree algebra yields $P=NP$, with or without the projections. In contrast, starting from the author's unary example, we construct five infinite structures with binary operations and $P=NP$. These include an algebra with one binary operation and one constant, an expansion with an associative rectangular-band operation, and an algebra with one binary operation whose every row and column has infinite image.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mihai Prunescu. 2026-11-11. A negative answer to the final question in "Les petits cailloux". https://searcharxiv.com/abs/2611.15773

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

A Dubnov-Ivanov-Nagata-Higman Theorem for NIP nilrings

We prove that NIP nilrings of bounded nilexponent are nilpotent. We also deduce that NIP $ω$-categorical $n$-Engel Lie algebras of characteristic $p>n$ are nilpotent, yielding a case of the Lie algebra analogous of Wilson conjecture for $ω$-categorical groups.

math.LO↗

Relative computability and definability for nonregular oracles

Classically, a set is computable from an oracle if both the set and its complement are computably enumerable (c.e.) relative to that oracle. We construct a countable nonstandard model of true arithmetic with sets A and X such that both A and its complement are c.e. relative to X, yet A is not pointwise Turing reducible to X. The Turing functionals used here are single-valued at every oracle. For regular oracles, we prove that the classical equivalence holds over ISigma_1. Two further phenomena, each known from earlier work, are realized with the same oracle X that witnesses our main separation. Strong and pointwise Turing reducibility differ for this X, and some Delta_1^X set is not X-c.e.

math.LO↗