Results 1  10
of
11
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.
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
The Cybersemiotics and InfoComputationalist Research Programmes as Platforms for Knowledge Production in Organisms and Machines
 ENTROPY
, 2010
"... ..."
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
Comparative Analysis of Hypercomputational Systems Submitted in partial fulfilment
"... 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
A Protophenomenological Analysis of Synthetic Emotion in Robots
, 2008
"... www.cs.utk.edu/~mclennan/ ..."
Computation and Nanotechnology: Toward the Fabrication of Complex Hierarchical Structures
, 2008
"... Enormous progress has been made in recent years in the nanostructuring of materials, and a variety of techniques are available for fabricating bulk materials with a desired nanostructure. However, the higher levels of organization have been neglected, and nanostructured materials are assembled into ..."
Abstract
 Add to MetaCart
Enormous progress has been made in recent years in the nanostructuring of materials, and a variety of techniques are available for fabricating bulk materials with a desired nanostructure. However, the higher levels of organization have been neglected, and nanostructured materials are assembled into macroscopic structures using techniques that are not essentially different from those used for conventional materials. We argue that the creation of complex hierarchical systems, with specific structures from the nanoscale up through the macroscale, and especially postMoore’s Law nanocomputers, will require a close alignment of computational and physical processes.