2 citations · 4 across the 5 of their papers we have counts for
5 papers
Justification logic and the epistemic contribution of deduction
Nancy Abigail Nuñez Hernández, Francisco Hernández Quiroz
Accounting for the epistemic contribution of deduction has been a pervasive problem for logicians interested in deduction, such as, among others, Jakko Hintikka. The problem arises…
Computable Model Discovery and High-Level-Programming Approximations to Algorithmic Complexity
Vladimir Lemusa, Eduardo Acuña, Víctor Zamora +2
Motivated by algorithmic information theory, the problem of program discovery can help find candidates of underlying generative mechanisms of natural and artificial phenomena. The…
Undecidability and Irreducibility Conditions for Open-Ended Evolution and Emergence
Santiago Hernández-Orozco, Francisco Hernández-Quiroz, Hector Zenil
Is undecidability a requirement for open-ended evolution (OEE)? Using methods derived from algorithmic complexity theory, we propose robust computational definitions of open-ended…
Rare Speed-up in Automatic Theorem Proving Reveals Tradeoff Between Computational Time and Information Value
Santiago Hernández-Orozco, Francisco Hernández-Quiroz, Hector Zenil +1
We show that strategies implemented in automatic theorem proving involve an interesting tradeoff between execution speed, proving speedup/computational time and usefulness of infor…
Bounded rationality in a dynamic alternate game
Eduardo Espinosa-Avila, Francisco Hernandez-Quiroz
From the standpoint of game theory, dominoes is a game that has not received much attention (specially the variety known as draw). It is usually thought that this game is already s…