math / data /lean /OAI /Computability /LoopMatching /Endpoint.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
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