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...
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...
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...
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...
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...