Boolfuck: Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
← Older edit
VisualWikitext
Polygon (talk | contribs)
2,509 edits
m →BB_boolf: brainf --> boolf in table
Loader3229 (talk | contribs)
631 edits
No edit summary
 
(9 intermediate revisions by 3 users not shown)
Line 2: Line 2:


== Language Overview ==
== Language Overview ==
Boolfuck operates on an array of memory cells, each initially set to false.
Boolfuck operates on an array of memory cells, each initially set to <code>False</code>.


Like in a [[Turing machine]], there is a pointer, initially pointing to the first memory cell.
Like in a [[Turing machine]], there is a pointer, initially pointing to the first memory cell.
Line 22: Line 22:
|-
|-
|<code>[</code>
|<code>[</code>
|Jump forward past matching <code>]</code> if current cell is zero
|Jump forward past matching <code>]</code> if current cell is <code>False</code>
|-
|-
|<code>]</code>
|<code>]</code>
|Jump back to matching <code>[</code> if current cell is non-zero
|Jump back to matching <code>[</code> if current cell is <code>True</code>
|}
|}


== BB_boolf ==
== Boolfuck Busy Beaver ==
'''BB_boolf(n)''' returns the maximum true cells count a program with n instructions can have when halting.
'''Σ<sub>boolf</sub>(n)''' returns the maximum <code>True</code> cells count a program with n instructions can have when halting.
{| class="wikitable"
{| class="wikitable"
!n
!n
!BB_boolf(n)
!Σ<sub>boolf</sub>(n)
!Champion
!Example Champion
|-
|-
|1
|1
|1
|= 1
|<code>*</code>
|<code>*</code>
|-
|-
|2
|2
|1
|= 1
|<code>*></code>
|<code>*></code>
|-
|-
|3
|3
|2
|= 2
|<code>*>*</code>
|<code>*>*</code>
|-
|-
|4
|4
|2
|= 2
|<code>*>*></code>
|<code>*>*></code>
|-
|-
|5
|5
|3
|= 3
|<code>*>*>*</code>
|<code>*>*>*</code>
|-
|-
|6
|6
|3
|= 3
|<code>*>*>*></code>
|<code>*>*>*></code>
|-
|-
|7
|7
|4
|= 4
|<code>*>*>*>*</code>
|<code>*>*>*>*</code>
|-
|8
|= 4
|<code>*>*>*>*></code>
|-
|9
|= 5
|<code>*>*>*>*>*</code>
|-
|10
|= 5
|<code>*>*>*>*>*></code>
|-
|11
|= 6
|<code>*>*>*>*>*>*</code>
|-
|12
|= 7
|<code>*[>*>>>*<<<]</code>
|-
|13
|≥ 8
|<code>*[>*>>>*<<<]*</code>
|-
|14
|≥ 11
|<code>*[>>*[<<<*<]>]</code>
|-
|15
|≥ 12
|<code>*[>>*[<<<*<]>]*</code>
|-
|16
|≥ 15
|<code>*[>>*[[<<<]*<]>]</code>
|-
|17
|≥ 31
|<code>*[>*[>>*[<<]*>]>]</code>
|}
|}


