Sciweavers

32 search results - page 4 / 7
» mcu 2007
Sort
View
MCU
2007
123views Hardware» more  MCU 2007»
13 years 9 months ago
Study of Limits of Solvability in Tag Systems
Abstract. In this paper we will give an outline of the proof of the solvability of the halting and reachability problem for 2-symbolic tag systems with a deletion number v = 2. Thi...
Liesbeth De Mol
MCU
2007
95views Hardware» more  MCU 2007»
13 years 9 months ago
Slightly Beyond Turing's Computability for Studying Genetic Programming
Inspired by genetic programming (GP), we study iterative algorithms for non-computable tasks and compare them to naive models. This framework justifies many practical standard tri...
Olivier Teytaud
MCU
2004
76views Hardware» more  MCU 2004»
13 years 8 months ago
Real Recursive Functions and Real Extensions of Recursive Functions
Recently, functions over the reals that extend elementarily computable functions over the integers have been proved to correspond to the smallest class of real functions containing...
Olivier Bournez, Emmanuel Hainry
MCU
1998
117views Hardware» more  MCU 1998»
13 years 8 months ago
The Turing Closure of an Archimedean Field
A BSS machine is -uniform if it does not use exact tests; such machines are equivalent (modulo parameters) to Type 2 Turing machines. We define a notion of closure related to Turi...
Paolo Boldi, Sebastiano Vigna
MCU
1998
170views Hardware» more  MCU 1998»
13 years 8 months ago
About the Universality of the Billiard ball model
Block cellular automata (BCA) make local, parallel, synchronous and uniform updates of in nite lattices. In the one-dimensionalcase, there exist BCA with 11 states which are unive...
Jérôme Olivier Durand-Lose