5608 search results - page 194 / 1122 » On the Theory of Matchgate Computations |
89
Voted
STACS
2009
Springer
15 years 8 months ago
2009
Springer
We extend the notion of randomness (in the version introduced by Schnorr) to computable Probability Spaces and compare it to a dynamical notion of randomness: typicality. Roughly, ...
173
click to vote
UMC
2000
15 years 5 months ago
2000
Abstract. We consider various extensions and modifications of Shannon's General Purpose Analog Computer, which is a model of computation by differential equations in continuou...
126
click to vote
FSEN
2009
Springer
15 years 8 months ago
2009
Springer
Automata theory presents roughly three types of automata: finite automata, pushdown automata and Turing machines. The automata are treated as language acceptors, and the expressiv...
127
click to vote
LICS
2006
IEEE
15 years 8 months ago
2006
IEEE
Logical properties of iterations of relational structures are studied and these decidability results are applied to the model checking of a powerful extension of pushdown systems....
133
click to vote
ESOP
2008
Springer
15 years 3 months ago
2008
Springer
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...