Francisco Hernández Quiroz

Orcid: 0000-0002-9748-0201

According to our database1, Francisco Hernández Quiroz authored at least 17 papers between 2004 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
An Additively Optimal Interpreter for Approximating Kolmogorov Prefix Complexity.
Entropy, September, 2024

2022
Computable model discovery and high-level-programming approximations to algorithmic complexity.
Theor. Comput. Sci., 2022

2021
Computable Model Discovery and High-Level-Programming Approximations to Algorithmic Complexity.
CoRR, 2021

2020
Shortening of Proof Length is Elusive for Theorem Provers.
Parallel Process. Lett., 2020

2019
Coding-theorem like behaviour and emergence of the universal distribution from resource-bounded algorithmic probability.
Int. J. Parallel Emergent Distributed Syst., 2019

2018
Towards a Formalization of a Framework to Express and Reason about Software Engineering Methods.
Comput. Informatics, 2018

Undecidability and Irreducibility Conditions for Open-Ended Evolution and Emergence.
Artif. Life, 2018

2017
Is there any Real Substance to the Claims for a 'New Computationalism'?
Proceedings of the Unveiling Dynamics and Complexity, 2017

2016
The Limits of Decidable States on Open-Ended Evolution and Emergence.
Proceedings of the Fifteenth International Conference on the Simulation and Synthesis of Living Systems, 2016

2015
Rare Speed-up in Automatic Theorem Proving Reveals Tradeoff Between Computational Time and Information Value.
CoRR, 2015

2013
Bounded rationality in a dynamic alternate game.
Proceedings of the 14th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2013), 2013

2010
Formal Semantics of a Dynamic Epistemic Logic for Describing Knowledge Properties of <i>pi</i>-Calculus Processes.
Proceedings of the Computational Logic in Multi-Agent Systems, 11th International Workshop, 2010

A Complete Proof System for a Dynamic Epistemic Logic Based upon Finite pi-Calculus Processes.
Proceedings of the Advances in Modal Logic 8, 2010

2006
On the possible Computational Power of the Human Mind
CoRR, 2006

Some Semantics for a Logical Language for the Game of Dominoes.
Proceedings of the IASTED International Conference on Artificial Intelligence and Applications, 2006

2005
Some Assumptions about Problem Solving Method in Turing's Model of Intelligence.
Proceedings of the IASTED International Conference on Computational Intelligence, 2005

2004
Full Abstraction for Gamma.
Proceedings of the 5th Mexican International Conference on Computer Science (ENC 2004), 2004


  Loading...