'''BlF(n)''' returns the maximum runtime of a halting program with n instructions.
{| class="wikitable"
!n
!'''BlF(n)'''<ref>https://discord.com/channels/960643023006490684/1243312334907375676/1346489746787926056</ref>
!Example Champion
|-
|1
|= 1
|<code>*</code>
|-
|2
|= 2
|<code>*></code>
|-
|3
|= 3
|<code>*>*</code>
|-
|4
|= 4
|<code>*>*></code>
|-
|5
|= 5
|<code>*>*>*</code>
|-
|6
|= 8
|<code>*>*[<]</code>
|-
|7
|= 10
|<code>*>*[*<]</code>
|-
|8
|= 14
|<code>*[>*>*<]</code>
|-
|9
|= 18
|<code>*[[>]<<*]</code>
|-
|10
|= 30
|<code>*[>*[<]>>]</code>
|-
|11
|= 35
|<code>*[>*[<]*>>]</code>
|-
|12
|= 72
|<code>*[>*[<<*<]>]</code>
|-
|13
|≥ 120
|<code>*[>*>*[<*<]>]</code>
|-
|14
|≥ 158
|<code>*[>>*[<<<*<]>]</code>
|-
|15
|≥ 276
|<code>*[[>*[<<<]>]>>]</code>
|-
|16
|≥ 352
|<code>*[>>*[[<<<]*<]>]</code>
|-
|17
|≥ 871
|<code>*[[>*>*[<]<]>*>>]</code>
|-
|18
|≥ 7,981
|<code>*[[>>*[<]*<]>>>*<]</code>
|-
|19
|≥ 32,167
|<code>*[>*[>>*>]<[<<]*>>]</code>
|-
|20
|≥ 4,359,966
|<code>*[*>*[<<]*>>>*>[>]<]</code>
|-
|21
|≥ 505,033,483,078
|<code>*[>>*[[<]*<[>>]*>*]>]</code>
|}


[page under construction]
[page under construction]
== References ==


[[Category:Functions]]
[[Category:Functions]]

Latest revision as of 11:33, 8 November 2026

Boolfuck is a variation of Brainfuck where cells store booleans instead of integers. Boolfuck is Turing complete.

Language Overview

Boolfuck operates on an array of memory cells, each initially set to False.

Like in a Turing machine, there is a pointer, initially pointing to the first memory cell.

Programs are composed of commands, represented with symbols:

Command Operation
> Move pointer right
< Move pointer left
* Flip current cell
[ Jump forward past matching ] if current cell is False
] Jump back to matching [ if current cell is True

Boolfuck Busy Beaver

Σboolf(n) returns the maximum True cells count a program with n instructions can have when halting.

n Σboolf(n) Example Champion
1 = 1 *
2 = 1 *>
3 = 2 *>*
4 = 2 *>*>
5 = 3 *>*>*
6 = 3 *>*>*>
7 = 4 *>*>*>*
8 = 4 *>*>*>*>
9 = 5 *>*>*>*>*
10 = 5 *>*>*>*>*>
11 = 6 *>*>*>*>*>*
12 = 7 *[>*>>>*<<<]
13 ≥ 8 *[>*>>>*<<<]*
14 ≥ 11 *[>>*[<<<*<]>]
15 ≥ 12 *[>>*[<<<*<]>]*
16 ≥ 15 *[>>*[[<<<]*<]>]
17 ≥ 31 *[>*[>>*[<<]*>]>]

BlF(n) returns the maximum runtime of a halting program with n instructions.

n BlF(n)[1] Example Champion
1 = 1 *
2 = 2 *>
3 = 3 *>*
4 = 4 *>*>
5 = 5 *>*>*
6 = 8 *>*[<]
7 = 10 *>*[*<]
8 = 14 *[>*>*<]
9 = 18 *[[>]<<*]
10 = 30 *[>*[<]>>]
11 = 35 *[>*[<]*>>]
12 = 72 *[>*[<<*<]>]
13 ≥ 120 *[>*>*[<*<]>]
14 ≥ 158 *[>>*[<<<*<]>]
15 ≥ 276 *[[>*[<<<]>]>>]
16 ≥ 352 *[>>*[[<<<]*<]>]
17 ≥ 871 *[[>*>*[<]<]>*>>]
18 ≥ 7,981 *[[>>*[<]*<]>>>*<]
19 ≥ 32,167 *[>*[>>*>]<[<<]*>>]
20 ≥ 4,359,966 *[*>*[<<]*>>>*>[>]<]
21 ≥ 505,033,483,078 *[>>*[[<]*<[>>]*>*]>]

[page under construction]

References

  1. ↑ https://discord.com/channels/960643023006490684/1243312334907375676/1346489746787926056
Retrieved from "https://wiki.bbchallenge.org/w/index.php?title=Boolfuck&oldid=10403"