The importance of algorithms is now recognized in all mathematical sciences, thanks to the development of computability and computational complexity theory in the 20th century.Expand

We present several models for describing the computational behaviour of evolving interactive systems, including 'interactive' Turing machines (ITM's) with advice and new, natural characterizations of non-uniform complexity classes.Expand

We develop a model of computation as an unbounded process, measuring complexity by the number of observed behavioural changes during the computation.Expand

We propose two models inspired from key mechanisms of current systems in both artificial and natural environments: evolving automata and interactive Turing machines with advice.Expand

Weak parallel machines represent a new class of physically feasible parallel machine models whose prominent representative is the so-called Parallel Turing Machine as introduced by the author in 1984.Expand

We propose a generalization of the original model that is based on rigorous mathematical fundamentals of fuzzy logic that obeys the Church--Turing Thesis.Expand

A finite automaton—the so-called neuromaton, realized by a finite discrete recurrent neural network, working in parallel computation mode, is considered.Expand