1 citations · 1 across the 2 of their papers we have counts for
3 papers
Forgetting complex propositions
David Fernández-Duque, Ángel Nepomuceno-Fernández, Enrique Sarrión-Morrillo +2
This paper uses possible-world semantics to model the changes that may occur in an agent's knowledge as she loses information. This builds on previous work in which the agent may f…
A geometric protocol for cryptography with cards
Andrés Cordón-Franco, Hans van Ditmarsch, David Fernández-Duque +1
In the generalized Russian cards problem, the three players Alice, Bob and Cath draw a,b and c cards, respectively, from a deck of a+b+c cards. Players only know their own cards an…
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…