8512 search results - page 118 / 1703 » Computing Theory With Relevance |
123
click to vote
JMLR
2010
14 years 11 months ago
2010
As we devise more complicated prior distributions, will inference algorithms keep up? We highlight a negative result in computable probability theory by Ackerman, Freer, and Roy (...
140
click to vote
ASC
2008
15 years 4 months ago
2008
Morphic Computing is based on Field Theory [14-16] and more specifically Morphic Fields. Morphic Fields were first introduced by [18] from his hypothesis of formative causation tha...
118
Voted
ITICSE
2006
ACM
15 years 10 months ago
2006
ACM
This paper describes Threshold Concepts, a theory of learning that distinguishes core concepts whose characteristics can make them troublesome in learning. With an eye to applying...
118
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical co...
119
click to vote
CIE
2007
Springer
15 years 10 months ago
2007
Springer
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...