Algorithmic Specified Complexity

  title={Algorithmic Specified Complexity},
  author={W. Ewert},
  • W. Ewert
  • Published 24 September 2013
  • Mathematics
Engineers like to think that they produce something different from that of a chaotic system. The Eiffel tower is fundamentally different from the same components lying in a heap on the ground. Mt. Rushmore is fundamentally different from a random mountainside. But engineers lack a good method for quantifying this idea. This has led some to reject the idea that engineered or designed systems can be detected. Various methods have been proposed, each of which has various faults. Some have trouble… 

Figures from this paper

Measuring meaningful information in images: algorithmic specified complexity
The application of ‘algorithmic specified complexity’ (ASC) to the problem of distinguishing random images, simple images and content-filled images is explored and is a model for measuring meaning using conditional KCS complexity.
Algorithmic Specified Complexity in the Game of Life
Algorithmic specified complexity is applied to Conway's Game of Life to differentiate patterns designed by programmers from those originating by chance and a variety of machines created by Game of life hobbyists exhibit high ASC thereby corroborating ASC's efficacy.
On the improbability of algorithmic specified complexity
An event with low probability is unlikely to happen, but events with low probability happen all of the time. This is because many distinct low probability events can have a large combined
Using statistical methods to model the fine-tuning of molecular machines and systems.
This paper argues that biological systems present fine-tuning at different levels, e.g. functional proteins, complex biochemical machines in living cells, and cellular networks, and presents a framework for such analysis.


Logical depth and physical complexity
Some mathematical and natural objects (a random sequence, a sequence of zeros, a perfect crystal, a gas) are intuitively trivial, while others (e.g. the human body, the digits of π) contain internal
Some preliminary work is presented on a very general new theory of inductive inference. The extrapolation of an ordered sequence of symbols is implemented by computing the a priori probabilities of
Three subsets of sequence complexity and their relevance to biopolymeric information
  • D. Abel, J. Trevors
  • Medicine, Computer Science
    Theoretical Biology and Medical Modelling
  • 2005
The algorithmic programming of FSC, not merely its aperiodicity, accounts for biological organization, which invariably manifests FSC rather than successive random events (RSC) or low-informational self-ordering phenomena (OSC).
No Free Lunch: Why Specified Complexity Cannot Be Purchased without Intelligence
Intelligent Design is a viewpoint in which natural processes are replaced by some kind of creation or design, in which the entire world is understood in terms of natural processes.
The Mathematical Theory of Communication
The theory of communication is extended to include a number of new factors, in particular the effect of noise in the channel, and the savings possible due to the statistical structure of the original message anddue to the nature of the final destination of the information.
Specification: The Pattern that Signifies Intelligence
This paper analyzes the concept of specification and shows how it applies to design detection (i.e., the detection of intelligence on the basis of circumstantial evidence) and reviews, clarifies, and extends previous work on specification.
Measuring the functional sequence complexity of proteins
For future extensions, measures of functional bioinformatics may provide a means to evaluate potential evolving pathways from effects such as mutations, as well as analyzing the internal structural and functional relationships within the 3-D structure of proteins.
Estimating the prevalence of protein sequences adopting functional enzyme folds.
  • D. Axe
  • Biology, Medicine
    Journal of molecular biology
  • 2004
The prevalence of low-level function in four such experiments indicates that roughly one in 10 signature-consistent sequences forms a working domain, implying the overall prevalence of sequences performing a specific function by any domain-sized fold may be as low as 1 in 10(77), adding to the body of evidence that functional folds require highly extraordinary sequences.
Elements of Information Theory
The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.
Conversations with a mathematician - math, art, science and the limits of reason
A century of controversy over the foundations of mathematics (Lecture); Math, science & fantasy (Interview).