Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

mention bf2fj in README #271

Merged
merged 1 commit into from
Dec 12, 2023
Merged

mention bf2fj in README #271

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions CONTRIBUTING.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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.
Expand Down
6 changes: 6 additions & 0 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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

Expand Down