Year: 2025
Type: preprint
Abstract: We propose the Transcendental Encoding Conjecture for decision problems, which asserts that every language in complexity class P encodes to an algebraic real (possibly rational or algebraic irrational) under its binary characteristic encoding or other relevant encodings, whereas every NP-complete language encodes to a transcendental real. In particular, we exhibit languages whose encodings are provably rational (hence algebraic), discuss the status of encodings for other "natural" languages such as PRIMES (its encoding is irrational but not known to be algebraic).
Source: arXiv (Cornell University)
Authors: Keshavan, Anand Kumar, Engineer, Sunu
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W6966755696
Cites:
Cited by:
Related to: