75 citations · 263 across the 13 of their papers we have counts for
4 papers · 1 filter
A secure additive protocol for card players
Andres Cordon-Franco, Hans van Ditmarsch, David Fernandez-Duque +2
Consider three players Alice, Bob and Cath who hold a, b and c cards, respectively, from a deck of d=a+b+c cards. The cards are all different and players only know their own cards.…
Algorithmic Complexity for Short Binary Strings Applied to Psychology: A Primer
Nicolas Gauvrit, Hector Zenil, Jean-Paul Delahaye +1
Since human randomness production has been studied and widely used to assess executive functions (especially inhibition), many measures have been suggested to assess the degree to…
Empirical Encounters with Computational Irreducibility and Unpredictability
Hector Zenil, Fernando Soler-Toscano, Joost J. Joosten
There are several forms of irreducibility in computing systems, ranging from undecidability to intractability to nonlinearity. This paper is an exploration of the conceptual issues…
Program-Size Versus Time Complexity, Speed-Up and Slowdown Phenomena in Small Turing Machines
Joost J. Joosten, Fernando Soler-Toscano, Hector Zenil
The aim of this paper is to undertake an experimental investigation of the trade-offs between program-size and time computational complexity. The investigation includes an exhausti…