This is the full version of my answer to a question formulated by Francisco A. Doria to me included in the Discussion Section of A Computable Universe, my edited volume being published by World Scientific and Imperial College Press coming out next month (already available in Asia) concerning whether I think if Hypercomputation is possible: [...]

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 [...]

The method introduced in my doctoral dissertation was featured in the French version of Scientific American Pour La Science in its July 2011 issue No. 405 under the title Le défi des faibles complexités. Jean-Paul Delahaye points out that: Comme les très petites durées ou longueurs, les faibles complexités sont délicates à évaluer. Paradoxalement, les [...] <http://feeds.feedburner.com/~ff/AnimaExMachina?a=2d__n0lQMbQ:XUCidLYZUSs:yIl2AUoC8zA><http://feeds.feedburner.com/~ff/AnimaExMachina?a=2d__

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><

The lack of correspondence between the abstract and the physical world seems sometimes to suggest that there are profound incompatibilities between what can be thought and what actually happens in the real world. One can ask, for example, how often one faces undecidable problems. However, the question of undecidability has been considered to be better [...] <http://feeds.feedburner.com/~ff/AnimaExMachina?a=aaoNMt8pLSc:tpkRNSUDqYE:yIl2AUoC8zA><http://feeds.feedburner.com/~ff/AnimaExMachina?a=aaoN

======================================== 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