#### Filter Results:

#### Publication Year

1984

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

#### Data Set Used

Learn More

This paper examines the limitations of Turing Machines as a complete model of computation, and presents several models that extend Turing Machines. Dynamic interaction of clients and servers on the Internet, an infinite adaptation from evolutionary computation, and robots sensing and acting are some examples of areas that cannot be properly described using… (More)

- Eugene Eberbach
- 2000

Genetic programming, autonomous agents, ar-tif icial life and evolutionary computation share many common ideas. They generally investigate distributed complex processes, perhaps with the ability to interact. It seems to be natural to study their behavior using process algebras, which were designed to handle distributed interactive systems. $-calculus is a… (More)

- Eugene Eberbach, Dina Goldin, Peter Wegner

- Eugene Eberbach
- 2001

$-calculus is a higher-order polyadic process algebra with a utility (cost) integrating deliberative and reactive approaches for action selection in real time, and allowing to capture bounded optimization and metaresoning in distributed interactive AI systems. In this paper we present basic notions of $-calculus and demonstrate the versatility of its k… (More)

- Eugene Eberbach, Christiane N Duarte, Christine Buzzell, Gerald R Martel
- 2003

In this paper we show the design of a language which is applicable for control of multiple autonomous unmanned vehicles as well as for distributed problem solving, in general. The language, under the working name CCL (Common Control Language) is a natural extension of behavior-based robotic architectures allowing both fast reaction and deliberation in… (More)

- Eugene Eberbach
- 2002

Evolutionary Computation has been used traditionally for solution of hard optimization problems. In a general case, solutions found by evolutionary algorithms are satisscing given current resources and constraints, but not necessary optimal. Under some conditions evolutionary algorithms are guaranteed (in innnity) to nd an optimal solution. However,… (More)

We outline a theory of evolutionary computation using a formal model of evolutionary computation--the Evolutionary Turing Machine--which is introduced as the extension of the Turing Machine model. Evolutionary Turing Machines provide a better and a more complete model for evolutionary computing than conventional Turing Machines, algorithms, and Markov… (More)

$-calculus is a higher-order polyadic process algebra for resource bounded computation. It has been designed to handle autonomous agents, evolutionary computing , neural nets, expert systems, machine learning, and distributed interactive AI systems, in general. $-calculus has built-in cost-optimization mechanism allowing to deal with nondeterminism,… (More)