244 search results - page 25 / 49 » Turing machines and bimachines |
IJBC
2007
14 years 11 months ago
2007
A Chaitin Omega number is the halting probability of a universal prefix-free Turing machine. Every Omega number is simultaneously computably enumerable (the limit of a computable...
STOC
2007
ACM
16 years 2 days ago
2007
ACM
For more than 35 years, the fastest known method for integer multiplication has been the Sch?onhage-Strassen algorithm running in time O(n log n log log n). Under certain restricti...
104
click to vote
FSEN
2009
Springer
15 years 6 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...
109
click to vote
LICS
2008
IEEE
15 years 6 months ago
2008
IEEE
In higher-order process calculi the values exchanged in communications may contain processes. A core calculus of higher-order concurrency is studied; it has only the operators nec...
101
click to vote
CIE
2005
Springer
15 years 5 months ago
2005
Springer
We argue that there is currently no satisfactory general framework for comparing the extensional computational power of arbitrary computational models operating over arbitrary doma...