Learn More
A finite automaton—the so-called neuromaton, realized by a finite discrete recurrent neural network, working in parallel computation mode, is considered. Both the size of neuromata (i.e., the number of neurons) and their descriptional complexity (i.e., the number of bits in the neuromaton representation) are studied. It is proved that a constraint(More)
The ÿrst attempts concerning formalization of the notion of fuzzy algorithms in terms of Turing machines are dated in late 1960s when this notion was introduced by Zadeh. Recently, it has been observed that corresponding so-called classical fuzzy Turing machines can solve undecidable problems. In this paper we will give exact recursion-theoretical(More)
We introduce a new formal computational model designed for studying the information transfer among the generations of offspring-producing evolving machines — so-called autopoietic automata. These can be seen as nondeterministic finite state transducers whose " program " can become a subject of their own processing. An autopoietic automaton can(More)
Motto: Caminante, son tus huellas el camino, y nada más; caminante, no hay camino, se hace camino al andar. Al andar se hace camino, y al volver la vista atrás se ve la senda que nunca se ha de volver a pisar. Caminante, no hay camino, sino estelas en la mar. Wanderer, your footsteps are the road, and nothing more; wanderer, there is no road, the road is(More)
The computational potential of artificial living systems can be studied without knowing the algorithms that govern their behavior. Modeling single organisms by means of so-called cognitive transducers, we will estimate the computational power of AL systems by viewing them as conglomerates of such organisms. We describe a scenario in which an artificial(More)