# A Universal FRACTRAN Interpreter in FRACTRAN

Chris Lomont, May 1, 2017

## Introduction

**FRACTRAN** is a Turing-complete esoteric programming language invented by the prolific mathematician John Conway in 1972 [Con72, Con87].

From Wikipedia (with slight edits):

A FRACTRAN program is an ordered list of positive (reduced) fractions together with an initial positive integer input s. The program is run by updating the integer s (which I call the state of the program) as follows:

- for the first fraction f in the list for which sf is an integer, replace s by sf.
- repeat this rule until no fraction in the list produces an integer when multiplied by s, then halt.

Note this means each time the process is started at the front of the list.

In The Book of Numbers [ConGuy86], John Conway and Richard Guy gave the following FRACTRAN program (and called it PRIMEGAME) :

`{ 17/91 , 78/85 , 19/51 , 23/38 , 29/33 , 77/29 , 95/23 , 77/19 , 1/17 , 11/13 , 13/11 , 15/14 , 15/2 , 55/1 }`

Starting with s=2, PRIMEGAME generates the following sequence of integers:

`2, 15, 825, 725, 1925, 2275, 425, 390, 330, 290, 770, ...`

(sequence A007542 in the OEIS).

After the first 2, this sequence contains the following powers of 2 (spaced in the output):

`2^2 = 4 , 2^3 = 8 , 2^5 = 32 , 2^7 = 128 , 2^11 = 2048 , 2^13 = 8192 , 2^17 = 131072 , 2 19 = 524288 , ...`

(sequence A034785 in the OEIS).

The exponents of the powers of 2 are all the primes in order. PRIMEGAME generates all the prime numbers!

Here is Conway himself explaining it: http://www.uctv.tv/shows/Fractran-A-Ridiculous-Logical-Language-with-John-Conway-23320

A lesser known Conway FRACTRAN program is FIBONACCIGAME:

`{17/65, 133/34, 17/19, 23/17, 2233/69, 23/29, 31/23, 74/341, 31/37, 41/31, 129/287, 41/43, 13/41, 1/13, 1/3}`

Starting with `78*5^(n-1)`

, it halts on `2^Fn`

where Fn is the nth Fibonacci number.

For years I have been fascinated by this, but have never had the time to dig into it. Friday night I decided to spend the weekend and really understand FRACTRAN, setting a motivational goal to write a nontrivial FRACTRAN program. After writing a small FRACTRAN interpreter in Mathematica to get a feel for it and to test ideas, I decided the write the FRACTRAN interpreter itself in FRACTRAN.

That’s right, I wrote FRACTRAN in FRACTRAN.

When I started, I did not know at least two others had done this, as recorded in this Code Golf challenge on StackOverflow. StackOverflow user Jesse Beder made one using 1779 fractions], and user Amadeus did it in 84 fractions. I discovered these while trying to understand FRACTRAN. Unfortunately, I did not find any FRACTRAN explanation as thorough as mine, so I decided to write it all up.

Mine ended up using 48 fractions, which, as far as I can tell, is the current record. I would not be surprised if my techniques can be reduced a few more fractions, which I may attempt if I return to this topic someday.

So, now to explain what I learned and how you too can waste a few days.

[Con72] Conway, J. H. "Unpredictable Iterations." In Proceedings of the 1972 Number Theory Conference Held at the University of Colorado, Boulder, Colo., Aug. 14-18, 1972. Boulder, CO: University of Colorado, pp. 49-52, 1972.

[Con87] Conway, J. H. "Fractran: A Simple Universal Programming Language for Arithmetic." Ch. 2 in Open Problems in Communication and Computation (Ed. T. M. Cover and B. Gopinath). New York: Springer-Verlag, pp. 4-26, 1987.

[ConGuy86] Conway, John H.; Guy, Richard K. (1996). The Book of Numbers. Springer-Verlag New York, Inc. ISBN 0-387-97993-X.

## FRACTRAN 101

First, a few rules. The state s is required to be greater than 0, otherwise multiplying by any fraction would yield 0, which would repeat indefinitely. It’s not very interesting.

All fractions are required to be in reduced terms for clarity of analysis.

Finally, All fractions are required to have positive numerator and denominator, again to prevent uninteresting edge cases and to simplify the analysis.

Plenty of places work through PRIMEGAME, which is complicated so I will not repeat that. After grokking this post you will be able to reverse-engineer it, and write your own FRACTRAN programs.

To gain understanding, here are a few examples.

### Example 1: Addition

The simplest FRACTRAN program is a single fraction.

`{3/2}`

What does this do to a state s? If s has a prime factor of 2, one such factor is removed, and a factor of 3 is added in, and the process repeats. If the state s does not have a prime factor of 2, the program halts.

So this program replaces factors of 2 with factors of 3, one per pass. Starting with 2^a 3^b will yield 3^(a+b) after enough steps.

So one way to view a single fraction with prime numerator and denominator is an adder of exponents.

Similarly for primes p and q, the fraction `p/q`

sends p^a q^b to p^(a+b) after multiple steps.

### Example 2: Subtraction

To subtract a constant k from the exponent of a prime p, the fraction `1/p^k`

will replace `p^(k+a)`

with `p^a`

. So subtracting by a constant is easy.

