An All-or-Nothing Flavor to the Church-Turing Hypothesis

نویسنده

  • Stefan Wolf
چکیده

Landauer’s principle claims that “Information is Physical.” It is not surprising that its conceptual antithesis, Wheeler’s “It from Bit,” has been more popular among computer scientists — in the form of the Church-Turing hypothesis: All natural processes can be computed by a universal Turing machine; physical laws then become descriptions of subsets of observable, as opposed to merely possible, computations. Switching back and forth between the two traditional styles of thought, motivated by quantum-physical Bell correlations and the doubts they raise about fundamental space-time causality, we look for an intrinsic, physical randomness notion and find one around the second law of thermodynamics. Bell correlations combined with complexity as randomness tell us that beyond-Turing computations are either physically impossible, or they can be carried out by “devices” as simple as individual photons.

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

ثبت نام

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

منابع مشابه

A Brief Note on Church-Turing Thesis and R.E. Sets

People who believe in the Enhanced Church-Turing Thesis assume that the origin of every formalism for computable functions must be some sort of informal notions. Since all formalisms we ever have turn out to be equivalent, it must be the case that their origins are also equivalent. I hardly find myself at a position to believe in this, since I do not see sufficient reasons to further believe th...

متن کامل

Physically-relativized Church-Turing Hypotheses: Physical foundations of computing and complexity theory of computational physics

We turn ‘the’ Church-Turing Hypothesis from an ambiguous source of sensational speculations into a (collection of) sound and well-defined scientific problem(s): Examining recent controversies, and causes for misunderstanding, concerning the state of the ChurchTuring Hypothesis (CTH), suggests to study the CTH relative to an arbitrary but specific physical theory—rather than vaguely referring to...

متن کامل

Locality, Weak or Strong Anticipation and Quantum Computing. I. Non-locality in Quantum Theory

The universal Turing machine is an anticipatory theory of computability by any digital or quantum machine. However the Church-Turing hypothesis only gives weak anticipation. The construction of the quantum computer (unlike classical computing) requires theory with strong anticipation. Category theory provides the necessary coordinate-free mathematical language which is both constructive and non...

متن کامل

A Formalization of the Church-Turing Thesis

Our goal is to formalize the Church-Turing Thesis for a very large class of computational models. Specifically, the notion of an “effective model of computation” over an arbitrary countable domain is axiomatized. This is accomplished by modifying Gurevich’s “Abstract State Machine” postulates for state-transition models. A proof is provided that all models satisfying these axioms, regardless of...

متن کامل

Computationalism, The Church-Turing Thesis, and the Church-Turing Fallacy

The Church–Turing Thesis (CTT) is often employed in arguments for computationalism. I scrutinize the most prominent of such arguments in light of recent work on CTT and argue that they are unsound. Although CTT does nothing to support computationalism, it is not irrelevant to it. By eliminating misunderstandings about the relationship between CTT and computationalism, we deepen our appreciation...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2017