Target-free bounded search on the observed finite set #
def
GenLimit.FiniteWitness.Candidate
{α : Type u_1}
[Encodable α]
[DecidableEq α]
(F : List α → α)
(S : Finset α)
(n : ℕ)
(p : List α)
(k : ℕ)
(q : List α)
:
A tentative bad extension: its output is unconfirmed by the entire sample.
Equations
Instances For
noncomputable def
GenLimit.FiniteWitness.sampleRun
{α : Type u_1}
[Encodable α]
[DecidableEq α]
(F : List α → α)
(S : Finset α)
(n : ℕ)
:
Bounded iteration; an empty candidate set leaves the current word fixed.
Equations
- One or more equations did not get rendered due to their size.
- GenLimit.FiniteWitness.sampleRun F S n 0 = []
Instances For
theorem
GenLimit.FiniteWitness.sampleRun_content
{α : Type u_1}
[Encodable α]
[DecidableEq α]
(F : List α → α)
(S : Finset α)
(n k : ℕ)
:
noncomputable def
GenLimit.FiniteWitness.normalized
{α : Type u_1}
[Encodable α]
[DecidableEq α]
(F : List α → α)
(S : Finset α)
:
α
The normalized output function is fixed before a target is selected.
Equations
- GenLimit.FiniteWitness.normalized F S = F (GenLimit.FiniteWitness.sampleRun F S S.card S.card)