Suppose the state is `p^a * q^b`

with and a >= b, and you want to compute `p^(a-b)*q^anything`

. The idea is to subtract values from both p and q exponents, which is possible if both have positive exponents. The program `{1/p*q}`

does this when repeatedly applied.

It will stop when the state is `p^(a-b)*q^0`

. If a <=b to start, it ends on `p^0 * q^(b-a)`

. If you want to maintain the value in the exponent of p, then copy it elsewhere, perform the subtraction, and copy it back.

Now you can subtract by constants or by register values.

### Example 3: Zero an exponent

Suppose you want to zero out an exponent. The adder gives the idea: take the program `{1/2}`

. Each pass this removes any factor of 2 and replaces it with a 1, effectively removing a 2 from the factorization of s. After enough passes it will remove all factors of 2, setting the exponent of 2 in the prime factorization to 0.

### Example 4: Move an exponent

Suppose you have some prime power q^d and you want to move the exponent d to a different prime p. Assume p has exponent 0 to start.

How do you do this?

Well, similar to the addition example, the program `{p/q}`

will return the following sequence when run with state p^0 q^d:

`p^0 * q^d, p^1 * q^(d-1), p^2 * q^(d-2), ..., p^d * q^0`

at which point it halts. So we *moved* the value d, and zeroed the exponent of q.

### Example 5 – Copy an exponent (and flow control!)

Example 4 showed how to move a value, but what if we want to copy it?

The solution is to make two copies at the same time, then copy one back. Use a third prime r as temporary storage, and assume it’s exponent is also 0. The program `{p r / q}`

will take the initial state p^0 q^d through the steps

`p^0 * r^0 * q^d, p^1 * r^1 * q^(d-1), p^2 * r^2 * q^(d-2), ..., p^d * r^d * q^0`

at which point it stops.

The first idea to copy the exponent on r back to q is to follow up with the fraction `q/r`

, but as soon as this gives `q`

a positive exponent, the first fraction sends it back to r. We need a way to cause the first fraction to become inactive.

The trick now is to introduce primes that control the flow of the program. This lets the first fraction run to completion, then get "disabled", and run the second one till completion.

Since this gets messy in letters, here is a concrete version: given 2^d * 7, convert this to 2^d * 3^d * 13.

1 2 3 4 5 |
3 * 5 * 11 / 2 * 7 // move the exponent of 2 to 3 and 5. 7 enabled this fraction 7 / 11 // this ensures if line 1 worked, that it gets called again. 13 / 7 // if the above two lines failed, prepare a new loop 2 * 17 / 5 * 13 // move the exponent of 5 back to 2. 13 enabled this 13 / 17 // this ensures if line 4 worked, that it gets called again |

Take the time to understand how this works. It is a pretty illustrative program using flow control to effect an outcome.

Before we do more examples, an interlude:

### Insight 1 : the register or variable viewpoint

A FRACTRAN state is completely characterized by the exponents of the prime powers in it’s factorized form. Thus a state s is

`s = 2^r2 * 3^r3 * 5^r5 * 7^r7 * 11^r7 * .....`

where the ri are non-negative integers, and all but a finite number are zero at any step.

A FRACTRAN program operates on these exponents, adding and subtracting from them.

A useful way to view a FRACTRAN program state is as an infinite tuple of non-negative integers `(r2,r3,r5,r7,r11,...)`

where all but a finite number of entries are 0.

Thus the state `2^1*3^8*7^20`

can be viewed as the following state:

`(1, 3, 0, 20, 0, 0, ....)`

.

A FRACTRAN program operates on this, adding and subtracting from the state, only modifying a finite number of locations at once.

So what does a fraction acting on a state do to the state?

Factoring the fraction f and state s into prime powers yields form

1 2 |
f = p1^r1 * p2^r2 * ... * pn^rn / q1^s1 * q2^s2 * ... * qm^sm s = p1^a1 * p2^a2 * ... * pn^an * q1^b1 * q2^b2 * ... * qm^bm * (other prime powers) |

subject to

- Primes pi are disjoint from primes qj since f is reduced.
- All ri and sj are >= 1
- All ai and bj are >= 0.
- Other prime powers may occur in s, but are not affected by this operation.

fs is in integer if and only if all sj <= bj. This is the condition for the fraction to modify the state.

If fs is an integer, the new state is

1 |
fs = pi^(ri+ai) qj^(bj-sj) * (other prime powers) (where i and j run over all appropriate indices). |

Then the control flow goes back to the first fraction.

Instead of all this notation with primes, which are merely placeholders, look only at the state tuple of exponents exponents, and label the slots as v1, v2, v3, …. Note these numbers are not primes, they are the index of a prime. So v1 corresponds to prime 2, v2 corresponds to prime 3, v3 corresponds to prime 5, etc.

For all primes in the denominator of f, let I be the set of indices. For all primes in the numerator of f, let J be the set of indices. I and J are disjoint since f is reduced. Let ki be the exponent of the ith prime, which is a constant defined by the fraction. vi holds the corresponding slot in the state s.

Then multiplication of f by s becomes (`// is a comment`

)

1 2 3 4 5 6 7 8 |
// I and J are disjoint sets of indices. // ki is >= 1 for i in I // kj is >= 0 for all j in J // if vi >= ki for all i in I then vi -= ki for all i in I vj += kj for all j in J go to first fraction |

