Skip to main content

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

  • Conference paper
  • First Online:
Theory and Applications of Models of Computation (TAMC 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10185))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    It has been shown [4] that if causality is dropped but logical consistency maintained, then a rich world opens — comparable to the one between locality and signaling.

  2. 2.

    Note furthermore that the definition is consistent with full determinism: A random variable with trivial distribution is independent of every other (even itself).

  3. 3.

    See, e.g., Allen, W., Husbands and Wives (1992): The protagonist Sally is explaining why her marriage did not work out. First she does not know, then she realizes: “It’s the second law of thermodynamics: sooner or later everything turns to shit. That’s my phrasing, not the Encyclopedia Britannica”.

  4. 4.

    Boltzmann imagined further that the universe had started in a completely “uniform” state, so the entire, rich reality perceived would be a simple fluctuation. (Note that the fact that this fluctuation is extremely unlikely is irrelevant if we can condition on our existence, given our discussing this.) He may have been aware that this way of thinking leads straight into solipsism: “My existence alone, simply imagining my environment, seems much more likely than the actual existence of all people around me, let alone all the visible galaxies, etc.” — he killed himself in a hotel room in Duino, Italy; it has been told that this was also related to “mobbing” by Mach in Vienna. In any case, we choose to comfort us today with the somewhat religious assumption that the universe initiated in a low-entropy state, called the big bang.

  5. 5.

    Let \(kT\ln 2=1\).

  6. 6.

    Since the amount of the required free energy (and heat dissipation) is proportional to the length of the best compression of the string, the latter can be seen as a quantification of the erasure transformation’s irreversibility.

  7. 7.

    Since new randomness cannot be gotten rid of later, the equation reads: “Logical reversibility plus randomness equals thermodynamic irreversibility”. If you can go back logically in a random universe, then you certainly cannot thermodynamically.

  8. 8.

    Note that there is no (objective) splitting up, or randomness, if time evolutions are unitary, e.g., come from Schrödinger, heat-propagation, or Maxwell’s equations. What is then the origin of the arrow of time? The quantum-physical version of injectivity is Hugh Everett III’s relative-state interpretation. How do we imagine the bridge from global unitarity to the subjective perception of time asymmetry? When we looked above, with Landauer, at a closed classical system of two parts, then the (possible) complexity deficit in one of them must simply be compensated in a corresponding increase in the other. In Everett’s view, this means that there can be low-entropy branches of the wave function (intuitively, yet too naïvely, called: parallel universes) as long as they are compensated by other, highly complex ones.

  9. 9.

    The counter-factual nature of the reasoning claiming “non-classicality” of quantum theory, that was the main motivation in [38], has already been pointed out by Specker [32]: “In einem gewissen Sinne gehören aber auch die scholastischen Spekulationen über die Infuturabilien hieher, das heisst die Frage, ob sich die göttliche Allwissenheit auch auf Ereignisse erstrecke, die eingetreten wären, falls etwas geschehen wäre, was nicht geschehen ist”. — “In some sense, this is also related to the scholastic speculations on the infuturabili, i.e., the question whether divine omniscience even extends to what would have happened if something had happened that did not happen”.

  10. 10.

    What does it mean that a classical bit exists? Note first that classicality of information implies that it can be measured without disturbance and that the outcome of a “measurement” is always the same; this makes it clear that it is an idealized notion requiring the classical bit to be represented in a redundant way over an infinite number of degrees of freedom, as a thermodynamic limit. It makes thus sense to say that a classical bit U exists, i.e., has taken a definite value.

  11. 11.

    The introduced asymptotic notions are independent of this choice.

  12. 12.

    This is inspired by [9] (see also [10]), where (joint) Kolmogorov complexity — or, in practice, any efficient compression method — is used to define a distance measure on sets of bit strings (such as literary texts of genetic information of living beings). The resulting structure in that case is a distance measure, and ultimately a clustering as a binary tree.

  13. 13.

    Here, h is the binary entropy \(h(x)=-p\log _2 p-(1-p)\log _2(1-p)\). Usually, p is a probability, but h is invoked here merely as an approximation for binomial coefficients.

