File size: 871 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 | 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
|