Storage Modification Machines
From MaRDI portal
Publication:3902484
DOI10.1137/0209036zbMath0454.68034OpenAlexW2009798194MaRDI QIDQ3902484
Publication date: 1980
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0209036
Turing machinesrandom access machinesreal time simulationKolmogorov algorithmsinteger- multiplication
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (44)
Invariance properties of RAMs and linear time ⋮ Universal quantifiers and time complexity of random access machines ⋮ Unit-cost pointers versus logarithmic-cost addresses ⋮ Parallel pointer machines ⋮ Efficient reductions of picture words ⋮ Efficient algorithms for the temporal precedence problem ⋮ A logical approach to locality in pictures languages ⋮ Even faster integer multiplication ⋮ Self-modifying finite automata: An introduction ⋮ On nondeterminism in parallel computation ⋮ Effective storage capacity of labeled graphs ⋮ The problem of space invariance for sequential machines ⋮ Squeezing Feasibility ⋮ Complexity theory of parallel time and hardware ⋮ On time versus space III ⋮ Space measures for storage modification machines ⋮ A class of algorithms which require nonlinear time to maintain disjoint sets ⋮ The complexity of on-line simulations between multidimensional turing machines and random access machines ⋮ Four Soviets walk the dog: improved bounds for computing the Fréchet distance ⋮ A computational model for generic graph functions ⋮ Finding a shortest vector in a two-dimensional lattice modulo m ⋮ Kolmogorov and mathematical logic ⋮ Unconventional algorithms: complementarity of axiomatics and construction ⋮ Towards Slime Mould Based Computer ⋮ Tri-state circuits. A circuit model that captures RAM ⋮ Simulations among multidimensional Turing machines ⋮ Unnamed Item ⋮ Causal nets or what is a deterministic computation? ⋮ Programmable reconfiguration of Physarum machines ⋮ Group Input Machine ⋮ A note on predecessor searching in the pointer machine model ⋮ Homonym population protocols ⋮ Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees ⋮ A Natural Axiomatization of Computability and Proof of Church's Thesis ⋮ From reaction-diffusion to physarum computing ⋮ The Level-Ancestor problem on pure pointer machines ⋮ Sorting, linear time and the satisfiability problem ⋮ Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)] ⋮ In Praise of Numerical Computation ⋮ A simulation result for two-way pushdown automata ⋮ Unnamed Item ⋮ A tradeoff theorem for space and reversal ⋮ Notes on the complexity of sorting in abstract machines ⋮ A Survey on Analog Models of Computation
This page was built for publication: Storage Modification Machines
