9405 search results - page 1 / 1881 » Computing a Model of Set Theory |
CIE
2005
Springer
13 years 10 months ago
2005
Springer
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. The general...
LICS
2002
IEEE
13 years 9 months ago
2002
IEEE
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...
ICLP
2003
Springer
13 years 10 months ago
2003
Springer
We propose and study algorithms for computing minimal models, stable models and answer sets of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs. We are especiall...
ISMIS
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. A model of granular computing (GrC) is proposed by reformulating, re-interpreting, and combining results from rough sets, quotient space theory, and belief functions. Two...
TRS
2008
13 years 4 months ago
2008
A popular view is that the brain works in a similar way to a digital computer or a Universal Turing Machine by processing symbols. Psychophysical experiments and our amazing capabi...