Yiannis N. Moschovakis
UCLA and University of Athens
Notation:
N = {0, 1, 2, . . .}
a ≥ b ≥ 1, a = bq + r , 0 ≤ r < b
=⇒ q = iq(a, b), r = rem(a, b)
gcd(a, b) = the greatest common divisor of a and b
⊥b ⇐⇒ rem(a, b) = 1
a⊥ (a and b are coprime)
For a, b ∈ N, a ≥ b ≥ 1,
where π : {0, . . . , n − 1}
→ {0, . . . , n − 1} is a permutation
head(hu0 , . . . , un−1 i) = u0
tail(hu0 , . . . , un−1 i) = hu1 , . . . , un−1 i
hxi ∗ hu0 , . . . , un−1 i = hx, u0 , . . . , un−1 i (prepend)
|hu0 , . . . , un−1 i| = n (the length of u)
h1 (u) = the first half of u (the first half)
h2 (u) = the second half of u (the second half)
S T
s
input - s0 ? z output -
W
· · ·
X x f(x)
σ
Two recursors
π : X × Dα → Dβ
such that the following three conditions hold, for every x ∈ X and
every d ∈ Dα :
I α ≤r β if a reduction exists
I m implements α if α ≤r rm