In a recent paper I have advanced some conjectures using a coefficient that renders aspects of the qualitative behavior of complex systems in quantitative terms. It measures the sensitivity of a system to external stimuli, its apparent ability to (efficiently) transfer information from the input through the output. In a previous paper, and in a [...]

Google adiestra un algoritmo para ser capaz de escribir artículos en Wikipedia. ¿Cómo lo adiestra? Qué pregunta tan tonta, ¿no? Con artículos de Wikipedia. En pocos años, las enciclopedias pueden pasar de ser una tarea llevada a cabo por cientos o miles de expertos en temáticas de todo tipo, a ser escritos por algoritmos capaces …

In a previous article, I suggested a method for testing the algorithmicity of a natural/physical process using the concept of Levin’s universal distribution. In this new paper published by the Journal of Experimental Artificial Intelligence, I explain this method in the context of the problem formulated by Floridi concerning the testability of pancomputationalism. Then, I introduce a […]

Computing the incomputable has always been a challenge. For example, in finding the busiest Turing machines (Rado) given a number of symbols and states (whimsically called busy beavers). This means either finding Turing machines that, starting from an empty input, produce more non-blank symbols in their output tapes before halting than any other Turing machine [...]

I was awarded a 3rd Place Prize in this year’s FQXi contest Is Reality Digital or Analog? by the Foundational Questions Institute for my work entitled The World is Either Algorithmic or Mostly Random. The winners were announced at this year’s World Science Festival in New York City. Based on the combined ratings of the [...] <http://feeds.feedburner.com/~ff/AnimaExMachina?a=aaTeyxGfHHU:prN5fYNxsGY:yIl2AUoC8zA><http://feeds.feedburner.com/~ff/AnimaExMachina?a=aaTeyxGfHHU:prN5fYNxsGY:dnMXMwOfBR0><

We present a method for estimating the complexity of an image based on the concept of Bennett's logical depth. We use this measure to classify images by their information content. The method provides a means for evaluating and classifying objects by way of their visual representations. <http://feeds.feedburner.com/~ff/AnimaExMachina?a=IW9tuhKc3ew:FZL33B1SA0s:yIl2AUoC8zA><http://feeds.feedburner.com/~ff/AnimaExMachina?a=IW9tuhKc3ew:FZL33B1SA0s:dnMXMwOfBR0><http://feeds.feedburner.com/~ff/AnimaExM

One of the greatest scientific achievements of the last century was the understanding of life in terms of information. We know today that the information for synthesizing the molecules that allow organisms to survive and replicate is encoded in the DNA. In the cell, DNA is copied to messenger RNA, and triplet codons in the [...] <http://feeds.feedburner.com/~ff/AnimaExMachina?a=SdY14MedKyQ:FhWqPCt-sRQ:yIl2AUoC8zA><http://feeds.feedburner.com/~ff/AnimaExMachina?a=SdY14MedKyQ:FhWqPCt-sRQ:dnMXMwOfB

======================================== The Shortest Universal Turing Machine Implementation Contest ANNOUNCEMENT 23 Dec – 2008 http://www.mathrix.org/experimentalAIT/TuringMachine.html ======================================== Contest Overview ============ In the spirit of the busy beaver competition though related to program-size complexity, we are pleased to announce the “Shortest Universal [...] <http://feeds.feedburner.com/~ff/AnimaExMachina?a=gv22a5CUWXQ:xCxFzzQEhHk:yIl2AUoC8zA><http://fee

This image was generated in the course of an investigation of the distribution of runtimes of programs in relation to the lengths of mathematical proofs, the results of which are being published in my paper bearing the title “Computer Runtimes and the Length of Proofs with an Algorithmic Probabilistic Application to Optimal Waiting Times in [...] <http://feeds.feedburner.com/~ff/AnimaExMachina?a=F7MEZ1RcIUw:T-1wGOVNZsQ:yIl2AUoC8zA><http://feeds.feedburner.com/~ff/AnimaExMachina?a=F7MEZ1RcIUw:T-1