Eugene Eberbach

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