429 search results - page 51 / 86 » Turing computations on ordinals |
118
click to vote
MFCS
1994
Springer
15 years 10 months ago
1994
Springer
We introduce the notion of empty alternation by investigating alternating automata which are restricted to empty their storage except for a logarithmically space-bounded tape befor...
147
click to vote
CSR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We will show how padding techniques can be applied on onedimensional cellular automata by proving a transfer theorem on complexity classes (how one inclusion of classes i...
181
click to vote
TCS
2011
15 years 1 months ago
2011
This paper presents a 1D intrinsically universal cellular automaton with four states for a first neighbors neighborhood, improving on the previous lower bound and getting nearer ...
145
click to vote
NDJFL
2010
15 years 26 days ago
2010
The weakly random reals contain not only the Schnorr random reals as a subclass but also the weakly 1-generic reals and therefore the n-generic reals for every n. While the class o...
294
click to vote
CONCUR
2012
Springer
13 years 8 months ago
2012
Springer
We introduce a nominal actor-based language and study its expressive power. We have identified the presence/absence of fields as a relevant feature: the dynamic creation of names...