Loop preventing brainfuck

Loop preventing brainfuck is a brainfuck derivative that can be used to solve the halting problem, calculate busy beavers, and solve math problems.

Commands

Command	Description
>	Move the pointer to the right
<	Move the pointer to the left
+	Increment the memory cell at the pointer
-	Decrement the memory cell at the pointer
.	Output the character signified by the cell at the pointer
,	Input a character and store it in the cell at the pointer
(A)(B)	Will run A while the current cell being nonzero, UNLESS this would continue forever, in which case B runs instead. If B is empty A is allowed to loop

Unbounded integers

It is reasonable to assume that, if one does operations on infinity, it will result in the machine never halting. you cant remove any infinities either. One can however test for infinity using (-)(CODE)

Examples

Run CODE If cell at pointer is nonzero

()(CODE)

Find 1 to the right and move to it if it exists

(<-(+<-)())(+-)

add cell to the left to current cell if cell to the left is NOT infinity

(>(-<+>)()<)(+-)

BrainFuck busy beaver

nothing here yet

Semidecider solver

If we have a brainfuck program b we can replace all [C] with (C)() to result in a loop preventing brainfuck program with the same behavior. If we have a brainfuck program which semidecides some fact, then we can modify it to set the cell under the pointer to 0 by adding a (-)() at the end. If we then use the structure, we can determine the answer of the semidecision.

Assuming a blank starting tape, this outputs the value 1 if b halts, or nul if it doesn't.

+( b (-)())(+-).

Semidecider solver with answer and pretty print

+(- b (-)())(---(--->+<)()>.-------.------.-------.+++++++++++.++++++++.(-)()+) ()() (.<)()

If b halts, it prints the answer from right to left until zero is found.

If b does not halt it prints 'UNHALT'.

Solving collatz conjecture

nothing here yet