References

  1. Barnea, T.J., Bancal, J.-D., Liang, Y.-C., Gisin, N.: Tripartite quantum state violating the hidden influence constraints. Phys. Rev. A 88, 022123 (2013)

    Article  Google Scholar 

  2. Barrett, J., Hardy, L., Kent, A.: No-signalling and quantum key distribution. Phys. Rev. Lett. 95, 010503 (2005)

    Article  Google Scholar 

  3. Baumeler, Ä., Bédard, C., Brassard, G., Wolf, S.: Kolmogorov amplification from Bell correlation. In: International Symposium in Information Theory (ISIT) 2017 (2017, submitted)

    Google Scholar 

  4. Baumeler, Ä., Feix, A., Wolf, S.: Maximal incompatibility of locally classical behavior and global causal order in multi-party scenarios. Phys. Rev. A 90, 042106 (2014)

    Article  Google Scholar 

  5. Baumeler, Ä., Wolf, S.: The space of logically consistent classical processes without causal order. New J. Phys. 18, 013036 (2016)

    Article  Google Scholar 

  6. Bell, J.S.: On the Einstein-Podolsky-Rosen paradox. Physics 1, 195–200 (1964)

    Google Scholar 

  7. Bennett, C.H.: The thermodynamics of computation. Int. J. Theoret. Phys. 21(12), 905–940 (1982)

    Article  Google Scholar 

  8. Chaitin, G.: A theory of program size formally identical to information theory. J. ACM 22, 329–340 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  9. Cilibrasi, R., Vitányi, P.: Clustering by compression. IEEE Trans. Inf. Theory 51(4), 1523–1545 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  10. Cilibrasi, R., Vitányi, P.: The Google similarity distance. arXiv:abs/cs/0412098 (2004)

  11. Clausius, R.: Über die bewegende Kraft der Wärme und die Gesetze die sich daraus für die Wärmelehre selbst ableiten lassen (1850)

    Google Scholar 

  12. Colbeck, R., Renner, R.: Free randomness can be amplified. Nat. Phys. 8, 450–454 (2012)

    Article  Google Scholar 

  13. Coretti, S., Hänggi, E., Wolf, S.: Nonlocality is transitive. Phys. Rev. Lett. 107, 100402 (2011)

    Article  Google Scholar 

  14. Einstein, A., Podolsky, B., Rosen, N.: Can quantum-mechanical description of physical reality be considered complete? Phys. Rev. 47, 777–780 (1935)

    Article  MATH  Google Scholar 

  15. Everett, H.: “Relative state” formulation of quantum mechanics. Rev. Mod. Phys. 29(3), 454–462 (1957)

    Article  MathSciNet  Google Scholar 

  16. Feyerabend, P.: Wissenschaft als Kunst. Suhrkamp, Berlin (1984)

    Google Scholar 

  17. Fine, A.: Hidden variables, joint probability, and the Bell inequalities. Phys. Rev. Lett. 48, 291–295 (1982)

    Article  MathSciNet  Google Scholar 

  18. Fredkin, E., Toffoli, T.: Conservative logic. Int. J. Theoret. Phys. 21(3–4), 219–253 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  19. Hermann, G.: Die naturphilosophischen Grundlagen der Quantenmechanik. Abhandlungen der Fries’schen Schule, Band 6, pp. 69–152 (1935). Die Kausalität in der Physik (1948)

    Google Scholar 

  20. Hersch, J.: L’étonnement philosophique (De l’école Milet à Karl Jaspers) (1981)

    Google Scholar 

  21. Kelvin, L.: On a universal tendency in nature to the dissipation of mechanical energy (1852)

    Google Scholar 

  22. Kleene, S.C.: Mathematical Logic. Wiley, New York (1967)

    MATH  Google Scholar 

  23. Kolmogorov, A.N.: Three approaches to the quantitative definition of information. Probl. Peredachi Informatsii 1(1), 3–11 (1965)

    MathSciNet  MATH  Google Scholar 

  24. Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5, 183–191 (1961)

    Article  MathSciNet  MATH  Google Scholar 

  25. Li, M., Vitányi, P.: An Introduction to Kolmogorov Complexity and Its Applications. Springer, New York (2008)

    Book  MATH  Google Scholar 

  26. Nietzsche, F.: Die Philosophie im tragischen Zeitalter der Griechen (1872)

    Google Scholar 

  27. Oreshkov, O., Costa, F., Brukner, C.: Quantum correlations with no causal order. Nat. Commun. 3, 1092 (2012)

    Article  Google Scholar 

  28. Popescu, S., Rohrlich, D.: Quantum non-locality as an axiom. Found. Phys. 24, 379–385 (1994)

    Article  MathSciNet  Google Scholar 

  29. Raz, R.: A parallel repetition theorem. SIAM J. Comput. 27(3), 763–803 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  30. Reichenbach, H.: The principle of the common cause. In: The Direction of Time, chap. 19, pp. 157–167. California Press, Berkeley (1956)

    Google Scholar 

  31. Shannon, C.E., Weaver, W.: The Mathematical Theory of Communication. University of Illinois Press, Urbana (1949)

    MATH  Google Scholar 

  32. Specker, E.: Die Logik nicht gleichzeitig entscheidbarer Aussagen. Dialectica 14, 239–246 (1960)

    Article  MathSciNet  Google Scholar 

  33. Stefanov, A., Zbinden, H., Gisin, N., Suarez, A.: Quantum correlations with spacelike separated beam splitters in motion: experimental test of multisimultaneity. Phys. Rev. Lett. 88, 120404 (2002)

    Article  Google Scholar 

  34. Stuart, T.E., Slater, J.A., Colbeck, R., Renner, R., Tittel, W.: An experimental test of all theories with predictive power beyond quantum theory. Phys. Rev. Lett. 109, 020402 (2012)

    Article  Google Scholar 

  35. Uffink, J.: Bluff your way in the second law of thermodynamics (2001)

    Google Scholar 

  36. Vailati, E.: Leibniz and Clarke: A Study of Their Correspondence. Oxford University Press, New York (1997)

    Google Scholar 

  37. Wheeler, J.A.: Information, physics, quantum: the search for link. In: Proceedings of III International Symposium on Foundations of Quantum Mechanics, pp. 354–368 (1989)

    Google Scholar 

  38. Wolf, S.: Non-locality without counterfactual reasoning. Phys. Rev. A 92(5), 052102 (2015)

    Article  Google Scholar 

  39. Wood, C., Spekkens, R.: The lesson of causal discovery algorithms for quantum correlations: causal explanations of Bell-inequality violations require fine-tuning. New J. Phys. 17, 033002 (2015)

    Article  Google Scholar 

  40. Zurek, W.H.: Algorithmic randomness and physical entropy. Phys. Rev. A 40(8), 4731–4751 (1989)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

