Results 11  20
of
39
Embodiment and Agency: Towards an Aesthetics of Interactive
"... Abstract — The aim of this paper is to take first steps in direction of a scientifically oriented aesthetics of New Media Art, taking into account the transformation of musical aesthetics taking place at present induced by new digital methods in artistic sound and music computing. Starting from the ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Abstract — The aim of this paper is to take first steps in direction of a scientifically oriented aesthetics of New Media Art, taking into account the transformation of musical aesthetics taking place at present induced by new digital methods in artistic sound and music computing. Starting from the observation of relevant current issues in music composition and performances such as gesture control in algorithmic sound synthesis, live coding, musical robotics, and live algorithms for music, certain important concepts concerning a theory of humanmachine interaction, which are at present under development in our research project
Computational Power of Infinite Quantum Parallelism
 pp.2057–2071 in International Journal of Theoretical Physics vol.44:11
, 2005
"... Recent works have independently suggested that quantum mechanics might permit procedures that fundamentally transcend the power of Turing Machines as well as of ‘standard ’ Quantum Computers. These approaches rely on and indicate that quantum mechanics seems to support some infinite variant of class ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Recent works have independently suggested that quantum mechanics might permit procedures that fundamentally transcend the power of Turing Machines as well as of ‘standard ’ Quantum Computers. These approaches rely on and indicate that quantum mechanics seems to support some infinite variant of classical parallel computing. We compare this new one with other attempts towards hypercomputation by separating (1) its computing capabilities from (2) realizability issues. The first are shown to coincide with recursive enumerability; the second are considered in analogy to ‘existence’ in mathematical logic. KEY WORDS: Hypercomputation; quantum mechanics; recursion theory; infinite parallelism.
Dialogs and Interaction Schema: Characterizing the Interaction Space of Information Systems
"... Information systems design concern modeling systems that are dynamic in nature. A dynamic system essentially has two dimensions of concern  static structure and dynamic behavior. The existence of dynamics  or interactions among parts of the system distinguish a dynamic system from a heap or coll ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Information systems design concern modeling systems that are dynamic in nature. A dynamic system essentially has two dimensions of concern  static structure and dynamic behavior. The existence of dynamics  or interactions among parts of the system distinguish a dynamic system from a heap or collection of parts. Specification and management of the static aspects of an information system like the data and metadata have been fairly well addressed by existing paradigms. However an understanding of the dynamic nature of information systems is still low. Currently most paradigms model behavioral properties above an existing structural model, resulting in what may be called "entity centric" modeling. Such a kind of modeling would neglect properties that can be attributed to behavioral processes themselves, and relationships that might exist among such processes. In this paper, we address behavioral modeling by first considering system behavior to be in the form of an abstract "interaction...
Agents from functionalcomputational perspective. Acta Polytechnica Hungarica 3
, 2006
"... Abstract: The contribution sketches a functionalcomputational typological scale of agents starting form the reactive ones, and puts the family of (at least minimally) conscious agents into the proposed typology. Then it discusses the traditional computational properties of agents according their ty ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract: The contribution sketches a functionalcomputational typological scale of agents starting form the reactive ones, and puts the family of (at least minimally) conscious agents into the proposed typology. Then it discusses the traditional computational properties of agents according their types, and sketches a way of a rather nontraditional computational characterization of conscious agents using the concept of hypercomputation. The contribution ends with relating the sketched formal approach to agents with agents embodiment, and relates embodiment of agents with their emergence of hypercomputational power.
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.
Lineages of Automata
, 2004
"... While in the series of previous papers we designed and studied a number of models of evolving interactive systems, in the present paper we concentrate on an indepth study of a single model that turned out to be a distinguished model of evolving interactive computing: lineages of automata. A line ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
While in the series of previous papers we designed and studied a number of models of evolving interactive systems, in the present paper we concentrate on an indepth study of a single model that turned out to be a distinguished model of evolving interactive computing: lineages of automata. A lineage consists of a sequence of interactive finite automata, with a mechanism of passing information from each automaton to its immediate successor. In this paper, we develop the theory of lineages. We give some means to construct new lineages out of given ones and prove several properties of translations that are realized by lineages. Lineages enable a definition of a suitable complexity measure for evolving systems. We show several complexity results, including a hierarchy result. Lineages are equivalent to interactive Turing machines with advice, but they stand out because they demonstrate the aspect of evolution explicitly.
ACCELERATING MACHINES
, 2006
"... This paper presents an overview of accelerating machines. We begin by exploring the history of the accelerating machine model and the potential power that it provides. We look at some of the problems that could be solved with an accelerating machine, and review some of the possible implementation me ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper presents an overview of accelerating machines. We begin by exploring the history of the accelerating machine model and the potential power that it provides. We look at some of the problems that could be solved with an accelerating machine, and review some of the possible implementation methods that have been presented. Finally, we expose the limitations of accelerating machines and conclude by posing some problems for further research.
Computations with Uncertain Time Constraints: Effects on Parallelism and Universality
, 2008
"... It is known that there exist computational problems that can be solved on a parallel computer, yet are impossible to be solved sequentially. Specifically, no general purpose sequential model of computation, such as the Turing Machine or the Random Access Machine, can simulate a large family of compu ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
It is known that there exist computational problems that can be solved on a parallel computer, yet are impossible to be solved sequentially. Specifically, no general purpose sequential model of computation, such as the Turing Machine or the Random Access Machine, can simulate a large family of computations (for example, solutions to certain realtime problems), each of which is capable of being carried out readily by a particular parallel computer. We extend the scope of such problems to the class of problems with uncertain time constraints. The first type of time constraints refers to uncertain time requirements on the input data, that is, when and for how long are the input data available. A second type of time constraints refers to uncertain deadlines for tasks. Our main objective is to exhibit computational problems in which it is very difficult to find out (read ‘compute’) what to do and when to do it. Furthermore, problems with uncertain time constraints, as described here, prove once more that it is impossible to define a ‘universal computer’, that is, a computer able to compute all computable functions. Finally, one of the contributions of this paper is to promote the study of a topic, conspicuously absent to date from theoretical computer science, namely, the role of physical time and physical space in computation. The focus of our work is to analyze the effect of external natural phenomena on the various components of a computational process, namely, the input phase, the calculation phase (including the algorithm and the computing agents themselves), and the output phase.
Cognition and (Artificial) Cognitive Systems
"...  explanatory & exploratory notes ..."
(Show Context)
TimeSensitive Computational Models with a Dynamic Time Component
"... It is known that a parallel computer can solve problems that are impossible to be solved sequentially. That is, any general purpose sequential model of computation, such as the Turing machine or the random access machine (RAM), cannot simulate certain computations, for example solutions to realtime ..."
Abstract
 Add to MetaCart
It is known that a parallel computer can solve problems that are impossible to be solved sequentially. That is, any general purpose sequential model of computation, such as the Turing machine or the random access machine (RAM), cannot simulate certain computations, for example solutions to realtime problems, that are carried out by a specific parallel computer. This paper extends the scope of such problems to the class of problems with uncertain time constraints. The first type of time constraints refers to uncertain time requirements on the input data, that is when and for how long are input data available. A second type of time constraints refers to uncertain deadlines for tasks. The main contribution of this paper is to exhibit computational problems in which itisvery difficult to find out (read compute) what to do and when to do it. Furthermore, problems with uncertain time constraints, as described in this paper, prove once more, that it is impossible to define a universal computer, that is, a computer able to simulate all computable functions.