If a Tree Casts a Shadow Is It Telling the Time?
Physical processes are computations only when we use them to externalize thought. Computation is the performance of one or more fixed processes within a contingent environment. We reformulate the Church-Turing thesis so that it applies to programs rather than to computability. When suitably formulated agent-based computing in an open, multi-scalar environment represents the current consensus view of how we interact with the world. But we don’t know how to formulate multi-scalar environments.
KeywordsTuring Machine Balance Scale Symbol Manipulation Contingent Environment Dynamic Entity
Unable to display preview. Download preview PDF.
- 1.IJUC Editorial Board, Preface [to the first edn.] from the Editorial Board. International Journal of Unconventional Computing 1(1), 1–2 (2004)Google Scholar
- 2.Wegner, P., Goldin, D.: Interaction, Computability, and Church’s Thesis. British Computing Journal (1999)Google Scholar
- 3.Google, Help Center, undated (accessed, March 12, 2006), http://mail.google.com/support/bin/answer.py?answer=29433&query=faq&topic=0&type=f
- 4.Abbott, R.: Emergence Explained. Complexity (to appear)Google Scholar
- 5.Albacete, L.: For the Love of God. New York Times (February 3, 2006)Google Scholar
- 7.Smart Computing, undated (accessed February 20, 2006), http://www.smartcomputing.com/editorial/dictionary/detail.asp?guid=&searchtype=1&DicID=18707&RefType=Encyclopedia
- 8.Sowa, J.: Existential Graphs (2002) (accessed February 20, 2006), http://www.jfsowa.com/peirce/ms514.htm
- 9.Eliasmith, C.: Computation, entry. In: Eliasmith, C. (ed.) Dictionary of the Philosophy of Mind (May 11, 2004), http://artsci.wustl.edu/~philos/MindDict/entry.html
- 11.Goldin, D., Wegner, P.: Behavior and Expressiveness of Persistent Turing Machines, Computer Science Technical Report, Brown Univ. (1999), http://www.cs.montana.edu/~elser/turingpapers/BehaviorandExpressivenessofPTM.pdf
- 12.Wegner, P., et al.: The Role of Agent Interaction in Models of Computing. Electronic Notes in Theoretical Computer Science, p. 141 (2005)Google Scholar