The sciences of the artificial (3rd ed.)
The sciences of the artificial (3rd ed.)
The structure of the “THE”-multiprogramming system
Communications of the ACM
Programming semantics for multiprogrammed computations
Communications of the ACM
How biology became an information science
The invisible future
A new kind of science
What Can Be Automated?: Computer Science and Engineering Research Study
What Can Be Automated?: Computer Science and Engineering Research Study
Operating Systems Theory
Computer system organization: The B5700/B6700 series (ACM monograph series)
Computer system organization: The B5700/B6700 series (ACM monograph series)
A Mathematical Theory of Communication
A Mathematical Theory of Communication
Communications of the ACM - Self managed systems
Interactive Computation: The New Paradigm
Interactive Computation: The New Paradigm
Meta Math!: The Quest for Omega
Meta Math!: The Quest for Omega
Computing is a natural science
Communications of the ACM - Creating a science of games
The profession of IT: Beyond computational thinking
Communications of the ACM - One Laptop Per Child: Vision vs. Reality
The profession of IT: Computing: the fourth great domain of science
Communications of the ACM - The Status of the P versus NP Problem
The profession of IT: Computing's paradigm
Communications of the ACM - Finding the Fun in Computer Science Education
Recent progress in quantum algorithms
Communications of the ACM
Logic of Analog and Digital Machines
Logic of Analog and Digital Machines
Computational thinking: what it might mean and what we might do about it
Proceedings of the 16th annual joint conference on Innovation and technology in computer science education
| Hi-index | 0.00 |
Most people understand a computation as a process evoked when a computational agent acts on its inputs under the control of an algorithm. The classical Turing machine model has long served as the fundamental reference model because an appropriate Turing machine can simulate every other computational model known. The Turing model is a good abstraction for most digital computers because the number of steps to execute a Turing machine algorithm is predictive of the running time of the computation on a digital computer. However, the Turing model is not as well matched for the natural, interactive, and continuous information processes frequently encountered today. Other models whose structures more closely match the information processes involved give better predictions of running time and space. Models based on transforming representations may be useful.