CounterScript - Revision history

Azerty: /* Champions */ Set BBCS(8) and BBCS(9) status to proven.

2026-04-22T19:03:24Z

Champions: Set BBCS(8) and BBCS(9) status to proven.

← Older revision		Revision as of 19:03, 22 April 2026
Line 78:		Line 78:
	\|-		\|-
	\|8		\|8
	\|≥9		\|9
	\|<code>A++; A++; A++; while A {A--; B++; B++; B++;}</code>		\|<code>A++; A++; A++; while A {A--; B++; B++; B++;}</code>
	\|-		\|-
	\|9		\|9
	\|~~≥12~~		\|12
	\|<code>A++; A++; A++; A++; while A {A--; B++; B++; B++;}</code>		\|<code>A++; A++; A++; A++; while A {A--; B++; B++; B++;}</code>
	\|-		\|-
Line 88:		Line 88:
	\|≥16		\|≥16
	\|<code>A++; A++; A++; A++; while A {A--; B++; B++; B++; B++;}</code>		\|<code>A++; A++; A++; A++; while A {A--; B++; B++; B++; B++;}</code>
			\|-
			\|11
			\|≥20
			\|<code>A++; A++; A++; A++; A++; while A {A--; B++; B++; B++; B++;}</code>
			\|-
			\|12
			\|≥25
			\|<code>A++; A++; A++; A++; A++; while A {A--; B++; B++; B++; B++; B++;}</code>
	\|}		\|}
	</div>		</div>

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

Polygon: Added Category:Functions

2026-04-12T09:09:27Z

Added Category:Functions

← Older revision		Revision as of 09:09, 12 April 2026
Line 90:		Line 90:
	\|}		\|}
	</div>		</div>

			[[Category:Functions]]

Azerty: /* Champions */

2026-04-11T16:32:22Z

Champions

← Older revision		Revision as of 16:32, 11 April 2026
Line 43:		Line 43:

	== Champions ==		== Champions ==
	<div class="toccolours mw-collapsible ~~mw-collapsed~~">		<div class="toccolours mw-collapsible">
	{\| class="wikitable"		{\| class="wikitable"
	!n		!n

Azerty: Created page

2026-04-11T16:32:00Z

Created page

New page

'''CounterScript''' is a minimal counter-based programming language designed for '''Busy Beaver–style program enumeration and analysis'''.

It features a very small instruction set operating over an unbounded set of nonnegative integer variables (''counters'').

'''BBCS'''(n) is the Busy Beaver function for '''CounterScript''' programs.

= Definition =
A CounterScript program consists of a finite sequence of instructions drawn from three primitives:

* Increment a counter
* Conditional decrement
* While loop

All counters are initialized to <code>0</code> and can grow without bound.

The model is closely related to '''Minsky register machines,''' '''Fractran''' and '''Brainfuck''', and is therefore [[Turing-complete]].

== Instructions ==
Instructions are executed one by one from left to right.
{| class="wikitable"
|+
!Name
!Command
!Definition
|-
|Increment
|<code>A++</code>
|Increment counter A by 1
|-
|Decrement
|<code>A--</code>
|Decrement counter A by 1 if A > 0
|-
|While loop
|<code>while A {...}</code>
|Executes the loop body while <code>x > 0</code>
|}

= Program size =
The '''length''' of a CounterScript program is defined as the total number of instructions.

By example, <code>A++; while A {A--; B++;}</code> has length 4.

== Champions ==
<div class="toccolours mw-collapsible mw-collapsed">
{| class="wikitable"
!n
!BBCS(n)
!Champion
|-
|1
|1
|<code>A++;</code>
|-
|2
|2
|<code>A++; A++;</code>
|-
|3
|3
|<code>A++; A++; A++;</code>
|-
|4
|4
|<code>A++; A++; A++; A++;</code>
|-
|5
|5
|<code>A++; A++; A++; A++; A++;</code>
|-
|6
|6
|<code>A++; A++; A++; A++; A++; A++;</code>
|-
|7
|7
|<code>A++; A++; A++; A++; A++; A++; A++;</code>
|-
|8
|≥9
|<code>A++; A++; A++; while A {A--; B++; B++; B++;}</code>
|-
|9
|≥12
|<code>A++; A++; A++; A++; while A {A--; B++; B++; B++;}</code>
|-
|10
|≥16
|<code>A++; A++; A++; A++; while A {A--; B++; B++; B++; B++;}</code>
|}
</div>