Sciweavers

4217 search results - page 107 / 844
» Computational indistinguishability logic
Sort
View
MFCS
2001
Springer
15 years 2 months ago
Computable Versions of Baire's Category Theorem
We study different computable versions of Baire’s Category Theorem in computable analysis. Similarly, as in constructive analysis, different logical forms of this theorem lead ...
Vasco Brattka
CORR
2004
Springer
139views Education» more  CORR 2004»
14 years 9 months ago
The Computational Power of Benenson Automata
The development of autonomous molecular computers capable of making independent decisions in vivo regarding local drug administration may revolutionize medical science. Recently B...
David Soloveichik, Erik Winfree
NC
2008
122views Neural Networks» more  NC 2008»
14 years 10 months ago
Computation with finite stochastic chemical reaction networks
A highly desired part of the synthetic biology toolbox is an embedded chemical microcontroller, capable of autonomously following a logic program specified by a set of instructions...
David Soloveichik, Matthew Cook, Erik Winfree, Jeh...
IJCAI
2007
14 years 11 months ago
Inside-Outside Probability Computation for Belief Propagation
In this paper we prove that the well-known correspondence between the forward-backward algorithm for hidden Markov models (HMMs) and belief propagation (BP) applied to HMMs can be...
Taisuke Sato
LICS
2002
IEEE
15 years 2 months ago
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
Alex K. Simpson