Java BrainF*** Interpreter & Visualizer: Unlocking the Power of Turing-Complete Computation 🚀

This is a project that demonstrates the potential of the infamous BrainF*** programming language to calculate *any* computable result. It is a Turing-complete language, meaning it could compute anything that modern programming languages could, given enough time and memory. The language consists of only 8 single-character commands. The visualization rendered in the black window depicts a Turing machine with the instruction tape at the top, and the data tape at the bottom. The instruction tape holds the symbols to be executed, and the data tape holds the infinite list of memory cells to be manipulated. Each memory cell can represent 256 possible values, but it is worth noting that only two different states (0 and 1) are required for the language to be Turing-complete. Source and Executable Jar: https://github.com/FuzzyCat444/Java-BrainF-Interpreter Commands: + increment the value of the cell at the current data pointer by one (with overflow) - decrement the value of the cell at the current data pointer by one (with overflow) 〉 move the data pointer one cell to the right 〈 move the data pointer one cell to the left , take one byte as input and store it in the cell at the current data pointer . print one byte from the cell at the current data pointer [ if the value at the current cell is 0, move to the instruction after the matching ] bracket, else move to the very next instruction ] move to the matching [ bracket The more complicated programs were sampled from http://brainfuck.org/ and are all created by Daniel B. Cristofani.