Sciweavers

429 search results - page 19 / 86
» Turing computations on ordinals
Sort
View
UC
2009
Springer
15 years 4 months ago
Evolvable Hardware: From Applications to Implications for the Theory of Computation
The paper surveys the fundamental principles of evolvable hardware, introduces main problems of the field and briefly describes the most successful applications. Although evolvab...
Lukás Sekanina
AB
2008
Springer
15 years 4 months ago
On the Computational Power of Biochemistry
We explore the computational power of biochemistry with respect to basic chemistry, identifying complexation as the basic mechanism that distinguishes the former from the latter. W...
Luca Cardelli, Gianluigi Zavattaro
EUROGP
2006
Springer
112views Optimization» more  EUROGP 2006»
15 years 1 months ago
The Halting Probability in Von Neumann Architectures
Abstract. Theoretical models of Turing complete linear genetic programming (GP) programs suggest the fraction of halting programs is vanishingly small. Convergence results proved f...
William B. Langdon, Riccardo Poli
80
Voted
SIGCSE
2006
ACM
128views Education» more  SIGCSE 2006»
15 years 3 months ago
Turning automata theory into a hands-on course
We present a hands-on approach to problem solving in the formal languages and automata theory course. Using the tool JFLAP, students can solve a wide range of problems that are te...
Susan H. Rodger, Bart Bressler, Thomas Finley, Ste...
IGPL
2006
107views more  IGPL 2006»
14 years 9 months ago
Undecidability over Continuous Time
Since 1996, some models of recursive functions over the real numbers have been analyzed by several researchers. It could be expected that they exhibit a computational power much g...
Jerzy Mycka, José Félix Costa