429 search results - page 11 / 86 » Turing computations on ordinals |
ITNG
2007
IEEE
15 years 3 months ago
2007
IEEE
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
AMC
2006
14 years 9 months ago
2006
The main purpose of this paper is quite uncontroversial. First, we recall some models of analog computations (including these allowed to perform Turing uncomputable tasks). Second...
ANNALS
2010
14 years 7 months ago
2010
The increasing popularity in the late 1970s of affordable, general-purpose, microprocessor-based personal computers in the US, generated a widespread interest around the world in t...
103
click to vote
FOSSACS
2011
Springer
14 years 1 months ago
2011
Springer
The paper investigates non-deterministic, probabilistic and quantum walks, from the perspective of coalgebras and monads. Nondeterministic and probabilistic walks are coalgebras of...
FCS
2006
14 years 11 months ago
2006
This paper is based on the idea that the Church-Turing-Deutsch (CTD) principle can play a very fundamental role in Physics similar to those of conservation laws in the constructio...