Counting is easy

DOI10.1145/48014.63141MaRDI QIDQ3813296zbMATH OpenOpenAlexFDO

Authors Joel I. Seiferas, Paul M. B. Vitányi

Publication date 1988

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/48014.63141

zbMATH Keywords

counter machinereal-time simulationsimulation between modelson-line simulationone-tape Turing machinerecursion eliminationmulticounter machinesigned-digit number representationabstract storage unitoblivious simulationredundant number representation

Mathematics Subject Classification ID

Cited in

(1)

• A communication hierarchy of parallel computations

This page was built for publication: Counting is easy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3813296)