The purpose of this article is to pinpoint the drawbacks of going to university to study web design, but this can also be applied to many other degrees and, in general, whatever field you want to study.

The purpose of this article is to pinpoint the drawbacks of going to university to study web design, but this can also be applied to many other degrees and, in general, whatever field you want to study.

The purpose of this article is to pinpoint the drawbacks of going to university to study web design, but this can also be applied to many other degrees and, in general, whatever field you want to study.

Un artículo en Quartz, titulado “You probably should have majored in computer science“, anima a los jóvenes a iniciar estudios en Ciencias de la Computación en particular y en materias STEM en general, dado el enorme diferencial de puestos de trabajo sin cubrir en el mercado frente a la disponibilidad actual de graduados en la …

This is a draft proposal for a computing curriculum for K12 in Spain and other countries

Un fantástico artículo en The Guardian, titulado “Educating Britain’s young people for the next industrial revolution“, ofrece un buen número de claves sobre cómo aterrizar las ciencias de la computación en los procesos educativos, y genera además auténtico pavor y desconfianza en el futuro cuando comparamos las iniciativas que están acometiendo en otros países con …

Software Days Journal (SDJ) is an independent international scholarly and open access journal devoted to the dissemination of software across different perspectives. The articles published in SDJ include scientific and technical works, covering the major field of software. SDJ seeks to provide a place for professionals, graduates and scholars all over the world to encourage the analysis and discussion of different topics related to software. The journal publishes articles, commentary, letters to the editor, review articles (including systematic reviews) and case studies describing original research in the field of software.

A new paper of mine with my colleagues, and Algorithmic Nature Lab members, Nicolas Gauvrit and Fernando Soler-Toscano just came out. Using previously generated and new experimental data together with new methods to calculate the algorithmic complexity of 2-dimensional objects, we were able to find that when humans assess the complexity of an image (a small 4×4 […]

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

Por decisión unánime, el Public School Board of Education del distrito de Chicago, el tercero más grande de los Estados Unidos, convierte las ciencias de la computación en una asignatura obligatoria y necesaria para obtener el título de bachillerato, comenzando con la promoción que comienza el año que viene y se gradúa en el año 2020. …

Por decisión unánime, el Public School Board of Education del distrito de Chicago, el tercero más grande de los Estados Unidos, convierte las ciencias de la computación en una asignatura obligatoria y necesaria para obtener el título de bachillerato, comenzando con la promoción que comienza el año que viene y se gradúa en el año 2020. …

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

Una combinación de iniciativas privadas y públicas en torno a la importancia de integrar una formación de alta calidad en tecnología en la educación en los Estados Unidos ha dado como resultado dos efectos interesantes: por un lado, se ha disparado la demanda de carreras relacionadas con las ciencias de la computación.Podemos decir lo que […]

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

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

A method for studying the qualitative dynamical properties of abstract computing machines based on the approximation of their program-size complexity using a general lossless compression algorithm is presented. It is shown that the compression-based approach classifies cellular automata (CA) into clusters according to their heuristic behavior, with these clusters showing a correspondence with Wolfram's main classes of CA behavior. A Gray code-based numbering scheme for initial conditions and a c

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