On the IO-complexity and approximation languages

The approach to complexity theory called IO-complexity requires only that conditions meet infinitely often. A connection is established between the IO-complexity theory and the notion of approximation solutions. IO time and space bounds for deterministic Turing machines are defined. Particular atten...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information processing letters 1988-05, Vol.28 (1), p.27-31
Hauptverfasser:	Rolim, JoséD.P., Greibach, Sheila A.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Approximation approximation language Automata. Abstract machines. Turing machines Complexity theory Computer science control theory systems Exact sciences and technology Infinitely often bound Information processing Mathematical analysis Theoretical computing Theory
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!