#### Filter Results:

- Full text PDF available (34)

#### Publication Year

1984

2015

- This year (0)
- Last 5 years (13)
- Last 10 years (26)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Eugene Eberbach, Jan R. Just
- Elektronische Informationsverarbeitung und…
- 1986

- Peter Wegner, Eugene Eberbach
- Comput. J.
- 2004

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)

The theory of computation that we have inherited from the 1960's focuses on algorithmic computation as embodied in the Turing Machine to the exclusion of other types of computation that Turing had considered. In this chapter we present new models of computation, inspired by Turing's ideas, that are more appropriate for today's interactive, networked, and… (More)

- Eugene Eberbach, Christiane Duarte, Christine Buzzell, Gerald 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
- Fundam. Inform.
- 2005

This paper presents a novel model for resource bounded computation based on process algebras. Such model is called the $-calculus (cost calculus). Resource bounded computation attempts to find the best answer possible given operational constraints. The $-calculus provides a uniform representation for optimization in the presence of limited resources. It… (More)

- Eugene Eberbach
- 2000

Genetic programming, autonomous agents, artif 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)

- Peter Wegner, Eugene Eberbach, Mark Burgin
- Turing-100
- 2012

In the paper we prove in a new and simple way that Interaction machines are more powerful than Turing machines. To do that we extend the definition of Interaction machines to multiple interactive components, where each component may perform simple computation. The emerging expressiveness is due to the power of interaction and allows to accept languages not… (More)

- Max H. Garzon, Eugene Eberbach
- Workshop on Implementing Automata
- 1996

- Eugene Eberbach, Peter Wegner
- Bulletin of the EATCS
- 2003

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