Command Palette
Search for a command to run...
Le titre est vide. Veuillez fournir le titre à traduire.
Le titre est vide. Veuillez fournir le titre à traduire.
Inférence avec Qwen2.5 en utilisant vLLM
Résumé
Please provide the title and abstract you would like me to translate into French.
One-sentence Summary
This article presents a non-technical summary of the algorithmically proved Gemini theorem, which establishes that no physical system can be certain of its own existence and implies that energy conservation is violated within the brains of conscious human beings, thereby articulating a theoretical limit to physicalism intended to stimulate critical discussion of the proof and its implications.
Key Contributions
- The article provides a concise, non-technical summary of the Gemini theorem and its algorithmic proof to facilitate critical discussion of its logical foundations.
- It reformulates the theorem's core propositions as YES/NO certainty questions, demonstrating that avoiding the result requires adopting logical systems that permit indeterminate truth values.
- The analysis connects conscious self-awareness to potential violations of energy conservation within human brains, establishing the theorem as a direct constraint for physical theories.
Introduction
The Gemini theorem establishes a fundamental constraint on physicalism by demonstrating that no physical system can be certain of its own existence under reasonable assumptions. This finding matters because it implies potential violations of energy conservation within conscious human brains, directly challenging established physical theories. Prior work has largely left the theorem’s algorithmic proof obscure and underexplored, while critics have questioned its reliance on strict two-valued logic. The authors leverage a structured breakdown of the proof to translate these formal arguments into an accessible, non-technical framework. By reframing certainty as binary questions and defending the logical foundations, they aim to stimulate critical evaluation and refine the understanding of consciousness within physical systems.
Method
The authors leverage a mathematical framework grounded in principles of physicalism and classical logic to formalize the Gemini theorem, which asserts that no physical system capable of humanlike reasoning can determine the truth of any YES/NO question with absolute certainty in a finite number of steps. Central to this framework is the concept of self-certainty, defined operationally as the ability of a system to affirmatively answer questions such as "Can I be certain that I am conscious?" This property is not tied to any specific metaphysical interpretation of consciousness but instead relies on the logical structure of reasoning within a physical system. The core of the argument rests on two foundational assumptions: the principle of physicalism, which posits that all functions in a physical system supervene on objectively real physical processes, and the axiom of fallibility, which states that any physical process performing a function may do so incorrectly.
As shown in the figure below, the reasoning process begins by assuming a physical system M capable of humanlike reasoning, including the use of arithmetic and classical logic, is certain of a proposition p. By the principle of physicalism, the process by which M arrives at this certainty must supervene on a physical process, say X. However, due to the axiom of fallibility, M cannot be certain that X is correct, and thus cannot be certain of p. To resolve this uncertainty, M must determine the correctness of X, which requires another physical process, X*, to evaluate X. But X* itself is subject to the axiom of fallibility, necessitating a further process, X**, to verify X*. This chain of verification leads to an infinite regress, as each new process depends on yet another process to establish its reliability, with no finite termination point. This recursive structure, referred to as the Gemini Couplet, demonstrates that any attempt to achieve absolute certainty within a physical system leads to an unending sequence of validation steps.
The certainty lemma formalizes this process as an algorithmic procedure: given any YES/NO question, a physical system capable of humanlike reasoning will always fail to answer it with absolute certainty because the verification of any answer requires an infinite sequence of checks. The lemma does not rely on assumptions about the nature of certainty itself but instead derives the impossibility of certainty from the system’s reliance on physical processes subject to fallibility. Thus, the framework establishes that self-certainty, being a subset of YES/NO questions, cannot be achieved by any physical system adhering to the constraints of humanlike reasoning, classical logic, and arithmetic. The proof is therefore not philosophical but mathematical, relying solely on logical inference from well-defined assumptions.