- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: Journal of Computer and System Sciences, Band 44, Ausgabe 2, Seite 272-286, 1992
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin
- (wer)
-
Humboldt-Universität zu Berlin
- (wann)
-
1992
- Urheber
-
Köbler, Johannes
Schöning, Uwe
Toda, Seinosuke
Toran, Jacobo
- DOI
-
10.18452/9149
- URN
-
urn:nbn:de:kobv:11-10054699
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:56 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Köbler, Johannes
- Schöning, Uwe
- Toda, Seinosuke
- Toran, Jacobo
- Humboldt-Universität zu Berlin
Entstanden
- 1992
Ähnliche Objekte (12)
On the automatic synthesis of turing machines from samples of their computations
Turing machines with sublogarithmic space
On Turing machines, groupoids, and Atiyah problem
Complexity of turing machine computations, Course unit 3.. Polynomial time
On sets Turing reducible to p-selective sets
Complexity of turing machine computations, Course units 1 and 2.. Introduction
Machines, computations, and universality : third international conference
Complexity of turing machine computations, Course unit 4.. Alternation ; INP complete problems
Relationships between pushdown automata and tape-bounded turing machines
Reachability for infinite time Turing machines with long tapes
Complexity of turing machine computations, Course unit 7.. Conclusions, applications and open questions
Complexity of turing machine computations, Course unit 6.. Polynomial space and logarithm space
On the automatic synthesis of turing machines from samples of their computations
Turing machines with sublogarithmic space
On Turing machines, groupoids, and Atiyah problem
Complexity of turing machine computations, Course unit 3.. Polynomial time
On sets Turing reducible to p-selective sets
Complexity of turing machine computations, Course units 1 and 2.. Introduction
Machines, computations, and universality : third international conference
Complexity of turing machine computations, Course unit 4.. Alternation ; INP complete problems
Relationships between pushdown automata and tape-bounded turing machines
Reachability for infinite time Turing machines with long tapes
Complexity of turing machine computations, Course unit 7.. Conclusions, applications and open questions
Complexity of turing machine computations, Course unit 6.. Polynomial space and logarithm space
On the automatic synthesis of turing machines from samples of their computations
Turing machines with sublogarithmic space
On Turing machines, groupoids, and Atiyah problem
Complexity of turing machine computations, Course unit 3.. Polynomial time
On sets Turing reducible to p-selective sets
Complexity of turing machine computations, Course units 1 and 2.. Introduction
Machines, computations, and universality : third international conference
Complexity of turing machine computations, Course unit 4.. Alternation ; INP complete problems
Relationships between pushdown automata and tape-bounded turing machines
Reachability for infinite time Turing machines with long tapes
Complexity of turing machine computations, Course unit 7.. Conclusions, applications and open questions