Undecidability and Incompleteness in Classical Mechanics

نویسنده

  • N. C. A. da Costa
چکیده

We describe Richardson's functor from the Diophantine equations and Diophantine problems into elementary real-valued functions and problems. We then derive a general undecidability and incompleteness result for elementary functions within ZFC set theory, and apply it to some problems in Hamiltonian mechanics and dynamical systems theory. Our examples deal with the algorithmic impossibility of deciding whether a given Hamiltonian can be integrated by quadratures and related questions; they lead to a version of G6del's incompleteness theorem within Hamiltonian mechanics. A similar application to the unsolvability of the decision problem for chaotic dynamical systems is also obtained.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Measurement - based quantum computation and undecidable logic

We establish a connection between measurement-based quantum computation and the field of mathematical logic. We show that the computational power of an important class of quantum states called graph states, representing resources for measurement-based quantum computation, is reflected in the expressive power of (classical) formal logic languages defined on the underlying mathematical graphs. In...

متن کامل

A Quantum Gate as a Physical Model of an Universal Arithmetical Algorithm without Church’s Undecidability and Gödel’s Incompleteness

In this work we define an universal arithmetical algorithm, by means of the standard quantum mechanical formalism, called universal qm-arithmetical algorithm. By universal qm-arithmetical algorithm any decidable arithmetical formula (operation) can be decided (realized, calculated. Arithmetic defined by universal qm-arithmetical algorithm called qmarithmetic one-to-one corresponds to decidable ...

متن کامل

Quantum recursion theory

Incompleteness and undecidability theorems have to be revised in view of quantum information and computation theory.

متن کامل

On the computational power of physical systems, undecidability, the consistency of phenomena and the practical uses of paradoxa

Just as in mathematics, recursion theory and formal logic paradoxa can be used to derive incompleteness theorems, physical paradoxa can be applied for a derivation of constraints on the dynamics of physical systems and of certain types of no-go theorems. For example, time paradoxa can be used against the outcome controllability of entangled subsystems. As a consequence, the requirement of consi...

متن کامل

On the Question of Absolute Undecidability∗

The incompleteness theorems show that for every sufficiently strong consistent formal system of mathematics there are mathematical statements undecided relative to the system. A natural and intriguing question is whether there are mathematical statements that are in some sense absolutely undecidable, that is, undecidable relative to any set of axioms that are justified. Gödel was quick to point...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1991