• Publications
  • Influence
The Turing machine paradigm in contemporary computing
TLDR
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
  • 111
  • 11
  • PDF
Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
TLDR
The first attempts concerning formalization of the notion of fuzzy algorithms in terms of Turing machines are dated in late 1960s when Zadeh. Expand
  • 40
  • 9
  • PDF
Beyond the Turing Limit: Evolving Interactive Systems
TLDR
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
  • 54
  • 8
  • PDF
Computation as an unbounded process
TLDR
We develop a model of computation as an unbounded process, measuring complexity by the number of observed behavioural changes during the computation. Expand
  • 29
  • 8
  • PDF
How We Think of Computing Today
TLDR
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
  • 26
  • 5
  • PDF
Weak Parallel Machines: a New Class of Physically Feasible Parallel Machine Models
TLDR
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
  • 11
  • 3
A Theory of Interactive Computation
TLDR
A theory of interactive computation must necessarily lead beyond the classical, finitary models of computation. Expand
  • 15
  • 3
Fuzzy Turing Machines Revised
TLDR
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
  • 24
  • 2
Optimal Algorithms for Sorting on Single-tape Turing Machines
  • 4
  • 2
Theory of neuromata
TLDR
A finite automaton—the so-called neuromaton, realized by a finite discrete recurrent neural network, working in parallel computation mode, is considered. Expand
  • 40
  • 1
...
1
2
3
4
5
...