From 51768202e9493b38a58d594957d7a0c48fcf990d Mon Sep 17 00:00:00 2001 From: Tom Herman Date: Tue, 12 Dec 2023 11:44:24 +0200 Subject: [PATCH] mention bf2fj in README --- CONTRIBUTING.md | 4 ++-- README.md | 6 ++++++ 2 files changed, 8 insertions(+), 2 deletions(-) diff --git a/CONTRIBUTING.md b/CONTRIBUTING.md index 33d70b0..9dd01dd 100644 --- 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 index 8c874ae..8b46134 100644 --- 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