Results 1  10
of
20
Beyond Turing Machines
"... In this paper we describe and analyze models of problem solving and computation going beyond Turing Machines. Three principles of extending the Turing Machine's expressiveness are identified, namely, by interaction, evolution and infinity. Several models utilizing the above principles are pr ..."
Abstract

Cited by 38 (6 self)
 Add to MetaCart
In this paper we describe and analyze models of problem solving and computation going beyond Turing Machines. Three principles of extending the Turing Machine's expressiveness are identified, namely, by interaction, evolution and infinity. Several models utilizing the above principles are presented. Other
Turing Machines, Transition Systems, and Interaction
 Information and Computation
, 2004
"... We present Persistent Turing Machines (PTMs), a new way of interpreting Turingmachine computation, one that is both interactive and persistent. A PTM repeatedly receives an input token from the environment, computes for a while, and then outputs the result. Moreover, it can \remember" its p ..."
Abstract

Cited by 28 (4 self)
 Add to MetaCart
We present Persistent Turing Machines (PTMs), a new way of interpreting Turingmachine computation, one that is both interactive and persistent. A PTM repeatedly receives an input token from the environment, computes for a while, and then outputs the result. Moreover, it can \remember" its previous state (worktape contents) upon commencing a new computation. We show that the class of PTMs is isomorphic to a very general class of eective transition systems, thereby allowing one to view PTMs as transition systems \in disguise." The persistent stream language (PSL) of a PTM is a coinductively dened set of interaction streams : innite sequences of pairs of the form (w i ; w o ), recording, for each interaction with the environment, the input token received by the PTM and the corresponding output token. We dene an innite hierarchy of successively ner equivalences for PTMs over nite interactionstream prexes and show that the limit of this hierarchy does not coincide with PSLequivalence. The presence of this \gap" can be attributed to the fact that the transition systems corresponding to PTM computations naturally exhibit unbounded nondeterminism. We also consider amnesic PTMs, where each new computation begins with a blank work tape, and a corresponding notion of equivalence based on amnesic stream languages (ASLs). We show that the class of ASLs is strictly contained in the class of PSLs. Amnesic stream languages are representative of the classical view of Turingmachine computation. One may consequently conclude that, in a streambased setting, the extension of the Turingmachine model with persistence is a nontrivial one, and provides a formal foundation for reasoning about programming concepts such as objects with static elds. We additional...
SuperTuring or NonTuring? Extending the Concept of Computation
"... “Hypercomputation ” is often defined as transcending Turing computation in the sense of computing a larger class of functions than can Turing machines. While this possibility is important and interesting, this paper argues that there are many other important senses in which we may “transcend Turing ..."
Abstract

Cited by 9 (8 self)
 Add to MetaCart
(Show Context)
“Hypercomputation ” is often defined as transcending Turing computation in the sense of computing a larger class of functions than can Turing machines. While this possibility is important and interesting, this paper argues that there are many other important senses in which we may “transcend Turing computation. ” Turing computation, like all models, exists in a frame of relevance, which underlies the assumptions on which it rests and the questions that it is suited to answer. Although appropriate in many circumstances, there are other important applications of the idea of computation for which this model is not relevant. Therefore we should supplement it with new models based on different assumptions and suited to answering different questions. In alternative frames of relevance, including natural computation and nanocomputation, the central issues include realtime response, continuity, indeterminacy, and parallelism. Once we understand computation in a broader sense, we can see new possibilities for using physical processes to achieve computational goals, which will increase in importance as we approach the limits of electronic binary logic. Key words: hypercomputation, ChurchTuring thesis, natural computation, theory of computation, model of computation, Turing computation,
A Portable Language for Control of Multiple Autonomous Vehicles and
 Distributed Problem Solving, Proc. of the 2nd Intern. Conf. on Computational Intelligence, Robotics and Autonomous Systems CIRAS’03
