429 search results - page 12 / 86 » Noisy Turing Machines |
CF
2005
ACM
13 years 9 months ago
2005
ACM
We survey results of a quarter century of work on computation by reversible general-purpose computers (in this setting Turing machines), and general reversible simulation of irrev...
ITNG
2007
IEEE
14 years 1 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...
ENTCS
2006
13 years 7 months ago
2006
It is reasonable to assume that quantum computations take place under the control of the classical world. For modelling this standard situation, we introduce a Classically-control...
EUROGP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Theoretical models of Turing complete linear genetic programming (GP) programs suggest the fraction of halting programs is vanishingly small. Convergence results proved f...
AIM
2005
13 years 7 months ago
2005
If it is true that good problems produce good science, then it will be worthwhile to identify good problems, and even more worthwhile to discover the attributes that make them goo...