A FRACTRAN program is a list of such operations. This is the **only** operation.

Hopefully this last viewpoint is more in line with programmer-speak, making FRACTRAN more transparent.

Now some more examples.

### Example: loops

The copy example showed a simple loop. The same idea generalizes and can be used to loop over many statements.

For example, if you know each line will work, here is an infinite loop

1 2 3 4 5 6 |
// write line numbers as p: // 2: 3/2 // go to line 3 3: 5/3 // go to line 5 5: 7/5 // go to line 7 7: 2/7 // go to line 2 |

### Example: Subroutines

Start with state s=41

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 |
// note this cannot execute till prime 101 is in the state // write line numbers as p: // // subroutine foo: add exponent of 3 into exponent of 2, zeroing 3 exponent 101: 2 * 103 / 3 * 101 // move one 103: 101 / 103 // loop if there was one 1 / 101 // return by remove the prime running this subroutine // start here 41: 3^10 * 43 / 41 // set exponent of 3 to 10, go to line 43 43: 101 * 47 / 43 // call subroutine foo, return to line 47 47: 3^4 * 53 / 47 // set exponent of 3 to 4, go to line 53 53: 101 * 59 / 53 // call subroutine foo, return to line 59 59: 1 / 59 // returns here, adds a final 5 to exponent of 2 // halts here, no line can execute |

This halts after 64 steps with the state 2^14. Surprisingly the largest state value during execution was 653663743948999527918944098014904289807469568.

### Example: Multiplication

Multiplication of a times b can be done by adding a to a counter c, and doing it b many times. The resulting is a double loop (and necessary copying).

With input 2^a 3^b the program `{455/33,11/13,1/11,3/7,11/2,1/3}`

produces output 5^(ab) .

It is worked through on the web many places. Wikipedia has a particularly good explanation, so I won’t detail it here.

### Example: Div and Remainder

Division and remainder can be implemented with pseudo-code like

1 2 3 4 5 6 7 |
// given n,d, compute q = n / d and r = n % d q = 0 r = n while r >= d r -= d q++ |

The only hard part is the while loop. This can be done by trying to subtract d from r as in the subtraction example, and checking if d was >= 1 at the end, in which case the subtraction failed. In the failure care, fix up the answer and return. If subtraction succeeded, loop again.

Now with these examples in mind, on to the overall goal, writing a FRACTRAN interpreter in FRACTRAN.

## FRACTRAN FRACTRAN

The goal is to make a FRACTRAN program that runs any other FRACTRAN program.

The process

- Start with normal pseudo-code
- Transform into a register based version
- Label control flow tokens
- Replace registers and flow tokens with primes

The end result is fairly pretty. I hope you like it. It was a full weekend working all this out.

### Notation

I’ll call the desired FRACTRAN interpreter **CLF-INTERPRET** (for Chris Lomont’s FRACTRAN INTERPRETer, in the spirit of Conway’s PRIMEGAME, and to distinguish it from the larger FRACTRAN interpreters mentioned in the introduction).

For CLF-INTERPRET to run any another FRACTRAN program, it will have to take as input state both the original FRACTRAN program and the original state encoded as an integer. The interpreter will decode the fractions, apply them to the simulated state, mark outputs, and halt if the original halts.

For example, if the FRACTRAN program to interpret is encoded as integer p, and the interpreted state is s, this could be stored for a CLF-INTERPRET state as

`2^p 3^s`

and CLF-INTERPRET can use other prime exponents for state to interpret the program in p.

### PROGRAM-1 : Pseudo-code

Start with pseudo-code for a FRACTRAN interpreter, using C-like syntax without braces. Notation and assumptions:

- All integers are non-negative.
`a / b`

means divide integer a by b, round down, just like in C.`a % b`

is modulus, returning the remainder of a divided by b.- Indentation denotes blocks, like Python.
`//`

starts a comment that runs to the end of the line.- Labels are of form
`label:`

, and are used for loops since`goto`

is easy in FRACTRAN. - Printing works. Later this will be done via a prime tag in the state.
- Multiplication, division, and modulus can be done.
- The initial program is passed in as a
*positive*integer p. - The initial state is passed in as a
*positive*integer s.

Fleshing out the pseudo-code directs the encoding method. The initial idea is to encode digits from the fractions with "spacing" symbols to separate them. Using the symbols `0`

to `9`

for the digits in the original program and the symbol `10`

to separate integers, a list of fractions can be encoded as a base 11 integer.

Then fractions are read from the encoded program one numerator or denominator at a time, digit by digit. Decoding is easier when the most significant digits of a numerator or denominator extract first, and extraction of digits from the encoded program is easiest from the lowest position of the encoded program. This means the digits of the original fractions are encoded in reverse order, with earlier fractions being lower significance in the encoded program.

An example:

To encode `{3/5,40/23}`

, form the sequence `{10,4,0,10,2,3,10,3,10,5 }`

, and treat these as the base-11 digits of a number, which is 24455007857 (in Mathematica or Wolfram Alpha `FromDigits[{10, 4, 0, 10, 2, 3, 10, 3, 10, 5}, 11]`

).

