Merge pull request #271 from tomhea/feature/mention-bf2fj

mention bf2fj in README
tomhea · Dec 12, 2023 · aa01b31 · aa01b31
2 parents 13e71b8 + 5176820
commit aa01b31
Show file tree

Hide file tree

Showing 2 changed files with 8 additions and 2 deletions.
diff --git a/CONTRIBUTING.md b/CONTRIBUTING.md
@@ -31,9 +31,9 @@ If a maintainer asks you to "rebase" your PR, they're saying that a lot of code
 # Getting started
 1. Create your own fork of the code
 2. Do the changes in your fork (keep them minimal).
-3. If you like the change and think the project could use it:
+3. If you like the changes and think the project could use it:
     * Be sure you have followed the [code style](CONTRIBUTING.md#clean-code) for the project.
-    * be sure your project passes the [ci-tests](tests/README.md#the-ci).
+    * be sure your project passes the [ci-tests](tests/README.md#the-ci) (Run `black .` for adjusting the code-formatting).
     * Send a pull request.
 
 If you have **small or "obvious" fixes**, include SMALLFIX in the PR/issue name.

diff --git a/README.md b/README.md
@@ -233,6 +233,12 @@ If you want to understand how the deep optimized hex macros work, understand how
 
 You can also write and run programs for yourself! It is just [that](README.md#how-to-run) easy :)
 
+## Turing Complete?
+As the language expects a finite memory, like most of today's programming languages, it's technically not Turing complete. 
+Yet, It's very capable.
+
+I wrote a [Brainfuck to Flipjump Compiler (bf2fj)](https://github.com/tomhea/bf2fj) to emphasize just that. 
+Brainfuck is indeed Turing complete, and the compiler proves that flipjump can run any program that brainfuck runs (besides those that require an unbounded memory).
 
 # Contribute