CIE
2007
Springer
13 years 11 months ago
2007
Springer
We expose a strict hierarchy within monotone monadic strict NP without inequalities (MMSNP), based on the number of second-order monadic quantifiers. We do this by studying a fin...
CIE
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We consider an extensional version, called qmTT, of the intensional Minimal Type Theory mTT, introduced in a previous paper with G. Sambin, enriched with proof-irrelevanc...
CIE
2007
Springer
13 years 11 months ago
2007
Springer
Winfree (1998) showed that discrete Sierpinski triangles can self-assemble in the Tile Assembly Model. A striking molecular realization of this self-assembly, using DNA tiles a fe...
CIE
2007
Springer
13 years 11 months ago
2007
Springer
CIE
2007
Springer
13 years 11 months ago
2007
Springer
In the standard model of inductive inference, a learner gets as input the graph of a function, and has to discover (in the limit) a program for the function. In this paper, we cons...
CIE
2007
Springer
13 years 11 months ago
2007
Springer
We study Post’s Problem for the ordinal register machines defined in [6], showing that its general solution is positive, but that any set of ordinals solving it must be unbounde...
CIE
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. The Ordinal Register Machine (ORM) is one of several different machine models for infinitary computability. We classify, by complexity, the sets that can be decided quic...
CIE
2007
Springer
13 years 11 months ago
2007
Springer
CIE
2007
Springer
13 years 11 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
CIE
2007
Springer
13 years 11 months ago
2007
Springer
Geometrical Computation and the Linear Blum, Shub and Smale Model Geometrical Computation and the Linear Blum, Shub and Smale Model J´erˆome Durand-Lose Laboratoire d’Informati...