Boolean Memories
From MaRDI portal
Publication:5518364
DOI10.1109/PGEC.1966.264373zbMath0143.01401OpenAlexW2294224924MaRDI QIDQ5518364
Publication date: 1966
Published in: IEEE Transactions on Electronic Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/pgec.1966.264373
Related Items (15)
Speedup of determinism by alternation for multidimensional Turing machines ⋮ On time versus space. II ⋮ On the Minimum Computation Time of Functions ⋮ An information-theoretic approach to time bounds for on-line computation ⋮ Simulations among multidimensional Turing machines ⋮ A fast implementation of a multidimensional storage into a tree storage ⋮ Relaxed Hensel lifting of triangular sets ⋮ Unnamed Item ⋮ A simple and fast online power series multiplication and its analysis ⋮ On the power of several queues ⋮ Linear speed-up does not hold on Turing machines with tree storages ⋮ On the sequential nature of functions ⋮ Linear-time simulation of multihead Turing machines ⋮ The time-precision tradeoff problem on on-line probabilistic Turing machines ⋮ Fast on-line integer multiplication
This page was built for publication: Boolean Memories
