![]() |
The Miser Project |
orcmid.github.io>
![]()
miser>
ct>
index.html>
0.1.1 2025-09-12T16:36Z |
This topic is devoted to application of Computation Theory, including confirmation of the Church-Turing completeness of oMiser. Elements of Automata Theory and Complexity Theory are touched on, along with application of Computability Theory with respect to oMiser and thence to Miser generally.
With regard to Church-Turing completeness, 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).
This topic carries details of the historical and technical conditions by which these claims are demonstrated, and precisely what they signify.
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 | 2025-09-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 |