Computing Mechanisms*

@article{Piccinini2007ComputingM,
  title={Computing Mechanisms*},
  author={Gualtiero Piccinini},
  journal={Philosophy of Science},
  year={2007},
  volume={74},
  pages={501 - 526}
}
  • G. Piccinini
  • Published 1 October 2007
  • Computer Science
  • Philosophy of Science
This paper offers an account of what it is for a physical system to be a computing mechanism—a system that performs computations. A computing mechanism is a mechanism whose function is to generate output strings from input strings and (possibly) internal states, in accordance with a general rule that applies to all relevant strings and depends on the input strings and (possibly) internal states for its application. This account is motivated by reasons endogenous to the philosophy of computing… 
A Problem for the Mechanistic Account of Computation
TLDR
It is argued that the mechanistic account faces a dilemma: if computations and computational systems are individuated in functional terms, then computational explanations are elliptic mechanistic explanations, or mechanism sketches, but, according to mechanists, mechanism sketches are incomplete and explanatorily weak.
A Behavioural Foundation for Natural Computing and a Programmability Test
TLDR
A behavioural characterisation of computing in terms of a measure of programmability, which reflects a system’s ability to react to external stimuli, is proposed, which is useful for classifying computers in Terms of the apparent algorithmic complexity of their evolution in time.
Review of Physical Computation: A Mechanistic Account by Gualtiero Piccinini
TLDR
Gualtiero Piccinini proposed to locate physical computation within the mechanistic framework in philosophy of science, which emphasizes the centrality of mechanistic explanations in the sciences, especially in biology and neuroscience.
What Is Nature-Like Computation? A Behavioural Approach and a Notion of Programmability
TLDR
An alternative behavioural definition of computation (and of a computer) is proposed based simply on whether a system is capable of reacting to the environment—the input—as reflected in a measure of programmability, by using an extension of a phase transition coefficient.
Does the solar system compute the laws of motion?
TLDR
It is shown that the algorithm execution account entails limited pancomputationalism, despite Copeland’s argument to the contrary, and it is suggested that the counterfactual account should be accepted as it stands, pancomputableist warts and all.
Central Nervous System and Computation
TLDR
The emerging picture shows the brain as a very peculiar system, in which genuine computational features act in concert with noncomputational dynamical processes, leading to continuous self-organization and remodeling under the action of external stimuli from the environment and from the rest of the organism.
Explaining Computation Without Semantics: Keeping it Simple
  • Nir Fresco
  • Philosophy, Computer Science
    Minds and Machines
  • 2010
TLDR
It is argued that the only justified appeal to a representational individuation of computation might be that it is partly individuated by implicitintrinsic representations.
The Computational Theory of Mind
TLDR
CCTM holds that a suitable abstract computational model offers a literally true description of core mental processes, and argues that addressable memory gives a better model of the mind than non-addressable memory.
Connectionist Computation
  • G. Piccinini
  • Psychology
    2007 International Joint Conference on Neural Networks
  • 2007
TLDR
There are compelling reasons to accept both (1) and (3) and to replace (2) with a more satisfactory account of computation, so that one can see more clearly what is peculiar to connectionist computation.
...
...

References

SHOWING 1-10 OF 63 REFERENCES
Programs in the Explanation of Behavior
The purpose of this paper is to set forth a sense in which programs can and do explain behavior, and to distinguish from this a number of senses in which they do not. Once we are tolerably clear
Connectionist Computation
  • G. Piccinini
  • Psychology
    2007 International Joint Conference on Neural Networks
  • 2007
TLDR
There are compelling reasons to accept both (1) and (3) and to replace (2) with a more satisfactory account of computation, so that one can see more clearly what is peculiar to connectionist computation.
Why everything doesn't realize every computation
TLDR
It is argued that if one's view of computation involves embeddedness and full causality, one can avoid the universal realizability results and therefore, the fact that a particular system realizes a particular automaton is not a vacuous one, and is often explanatory.
When Physical Systems Realize Functions...
TLDR
It is argued that standard notions of computation together with a ‘state-to-state correspondence view of implementation’ cannot overcome difficulties posed by Putnam's Realization Theorem and that, therefore, a different approach to implementation is required.
Does a rock implement every finite-state automaton?
TLDR
An account of implementation is developed, linked to an appropriate class of automata, such that the requirement that a system implement a given automaton places a very strong constraint on the system.
Minds, Brains, and Programs
  • J. Searle
  • Philosophy
    The Philosophy of Artificial Intelligence
  • 1990
TLDR
Only a machine could think, and only very special kinds of machines, namely brains and machines with internal causal powers equivalent to those of brains, and no program by itself is sufficient for thinking.
Why we view the brain as a computer
TLDR
This work suggests that neuroscientists invoke the computational outlook to explain regularities that are formulated in terms of the information content of electrical signals, and indicates why computational theories have explanatory force with respect to these regularities.
Neural networks and physical systems with emergent collective computational abilities.
  • J. Hopfield
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 1982
TLDR
A model of a system having a large number of simple equivalent components, based on aspects of neurobiology but readily adapted to integrated circuits, produces a content-addressable memory which correctly yields an entire memory from any subpart of sufficient size.
Computational modelling vs. Computational explanation: Is everything a Turing Machine, and does it matter to the philosophy of mind?
TLDR
It is found that although some varieties of pancomputationalism are more plausible than others, only the strongest variety is relevant to the philosophy of mind, but only the most trivial varieties are true.
K-graph machines : generalizing Turing's machines and arguments
TLDR
K-graph machines are introduced and used to give a detailed mathematical explication of the first two aspects of Turing's considerations for general configurations, i.e. boundedness and locality conditions and mechanical operations, which provide a significant strengthening of Turing’s argument for his central thesis.
...
...