Computability and logic: 3rd ed.
Computability and logic: 3rd ed.
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Representation and Reality
Structure and Interpretation of Computer Programs
Structure and Interpretation of Computer Programs
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Understanding Computers and Cognition: A New Foundation for Design
Understanding Computers and Cognition: A New Foundation for Design
A Mathematical Theory of Communication
A Mathematical Theory of Communication
| Hi-index | 0.00 |
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.