FANDOM


Take the code for BF(n), then resolve it. BF(n) is defined here.

WIP!

Counting Series

BF(0)

>0
Finished. Result: 0

BF(1)

>0
Add the chain of pluses up.
>1
Finished. Result: 1

BF(2)

>0
Add the chain of pluses up.
>2
Finished. Result: 2

BF(3)

>0
Add the chain of pluses up.
>3
Finished. Result: 3

BF(4)

>0
Add the chain of pluses up.
>4
Finished. Result: 4

BF(5)

>0
Add the chain of pluses up.
>5
Finished. Result: 5

Multiplication Series

BF(15)

Now, here's something about loops.

When an iteration is done, find the entry that the pointer is on. Call this entry the iterator.

If it's not been decreased, the code never terminates.

If it's been decreased, find the entry that has been increased, call it the iterating entry. Then, take the iterator, multiply it by the iterating entry, increase the iterating entry by that number, then set the iterator to 0.

>0
Add the chain of pluses up.
>4
Start the first loop.
4,>0
Add the chain of pluses up.
4,>4
>4,4
>3,4
The iterator has been decreased, increase the iterating entry 3 more times.
>0,12
End the first loop.
0,>12
Finished. Result: 12

Ad blocker interference detected!


Wikia is a free-to-use site that makes money from advertising. We have a modified experience for viewers using ad blockers

Wikia is not accessible if you’ve made further modifications. Remove the custom ad blocker rule(s) and the page will load as expected.