Sciweavers

244 search results - page 20 / 49
» Turing machines and bimachines
Sort
View
CORR
2002
Springer
83views Education» more  CORR 2002»
14 years 11 months ago
Optimal Ordered Problem Solver
We introduce a general and in a certain sense time-optimal way of solving one problem after another, efficiently searching the space of programs that compute solution candidates, i...
Jürgen Schmidhuber
STACS
2010
Springer
15 years 6 months ago
Evolving Multialgebras Unify All Usual Sequential Computation Models
Abstract. It is well-known that Abstract State Machines (ASMs) can simulate “stepby-step” any type of machines (Turing machines, RAMs, etc.). We aim to overcome two facts: 1) s...
Serge Grigorieff, Pierre Valarcher
IAT
2007
IEEE
15 years 6 months ago
The Whole Brain Approach to the Web
I introduce a new approach to data representation, which reflects the mechanism of mind based on the compartmentalization of brain into two hemispheres. I cribe an abstract device...
Ioachim Drugus
AE
2007
Springer
15 years 6 months ago
Searching for Glider Guns in Cellular Automata: Exploring Evolutionary and Other Techniques
Abstract. We aim to construct an automatic system for the discovery of collision-based universal cellular automata that simulate Turing machines in their space-time dynamics using ...
Emmanuel Sapin, Larry Bull
ATVA
2007
Springer
153views Hardware» more  ATVA 2007»
15 years 6 months ago
Continuous Petri Nets: Expressive Power and Decidability Issues
State explosion is a fundamental problem in the analysis and synthesis of discrete event systems. Continuous Petri nets can be seen as a relaxation of discrete models. The expected...
Laura Recalde, Serge Haddad, Manuel Silva