The Insane Esolang

This language was created by Galaxtone. (The lang is Esolang is pronounced like the ane is Insane.)

Uses the same tape as from Brainfuck (Unbounded in both directions, 8-bit)

The tape is lazy and every time a value has been accessed for the first time it assigned a random number.

Random Number Generator
To prevent this language from being completely impossible, this uses an RNG which gives you the same values each time.

function random { seed = (38674947661 * seed + 58487) % 256; return seed; }

The initial seed is 142.

Instructions
Notes:
 * That every instruction polls the RNG regardless of usage. (The RNG is triggered before execution of the instruction)
 * Due to the 8bit limitations, all division is integer division and the end result is modded by 256. (The calculated numbers within the operations are not 8bit, only the end result is.)
 * All non-instruction characters are ignored, so comments can exist.
 * The ə instruction does not count as two instruction, therefore RNG will not be polled twice.
 * The input alphabet, output alphabet and instruction list all start at 1.
 * Execute the “ instruction using the “ instruction.
 * Modular operations should not result in negative numbers. e.g. 6 % 5 = 1, -2 % 5 = 3.
 * Always-positive modular implementation if none is available: x - (floor(x / y) * y)

Hello, World!
ĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬǿĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬǿĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬđǿǿĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬđđđđđđđđđđđđđǿĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬǿĬĬĬĬǿĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬǿĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬǿĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬĬǿĬĬĬĬĬǿ

Submitted by LyricLy using a program of his own creation which can be found in the External resources section.

Non-Terminating Cat
None.

Terminating Cat
None.

Fibonacci Sequence
None.

Note: The sequence must go up to 233, and you CANNOT hard-code any part of the sequence except the initial values of 1 and 1.

Truth Machine
None.

Note: It must take ignore all input except 0 and 1, if 0, print a zero and halt else print a 1 repeatedly and never halt.

Prove Turing-Completeness
None.

External resources

 * Brute Force Insane Text Generator by LyricLy.
 * Javascript Brute Force Insane Text Generator by Galaxtone based on LyricLy's Brute Force Insane Text Generator.