An information-theoretic approach to time bounds for on-line computation
From MaRDI portal
(Redirected from Publication:1156484)
Cites work
- scientific article; zbMATH DE number 3646282 (Why is no real title available?)
- scientific article; zbMATH DE number 3471609 (Why is no real title available?)
- scientific article; zbMATH DE number 3495593 (Why is no real title available?)
- scientific article; zbMATH DE number 3600020 (Why is no real title available?)
- A formal theory of inductive inference. Part I
- Boolean Memories
- Counter machines and counter languages
- New Real-Time Simulations of Multihead Tape Units
- On the Minimum Computation Time of Functions
- On time versus space. II
- Real time computation
- Real-Time Simulation of Multihead Tape Units
- Real-time solutions of the origin-crossing problem
- Relations Among Complexity Measures
- Two-Tape Simulation of Multitape Turing Machines
Cited in
(13)- Minimizing access pointers into trees and arrays
- Milking the Aanderaa argument
- Three one-way heads cannot do string matching
- Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity
- `Ideal learning' of natural language: positive results about learning from positive evidence
- On the power of several queues
- Tape versus queue and stacks: The lower bounds
- Simulations among multidimensional Turing machines
- On space-bounded synchronized alternating Turing machines
- An \(n^{1.618}\) lower bound on the time to simulate one queue or two pushdown stores by one tape
- On the structure of one-tape nondeterministic Turing machine time hierarchy
- On two-tape real-time computation and queues
- On the simulation of many storage heads by one
This page was built for publication: An information-theoretic approach to time bounds for on-line computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1156484)
