On Communication and Computation

Comparing technical notions of communication and computation leads to a surprising result, these notions are often not conceptually distinguishable. This paper will show how the two notions may fail to be clearly distinguished from each other. The most famous models of computation and communication, Turing Machines and (Shannon-style) information sources, are considered. The most significant difference lies in the types of state-transitions allowed in each sort of model. This difference does not correspond to the difference that would be expected after considering the ordinary usage of these terms. However, the natural usage of these terms are surprisingly difficult to distinguish from each other. The two notions may be kept distinct if computation is limited to actions within a system and communications is an interaction between a system and its environment. Unfortunately, this decision requires giving up much of the nuance associated with natural language versions of these important terms.

[1]  Nancy Cartwright,et al.  Causal Diversity and the Markov Condition , 1999, Synthese.

[2]  George Boolos,et al.  Computability and logic: 3rd ed. , 1989 .

[3]  Terry Winograd,et al.  Understanding computers and cognition - a new foundation for design , 1987 .

[4]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[5]  Gerald J. Sussman,et al.  Structure and interpretation of computer programs , 1985, Proceedings of the IEEE.

[6]  John Haugeland,et al.  Analog and Analog , 1981 .

[7]  S. Kleene,et al.  General Recursive Functions of Natural Numbers. , 1937 .

[8]  James H. Fetzer.  Mental Algorithms: Are Minds Computational Systems? , 1994 .

[9]  John R. Searle,et al.  Minds, brains, and programs , 1980, Behavioral and Brain Sciences.

[10]  Haskell B. Curry,et al.  Foundations of Mathematical Logic , 1964 .

[11]  George Boolos,et al.  Computability and logic , 1974 .

[12]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[13]  S. Sajami,et al.  Representation and reality , 1993 .

[14]  R. J. Nelson,et al.  Introduction to Automata , 1968 .

[15]  Nancy Cartwright,et al.  The Reality of Causes in a World of Instrumental Laws , 1980, PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association.

[16]  S. Schein.  The Iliad: Structure and Interpretation , 1997 .

[17]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[18]  Luciano Floridi,et al.  What is the Philosophy of Information , 2002 .

[19]  Jeffrey D. Ullman,et al.  Introduction to automata theory, languages, and computation, 2nd edition , 2001, SIGA.

[20]  Proposals for Development in the Mathematics , 2022 .

[21]  S. Kleene.  General recursive functions of natural numbers , 1936 .

[22]  David J. Chalmers,et al.  Does a rock implement every finite-state automaton? , 1996, Synthese.

[23]  Terry Winograd,et al.  Understanding computers and cognition , 1986 .

[24]  Gerald J. Sussman,et al.  Structure and Interpretation of Computer Programs, Second Edition , 1996 .