8699 search results - page 152 / 1740 » Elements of the Theory of Computation |
BSL
2005
14 years 11 months ago
2005
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length to computations on tapes of arbitrary ordinal length. We show that a ...
JMLR
2010
14 years 6 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 (...
101
click to vote
ASC
2008
14 years 11 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...
ITICSE
2006
ACM
15 years 5 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...
CORR
2008
Springer
14 years 11 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...