Outinp
Outinp is an esolang created by User:Win7HE, not made for code golfing and probably turing complete.
Commands
Any # can be replaced by a diffrent character. Any $ can be a comment, or replaced by a space.
out##### - outputs the #'s.
inp##### - asks you for 5 character input with reason that is the #.
oui$$$$$ - outputs input
emp$$$$$ - a newline (new empty scratch list item)
1in##### - increases variable 1 by #####. (if negative number decreases variable)
2in##### - increases variable 2 by #####. (if negative number decreases variable)
iff###$$ - if variable 1 not ### skip next command
swp$$$$$ - swaps variable 1 and 2's values
ouv$$$$$ - outputs ascii value mapped variable 2
jmp##### - jumps to command #####
ini$$$$$ - increases variable 1 by input (input, not hashtags)
nop$$$$$ - a no operation command.
Example Programs
Cat
inpimcatoui/////inpimcatoui/////inpimcatoui/////
Truth Machine (please fix this code or interpreter)
out123 iouts 1, outelse outzero.inpinputini.....emp.....iff123..jmp00009jmp00012out11111jmp00009nop.....out00000jmp00012
Hello World
outHelloout, woroutld!..
Computational class
Outinp could be Turing-complete, if not for the limited amount of instructions it can jump to. Written by User:RikoMamaBala.
It could be translated to this Minsky machine:
1in000012in00001 start of program 1inxxxxx inc 1 by xxxxx 1in-xxxxiff000TCjmpxxxxx dec 1 by xxxx unless it's 0, in which case jump to line xxxxx - (number of decrement reg 1 instructions * 2) - number of decrement reg 2 instructions 2inxxxxx inc 2 by xxxxx 2in-xxxxswpoutiniff000TCjmpxxxxx dec 2 by xxxx unless it's 0, in which case jump to line xxxxx - (number of decrement reg 1 instructions * 2) - number of decrement reg 2 instructions
But, as you can see, it can only jump up to instruction 99999, hence proving that it, sadly, is a bounded-storage machine.