5608 search results - page 76 / 1122 » On the Theory of Matchgate Computations |
EUROPAR
2000
Springer
15 years 5 months ago
2000
Springer
109
click to vote
AII
1989
15 years 5 months ago
1989
This paper surveys recent results concerning the inference of deterministic finite automata (DFAs). The results discussed determine the extent to which DFAs can be feasibly inferr...
ENTCS
2008
15 years 1 months ago
2008
In this note we give a new representation for closed sets under which the robust zero set of a function is computable. We call this representation the component cover representati...
132
click to vote
LOGCOM
2008
15 years 1 months ago
2008
We investigate mathematical modelling with theories of data types. We provide a formal setting for the formulation of such theories (TPL) and use it to introduce the notion of a c...
LOGCOM
2007
15 years 1 months ago
2007
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characteri...