Skip to main content
SpringerLink
Log in

Programming Infinite Machines

  • Original Research
  • Published:
Erkenntnis Aims and scope Submit manuscript

Abstract

For infinite machines that are free from the classical Thomson’s lamp paradox, we show that they are not free from its inverted-in-time version. We provide a program for infinite machines and an infinite mechanism that demonstrate this paradox. While their finite analogs work predictably, the program and the infinite mechanism demonstrate an undefined behavior. As in the case of infinite Davies machines (Davies in Br J Philos Sci 52(4):671–682, 2001), our examples are free from infinite masses, infinite velocities, infinite forces, etc. Only infinite divisibility of space and time is assumed. Thus, the infinite devices considered are possible in a Newtonian Universe and they do not conflict with Newtonian mechanics. Note that the classical Thomson’s lamp paradox leads to infinite velocities which may not be producible in acceptable models of Newtonian mechanics. Finally, it is shown that the “paradox of predictability” is similar to the inverted Thomson’s lamp paradox.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  • Adamatzky, A. A. (2019). A brief history of liquid computers. Philosophical Transactions of the Royal Society B,. https://doi.org/10.1098/rstb.2018.0372.

    Article  Google Scholar 

  • Boolos, G. S., Burgess, J. P., & Jeffrey, R. C. (2007). Computability and logic (5th ed.). Cambridge: Cambridge University Press.

    Book  Google Scholar 

  • Burgin, M. (2003). Nonlinear phenomena in spaces of algorithms. International Journal of Computer Mathematics, 80(12), 1449–1476.

    Article  Google Scholar 

  • Burgin, M., & Klinger, A. (2004). Three aspects of super-recursive algorithms and hypercomputation or finding black swans. Theoretical Computer Science, 317(1–3), 1–11.

    Article  Google Scholar 

  • Clark, P., & Read, S. (1984). Hypertasks. Synthese, 61(3), 387–390.

    Article  Google Scholar 

  • Copeland, B. J. (2002). Hypercomputation. Minds and Machines, 12(4), 461–502.

    Article  Google Scholar 

  • Cotogno, P. (2009). A brief critique of pure hypercomputation. Minds and Machines, 19, 391–405.

    Article  Google Scholar 

  • da Costa, N. C. A., & Doria, F. A. (2009). How to build a hypercomputer. Applied Mathematics and Computation, 215(4), 1361–1367.

    Article  Google Scholar 

  • Davies, E. B. (2001). Building infinite machines. British Journal for the Philosophy of Science, 52(4), 671–682.

    Article  Google Scholar 

  • Earman, J., & Norton, J. D. (1996). Infinite pains. The trouble with supertasks. In A. Morton & S. P. Stich (Eds.), Benacerraf and his critics (pp. 231–261). Hoboken, NJ: Wiley-Blackwell.

    Google Scholar 

  • Falkovich, G., & Sreenivasan, K. R. (2006). Lessons from hydrodynamic turbulence. Physics Today, 59(4), 43–49.

    Article  Google Scholar 

  • Hagar, A., & Korolev, A. (2006). Quantum hypercomputability? Minds and Machines, 16(1), 87–93.

    Article  Google Scholar 

  • Hogarth, M. (1996). Predictability, computability, and spacetime. PhD thesis, Sidney Sussex College, Cambridge.

  • Meneveau, C., & Sreenivasan, K. R. (1991). The multifractal nature of turbulent energy dissipation. Journal of Fluid Mechanics, 224, 429–484.

    Article  Google Scholar 

  • Minsky, M. L. (1967). Computation: Finite and infinite machines. Upper Saddle River, NJ: Prentice-Hall Inc.

    Google Scholar 

  • Nayebi, A. (2014). Practical intractability: A critique of the hypercomputation movement. Minds and Machines, 24(3), 275–305.

    Article  Google Scholar 

  • Németi, I., & Dávid, G. (2006). Relativistic computers and the turing barrier. Applied Mathematics and Computation, 178(1), 118–142.

    Article  Google Scholar 

  • Rummens, S., & Cuypers, S. E. (2010). Determinism and the paradox of predictability. Erkenntnis, 72(2), 233–249.

    Article  Google Scholar 

  • Sreenivasan, K. R., & Meneveau, C. (1986). The fractal facets of turbulence. Journal of Fluid Mechanics, 173, 357–386.

    Article  Google Scholar 

  • Stannett, M. (2012). Computing the appearance of physical reality. Applied Mathematics and Computation, 219(1), 54–62.

    Article  Google Scholar 

  • Syropoulos, A. (2008). Hypercomputation: Computing beyond the Church–Turing barrier. New York: Springer.

    Book  Google Scholar 

  • Thomson, J. (1954). Tasks and supertasks. Analysis, 15(1), 1–13.

    Article  Google Scholar 

  • Wüthrich, C. (2015). A quantum-information-theoretic complement to a general-relativistic implementation of a beyond-Turing computer. Synthese, 192(7), 1989–2008.

    Article  Google Scholar 

Download references

Acknowledgements

This work is supported by the Russian Science Foundation (RSF) Project 18-11-00032. This paper is also a contribution to the project M3 of the Collaborative Research Centre TRR 181 “Energy Transfer in Atmosphere and Ocean” funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Project Number 274762653. I would like to thank Prof. Dr. Marcel Oliver (Jacobs University), Dr. Ryan North (Hamburg University), the editors of Erkenntnis, and anonymous reviewers, for their valuable comments and very useful discussions.

Author information

Authors and Affiliations

  1. Jacobs University, 28759, Bremen, Germany

    Anton A. Kutsenko

  2. Saint-Petersburg State University, Universitetskaya nab. 7/9, St. Petersburg, Russia, 199034

    Anton A. Kutsenko

Authors
  1. Anton A. Kutsenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Anton A. Kutsenko.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kutsenko, A.A. Programming Infinite Machines. Erkenn 87, 181–189 (2022). https://doi.org/10.1007/s10670-019-00190-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10670-019-00190-7

Search

Navigation