Boolean Memories

DOI10.1109/PGEC.1966.264373MaRDI QIDQ5518364zbMATH OpenOpenAlexFDO

Authors F. C. Hennie

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

zbMATH Keywords

mathematical logic

Cited in

(15)

• On time versus space. II
• 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
• On the sequential nature of functions
• Speedup of determinism by alternation for multidimensional Turing machines
• Linear-time simulation of multihead Turing machines
• The time-precision tradeoff problem on on-line probabilistic Turing machines
• Fast on-line integer multiplication
• Relaxed Hensel lifting of triangular sets
• A simple and fast online power series multiplication and its analysis
• scientific article; zbMATH DE number 3292872 (Why is no real title available?)
• On the Minimum Computation Time of Functions
• On the power of several queues
• Linear speed-up does not hold on Turing machines with tree storages

This page was built for publication: Boolean Memories

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