429 search results - page 61 / 86 » Turing computations on ordinals |
MCU
2004
14 years 11 months ago
2004
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...
JLP
2007
2007
Universality and semicomputability for nondeterministic programming languages over abstract algebras
14 years 9 months ago
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...
159
click to vote
Publication
In this paper, we seek to design a Groves mechanism for
assigning p heterogeneous objects among n competing agents (n > p)
with unit demand, satisfying weak budget balance, in...
176
click to vote
POPL
2008
ACM
15 years 10 months ago
2008
ACM
We propose a characterization of PSPACE by means of a type assignment for an extension of lambda calculus with a conditional construction. The type assignment STAB is an extension...
FSEN
2009
Springer
15 years 4 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...