5608 search results - page 92 / 1122 » On the Theory of Matchgate Computations |
116
click to vote
DIS
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We discuss what constitutes knowledge in pure mathematics and how new advances are made and communicated. We describe the impact of computer algebra systems, automated th...
AML
2008
15 years 1 months ago
2008
We generalize ordinary register machines on natural numbers to machines whose registers contain arbitrary ordinals. Ordinal register machines are able to compute a recursive bounde...
IWINAC
2007
Springer
15 years 7 months ago
2007
Springer
Theories of how the brain computes can be differentiated in three general conceptions: the algorithmic approach, the neural information processing (neurocomputational) approach an...
125
click to vote
CASC
2006
Springer
15 years 5 months ago
2006
Springer
Homological Perturbation Theory [11, 13] is a well-known general method for computing homology, but its main algorithm, the Basic Perturbation Lemma, presents, in general, high com...
115
click to vote
ESOP
2008
Springer
15 years 3 months ago
2008
Springer
We present a denotational model of impredicative Hoare Type Theory, a very expressive dependent type theory in which one can and reason about mutable abstract data types. The model...