“…for all M, b ∈ N, p ∈ C, ε > 0p ≤ b ∧ S(p) − p ≤ Φ(ε, M, b) → ∀t ∈ [0, M ] ( T (t)p − p ≤ ε).The main noneffective tool used in Suzuki's proof is the binary König's lemma WKL and by Remark 2.4 it is guaranteed to have a primitive recursive (in the sense of Kleene) bound Φ. In fact, the bound actually extracted in[42] is of rather low complexity:Φ(2 −m , M, b) D2 ω D,b (3+[log 2 (1+M N )]+m)+1 , φ(k, f ) := max{2f (i) + 6 : 0 < i ≤ k}. Example: α = √ 2, β = 2, λ = 1/2.…”