On Insolvability of the 4-th Hilbert Problem for Hyperbolic Geometries
Bibliographic record
Abstract
The article proves the insolvability of the 4-th Hilbert Problem for hyperbolic geometries. It has been hypothesized that this fundamental mathematical result (the insolvability of the 4-th Hilbert Problem) holds for other types of non-Euclidean geometry (geometry of Riemann (elliptic geometry), non-Archimedean geometry, and Minkowski geometry). The ancient Golden Section, described in Euclid’s Elements (Proposition II.11) and the following from it Mathematics of Harmony, as a new direction in geometry, are the main mathematical apparatus for this fundamental result. By the way, this solution is reminiscent of the insolvability of the 10-th Hilbert Problem for Diophantine equations in integers. This outstanding mathematical result was obtained by the talented Russian mathematician Yuri Matiyasevich in 1970, by using Fibonacci numbers, introduced in 1202 by the famous Italian mathematician Leonardo from Pisa (by the nickname Fibonacci), and the new theorems in Fibonacci numbers theory, proved by the outstanding Russian mathematician Nikolay Vorobyev and described by him in the third edition of his book “Fibonacci numbers”.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.012 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.003 | 0.010 |
| Scholarly communication | 0.003 | 0.008 |
| Open science | 0.001 | 0.005 |
| Research integrity | 0.002 | 0.006 |
| Insufficient payload (model declined to judge) | 0.012 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".