Here is the pseudo-code for **PROGRAM-1: FRACTRAN interpreter pseudo-code**.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 |
// PROGRAM-1: FRACTRAN interpreter pseudo-code start: temp_prog = p // make temp program copy to decode while temp_prog != 0 den = extract_number() // denominator, reduces temp_prog num = extract_number() // numerator, reduces temp_prog if s % den == 0 // does den divide evenly (no remainder)? s = s*num/den // next state print_state() // output state rs goto start // start at top print "done" end program // finished // extract the next number encoded in temp_prog subroutine extract_number() value = 0 extract_loop: digit = temp_prog % 11 // read off a base 11 digit temp_prog = temp_prog / 11 // remove the digit from temp_prog if digit == 10 // is it a number delimiter? return value value <- value * 10 + digit // make room for the digit, and add to end goto extract_loop // loop again |

Pretty straightforward.

### PROGRAM-2 : Register code

This part took the longest time to understand and get correct. Trying to get various math and flow of control things to work in some symbolic form amenable to conversion to FRACTRAN led me to many realizations, summarized here.

#### Flow control

Trying to tackle precise flow control simultaneously while converting the higher level pseudo-code was a mess, leading to a few aborted attempts. I learned to ignore flow control at this stage and do it afterwards.

#### Insight # 2 : A looping primitive

From Insight #1 above, performing an `if`

is possible. We need loops, which can be done with an `if`

, but converting the pseudo-code using only `if`

statements was verbose. Quite often when a fraction modifies the state, that fraction does so many times in a row before it no longer results in an integer. This leads to a conceptual operation of the form

1 2 3 4 |
// I and J are disjoint subsets of variable indices, // vi are variables holding non-negative integers // ki are constants, each >= 1 while (vi >= ki for all i in I), vi -= ki for all i in I, vj += kj for all j in J |

This is pretty much the same insight as #1, except it let me work on a slightly higher level. It abstracts the *effective* behavior of a fraction, making the program easier to reason about.

#### Observations

- The encoded program can be a huge number. This leads to many performance issues.
- Variable copies/moves/zeroing may require many steps, since only a constant can be moved per pass.
- Can prevent some copies by computing multiple copies the first time.
- A single fraction can act on any number of variables. Exploit it to lower the fraction count.
- Testing against 0 is tricky; this is avoided for simplicity. Testing for >= 1 is easy.
- Since the only operation adds or subtracts from variables, keeping them in known states is very useful.
- Zeroing registers is necessary before reusing them for the same process.
- Putting commented asserts for variables that should be 0 or nonzero helped debugging.
- Subroutines can often be avoided and inlined for shorter programs.
- Division, multiplication, and remainder are slow.
- Since FRACTRAN starts at the top each pass, organize code so the most common operations are higher whenever possible for performance.

Applying these observations led me to, after several aborted attempts to code ordering and algorithm form that was short and simple to reason about. The code form forced a new program encoding with padded, interleaved numerator and denominator digits. The new encoding is in the program comments. Instead of requiring base 11 program encoding as in the pseudo-code example, I used general base B in case I wanted to tweak it later. This allows speed, program size, and intermediate result size trade-offs.

In the end I was able to recast the pseudo-code into a set of nested loops using the `while`

loop trick from insight #2.

Often querying a variable changes its value, so I use a trick of doing some things in pairs to avoid copying the variable first then restoring it. The trick is to do the work "over and back" in less fractions than all the original copying would require, and does twice the work without needing copy/restore of values. This led to the interleaved numerator/denominator format.

