429 search results - page 70 / 86 » Turing computations on ordinals |
134
click to vote
STACS
2007
Springer
16 years 5 days ago
2007
Springer
Abstract. We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary...
148
click to vote
IJFCS
2006
15 years 6 months ago
2006
We continue here the study of the recently introduced spiking neural P systems, which mimic the way that neurons communicate with each other by means of short electrical impulses, ...
163
click to vote
JSYML
2007
15 years 6 months ago
2007
We consider embeddings of structures which preserve spectra: if g : M → S with S computable, then M should have the same Turing degree spectrum (as a structure) that g(M) has (a...
158
click to vote
STACS
2010
Springer
16 years 17 days ago
2010
Springer
This paper presents the following results on sets that are complete for NP. (i) If there is a problem in NP that requires 2nΩ(1) time at almost all lengths, then every many-one N...
170
click to vote
SPAA
2005
ACM
15 years 11 months ago
2005
ACM
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...