Download data/lean/OAI/Computability/LoopMatching/Endpoint.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 871 Bytes
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/LoopMatching/Endpoint.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Computability/LoopMatching/Endpoint.lean
-
curl -L -o Endpoint.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/LoopMatching/Endpoint.lean
871 Bytes
| import OAI.Computability.LoopMatching.LiteralChoices | |
| import OAI.Computability.LoopMatching.SmallBoundary | |
| import OAI.Computability.LoopMatching.Main | |
| namespace OAI | |
| namespace LoopMatchingReference | |
| theorem challenge : | |
| β A : LoopMatching.Input β β Γ β, | |
| β machine : Turing.TM2ComputableInPolyTime | |
| LoopMatching.encodeInput LoopMatching.encodeOutput A, | |
| (β k, Finite (machine.tm.Ξ k)) β§ | |
| (β P : Polynomial β, β G, | |
| (LoopMatching.encodeOutput (A G)).length β€ | |
| P.eval (LoopMatching.encodeInput G).length) β§ | |
| β G, 0 < (A G).2 β§ | |
| (A G).1 β€ (A G).2 * LoopMatching.count G β§ | |
| (A G).2 * LoopMatching.count G β€ 2 ^ (18 * G.n) * (A G).1 β§ | |
| ((A G).1 = 0 β LoopMatching.count G = 0) := by | |
| exact LoopMatching.fullEndpoint | |
| end LoopMatchingReference | |
| end OAI | |