With all these things in mind, enjoy **PROGRAM-2 : FRACTRAN interpreter register-code**. It illustrates how to convert normal pseudo-code into a form that can be mechanically turned into FRACTRAN.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 |
// PROGRAM-2: FRACTRAN interpreter register-code // // Chris Lomont, Apr 2017 // // Input format: // The start state for the interpreted program is in variable s // The encoded program to be interpreted is in variable p // The program is encoded into p as follows // 1. Choose a base B > 2, B=11 works well // 2. 0 pad each num and den on left to make same length (per fraction) // 3. Expand all integers base B-1 // 4. Alternate digits, numerator first, then denominator, etc. // 5. for each fraction prepend 0, append B - 1 // 6. at end of program, append B - 1 to signal end of fractions // 7. Encode result as a base B number to get p, with // first terms in sequence as least sig digits (i.e., reverse list) // // // In Mathematica: // // base2 = 11; // pad2[f_] := // Block[{n = IntegerDigits[Numerator[f], base2 - 1], // d = IntegerDigits[Denominator[f], base2 - 1], len }, // len = Max[Length[n], Length[d]]; // n = PadLeft[n, len]; // d = PadLeft[d, len]; // Flatten[{0, Riffle[n, d], base2 - 1}] // ]; // digits2[progList_] := Join[Flatten[pad2 /@ progList], {base2 - 1}]; // encode2[progList_] := FromDigits[Reverse[digits2[progList]], base2]; // // {digits2[{21/3, 4/17}], encode2[{21/3, 4/17}]} // {{0, 7, 1, 10, 0, 0, 1, 4, 7, 10, 10}, 284533968840} // // Assertions are in comments to assert variables are 0 or are non-zero via // 0 : assert variables are 0 // !0 : assert variables are nonzero // // Comments like :symbol: are lines changed later for performance // // program variables // p program // s state // n numerator // d denominator // pr program removed - amount removed at any point in time, added back later // sr state removed - amount removed, added back when d does not divide s // x temp variable used locally in loops and to hold s/d // y temp variable used locally in loops start: // !0 : p,s // 0 : n,d,pr,sr,x,y // this loop extracts the next fraction numerator and denominator extract_loop: // 0: x,y while p >= B, p -= B, pr += B-1, y++ // p, y <- p%B, p/B, track pr, :P: if p >= B-1 goto program_end // signals no more fractions while d >= 1, d--, x += B-1 // x = d*(B-1) while p >= 1, p--, pr++, x++ // add in digit in p, track pr while x >= 1, x--, d++ // copy back into d while y >= B, y -= B, pr += B-1, p++ // y, p <- y%B, y/B, track pr, :P: if y >= B-1, pr+=B-1, goto end_extract // numerator and denominator done while n >= 1, n--, x += B-1 // x = n*(B-1) while y >= 1, y--, pr++, x++ // add in digit in y, track pr while x >= 1, x--, n++ // copy back into n goto extract_loop end_extract: // !0 : n,d, else not valid fraction // 0 : x, y, sr // compute s,x <- s%d,s/d. Note s holds the remainder for a while // Division: repeated subtraction of den from state until cannot // subtract any more. Copies old state and new state at the same time // :D: div_loop: while s >=1 && d >= 1, s--, d--, sr++, y++ // remove 1 from both sides, track it, :S: if d >= 1 // subtraction failed, so restore actual remainder and exit loop // d is one less from test, but irrelevant while y >= 1 && sr >= 1, y--, sr--, s++ // correct the remainder in state while d >= 1, d-- // zero denominator for next fraction goto div_exit x++ // count number of subtractions performed while y >= 1, y--, d++ // restore denominator goto div_loop div_exit: // 0 : d,y // now s has remainder s%d, x has state/denominator if s >= 1 // is there a remainder? s-- // from the if statement s++ // fixup while sr >= 1 sr--, s++ // restore old state, :S: while n >= 1, n-- // zero numerator while x >= 1, x-- // zero partial state, :S: goto extract_loop // no remainder, multiply state/d by n for next state. n-- // pre-subtract since check is at the end mul_loop: while x >= 1, x--, s++, y++ // add state/d into s, and make copy, :S: while y >= 1, y--, x++ // restore state/d, :S: if n >= 1, n--, goto mul_loop // any more? // 0 : n, y // cleanup and restore to start of fraction list while x >= 1, x-- // zero state/d, :S: while sr >= 1, sr-- // clean, :S: while pr >= 1, pr--, p++ // restore prog, :P: print_state() // output state // same check as top // !0 : p,s // 0 : n,d,pr,sr,x,y goto start // get first fraction program_end: print "done" exit or inf loop |

This program was implemented in Mathematica and used to interpret simple FRACTRAN programs. For anything too complex it is too slow, mostly due to the slow copies/moves. Replacing the `while`

blocks with a fast version allowed larger programs to run, but then the simple division algorithm was the bottle neck. Replacing that with an equivalent routine made this algorithm able to successfully run all FRACTRAN programs tried, including Conway’s PRIMEGAME. So the algorithm is likely correct.

### PROGRAM-3 : To fractions!

The next step towards CLF-INTERPRET is implementing the control flow of PROGRAM-2 using primes as flow control markers. This can be done by putting primes in the numerator and denominator of fractions, so the resulting instruction cannot possibly be executed except when that prime is a factor of the state s, and possible followup lines are dictated. These control flow primes dictate which lines are eligible for consideration each pass through the list of fractions.

Steps:

- Use the above program as comments.
- For each line in the original, write the corresponding fraction, using variables from the code.
- Replace the additive notation of the code to powers: p += k becomes p^k, p-=k becomes 1/p^k.
- Place a prime in each numerator and denominator to dictate flow.
- Use a flow token (
`[m]`

, where`m`

is an integer) to denote such a prime. Replace with primes later. - Label loop controls and loop changes (see example below).
- Leave space in flow token numbering in case of errors.
- For labels, in the comment place the flow token to get there.

Consider an example. Take the block of code from PROGRAM-2:

1 2 3 4 5 6 7 |
extract_loop: // 0: x,y while p >= B, p -= B, pr += B-1, y++ // p, y <- p%B, p/B, track pr if p >= B-1 goto program_end // signals no more fractions while d >= 1, d--, x += B-1 // x = d*(B-1) while p >= 1, p--, pr++, x++ // add in digit in p, track pr while x >= 1, x--, d++ // copy back into d |

Convert code to comments, remove unused lines, and make initial fractions (the goto is handled below).

1 2 3 4 5 6 7 |
// this loop extracts the next fraction numerator and denominator extract_loop: // pr^(B-1) y / p^B // while p >= B, p -= B, pr += B-1, y++ 1 / p^(B-1) // if p >= B-1 goto program_end x^(B-1) / d // while d >= 1, d--, x += B-1 pr x / p // while p >= 1, p--, pr++, x++ d / x // while x >= 1, x--, d++ |

For the first line, pick a flow token for the numerator and denominator. I picked `[1]`

and `[2]`

:

