OpenResearchAlpha

Entropy · 8 Sept 2026

Category-Native Solomonoff Approximation: From Algorithmic Geometry to Kernels, Operators, and Induction

Boumediene Hamzi, Marcus Hutterh-index 43

1
Citations
OpenAlex's count; others 0
0
Citations in 2026
so far
43
Leading author's h-index
Marcus Hutter, in QAI's scholar index
74
References
works it cites, from open citation data

Citations by database

Each database indexes a different set of journals, preprints and books, so they are shown side by side rather than blended.

  • OpenAlex1
  • OpenCitations0
  • Crossref0

Citations per year

The current year is still counting.

  • 2026 so far0

Abstract

Solomonoff induction mixes all computable explanations with description-length weights, but it is incomputable. This theory-and-position paper argues that practical approximation must be category-native: one should first declare the mathematical category in which a computable shadow will live, then use that category’s native comparison functional, complexity code, and inductive object. The proposal is not an omnibus theorem asserting that all categories are equivalent. It is a research architecture that separates comparison, representation, and prediction and makes the information lost by each projection explicit. The metric–measure branch supplies the developed realization. Compression data define an empirical Solomonoff space; Gromov–Wasserstein (GW) distance supplies relational distortion; minimum description length (MDL) controls candidate complexity; and distance-to-kernel embedding produces a positive-semidefinite predictor. For finite or countable coded classes, we prove existence and stability results, a held-out validation oracle inequality, a Kolmogorov–Solomonoff kernel unification, conditional empirical-GW consistency, and a coding-redundancy bound. Stronger learning-oracle statements remain conditional on marked/predictive selection, candidate-family adequacy, and kernel stability. Topological, Banach/Barron, graph, tree, and operator branches are presented as a constructional and testable research programme, with their maturity stated explicitly.

What the data shows

  • OpenAlex counts 1 citations, the most of the databases. The others count 0.
  • Marcus Hutter has the highest h-index among the authors (43).

Graph

This paper in the middle, its authors and their most-cited papers below, the papers it cites to the left and the papers citing it to the right. The timeline lays every paper out by year.

Citing paper shares an authorAuthor without a profileSize shows citations, or h-index for authors

Select a node for its details. Drag to pan, scroll to zoom, drag a node to move it.

Start with

Authors (2)

Each author's standing in QAI's scholar index: the works their ORCID iD is attached to, and for anyone whose ORCID record names a lab OpenResearch follows, their arXiv preprints matched by name and a shared co-author. Names are as printed on the paper.

ProfileMost-cited paper

Cited by 0 papers

Who cites this paper, from open citation data, with Crossref's record of each; the 100 newest when there are more.

0 shown
No citing papers for this filter.

References (74)

What it cites, from open citation data, with Crossref's record of each.

Diffusion maps
Applied and Computational Harmonic Analysis · 2006
2,498

Sign in to see 54 more references

A free account opens the rest of the citing papers and references on every paper’s page.