"... 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 behaviorbased robotic architec ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
(Show Context)
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 behaviorbased robotic architectures allowing both fast reaction and deliberation in realtime. CCL provides a powerful support for distributed problem solving based on the cost optimization mechanism, and combines the best of the world of declarative and imperative programming. 1.
$Calculus of Bounded Rational Agents: Flexible Optimization as Search under Bounded Resources in Interactive Systems
 FUNDAMENTA INFORMATICAE
, 2005
"... This paper presents a novel model for resource bounded computation based on process algebras. ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
This paper presents a novel model for resource bounded computation based on process algebras.
On Designing CO$T: A New Approach and Programming Environment for Distributed Problem Solving Based on Evolutionary Computation and Anytime Algorithms
 PROC. 2004 CONGRESS ON EVOLUTIONARY COMPUTATION CEC’2004, VOL.2
, 2004
"... In this paper we present a unified view of AI inspired by ideas from Evolutionary Computation as design of bounded rational agents. The approach specifies optimal programs rather than optimal actions, and is based on process algebras and anytime algorithms. The search method described in this paper ..."
Abstract

Cited by 6 (6 self)
 Add to MetaCart
In this paper we present a unified view of AI inspired by ideas from Evolutionary Computation as design of bounded rational agents. The approach specifies optimal programs rather than optimal actions, and is based on process algebras and anytime algorithms. The search method described in this paper is so general than many other search algorithms, including evolutionary search methods, become its special case. In this paper, we present a practical design of the programming language and environment targetting realtime complex domains. As AI systems move into more complex domains, all problems become realtime, because the agent will never have long enough time to solve the decision problem exactly.
The role of agent interaction in models of computation (panel summary
 In Workshop on Foundations of Interactive Computation
, 2005
"... ..."
Toward a theory of evolutionary computation
 BIOSYSTEMS
, 2005
"... 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 ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
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 chains. The convergence and convergence rate are defined and investigated in terms of this new model. The sufficient conditions needed for the completeness and optimality of evolutionary search are investigated. In particular, the notion of the total optimality as an instance of the multiobjective optimization of the Universal Evolutionary Turing Machine is introduced. This provides an automatic way to deal with the intractability of evolutionary search by optimizing the quality of solutions and search costs simultaneously. Based on a new model a very flexible classification of optimization problem hardness for the evolutionary techniques is proposed.
Comparative Analysis of Hypercomputational Systems
, 2006
"... In the 1930s, Turing suggested his abstract model for a practical computer, hypothetically visualizing the digital programmable computer long before it was actually invented. His model formed the foundation for every computer made today. The past few years have seen a change in ideas where philosoph ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In the 1930s, Turing suggested his abstract model for a practical computer, hypothetically visualizing the digital programmable computer long before it was actually invented. His model formed the foundation for every computer made today. The past few years have seen a change in ideas where philosophers and scientists are suggesting models of hypothetical computing devices which can outperform the Turing machine, performing some calculations the latter is unable to. The ChurchTuring Thesis, which the Turing machine model embodies, has raised discussions on whether it could be possible to solve undecidable problems which Turing’s model is unable to. Models which could solve these problems, have gone further to claim abilities relating to quantum computing, relativity theory, even the modeling of natural biological laws themselves. These so called ‘hypermachines’ use hypercomputational abilities to make the impossible possible. Various models belonging to different disciplines of physics, mathematics and philosophy, have been suggested for these theories. My (primarily researchoriented) project is based on the study and review of these different hypercomputational models and attempts to compare the different models in terms of computational power. The project focuses on the ability to compare these models of different disciplines on similar grounds and
Talk Amongst Yourselves: Getting Multiple Autonomous Vehicles to Cooperate
"... AbstractThis paper will describe our efforts to define a common control language (CCL), its interpreter/compiler integrated with an optimization planner using kΩsearch. The objectives for this language is to provide the representation of missions, realtime mission redirects and task allocation ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
AbstractThis paper will describe our efforts to define a common control language (CCL), its interpreter/compiler integrated with an optimization planner using kΩsearch. The objectives for this language is to provide the representation of missions, realtime mission redirects and task allocation between an operator and multiple vehicles to support cooperative autonomous behavior. I.