1 |
pr^(B-1) y [2] / p^B [1] // while p >= B, p -= B, pr += B-1, y++ |

This line cannot execute without prime `[1]`

as a factor of state. Whenever this fraction executes, the `[1]`

is replaced by a `[2]`

in the state. We want this to loop, so after it we could add `[1]/[2]`

, which would cause the line to executed until the rest of the denominator was not satisfied. Call such a fraction a "loop control" and place in the comments. It’s ok to place it before the line; it still works, and for loops over larger numbers of lines it results in less steps during execution.

We can also use this to cause multiple lines to loop. Consider this code (ignore the `[?]`

and `[!]`

for now)

1 2 3 4 5 6 7 |
extract_loop: // [1] [1] / [2] // loop control pr^(B-1) y [2] / p^B [1] // while p >= B, p -= B, pr += B-1, y++ [?] / p^(B-1) [1] // if p >= B-1 goto program_end x^(B-1) [2] / d [1] // while d >= 1, d--, x += B-1 pr x [2] / p [1] // while p >= 1, p--, pr++, x++ d [!] / x [!] // while x >= 1, x--, d++ |

If any of the fractions with a `[1]`

in the denominator executes, then the top loop control resets the `[2]`

with a `[1]`

, and the fractions are tested again.

There is a problem with the last line. If the last line used `[2]/[1]`

like the previous, when it executed and reset to the top, then `d`

would be positive, which would trigger a higher line. This would be incorrect.

The solution is to give the last line a new pair of loop controls, `[3]`

and `[4]`

, and to insert a "loop change" construct that always executes after all lines in the loop cannot execute. This construct is `[3]/[1]`

which switches to the new loop. This results in

1 2 3 4 5 6 7 8 9 10 |
// this loop extracts the next fraction numerator and denominator extract_loop: // [1] [1] / [2] // loop control pr^(B-1) y [2] / p^B [1] // while p >= B, p -= B, pr += B-1, y++ [81] / p^(B-1) [1] // if p >= B-1 goto program_end x^(B-1) [2] / d [1] // while d >= 1, d--, x += B-1 pr x [2] / p [1] // while p >= 1, p--, pr++, x++ [3] / [1] // loop change [3] / [4] // loop control d [4] / x [3] // while x >= 1, x--, d++ |

And that’s all there is to it. Any time the next line will interfere with a previous line, switch to a new loop state. Tag program labels with a new state, and place tokens to effect gotos.

The final issue is `print`

and `program_end`

. These are handled by adding a unique flow token for each, so the state will have these factors when such events occur. Print is `[101]`

and the interpreted program terminates when token `[102]`

is a factor of the state (and the interpreter stops soon thereafter).

Finally, start the program with flow token `[1]`

.

Here is the resulting flow control tagged program.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 |
// PROGRAM-3: FRACTRAN interpreter fraction-code // // Chris Lomont, Apr 2017 // // Input format: // The start state for the interpreted program is in variable s // The encoded program to be interpreted is in variable p // The program is encoded into p as follows // 1. Choose a base B > 2, B=11 works well // 2. 0 pad each num and den on left to make same length (per fraction) // 3. Expand all integers base B-1 // 4. Alternate digits, numerator first, then denominator, etc. // 5. for each fraction prepend 0, append B - 1 // 6. at end of program, append B - 1 to signal end of fractions // 7. Encode result as a base B number to get p, with // first terms in sequence as least sig digits (i.e., reverse list) // // // In Mathematica: // // base2 = 11; // pad2[f_] := // Block[{n = IntegerDigits[Numerator[f], base2 - 1], // d = IntegerDigits[Denominator[f], base2 - 1], len }, // len = Max[Length[n], Length[d]]; // n = PadLeft[n, len]; // d = PadLeft[d, len]; // Flatten[{0, Riffle[n, d], base2 - 1}] // ]; // digits2[progList_] := Join[Flatten[pad2 /@ progList], {base2 - 1}]; // encode2[progList_] := FromDigits[Reverse[digits2[progList]], base2]; // // {digits2[{21/3, 4/17}], encode2[{21/3, 4/17}]} // {{0, 7, 1, 10, 0, 0, 1, 4, 7, 10, 10}, 284533968840} // // program variables // p program // s state // n numerator // d denominator // pr program removed - amount removed at any point in time, added back later // sr state removed - amount removed, added back when d does not divide s // x temp variable used locally in loops and to hold s/d // y temp variable used locally in loops start: // [1] // this loop extracts the next fraction numerator and denominator extract_loop: // [1] [1] / [2] // loop control pr^(B-1) y [2] / p^B [1] // while p >= B, p -= B, pr += B-1, y++ [81] / p^(B-1) [1] // if p >= B-1 goto program_end x^(B-1) [2] / d [1] // while d >= 1, d--, x += B-1 pr x [2] / p [1] // while p >= 1, p--, pr++, x++ [3] / [1] // loop change [3] / [4] // loop control d [4] / x [3] // while x >= 1, x--, d++ pr^(B-1) p [4] / y^B [3] // while y >= B, y -= B, pr += B-1, p++ pr^(B-1) [21] / y^(B-1) [3] // if y >= B-1, pr+=B-1, goto end_extract x^(B-1) [4] / n [3] // while n >= 1, n--, x += B-1 pr x [4] / y [3] // while y >= 1, y--, pr++, x++ [5] / [3] // loop change [5] / [6] // loop control n [6] / x [5] // while x >= 1, x--, n++ [1] / [5] // goto extract_loop end_extract: // [21] // compute s,x <- s%d,s/d. Note s holds the remainder for a while // Division: repeated subtraction of den from state until cannot // subtract any more. Copies old state and new state at the same time div_loop: // [21] [21] / [22] // loop control sr y [22] / s d [21] // while s >=1 && d >= 1,s--,d--,sr++,y++ [23] / d [21] // if d >= 1 [23] / [24] // loop control s [24] / y sr [23] // while y>=1 && sr>=1,y--,sr--,s++ [24] / d [23] // while d >= 1, d-- [41] / [23] // goto div_exit x [25] / [21] // x++, loop change [25] / [26] // loop control d [26] / y [25] // while y >= 1, y--, d++ [21] / [25] // goto div_loop div_exit: // [41] // s has s%d, x has s/d [42] / s [41] // if s >= 1 // is there a remainder? // already performed // s-- // from the if statement // moved to the goto below // s++ // fixup [43] / [42] // loop control s [42] / sr [43] // while sr >= 1 sr--, s++ // restore [42] / n [43] // while n >= 1, n-- // clean [42] / x [43] // while x >= 1, x-- // clean s [1] / [43] // goto extract_loop [61] / n [41] // n-- and loop change mul_loop: // [61] [61] / [62] // loop control s y [62] / x [61] // while x >= 1, x--, s++, y++ [63] / [61] // loop change [63] / [64] // loop control x [64] / y [63] // while y >= 1, y--, x++ [61] / n [63] // if n >= 1, n--, goto mul_loop // cleanup for start of fraction list [65] / [63] // loop change [65] / [66] // loop control [66] / x [65] // while x >= 1, x-- // zero s/d [66] / sr [65] // while sr >= 1, sr-- // p [66] / pr [65] // while pr >= 1, pr--, p++ // restore [101] / [65] // print_state() // output [1] / [101] // goto start // 1st fraction program_end: // [81] [102] / [81] // print "done" // exit or inf loop |

