Infinite fun
This part will cover
- How to define recursive dfns
- Guard syntax in dfns
The engineer sits hunched over their cubicle, focused as they diligently type out
1+(0.99)+(0.99*2)
2.9701
1+(0.99)+(0.99*2)+(0.99*3)+(0.99*4)
4.90099501
1+(0.99)+(0.99*2)+(0.99*3)+(0.99*4)+(0.99*5)+(0.99*6)+(0.99*7)+(0.99*8)+(0.99*9)
9.561792499
In the back of their mind, they know the task they are trying to achieve is impossible, approximating the sum of powers of 0.99 to a reasonable precision would take thousands of terms. Their anxiety grows as they reach the 20th term, the line of terms now stands longer than their computer monitor.
A coworker suggested using a function, and provided some code to evaluate the sequence. Not wanting their skills to be overshadowed, the engineer refused the help and started creating their own function
a ← {0.99*⍵}
(a 0)+(a 1)+(a 2)+(a 3)+(a 4)+(a 5)+(a 6)+(a 7)+(a 8)+(a 9)+(a 10)
9.561792499
Now reaching the 50th term, the series is no closer to being evaluated. The infinite seems always just out of grasp. Resting their chin in their palm, they let their mind wander. If variables can refer to functions, and functions can use variables, can functions refer to and call themselves?
With a renewed burst of motivation, looking over their shoulder, they write the following
function ← {function ⍵+1}
function 1
Nothing seems to be happening, adding a ⎕ quad to look at intermediate values,
function ← {
⎕ ← ⍵
function ⍵+1
}
function 1
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
...
They quickly halt the program using Action > Interrupt in RIDE, through a rush of fear and excitement. realising an infinite number of computations have been specified with a finite number of symbols, by calling the function within itself. The special symbol ∇ can also be used in place of the function name. Trying to do this for the infinite sum,
sum ← {
⎕ ← ⍵
(⍺+1) sum ⍵+0.99*⍺
}
0 sum 0
0
1
1.99
2.9701
3.940399
4.90099501
5.85198506
6.793465209
7.725530557
8.648275252
9.561792499
...
The above function takes in a right argument ⍵ and a left argument ⍺. It displays the right argument ⍵, then applies the function again incrementing the left argument ⍺ by one, and adding 0.99*⍺ to the right argument ⍵. Expanding it out, 0 sum 0 gives ⎕ ← 0 and (0+1) sum 0.99*0 which is 1 sum 1, giving ⎕ ← 1 and 2 sum 1.99, and so on. That is, the right argument sums up (0.99*0)+(0.99*1)+(0.99*2)+... using the left argument to keep track of what term comes next.
However, infinite computations on their own will never be terminate on finite machines, and hence not useful for real computations. Thankfully, there is a way to stop and control these infinite computations, using guarded expressions.
Guarded expressions are conditional expressions; they only execute a statement if some condition holds. The engineer rewrites the function, this time stopping the computation if the terms get smaller than 10*¯10,
sum ← {
(10*¯10)>0.99*⍺: ⎕ ← ⍵
(⍺+1) sum ⍵+0.99*⍺
}
0 sum 0
99.99999999
The guarded expression in the above function is (10*¯10)>0.99*⍺: ⎕ ← ⍵. The guarded expression consists of a logical expression (10*¯10)>0.99*⍺ followed by a colon :, and another expression ⎕ ← ⍵, meaning ⎕ ← ⍵ will be executed only if 0.99*⍺ is less than (10*¯10).
Staring excitedly at your computer, you email your coworker and tell them about your solution. Your smile slowly fades as you read that your coworker had a solution that was exact, and required only one computation.
sum_geometric ← {1÷1-⍵}
sum_geometric 0.99
100
That was embarrasing. You did learn a new programming technique to control infinite amounts of computation, so you try to make the most of it by writing a couple more useful programs.
The factorial function is typically defined as f(n) = n * f(n-1), such that f(0)=1. Thinking in terms of guarded expressions, if the argument of the function is 0 the result should be 1 (in symbols, ⍵=0: 1), otherwise multiply the right argument (⍵) by the result of the function itself (∇) evaluated for the right argument minus 1 (⍵ - 1). Putting it together,
factorial ← {⍵=0: 1 ⋄ ⍵ × ∇ ⍵ - 1}
⋄.
The first statement in this function is an example of a guarded expression, if ⍵=0 is true, that is, when ⍵ is equal to 0, the expression 1 is evaluated. Otherwise, the expression ⍵ × ∇ ⍵ - 1 is evaluated.
For example, the evaluation of factorial 2 can be visualised as:
{⍵=0: 1 ⋄ ⍵ × ∇ ⍵ - 1} 2
⍝ Since 2=0 is 0, the guarded statement is not evaluated.
⍝ 2 × ∇ 1
⍝ 2 × {⍵=0: 1 ⋄ ⍵ × ∇ ⍵ - 1} 1
⍝ Since 1=0 is 0, the guarded statement is not evaluated.
⍝ 2 × 1 × ∇ 0
⍝ 2 × 1 × {⍵=0: 1 ⋄ ⍵ × ∇ ⍵ - 1} 0
⍝ Since 0=0 is 1, the guarded statement is evaluated.
⍝ 2 × 1 × 1
factorial 2
2
factorial 3
6
factorial 4
24
collatz ← {
⍵=1: 1
0=2|⍵: ⍵ , ∇ ⍵÷2
⍵ , ∇ 1+3×⍵}
This function keeps track of the evaluation of the Collatz sequence. If the ⍵ is even, (0=2|⍵) divide it by two and add it to the list (⍵ , ∇ ⍵÷2). If it is not, multiply it by three, add one, and add it to the list (⍵ , ∇ 1+3×⍵). Repeat this process until ⍵ reaches 1.
⍝ Example:
⍝ collatz 3
⍝ 3 , ∇ 1+3×3
⍝ 3 , collatz 1+3×3
⍝ 3 , collatz 10
⍝ 3 , 10 , ∇ 10÷2
⍝ 3 10 , collatz 10÷2
⍝ 3 10 , collatz 5
⍝ and so on
collatz 3
3 10 5 16 8 4 2 1
collatz 100
100 50 25 76 38 19 58 29 88 44 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1
collatz 2*10
1024 512 256 128 64 32 16 8 4 2 1