Results 1  10
of
18
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 8 (8 self)
 Add to MetaCart
“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,
Knowledge Generation as Natural Computation
"... Knowledge generation can be naturalized by adopting computational model of cognition and evolutionary approach. In this framework knowledge is seen as a result of the structuring of input data (data → information → knowledge) by an interactive computational process going on in the agent during the a ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Knowledge generation can be naturalized by adopting computational model of cognition and evolutionary approach. In this framework knowledge is seen as a result of the structuring of input data (data → information → knowledge) by an interactive computational process going on in the agent during the adaptive interplay with the environment, which clearly presents developmental advantage by increasing agent’s ability to cope with the situation dynamics. This paper addresses the mechanism of knowledge generation, a process that may be modeled as natural computation in order to be better understood and improved.
Models and Mechanisms for Artificial Morphogenesis
"... Abstract. Embryological development provides an inspiring example of the creation of complex hierarchical structures by selforganization. Likewise, biological metamorphosis shows how these complex systems can radically restructure themselves. Our research investigates these principles and their app ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract. Embryological development provides an inspiring example of the creation of complex hierarchical structures by selforganization. Likewise, biological metamorphosis shows how these complex systems can radically restructure themselves. Our research investigates these principles and their application to artificial systems in order to create intricately structured systems that are ordered from the nanoscale up to the macroscale. However these processes depend on mutually interdependent unfoldings of an information process and of the “body ” in which it is occurring. Such embodied computation provides challenges as well as opportunities, and in order to fulfill its promise, we need both formal and informal models for conceptualizing, designing, and reasoning about embodied computation. This paper presents a preliminary design for one such model especially oriented toward artificial morphogenesis.
The Cybersemiotics and InfoComputationalist Research Programmes as Platforms for Knowledge Production in Organisms and Machines
 ENTROPY
, 2010
"... ..."
Bodies — both informed and transformed: Embodied computation and information processing
 Information and Computation. World Scientific, Singapore (in
"... PostMoore’s Law computing will require an assimilation between computational processes and their physical realizations, both to achieve greater speeds and densities and to allow computational processes to assemble and control matter at the nanoscale. Therefore, we need to investigate “embodied comp ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
PostMoore’s Law computing will require an assimilation between computational processes and their physical realizations, both to achieve greater speeds and densities and to allow computational processes to assemble and control matter at the nanoscale. Therefore, we need to investigate “embodied computing, ” which addresses the essential interrelationships of information processing and physical processes in the system and its environment in ways that are parallel to those in the theory of embodied cognition. We briefly discuss matters of function and structure, regulation and causation, and the definition of computation. We address both the challenges and opportunities of embodied computation. Analysis is more difficult because physical effects must be included, but information processing may be simplified by dispensing with explicit representations and allowing massively parallel physical processes to process information. Nevertheless, in order to fully exploit embodied computation, we need robust and powerful theoretical tools, but we argue that the theory of ChurchTuring computation is not suitable for the task. 1. PostMoore’s Law Computation Although estimates differ, it is clear that the end of Moore’s Law is in sight; there are physical limits to the density of binary logic devices and to their speed of operation. This will require us to approach computation
Constructive Research and InfoComputational Knowledge Generation
"... It is usual when writing on research methodology in dissertations and thesis work ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
It is usual when writing on research methodology in dissertations and thesis work
Preliminary development of a formalism for embodied computation and morphogenesis
, 2009
"... www.cs.utk.edu/~mclennan ..."
First Steps Towards a Geometry of Computation
"... Summary. We introduce a geometrical 3 setting which seems promising for the study of computation in multiset rewriting systems, but could also be applied to register machines and other models of computation. This approach will be applied here to membrane systems (also known as P systems) without dyn ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Summary. We introduce a geometrical 3 setting which seems promising for the study of computation in multiset rewriting systems, but could also be applied to register machines and other models of computation. This approach will be applied here to membrane systems (also known as P systems) without dynamical membrane creation. We discuss the rôle of maximum parallelism and further simplify our model by considering only one membrane and sequential application of rules, thereby arriving at asynchronous multiset rewriting systems (AMR systems). Considering only one membrane is no restriction, as each static membrane system has an equivalent AMR system. It is further shown that AMR systems without a priority relation on the rules are equivalent to Petri Nets. For these systems we introduce the notion of asymptotically exact computation, which allows for stochastic appearance checking in a priori bounded (for some complexity measure) computations. The geometrical analogy in the lattice N d 0, d ∈ N, is developed, in which a computation corresponds to a trajectory of a random walk on the directed graph induced by the possible rule applications. Eventually this leads to symbolic dynamics on the partition generated by shifted positive cones C + p, p ∈ N d 0, which are associated with the rewriting rules, and their intersections. Complexity measures are introduced and we consider non–halting, loop–free computations and the conditions imposed on the rewriting rules. Eventually, two models of information processing, control by demand and control by availability are discussed and we end with a discussion of possible future developments. 1
The UMachine: A Model of Generalized Computation
 INT. JOURN. OF UNCONVENTIONAL COMPUTING, VOL. 6, PP. 265–283
, 2010
"... ..."