The resulting program is 48 fractions, and has requires 32 unique primes (8 variables, 24 flow control tokens).

### PROGRAM-4 : CLF-INTERPRET

The final step is very straightforward: replace each variable and flow token with a unique prime.

First pick a base B and replace it; I choose B=11.

The program needs 32 unique primes; the 32 smallest primes are those from 2 through 131. For fun I’ll assign letters to the first 26

1 2 3 4 5 6 7 |
A B C D E F G H I J K L M 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, N O P Q R S T U V W X Y Z 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131 |

My name is Chris Lomont. I’ll assign the first 10 primes needed at the program start to those with letters "CHRISLOMNT" for shameless self-promotion and trivial watermarking. This puts encoded program p as the exponent for prime 67, and start token `[1]`

is 5.

Next I assign a few nice things: the interpreted state is prime 7. The print token 101 is prime 2, so anytime the state is even, the interpreted state is the exponent of the factor 7 of the CLF-INTERPRET state. The end token is prime 3, so anytime 3 divides the CLF-INTERPRET state, the interpreted program halted. CLF-INTERPRET will halt soon thereafter.

After this I assigned the lowest unused primes to program variables, then assigned primes to the flow control tokens.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 |
// CLF-INTERPRET: FRACTRAN interpreter written in FRACTRAN // // Chris Lomont, Apr 2017 // // Input format: // The start state for the interpreted program is in variable s // The encoded program to be interpreted is in variable p // The program is encoded into p as follows // 1. 0 pad each num and den on left to make same length (per fraction) // 2. Expand all integers base 10 // 3. Alternate digits, numerator first, then denominator, etc. // 4. for each fraction prepend 0, append 10 // 5. at end of program, append 10 to signal end of fractions // 6. Encode result as a base 11 number to get p, with // first terms in sequence as least sig digits (i.e., reverse list) // // In Mathematica: // // base2 = 11; // pad2[f_] := // Block[{n = IntegerDigits[Numerator[f], base2 - 1], // d = IntegerDigits[Denominator[f], base2 - 1], len }, // len = Max[Length[n], Length[d]]; // n = PadLeft[n, len]; // d = PadLeft[d, len]; // Flatten[{0, Riffle[n, d], base2 - 1}] // ]; // digits2[progList_] := Join[Flatten[pad2 /@ progList], {base2 - 1}]; // encode2[progList_] := FromDigits[Reverse[digits2[progList]], base2]; // // {digits2[{21/3, 4/17}], encode2[{21/3, 4/17}]} // {{0, 7, 1, 10, 0, 0, 1, 4, 7, 10, 10}, 284533968840} // // // Execute CLF-INTERPRET with start state 5 * 7^s * 67^p // Whenever CLF-INTERPRET state is divisible by 2, the exponent of the prime // factor of 7 holds the interpreted state. When the CLF-INTERPRET state is // divisible by 3, the interpreted program has halted. CLF-INTERPRET will // halt soon thereafter. // // The program is 48 fractions using 32 unique primes. // Factored form: 5/19, 61^10*23*19/67^11*5, 37/67^10*5, 47^10*19/41*5, 61*47*19/67*5, 43/5, 43/71, 41*71/47*43, 61^10*67*71/23^11*43, 61^10*31/23^10*43, 47^10*71/13*43, 61*47*71/23*43, 17/43, 17/29, 13*29/47*17, 5/17, 31/53, 11*23*53/7*41*31, 59/41*31, 59/73, 7*73/23*11*59, 73/41*59, 89/59, 47*79/31, 79/83, 41*83/23*79, 31/79, 97/7*89, 101/97, 7*97/11*101, 97/13*101, 97/47*101, 7*5/101, 103/13*89, 103/107, 7*23*107/47*103, 109/103, 109/113, 47*113/23*109, 103/13*109, 127/109, 127/131, 131/47*127, 131/11*127, 67*131/61*127, 2/127, 5/2,3/37 Expanded form: 5/19, 1558654261983398483185/122130132904968017083, 185/1822837804551761449, 4996917562403854655/41, 272365/67, 43/5, 43/71, 125173/47, 145915005923554298917151/952809757913927, 950886101246622507133/41426511213649, 160585150715989139597/13, 8752951/23, 17/43, 17/29, 6409/47, 5/17, 31/53, 17042839/7, 1829/41, 59/73, 331639/23, 4307/41, 89/59, 3713/31, 79/83, 268837/23, 31/79, 8633/7, 101/97, 68579/11, 9797/13, 9797/47, 35/101, 9167/13, 103/107, 1774381/47, 109/103, 109/113, 578899/23, 11227/13, 127/109, 127/131, 16637/47, 16637/11, 1114679/61, 2/127, 5/2, 3/37 |

