244 search results - page 37 / 49 » Turing machines and bimachines |
136
click to vote
FSTTCS
1992
Springer
15 years 5 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
100
click to vote
FUIN
2006
15 years 1 months ago
2006
Many different definitions of computational universality for various types of dynamical systems have flourished since Turing's work. We propose a general definition of univers...
112
click to vote
TCS
2008
15 years 1 months ago
2008
Reversible computing is a paradigm where computing models are so defined that they reflect physical reversibility, one of the fundamental microscopic physical property of Nature. ...
CSR
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We will show how padding techniques can be applied on onedimensional cellular automata by proving a transfer theorem on complexity classes (how one inclusion of classes i...
106
click to vote
CCA
2005
Springer
15 years 3 months ago
2005
Springer
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...