A Deterministic Semantic-State Contraction Framework for Polynomial Resolution of NP-Complete Problems and Experimental Pathways Beyond the Born Rule (IEEE) (MDPI)

Yoon A Limsuwan

Published Mar 29, 2026• 0 citations

Related papers

A Deterministic Framework for Surpassing Quantum Computation via Semantic-State Contraction and Structural Calculus (MDPI) (IEEE)

Yoon A Limsuwan

Absolute Deterministic Universe via Semantic-State Contraction- From Sub-Quantum Structural Laws to Structural Determinism (IEEE) (MDPI)

Yoon A Limsuwan

Semantic Stabilized Computation : A Contractive Computational Framework Beyond Quantum Algorithms. (IEEE)

Yoon A Limsuwan

A Deterministic Sub-Quantum Structural Framework via Semantic-State Contraction- Toward Emergent Quantum Probability and Continuum Dynamics (IEEE)

Yoon A Limsuwan

Deterministic Classical Simulation of Shor's Algorithm Using Irreducible Convergence Spaces and Semantic State Contraction (IEEE)

Yoon A Limsuwan

Topology-Driven Quantum-Mimetic Computation via Structural Calculus and Semantic State Contraction (MDPI)

Yoon A Limsuwan