Skip to main content
Top
Published in: Minds and Machines 3/2018

25-08-2018

The Role of Observers in Computations

How Much Computation Does it Take to Recognize a Computation?

Author: Peter Leupold

Published in: Minds and Machines | Issue 3/2018

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

John Searle raised the question whether all computation is observer-relative. Indeed, all of the common views of computation, be they semantical, functional or causal rely on mapping something onto the states of a physical or abstract process. In order to effectively execute such a mapping, this process would have to be observed in some way. Thus a probably syntactical analysis by an observer seems to be essential for judging whether a given process implements some computation or not. In order to be able to explore the nature of these observers in a more formal way, we look at the Computing by Observing paradigm, a theoretical model of computation that includes an observer. We argue that the observers used there, monadic transducers, are good candidates for formalizing the way in which the syntax of a process must be analysed in order to judge whether it is computational.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Footnotes
1
In a setting like the one of the example of Sect. 2 we could imagine that for an addition \(14+32\) the process has to do the additions \(1+3\) and \(4+2\) separately; the observation does not contain these but only the compact result \(14+32\).
 
Literature
go back to reference Aaronson, S. (2013). Why philosophers should care about computational complexity. In B. J. Copeland & O. S. C. Posy (Eds.), Computability: Turing, gdel, church, and beyond (pp. 261–328). London: MIT Press. Aaronson, S. (2013). Why philosophers should care about computational complexity. In B. J. Copeland & O. S. C. Posy (Eds.), Computability: Turing, gdel, church, and beyond (pp. 261–328). London: MIT Press.
go back to reference Adleman, L. (1994). Molecular computation of solutions to combinatorial problems. Science, 226, 1021–1024.CrossRef Adleman, L. (1994). Molecular computation of solutions to combinatorial problems. Science, 226, 1021–1024.CrossRef
go back to reference Alhazov, A., & Cavaliere, M. (2004). Computing by observing bio-systems: The case of sticker systems. In C. Ferretti, G. Mauri, & C. Zandron (Eds.), DNA (Vol. 3384, pp. 1–13)., Lecture Notes in Computer Science Berlin: Springer. Alhazov, A., & Cavaliere, M. (2004). Computing by observing bio-systems: The case of sticker systems. In C. Ferretti, G. Mauri, & C. Zandron (Eds.), DNA (Vol. 3384, pp. 1–13)., Lecture Notes in Computer Science Berlin: Springer.
go back to reference Bickle, J. (2013). Multiple realizability. In E. N. Zalta (Ed.), The Stanford encyclopedia of philosophy (2013th ed.). Berlin: Springer. Bickle, J. (2013). Multiple realizability. In E. N. Zalta (Ed.), The Stanford encyclopedia of philosophy (2013th ed.). Berlin: Springer.
go back to reference Cavaliere, M., Frisco, P., & Hoogeboom, H. J. (2006). Computing by only observing. In O. H. Ibarra & Z. Dang (Eds.), Developments in language theory (Vol. 4036, pp. 304–314)., Lecture Notes in Computer Science Berlin: Springer.CrossRef Cavaliere, M., Frisco, P., & Hoogeboom, H. J. (2006). Computing by only observing. In O. H. Ibarra & Z. Dang (Eds.), Developments in language theory (Vol. 4036, pp. 304–314)., Lecture Notes in Computer Science Berlin: Springer.CrossRef
go back to reference Cavaliere, M., & Leupold, P. (2003). Evolution and observation: A new way to look at membrane systems. In C. Martín-Vide, G. Mauri, G. Paun, G. Rozenberg, & A. Salomaa (Eds.), Workshop on membrane computing (Vol. 2933, pp. 70–87). Lecture Notes in Computer Science, Berlin: Springer.CrossRef Cavaliere, M., & Leupold, P. (2003). Evolution and observation: A new way to look at membrane systems. In C. Martín-Vide, G. Mauri, G. Paun, G. Rozenberg, & A. Salomaa (Eds.), Workshop on membrane computing (Vol. 2933, pp. 70–87). Lecture Notes in Computer Science, Berlin: Springer.CrossRef
go back to reference Cavaliere, M., & Leupold, P. (2004). Evolution and observation—A non-standard way to generate formal languages. Theoretical Computer Science, 321, 233–248.MathSciNetCrossRefMATH Cavaliere, M., & Leupold, P. (2004). Evolution and observation—A non-standard way to generate formal languages. Theoretical Computer Science, 321, 233–248.MathSciNetCrossRefMATH
go back to reference Cavaliere, M., & Leupold, P. (2006). Observation of string-rewriting systems. Fundamenta Informaticae, 74(4), 447–462.MathSciNetMATH Cavaliere, M., & Leupold, P. (2006). Observation of string-rewriting systems. Fundamenta Informaticae, 74(4), 447–462.MathSciNetMATH
go back to reference Dassow, J., Mitrana, V., & Salomaa, A. (2002). Operations and language generating devices suggested by the genome evolution. Theoretical Computer Science, 270(1–2), 701–738.MathSciNetCrossRefMATH Dassow, J., Mitrana, V., & Salomaa, A. (2002). Operations and language generating devices suggested by the genome evolution. Theoretical Computer Science, 270(1–2), 701–738.MathSciNetCrossRefMATH
go back to reference Fodor, J. A. (1981). The mind–body problem. Scientific American, 241, 114–123.CrossRef Fodor, J. A. (1981). The mind–body problem. Scientific American, 241, 114–123.CrossRef
go back to reference Krassovitskiy, A., & Leupold, P. (2012). Computing by observing insertion. In A. H. Dediu & C. Martín-Vide (Eds.), LATA (Vol. 7183, pp. 377–388)., Lecture Notes in Computer Science Berlin: Springer. Krassovitskiy, A., & Leupold, P. (2012). Computing by observing insertion. In A. H. Dediu & C. Martín-Vide (Eds.), LATA (Vol. 7183, pp. 377–388)., Lecture Notes in Computer Science Berlin: Springer.
go back to reference Landweber, L. F., & Kari, L. (2002). Universal molecular computation in ciliates. In L. F. Landweber & E. Winfree (Eds.), Evolution as computation, natural computing series (pp. 257–274). Berlin: Springer.CrossRef Landweber, L. F., & Kari, L. (2002). Universal molecular computation in ciliates. In L. F. Landweber & E. Winfree (Eds.), Evolution as computation, natural computing series (pp. 257–274). Berlin: Springer.CrossRef
go back to reference Morse, M. (1938). A solution of the problem of infinite play in chess. Bulletin of the American Mathemetical Society, 44, 632. Morse, M. (1938). A solution of the problem of infinite play in chess. Bulletin of the American Mathemetical Society, 44, 632.
go back to reference Păun, G., Rozenberg, G., & Salomaa, A. (1998). DNA computing—New computing paradigms. Berlin: Springer.CrossRefMATH Păun, G., Rozenberg, G., & Salomaa, A. (1998). DNA computing—New computing paradigms. Berlin: Springer.CrossRefMATH
go back to reference Putnam, H. (1988). Representation and reality. London: MIT Press. Putnam, H. (1988). Representation and reality. London: MIT Press.
go back to reference Searle, J. R. (1992). The rediscovery of the mind. London: MIT Press. Searle, J. R. (1992). The rediscovery of the mind. London: MIT Press.
go back to reference Turing, A. (1937). On computable numbers, with an application to the entscheidungsproblem. Proceedings of the London Mathematical Society, 2(42), 230–265.MathSciNetCrossRefMATH Turing, A. (1937). On computable numbers, with an application to the entscheidungsproblem. Proceedings of the London Mathematical Society, 2(42), 230–265.MathSciNetCrossRefMATH
go back to reference von Braunmühl, B., & Verbeek, R. (1979). Finite-change automata. In K. Weihrauch (Ed.), Theoretical computer science 4th GI conference (Vol. 67, pp. 91–100)., Lecture Notes in Computer Science Berlin: Springer.CrossRef von Braunmühl, B., & Verbeek, R. (1979). Finite-change automata. In K. Weihrauch (Ed.), Theoretical computer science 4th GI conference (Vol. 67, pp. 91–100)., Lecture Notes in Computer Science Berlin: Springer.CrossRef
Metadata
Title
The Role of Observers in Computations
How Much Computation Does it Take to Recognize a Computation?
Author
Peter Leupold
Publication date
25-08-2018
Publisher
Springer Netherlands
Published in
Minds and Machines / Issue 3/2018
Print ISSN: 0924-6495
Electronic ISSN: 1572-8641
DOI
https://doi.org/10.1007/s11023-018-9471-8

Other articles of this Issue 3/2018

Minds and Machines 3/2018 Go to the issue

Premium Partner