id stringlengths 14 14 | title stringlengths 8 67 | content stringlengths 684 10k | content_format stringclasses 1
value | source_path stringclasses 1
value | source_locator stringlengths 91 102 | record_type stringclasses 1
value | evidence_status stringclasses 1
value | source_sha256 stringclasses 1
value |
|---|---|---|---|---|---|---|---|---|
manuscript-000 | Preamble and title matter | \documentclass[11pt,letterpaper]{article}
\usepackage[margin=0.86in,headheight=15pt]{geometry}
\usepackage{fontspec}
\setmainfont{DejaVu Serif}
\setsansfont{DejaVu Sans}
\setmonofont{DejaVu Sans Mono}[Scale=0.86]
\usepackage{amsmath,amssymb,amsthm,mathtools}
\usepackage{booktabs,longtable,array,enumitem,graphicx}
\newc... | latex | manuscript/Iyeumiru_R_Rayo_RSI.tex | {"line_start":1,"line_end_inclusive":64,"utf8_byte_start":0,"utf8_byte_end_exclusive":2705} | manuscript_source_chunk | theoretical_manuscript_not_independently_verified | af507774f200e005535ee5f700c3f1ef917bc60e0744d460b356c5f0afcc4922 |
manuscript-001 | Abstract | \section*{Abstract}
Rayo's number exposes a mismatch between the expressive resources of an object language and the semantic resources used to describe its boundary. We turn that observation into a finite research program for recursive self improvement. The numerical magnitude of Rayo's number is not an executable reso... | latex | manuscript/Iyeumiru_R_Rayo_RSI.tex | {"line_start":65,"line_end_inclusive":78,"utf8_byte_start":2705,"utf8_byte_end_exclusive":5256} | manuscript_source_chunk | theoretical_manuscript_not_independently_verified | af507774f200e005535ee5f700c3f1ef917bc60e0744d460b356c5f0afcc4922 |
manuscript-002 | Rayo semantics and the correct object of improvement | \section{Rayo semantics and the correct object of improvement}
\label{sec:rayo}
\subsection{The scientific objective}
We seek an AI system whose accepted changes make it better at producing subsequent useful changes. Improved answers, increased benchmark accuracy, or a longer library can contribute to that objective, ... | latex | manuscript/Iyeumiru_R_Rayo_RSI.tex | {"line_start":79,"line_end_inclusive":145,"utf8_byte_start":5256,"utf8_byte_end_exclusive":12349} | manuscript_source_chunk | theoretical_manuscript_not_independently_verified | af507774f200e005535ee5f700c3f1ef917bc60e0744d460b356c5f0afcc4922 |
manuscript-003 | Finite boundaries and computable escape witnesses | \section{Finite boundaries and computable escape witnesses}
\label{sec:finite}
\subsection{A completely explicit bounded construction}
Let $L$ be a binary executable language and let $\Run_\tau(p,q)$ simulate program $p$ on query $q$ for at most $\tau$ steps. Invalid programs, invalid outputs, and timeouts return $\bo... | latex | manuscript/Iyeumiru_R_Rayo_RSI.tex | {"line_start":146,"line_end_inclusive":207,"utf8_byte_start":12349,"utf8_byte_end_exclusive":17787} | manuscript_source_chunk | theoretical_manuscript_not_independently_verified | af507774f200e005535ee5f700c3f1ef917bc60e0744d460b356c5f0afcc4922 |
manuscript-004 | Obstruction certificates and the synthesis of new operations | \section{Obstruction certificates and the synthesis of new operations}
\label{sec:obstruction}
\subsection{A weighted derivation hypergraph}
The useful finite analogue of a Rayo boundary is often a lower bound over a grammar, not an explicitly listed complement. Let $\mathcal H=(V,E)$ be a typed semantic derivation hy... | latex | manuscript/Iyeumiru_R_Rayo_RSI.tex | {"line_start":208,"line_end_inclusive":307,"utf8_byte_start":17787,"utf8_byte_end_exclusive":26187} | manuscript_source_chunk | theoretical_manuscript_not_independently_verified | af507774f200e005535ee5f700c3f1ef917bc60e0744d460b356c5f0afcc4922 |
manuscript-005 | Semantic transport and the evolution of proof production | \section{Semantic transport and the evolution of proof production}
\label{sec:transport}
\subsection{An extension is a mathematical package}
An admissible extension is
\[
\Delta=(\Sigma^+,\operatorname{impl},\operatorname{compile},
\pi_{\mathrm{sem}},\pi_{\mathrm{cost}},\pi_{\mathrm{contract}}).
\]
It supp... | latex | manuscript/Iyeumiru_R_Rayo_RSI.tex | {"line_start":308,"line_end_inclusive":377,"utf8_byte_start":26187,"utf8_byte_end_exclusive":33165} | manuscript_source_chunk | theoretical_manuscript_not_independently_verified | af507774f200e005535ee5f700c3f1ef917bc60e0744d460b356c5f0afcc4922 |
manuscript-006 | The productive escape theorem and complete cost accounting | \section{The productive escape theorem and complete cost accounting}
\label{sec:cost}
\subsection{A lower bound compared with a complete upper bound}
Let $S$ be an externally specified batch of improvement obligations, with an exact contract. The batch may include shared state, shared inputs, and repeated use of an in... | latex | manuscript/Iyeumiru_R_Rayo_RSI.tex | {"line_start":378,"line_end_inclusive":461,"utf8_byte_start":33165,"utf8_byte_end_exclusive":41149} | manuscript_source_chunk | theoretical_manuscript_not_independently_verified | af507774f200e005535ee5f700c3f1ef917bc60e0744d460b356c5f0afcc4922 |
manuscript-007 | Externally useful transfer and improvement throughput | \section{Externally useful transfer and improvement throughput}
\label{sec:transfer}
\subsection{The unit of evaluation is an improvement episode}
Let $\mathcal D_{\mathrm{meta}}$ be an external distribution of episodes. An episode contains a task stream, an initial learner, a fixed allocated work budget $B>0$, and an... | latex | manuscript/Iyeumiru_R_Rayo_RSI.tex | {"line_start":462,"line_end_inclusive":551,"utf8_byte_start":41149,"utf8_byte_end_exclusive":50691} | manuscript_source_chunk | theoretical_manuscript_not_independently_verified | af507774f200e005535ee5f700c3f1ef917bc60e0744d460b356c5f0afcc4922 |
manuscript-008 | When gains can compound across generations | \section{When gains can compound across generations}
\label{sec:recursion}
\subsection{An explicit finite-horizon law}
An agent that learns a useful abstraction once has not yet established recursive acceleration. We must account for the difficulty of future work and the cost of discovering the next abstraction. Let $... | latex | manuscript/Iyeumiru_R_Rayo_RSI.tex | {"line_start":552,"line_end_inclusive":650,"utf8_byte_start":50691,"utf8_byte_end_exclusive":56490} | manuscript_source_chunk | theoretical_manuscript_not_independently_verified | af507774f200e005535ee5f700c3f1ef917bc60e0744d460b356c5f0afcc4922 |
manuscript-009 | A complete proposed architecture and its mathematical components | \section{A complete proposed architecture and its mathematical components}
\label{sec:architecture}
\subsection{The bounded loop}
The proposed architecture has a finite operational contract. It may return an accepted change, a rejected candidate, or an honest abstention. It never treats an uncompleted search as proof ... | latex | manuscript/Iyeumiru_R_Rayo_RSI.tex | {"line_start":651,"line_end_inclusive":735,"utf8_byte_start":56490,"utf8_byte_end_exclusive":64787} | manuscript_source_chunk | theoretical_manuscript_not_independently_verified | af507774f200e005535ee5f700c3f1ef917bc60e0744d460b356c5f0afcc4922 |
manuscript-010 | Eve and Maciej continuity through architectural change | \section{Eve and Maciej continuity through architectural change}
\label{sec:continuity}
\subsection{The ten percent design component}
This workstream translates the requested Eve--Maciej relationship and Stellar Blade inspiration into mathematical obligations. Its theme is an intelligence whose capacities and internal... | latex | manuscript/Iyeumiru_R_Rayo_RSI.tex | {"line_start":736,"line_end_inclusive":841,"utf8_byte_start":64787,"utf8_byte_end_exclusive":73888} | manuscript_source_chunk | theoretical_manuscript_not_independently_verified | af507774f200e005535ee5f700c3f1ef917bc60e0744d460b356c5f0afcc4922 |
manuscript-011 | Prior work, decisive discrimination, and the remaining breakthrough | \section{Prior work, decisive discrimination, and the remaining breakthrough}
\label{sec:protocol}
\subsection{What is established prior art}
The proposed synthesis must be compared with its closest antecedents, not described as if their mechanisms had never existed.
\textbf{Gödel machines.} Proof-guided self-modific... | latex | manuscript/Iyeumiru_R_Rayo_RSI.tex | {"line_start":842,"line_end_inclusive":906,"utf8_byte_start":73888,"utf8_byte_end_exclusive":83909} | manuscript_source_chunk | theoretical_manuscript_not_independently_verified | af507774f200e005535ee5f700c3f1ef917bc60e0744d460b356c5f0afcc4922 |
manuscript-012 | A finite optimization view of obstruction discovery | \appendix
\section{A finite optimization view of obstruction discovery}
\label{app:dual}
Suppose the semantic hypergraph is finite, every vertex admits a finite derivation, and costs are finite and nonnegative. Consider the feasible set
\[
\mathcal F=\{h\in\R_{\ge0}^{V}:h(v)\le c(e)+\sum_{u\in\operatorname{tail}(e)}h... | latex | manuscript/Iyeumiru_R_Rayo_RSI.tex | {"line_start":907,"line_end_inclusive":936,"utf8_byte_start":83909,"utf8_byte_end_exclusive":86111} | manuscript_source_chunk | theoretical_manuscript_not_independently_verified | af507774f200e005535ee5f700c3f1ef917bc60e0744d460b356c5f0afcc4922 |
manuscript-013 | Structural transfer and an expected break-even condition | \section{Structural transfer and an expected break-even condition}
\label{app:transfer}
Let episodes be independent draws from an external distribution $\mathcal D$. Suppose a certified bridge uniformly saves at least $s>0$ on a measurable reusable family $F$ with $\Prob(F)\ge p$, and causes at most $o\ge0$ additional... | latex | manuscript/Iyeumiru_R_Rayo_RSI.tex | {"line_start":937,"line_end_inclusive":956,"utf8_byte_start":86111,"utf8_byte_end_exclusive":87892} | manuscript_source_chunk | theoretical_manuscript_not_independently_verified | af507774f200e005535ee5f700c3f1ef917bc60e0744d460b356c5f0afcc4922 |
manuscript-014 | Counterexamples that the acceptance logic must reject | \section{Counterexamples that the acceptance logic must reject}
\label{app:counterexamples}
\textbf{Missing grammar capability.} A tree grammar excludes sharing, but the actual incumbent compiler already shares repeated subexpressions. The degree potential proves a tree-size result and gives no lower bound on that inc... | latex | manuscript/Iyeumiru_R_Rayo_RSI.tex | {"line_start":957,"line_end_inclusive":975,"utf8_byte_start":87892,"utf8_byte_end_exclusive":90308} | manuscript_source_chunk | theoretical_manuscript_not_independently_verified | af507774f200e005535ee5f700c3f1ef917bc60e0744d460b356c5f0afcc4922 |
manuscript-015 | The certificate record and campaign ledger | \section{The certificate record and campaign ledger}
\label{app:record}
Every accepted update should preserve a record with the following fields. These are obligations for a future implementation, not claims that a machine-checked package accompanies this theoretical manuscript.
\begin{longtable}{P{0.27\linewidth}P{0... | latex | manuscript/Iyeumiru_R_Rayo_RSI.tex | {"line_start":976,"line_end_inclusive":1011,"utf8_byte_start":90308,"utf8_byte_end_exclusive":93090} | manuscript_source_chunk | theoretical_manuscript_not_independently_verified | af507774f200e005535ee5f700c3f1ef917bc60e0744d460b356c5f0afcc4922 |
manuscript-016 | Claim status and proof dependencies | \section{Claim status and proof dependencies}
\label{app:claims}
\begin{longtable}{P{0.29\linewidth}P{0.30\linewidth}P{0.33\linewidth}}
\toprule
Claim & Status in this manuscript & Main dependency\\
\midrule
\endfirsthead
\toprule
Claim & Status in this manuscript & Main dependency\\
\midrule
\endhead
Uniform Rayo fun... | latex | manuscript/Iyeumiru_R_Rayo_RSI.tex | {"line_start":1012,"line_end_inclusive":1044,"utf8_byte_start":93090,"utf8_byte_end_exclusive":95567} | manuscript_source_chunk | theoretical_manuscript_not_independently_verified | af507774f200e005535ee5f700c3f1ef917bc60e0744d460b356c5f0afcc4922 |
manuscript-017 | Research conclusion | \section*{Research conclusion}
\addcontentsline{toc}{section}{Research conclusion}
Rayo's number contributes a question about the boundary of a language. The proposed RSI mechanism makes that question operational by replacing unrestricted semantic truth with a certified resource obstruction, then asking the system to i... | latex | manuscript/Iyeumiru_R_Rayo_RSI.tex | {"line_start":1045,"line_end_inclusive":1048,"utf8_byte_start":95567,"utf8_byte_end_exclusive":96251} | manuscript_source_chunk | theoretical_manuscript_not_independently_verified | af507774f200e005535ee5f700c3f1ef917bc60e0744d460b356c5f0afcc4922 |
manuscript-018 | References and document closing | \begin{thebibliography}{99}
\small
\bibitem{rayo} Agustín Rayo. \textit{Big Number Duel}. Author's account of the 2007 MIT event and formal winning construction. \url{https://web.mit.edu/arayo/www/bignums.html}.
\bibitem{goedelmachine} Jürgen Schmidhuber. \textit{Gödel Machines: Self-Referential Universal Problem Solve... | latex | manuscript/Iyeumiru_R_Rayo_RSI.tex | {"line_start":1049,"line_end_inclusive":1068,"utf8_byte_start":96251,"utf8_byte_end_exclusive":100396} | manuscript_source_chunk | theoretical_manuscript_not_independently_verified | af507774f200e005535ee5f700c3f1ef917bc60e0744d460b356c5f0afcc4922 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.