Increasing limits of bounded evaluators — unchecked contract
Lax755887.LimitDeciderContract · concepts/Lax755887/LimitDeciderContract.lean · lax-755887
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Bounded acceptance is computable and increases with fuel. Its union is the halting predicate; computability does not pass to this increasing limit.
This is an intentionally false contract, retained as an open proof obligation.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
No proof in the archive yet — this claim is open.
Lean source view on GitHub
| 1 | import Lax755887.LimitDecider |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Increasing limits of bounded evaluators — unchecked contract |
| 6 | type: theorem |
| 7 | --- |
| 8 | Bounded acceptance is computable and increases with fuel. Its union is the halting predicate; computability does not pass to this increasing limit. |
| 9 | |
| 10 | This is an intentionally false contract, retained as an open proof obligation. |
| 11 | -/ |
| 12 | |
| 13 | namespace Lax755887.LimitDeciderContract |
| 14 | |
| 15 | open Lax755887.LimitDecider |
| 16 | |
| 17 | open Nat.Partrec (Code) |
| 18 | open Nat.Partrec.Code |
| 19 | |
| 20 | axiom monotone_limit (p : ℕ → Code → Prop) |
| 21 | (step : ∀ n c, p n c → p (n + 1) c) |
| 22 | (deciders : ∀ n, ComputablePred (p n)) : ComputablePred (fun c => ∃ n, p n c) |
| 23 | |
| 24 | end Lax755887.LimitDeciderContract |
| 25 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments