… brainf***? It is an unfortunately (albeit accurately) named Turing complete language with only eight single character commands:

.  ,  <  >  [  ]  +  -

The language assumes (at least) a 30,000 element array, initialized to zero, and a moveable pointer, which is always pointing at a single element of the array.

>  moves pointer forward one position, relative to current position

< moves pointer back one position, relative to current position

+  increments value of array element in pointer's current position one unit

-  decrements value of array element in pointer's current position one unit

[  begins a "while value of element at current pointer position ≠ 0" loop

]  represents the end of the loop structure

. outputs ascii character associated with the value of element in current pointer position

, accepts ascii value of a single character as input and assigns that value to element at current position


Any character other than these eight, including spaces and new lines, is a comment.

brainf*** (<- not capitalized) is a Turing complete programming language. If a problem has a solution that can be calculated, given sufficient memory and time (and/or processing power), any Turing complete language , including brainf***, can be used to do the calculations. Compilers smaller than 200 bytes have been written for the language.

Here is an uncommented version of Hello World! in brainf***, ending in a new line (from Wikipedia):

++++++++++[>+++++++>++++++++++>+++>+<<<<-]>++.>+.+++++++..+++.>++.<<+++++++++++++++.>.+++.------.--------.>+.>.

A couple years ago, I wrote a brainf*** program that printed out the first 43 (I think) numbers of the Fibonacci sequence, without reusing anyone else's code. Due to hardware or compiler limitations (can't recall which) anything beyond that would have been inaccurately calculated. I'll see if I can't dig up the code.

Is anyone up to the challenge of writing a program in brainf***? Post them here.

Last edited by All_Is_Number (2008-11-06 20:15:46)