Work

Turing-Computability Excludes Phenomenal Consciousness: A Derivation from the NEMS No-Emulation and SIAM Theorems, with Implications for Large Language Models

Year: 2026

Type: preprint

Abstract: Derived from two machine-checked theorems in the NEMS (No External Model Selection) framework, we show that no Turing-computable system can satisfy the structural conditions for phenomenal consciousness; large language models are a special case. The argument uses diagonal-capability of the physical universe (weaker than full PSC) together with the No-Emulation theorem (NEMS Paper 15) and the SIAM separation theorem (NEMS Paper 73). The result is contrasted with Penrose's Gödelian argument in foundation, verification status, and architectural scope.

Source: Zenodo (CERN European Organization for Nuclear Research)

DOI: 10.5281/zenodo.20075503

Author: Spivack, Nova

Language: English

Topic: Philosophy and Theoretical Science

Subfield: Experimental and Cognitive Psychology

Field: Psychology

Domain: Social Sciences

Open Access status: green

OpenAlex ID: W7160508983

Cites:

Cited by:

Related to: