arXiv subjects

Francisco Hernández-Quiroz

Publications and source records attributed to Francisco Hernández-Quiroz.

4 recordsLinked to original sources

arXiv2026

Integrative Adaptive Indexes from Noisy Routine Haematological Markers can Predict and Discriminate Health Status and Biological Age

For more than two decades, advances in personalised medicine and precision healthcare have largely been based on genomics and other omics data. These strategies aim to tailor interventions to individual patient profiles, promising greater treatment efficacy and more efficient allocation of healthcare resources. Here, we show that widely collected common haematologic markers can reliably predict and discriminate individual chronological age and health status from even noisy sources. Our analysis includes synthetic and real retrospective patient data, including medically relevant and extreme cases, and draws on more than 100\,000 complete blood count records over 13 years from the United States Centers for Disease Control and Prevention's National Health and Nutrition Examination Survey (CDC NHANES). We combine fully explainable risk assessment scores with machine and deep learning techniques to focus on clinically significant patterns and characteristics without functioning purely as a ''black-box model allowing interpretation and control. We validated the results with the UK Biobank, a larger cohort independent of the CDC NHANES and with very different collection techniques, the former a survey and the second a longitudinal study. Unlike current biological ageing indicators, this approach may offer rapid, and scalable implementations of personalised, precision and predictive approaches to healthcare and medicine without or before requiring other specialised, uncommon or costly tests.

q-bio.QM↗

arXiv2018

Coding-theorem Like Behaviour and Emergence of the Universal Distribution from Resource-bounded Algorithmic Probability

Previously referred to as `miraculous' in the scientific literature because of its powerful properties and its wide application as optimal solution to the problem of induction/inference, (approximations to) Algorithmic Probability (AP) and the associated Universal Distribution are (or should be) of the greatest importance in science. Here we investigate the emergence, the rates of emergence and convergence, and the Coding-theorem like behaviour of AP in Turing-subuniversal models of computation. We investigate empirical distributions of computing models in the Chomsky hierarchy. We introduce measures of algorithmic probability and algorithmic complexity based upon resource-bounded computation, in contrast to previously thoroughly investigated distributions produced from the output distribution of Turing machines. This approach allows for numerical approximations to algorithmic (Kolmogorov-Chaitin) complexity-based estimations at each of the levels of a computational hierarchy. We demonstrate that all these estimations are correlated in rank and that they converge both in rank and values as a function of computational power, despite fundamental differences between computational models. In the context of natural processes that operate below the Turing universal level because of finite resources and physical degradation, the investigation of natural biases stemming from algorithmic rules may shed light on the distribution of outcomes. We show that up to 60\% of the simplicity/complexity bias in distributions produced even by the weakest of the computational models can be accounted for by Algorithmic Probability in its approximation to the Universal Distribution.

cs.IT↗

arXiv2016

Undecidability and Irreducibility Conditions for Open-Ended Evolution and Emergence

Is undecidability a requirement for open-ended evolution (OEE)? Using methods derived from algorithmic complexity theory, we propose robust computational definitions of open-ended evolution and the adaptability of computable dynamical systems. Within this framework, we show that decidability imposes absolute limits to the stable growth of complexity in computable dynamical systems. Conversely, systems that exhibit (strong) open-ended evolution must be undecidable, establishing undecidability as a requirement for such systems. Complexity is assessed in terms of three measures: sophistication, coarse sophistication and busy beaver logical depth. These three complexity measures assign low complexity values to random (incompressible) objects. As time grows, the stated complexity measures allow for the existence of complex states during the evolution of a computable dynamical system. We show, however, that finding these states involves undecidable computations. We conjecture that for similar complexity measures that assign low complexity values, decidability imposes comparable limits to the stable growth of complexity, and that such behaviour is necessary for non-trivial evolutionary systems. We show that the undecidability of adapted states imposes novel and unpredictable behaviour on the individuals or populations being modelled. Such behaviour is irreducible. Finally, we offer an example of a system, first proposed by Chaitin, that exhibits strong OEE.

cs.OH↗

arXiv2015

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

We show that strategies implemented in automatic theorem proving involve an interesting tradeoff between execution speed, proving speedup/computational time and usefulness of information. We advance formal definitions for these concepts by way of a notion of normality related to an expected (optimal) theoretical speedup when adding useful information (other theorems as axioms), as compared with actual strategies that can be effectively and efficiently implemented. We propose the existence of an ineluctable tradeoff between this normality and computational time complexity. The argument quantifies the usefulness of information in terms of (positive) speed-up. The results disclose a kind of no-free-lunch scenario and a tradeoff of a fundamental nature. The main theorem in this paper together with the numerical experiment---undertaken using two different automatic theorem provers AProS and Prover9 on random theorems of propositional logic---provide strong theoretical and empirical arguments for the fact that finding new useful information for solving a specific problem (theorem) is, in general, as hard as the problem (theorem) itself.

cs.LO↗