Milking the Aanderaa argument (Q918198)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Milking the Aanderaa argument	scientific article

Statements

scholarly article

0 references

Milking the Aanderaa argument (English)

0 references

Ramamohan Paturi

0 references

Joel I. Seiferas

0 references

0 references

Richard E. Newman-Wolfe

0 references

Information and Computation

0 references

publication date

1990

0 references

full work available at URL

http://hdl.handle.net/1802/5963

0 references

zbMATH Keywords

lower bounds

0 references

on-line simulation

0 references

pushdown stores

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

Space Lower Bounds for Maze Threadability on Restricted Machines

0 references

Two nonlinear lower bounds for on-line computations

0 references

0 references

Two-Tape Simulation of Multitape Turing Machines

0 references

0 references

An information-theoretic approach to time bounds for on-line computation

0 references

On-line simulation of k + 1 tapes by k tapes requires nonlinear time

0 references

Real time computation

0 references

THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/0890-5401(90)90005-3

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:918198

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q918198&oldid=34828661"