Skip to content

Commit 5176820

Browse files
committed
mention bf2fj in README
1 parent 13e71b8 commit 5176820

File tree

2 files changed

+8
-2
lines changed

2 files changed

+8
-2
lines changed

CONTRIBUTING.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -31,9 +31,9 @@ If a maintainer asks you to "rebase" your PR, they're saying that a lot of code
3131
# Getting started
3232
1. Create your own fork of the code
3333
2. Do the changes in your fork (keep them minimal).
34-
3. If you like the change and think the project could use it:
34+
3. If you like the changes and think the project could use it:
3535
* Be sure you have followed the [code style](CONTRIBUTING.md#clean-code) for the project.
36-
* be sure your project passes the [ci-tests](tests/README.md#the-ci).
36+
* be sure your project passes the [ci-tests](tests/README.md#the-ci) (Run `black .` for adjusting the code-formatting).
3737
* Send a pull request.
3838

3939
If you have **small or "obvious" fixes**, include SMALLFIX in the PR/issue name.

README.md

+6
Original file line numberDiff line numberDiff line change
@@ -233,6 +233,12 @@ If you want to understand how the deep optimized hex macros work, understand how
233233

234234
You can also write and run programs for yourself! It is just [that](README.md#how-to-run) easy :)
235235

236+
## Turing Complete?
237+
As the language expects a finite memory, like most of today's programming languages, it's technically not Turing complete.
238+
Yet, It's very capable.
239+
240+
I wrote a [Brainfuck to Flipjump Compiler (bf2fj)](https://github.com/tomhea/bf2fj) to emphasize just that.
241+
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).
236242

237243
# Contribute
238244

0 commit comments

Comments
 (0)