10 John Case, Timo Kötzing Difficulties in Forcing Fairness Formally: Restrictions on TxtEx-Learning A TxtEx-learner h is called postdictively complete a.k.a. consistent iff, for all

A Txtex

T (k − 1)), i.e., {T (0), . . . , T (k − 1)} ⊆ V…

A TxtEx-learner h is called conservative iff, for all

A TxtEx-learner h is called conservative iff, for…

A TxtEx-learner h is called postdictively complete a.k.a. consistent iff, for all T , k, h(T [k]) correctly postdicts

A TxtEx-learner h is called postdictively…

A TxtEx-learner h is called prudent iff, for all T , k, V h(T [k]) is TxtEx-learnable by h