Indirect addressing and the time relationships of some models of sequential computation
type: Item
instance of: scholarly article
title: Indirect addressing and the time relationships of some models of sequential computation
zbMATH Open document ID: 0435.68036
DOI: 10.1016/0898-1221(79)90042-7
author: P. Dymond
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68W99
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03D60
zbMATH DE Number: 3679180
zbMATH Keywords: sequential computation
zbMATH Keywords: counter machine
zbMATH Keywords: effective computability
zbMATH Keywords: random access machine
zbMATH Keywords: complexity analogues to Church's thesis
zbMATH Keywords: indirect addressing
MaRDI profile type: Publication
full work available at URL: 0898-1221(79)90042-7
OpenAlex ID: W1980560405
cites work: On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
cites work: On the Computational Complexity of Algorithms
cites work: Q5592246
cites work: Real-Time Simulation of Multihead Tape Units
cites work: Q4124336
cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines
cites work: Counter machines and counter languages
cites work: Real-time solutions of the origin-crossing problem
cites work: On Families of Languages Defined by Time-Bounded Random Access Machines
cites work: Q4773298
cites work: On the Minimum Computation Time of Functions
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 3679180