The large fractions in the final form are due to having exponents of B and B-1 from the base expansions. Using a lower base like B=3 and redoing the work results in a version of CLF-INTERPRET with much smaller numbers, at the cost of slightly less clear encoding and needing more steps to extract numbers.

### PROGRAM-5 : CLF-INTERPRET-FAST

CLF-INTERPRET, while theoretically correct (as far as I can test!) is too slow to run any decent programs, mostly due to the linear performance of lines such as this

1 |
while p >= B, p -= B, pr += B-1, y++ // p, y <- p%B, p/B, track pr, :P: |

The problem is an encoded program is a huge number, and lines like this reduce it in a linear manner. For example, PRIMEGAME encodes as the program

`32753194753582418421057144093528848329987944476675050163790617367881883494565655231458924`

which to extract the left most digit takes 1/11th as many subtractions. Clearly this line needs to be faster.

The solution is to take the resulting line as a fraction:

1 |
pr^(B-1) y [2] / p^B [1] // while p >= B, p -= B, pr += B-1, y++ |

and expand it into multiple lines, with earlier ones extracting larger powers. This is mechanical to do. Separate the variables part from the flow control part, and simply raise the variable part to a set of decreasing powers:

1 2 3 4 5 6 7 8 |
// Let v = pr^(B-1) y / p^B // Let f = [2] / [1] v^(N^R) * f v^(N^(R-1)) * f ... v^(N^1) * f v^(N^0) * f |

For example, using powers of 10 to move a to b and c, this works for a up to a certain size.

1 2 3 4 5 |
// Fast move a to b and c (zeroes a). Useful for a <= 10,000 in size while a >= 1000, a -= 1000, b += 1000, c += 1000 while a >= 100, a -= 100, b += 100, c += 100 while a >= 10, a -= 10, b += 10, c += 10 while a >= 1, a -= 1, b += 1, c += 1 |

For larger a it is still correct; it just becomes slow.

Lines with the comment `:P:`

need enough expansion to reduce encoded programs, and lines with `:S:`

need enough to reduce the state

For example, computing 5000 steps of PRIMEGAME, which outputs the primes 2,3,5,7,11,13, has a max state of 269070432954010009765625, a 77 bit number. Encoding PRIMEGAME gives a 295 bit number. So expanding the `:P:`

into 295 lines using powers of 2 as exponents, and the `:S:`

into 78 such lines gives an exponential speedup on these lines.

The above assumes the fractions of the interpreted program do not have excessively large integers in them, otherwise the same expansions need to be done to lines handling numerators and denominators.

The final issue is that the division algorithm, even with the above tricks, is still far too slow. Hence it was marked in it’s entirety with `:D:`

.

The algorithm used, repeated subtraction, is basically (using the code notation)

1 2 3 4 5 |
// compute x,s = s/d, s%d x = 0 while s >= d s -= d x++ |

The problem lies in that this loop takes s/d passes, which is far too large. The solution is to replace with a division algorithm that removes bigger multiples of d when possible (much like longhand school division).

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 |
// compute x,s = s/d, s%d x = 0 t = 1 z = d // find largest usable while s >= z z = 2*z t = 2*t // now reduce while t >= 1 while s >= z s -= z x += t t = t/2 z = z/2 |

The result is a much larger program, depending on how far one expands the necessary lines.

Since my weekend is over, and I need to stop working on this, I’ll stop here. Hopefully when I get time I’ll finish this part of the writeup, giving a parametrized version that easily expands to handle any (pre-chosen) size program. But this part of my code is still an experimental mess.

Sorry for the cliffhanger! The initial goal of CLF-INTERPRET was more of a success than I expected on Friday night!