5964 search results - page 235 / 1193 » A theory of speculative computation |
188
click to vote
ENTCS
2008
15 years 6 months ago
2008
: A finite-time computable function is a partial function from to whose value is constructed by concatenating a finite list with a suffix of the argument. A finite-time computabili...
163
click to vote
JACIII
2007
15 years 7 months ago
2007
Abstract— A common framework for formalization of statetransition computation models is presented based on a general theory for studying the interrelationships between specifica...
146
click to vote
STACS
2009
Springer
16 years 2 months ago
2009
Springer
We extend the notion of randomness (in the version introduced by Schnorr) to computable Probability Spaces and compare it to a dynamical notion of randomness: typicality. Roughly, ...
251
click to vote
UMC
2000
15 years 10 months ago
2000
Abstract. We consider various extensions and modifications of Shannon's General Purpose Analog Computer, which is a model of computation by differential equations in continuou...
219
click to vote
FSEN
2009
Springer
16 years 1 months ago
2009
Springer
Automata theory presents roughly three types of automata: finite automata, pushdown automata and Turing machines. The automata are treated as language acceptors, and the expressiv...