Sciweavers

9405 search results - page 273 / 1881
» Computing a Model of Set Theory
Sort
View
144
Voted
MLQ
2000
99views more  MLQ 2000»
15 years 4 months ago
Von Rimscha's Transitivity Conditions
In Zermelo-Fraenkel set theory with the axiom of choice every set has the same cardinal number as some ordinal. Von Rimscha has weakened this condition to "Every set has the s...
Paul E. Howard, Jean E. Rubin, Adrienne Stanley
143
Voted
ECCC
2000
158views more  ECCC 2000»
15 years 4 months ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass
CONTEXT
1999
Springer
15 years 8 months ago
The Formal Structure of Ecological Contexts
This paper presents the outline of a formal ontology of contexts. More specifically, it deals with the ontology of ecological contexts (niches, habitats, environments, ambients) an...
Barry Smith, Achille C. Varzi
NIPS
2000
15 years 5 months ago
Structure Learning in Human Causal Induction
We use graphical models to explore the question of how people learn simple causal relationships from data. The two leading psychological theories can both be seen as estimating th...
Joshua B. Tenenbaum, Thomas L. Griffiths
CCS
2009
ACM
15 years 11 months ago
CoSP: a general framework for computational soundness proofs
We describe CoSP, a general framework for conducting computational soundness proofs of symbolic models and for embedding these proofs into formal calculi. CoSP considers arbitrary...
Michael Backes, Dennis Hofheinz, Dominique Unruh