This text is based on a presentation at the 14th Annual Conference on Theory and Applications of Models of Computation (TAMC 2017) at the Universität Bern. I am grateful to Gerhard Jäger and all the organizers for kindly inviting me to give a talk.

I thank Mateus Araújo, Veronika Baumann, Ämin Baumeler, Charles Bédard, Claus Beisbart, Gilles Brassard, Harvey Brown, Caslav Brukner, Harry Buhrman, Matthias Christandl, Sandro Coretti, Fabio Costa, Bora Dakic, Frédéric Dupuis, Paul Erker, Adrien Feix, Jürg Fröhlich, Manuel Gil, Nicolas Gisin, Esther Hänggi, Arne Hansen, Marcus Huber, Lorenzo Maccone, Alberto Montina, Samuel Ranellucci, Paul Raymond-Robichaud, Louis Salvail, L. Benno Salwey, Martin Schüle, Andreas Winter, and Magdalena Zych for inspiring discussions, and the Pläfä-Einstein as well as the Reitschule for their inspiring atmosphere.

This research is supported by the Swiss National Science Foundation (SNF), the National Centre of Competence in Research “Quantum Science and Technology” (QSIT), the COST action on Fundamental Problems in Quantum Physics, and by the Hasler Foundation.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Stefan Wolf .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Wolf, S. (2017). An All-or-Nothing Flavor to the Church-Turing Hypothesis. In: Gopal, T., Jäger , G., Steila, S. (eds) Theory and Applications of Models of Computation. TAMC 2017. Lecture Notes in Computer Science(), vol 10185. Springer, Cham. https://doi.org/10.1007/978-3-319-55911-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-55911-7_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-55910-0

  • Online ISBN: 978-3-319-55911-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics