Real-Time Computation and Recursive Functions Not Real-Time Computable
Abstract
As an attempt to investigate a general theory of real-time computability in digital computers, a subclass of Turing machines is formally introduced together with some classes of functions that are computable by them in real time. Then the existence is established of a class of recursive functions that are not computable in real time by use of a class of machines, no matter how general we make the machines subject to a given constraint.
- Publication:
-
IRE Transactions on Electronic Computers
- Pub Date:
- December 1962
- DOI:
- Bibcode:
- 1962IRTEC..11..753Y
- Keywords:
-
- Automata;
- Costs;
- Application software;
- Testing;
- Upper bound;
- Tree data structures;
- Network synthesis;
- Tellurium;
- Computer applications;
- Mathematical model