Indirect addressing and the time relationships of some models of sequential computation

DOI10.1016/0898-1221(79)90042-7zbMath0435.68036OpenAlexW1980560405MaRDI QIDQ1140427

Patrick W. Dymond

Publication date: 1979

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(79)90042-7

zbMATH Keywords

random access machinecounter machineindirect addressingcomplexity analogues to Church's thesiseffective computabilitysequential computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (1)

Counter machines and distributed automata -- a story about exchanging space and time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• On Families of Languages Defined by Time-Bounded Random Access Machines
• On the Computational Complexity of Algorithms
• Counter machines and counter languages
• Real-time solutions of the origin-crossing problem
• On the Minimum Computation Time of Functions
• Real-Time Simulation of Multihead Tape Units
• On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction

This page was built for publication: Indirect addressing and the time relationships of some models of sequential computation