2,457 research outputs found
From Knowledge, Knowability and the Search for Objective Randomness to a New Vision of Complexity
Herein we consider various concepts of entropy as measures of the complexity
of phenomena and in so doing encounter a fundamental problem in physics that
affects how we understand the nature of reality. In essence the difficulty has
to do with our understanding of randomness, irreversibility and
unpredictability using physical theory, and these in turn undermine our
certainty regarding what we can and what we cannot know about complex phenomena
in general. The sources of complexity examined herein appear to be channels for
the amplification of naturally occurring randomness in the physical world. Our
analysis suggests that when the conditions for the renormalization group apply,
this spontaneous randomness, which is not a reflection of our limited
knowledge, but a genuine property of nature, does not realize the conventional
thermodynamic state, and a new condition, intermediate between the dynamic and
the thermodynamic state, emerges. We argue that with this vision of complexity,
life, which with ordinary statistical mechanics seems to be foreign to physics,
becomes a natural consequence of dynamical processes.Comment: Phylosophica
Arithmetic logical Irreversibility and the Turing's Halt Problem
A new approach to the halting problem of the Turing machine using different
interpretations of the Shannon measure of the information on the computational
process represented as a distribution of events and defining a new concept of
arithmetic logical irreversibility and memory erasure that generate uncertainty
and computational improbability due to loss of information during computation.
Different computational steps (input) can give the same result (next step,
output) introducing thus information entropy in the computing process and
uncertainty about the original step (cause). This means that the same output is
produced by different inputs. Global indeterminism of computation as
distribution but determinism of the computation as current process because the
outputs are the same but the information not. The program or Turing machine as
macro description of the computational states as micro description that they
may be several and different but give the same result when they work
Some Computational Aspects of Essential Properties of Evolution and Life
While evolution has inspired algorithmic methods of heuristic optimisation, little has been done in the way of using concepts of computation to advance our understanding of salient aspects of biological evolution. We argue that under reasonable assumptions, interesting conclusions can be drawn that are of relevance to behavioural evolution. We will focus on two important features of life--robustness and fitness optimisation--which, we will argue, are related to algorithmic probability and to the thermodynamics of computation, subjects that may be capable of explaining and modelling key features of living organisms, and which can be used in understanding and formulating algorithms of evolutionary computation
The Mode of Computing
The Turing Machine is the paradigmatic case of computing machines, but there
are others, such as Artificial Neural Networks, Table Computing,
Relational-Indeterminate Computing and diverse forms of analogical computing,
each of which based on a particular underlying intuition of the phenomenon of
computing. This variety can be captured in terms of system levels,
re-interpreting and generalizing Newell's hierarchy, which includes the
knowledge level at the top and the symbol level immediately below it. In this
re-interpretation the knowledge level consists of human knowledge and the
symbol level is generalized into a new level that here is called The Mode of
Computing. Natural computing performed by the brains of humans and non-human
animals with a developed enough neural system should be understood in terms of
a hierarchy of system levels too. By analogy from standard computing machinery
there must be a system level above the neural circuitry levels and directly
below the knowledge level that is named here The mode of Natural Computing. A
central question for Cognition is the characterization of this mode. The Mode
of Computing provides a novel perspective on the phenomena of computing,
interpreting, the representational and non-representational views of cognition,
and consciousness.Comment: 35 pages, 8 figure
Quantum observer and Kolmogorov complexity: a model that can be tested
Different observers do not have to agree on how they identify a quantum
system. We explore a condition based on algorithmic complexity that allows a
system to be described as an objective "element of reality". We also suggest an
experimental test of the hypothesis that any system, even much smaller than a
human being, can be a quantum mechanical observer.Comment: 11 pages. Section 6 on experimental tests added in version
Measuring complexity with zippers
Physics concepts have often been borrowed and independently developed by
other fields of science. In this perspective a significant example is that of
entropy in Information Theory. The aim of this paper is to provide a short and
pedagogical introduction to the use of data compression techniques for the
estimate of entropy and other relevant quantities in Information Theory and
Algorithmic Information Theory. We consider in particular the LZ77 algorithm as
case study and discuss how a zipper can be used for information extraction.Comment: 10 pages, 3 figure
- …