David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
The Monist 82 (1):58-108 (1999)
Part I presents a model of interactive computation and a metric for expressiveness, Part II relates interactive models of computation to physics, and Part III considers empirical models from a philosophical perspective. Interaction machines, which extend Turing Machines to interaction, are shown in Part I to be more expressive than Turing Machines by a direct proof, by adapting Gödel's incompleteness result, and by observability metrics. Observation equivalence provides a tool for measuring expressiveness according to which interactive systems are more expressive than algorithms. Refinement of function equivalence by observation of outer interactive behavior and inner computation steps is examined. The change of focus from algorithms specified by computable functions to interaction specified by observation equivalence captures the essence of empirical computer science. Part II relates interaction in models of computation to observation in the natural sciences. Explanatory power in physics is specified by the same observability metric as expressiveness in interactive systems. Realist models of inner structure are characterized by induction, abduction, and Occam's Razor. Interactive realism extends the hidden-variable model of Einstein to hidden interfaces that provide extra degrees of freedom to formulate hypotheses with testable predictions conforming with quantum theory. Greater expressiveness of collaborative computational observers (writers) than single observers implies that hidden-interface models are more expressive than hidden-variable models. By providing a common foundation for empirical computational and physical models we can use precise results about computational models to establish properties of physical models. Part III shows that the evolution in computing from algorithms to interaction parallels that in physics from rationalism to empiricism. Plato's cave metaphor is interactively extended from Platonic rationalism to empiricism. The Turing test is extended to TMs with hidden interfaces that express interactive thinking richer than the traditional Turing test. Interactive (nonmonotonic) extensions of logic such as the closed-world assumption suggest that interactiveness is incompatible with monotonic logical inference. Procedure call, atomicity of transactions, and taking a fixed point are techniques for closing open systems similar to "preparation" followed by "observation" of a physical system. Pragmatics is introduced as a framework for extending logical models with a fixed syntax and semantics to multiple-interface models that support collaboration among clients sharing common resources
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
Dina Goldin & Peter Wegner (2008). The Interactive Nature of Computing: Refuting the Strong Church–Turing Thesis. [REVIEW] Minds and Machines 18 (1):17-38.
Similar books and articles
Allen Newell & Herbert A. Simon (1981). Computer Science as Empirical Inquiry: Symbols and Search. Communications of the Association for Computing Machinery 19:113-26.
Michael J. Quinn (2006). On Teaching Computer Ethics Within a Computer Science Department. Science and Engineering Ethics 12 (2):335-343.
Timothy Colburn & Gary Shute (2011). Decoupling as a Fundamental Value of Computer Science. Minds and Machines 21 (2):241-259.
Izabela Bondecka-Krzykowska (2010). O związkach informatyki z matematyką. Filozofia Nauki 1.
Oron Shagrir (1999). What is Computer Science About? The Monist 82 (1):131-149.
William J. Rapaport (2005). Philosophy of Computer Science. Teaching Philosophy 28 (4):319-341.
Justin Solomon (2009). Programmers, Professors, and Parasites: Credit and Co-Authorship in Computer Science. Science and Engineering Ethics 15 (4):467-489.
Stefan Gruner (2011). Problems for a Philosophy of Software Engineering. Minds and Machines 21 (2):275-299.
Amnon Eden (2011). Some Philosophical Issues in Computer Science. Minds and Machines 21 (2):123-133.
Amnon H. Eden (2007). Three Paradigms of Computer Science. Minds and Machines 17 (2):135-167.
Aaron Sloman (1978). The Computer Revolution in Philosophy: Philosophy Science and Models of Mind. Harvester.
Darren Abramson (2011). Philosophy of Mind Is (in Part) Philosophy of Computer Science. Minds and Machines 21 (2):203-219.
Timothy Colburn & Gary Shute (2007). Abstraction in Computer Science. Minds and Machines 17 (2):169-184.
André Kukla (1989). Is AI an Empirical Science? Analysis 49 (March):56-60.
Added to index2011-01-09
Total downloads4 ( #434,173 of 1,727,288 )
Recent downloads (6 months)1 ( #354,178 of 1,727,288 )
How can I increase my downloads?