Projects

One of the main objectives of LABORES is to spur collaborative networks.

Associated projects

Responsible(s)	Project name	Short description
A. Cabello, J.J. Joosten	Simulating quantum contextuality with deterministic automata.	The project investigates the physical resources needed to simulate quantum contextuality in a classical framework using tools of formal languages and automata theory.
T. Bolognesi and H. Zenil	Algorithmic causal sets, information theory and computational cosmology	Investigation on the derivation of causal sets (discrete representations of spacetime) from the computation of simple models. Emergent properties of these huge, acyclic directed graphs are investigated, including dimensionality, curvature, entropy and pseudo-particles, algorithmic complexity, among others. Related to questions of fine-tuning and connections to notions of the holographic principle.
J.J. Joosten, H. Zenil, F. Soler	Entropy as an indication of the runtime of discrete dynamical systems	Experimental investigation of a notion related to Shannon’s information and fractal dimension in connection to the possible characterization of the runtime unfolding behavior of the evolution of a terminating computing system.
G.J. Martínez, A. Adamatzky, and C.R. Stephens	Cellular automaton supercolliders and virtual particles	Investigation of the interaction between travelling patterns on cellular automata as if they were particles in a particle accelerator and the classification of their most common reactions by engineering collisions between beams of gliders that can also carry out computations.
J. Riedel and H. Zenil	Networks of cellular automata emulations	Investigation of emulation and computation capabilities of small computer programs towards a statistical and topological measure of Turing computational universality.
H. Zenil, J.J. Joosten, F. Soler	Computational irreducibility and unpredictability	Investigation of intrinsically computational constraints (other than traditional time complexity) dealing to the concept of algorithmic epistemology and carried out by computer experiments.
H. Zenil, F. Soler, JP. Delahaye, N. Gauvrit	OACC – Online Algorithmic Complexity Calculator	An online system to evaluate algorithmic theoretic measures of information content such as Bennett’s logical depth, algorithmic probability and the Kolmogorov complexity of short strings, 2-dimensional arrays and other non-binary sequences.
H. Zenil, N. Gauvrit, F. Soler, JP. Delahaye and P. Brugger	Human Randomness Generation Project	An algorithmic test to assess the human capabilities to produce and perceive randomness quantified by measures of information theory.
H. Zenil, F. Soler, JP. Delahaye, J.J. Joosten, N. Gauvrit	Algorithmic Nature group	Group specializing in the investigation of the Micro-cosmos of Small Turing machines from which calculation of complexity measures are taken, compared and scrutinized.