miser
|
The Miser Project |
orcmid.github.io>
miser>
ct>
index.html>
0.1.0 2025-07-24T19:23Z |
Synopsis
There are three important computation-theoretical claims to be made and demonstrated about the ‹ob› Universal Computational function obap.ap(p, x) and the companion function obap.eval(p).
- obap..ap is a universal function in the sense that for every computable function f(x) on obs x there is an ob p for which obap.ap(p, x) = f(x) for every determined ob x.
- The obs are denumerably infinite (i.e., are countable) and ‹ob› can represent the natural numbers, N, and their arithmetic. This puts ‹ob› with obap.ap on par with other schemes, including Universal Turing Machines, that satisfy Church’s Thesis on effective computability.
- A feature of universal computation systems is any one can simulate the others. This is demonstrationed for ‹ob› by representation of a Universal Turing Machine, a roundabout confirmation of claim (1).
This topic carries details of the historical and technical conditions by which these claims are demonstrated, and precisely what they signify.
Catalog (Specimens, draft notes, ctYYMMXX Content TBD)
This placeholder links to raw materials and notes, including text files. There will be organized folios of content as documentation continues.
| ID | Status | Started | Topic |
|---|---|---|---|
| Diary & Job Jar | undated | 2023-11-12 | Notes until there is more narrative material |
Using a GitHub account, discuss Miser Project topics in the Discussion section. Propose improvements and removal of defects in Miser Project documentation and software in the Issues section. There are also relevant projects from time to time. For any security concerns, please consult the project security policy.
|
You are navigating the Miser Project on Github |
created 2024-01-13 by orcmid |