Truth-machine
A truth-machine is a simple program type, devised by User:Keymaker to be a program that is easy, most of the time, to implement in a language, and useful for testing or showcasing the following capabilities of a language:
- input
- output
- decision
- repetition
- termination
Essentially, a truth-machine works like this:
- Ask for input.
- If the input is 0:
- Output 0.
- Terminate program.
- Whereas if the input is 1:
- Repeat infinitely:
- Output 1.
- Repeat infinitely:
In languages without input capabilities, a truth-machine might instead have a simple way for the user to modify a variable or other structure in the beginning of the program, and the machine would do its decision based on that. A truth-machine in a language without output capabilities might simply either terminate or not terminate, based on the the input. The essence of a truth-machine is that some part of it, whether in the memory the program is using or in the program's code, may be either A or B, and the program contains the capacity (namely, program code) to do either of two possible things: in case of A the machine/program will perform an infinite loop, in case of B it will quit running. An alternative to output could be placing a 0 in memory once, or start filling the (infinite) memory with 1s.
Contents
- 1 Implementations
- 1.1 0815
- 1.2 2-ill
- 1.3 2KWLang
- 1.4 ACL
- 1.5 A colon semicolon
- 1.6 Acyclic Tag
- 1.7 Aeolbonn
- 1.8 Alight
- 1.9 ALLSCII
- 1.10 Alphabet Stew
- 1.11 ALPL
- 1.12 Andromeda
- 1.13 Aubergine
- 1.14 Argh!
- 1.15 AsciiDots
- 1.16 asm2bf
- 1.17 Assembly language
- 1.18 Backshift
- 1.19 Beam
- 1.20 Beeswax
- 1.21 Befunge-93
- 1.22 Benul
- 1.23 beta-Juliet
- 1.24 Betterave
- 1.25 Binary lambda calculus
- 1.26 BIT
- 1.27 bitch
- 1.28 BitChanger
- 1.29 Bitoven
- 1.30 Bit Stupid
- 1.31 Bitter
- 1.32 Bitwise Cyclic Tag
- 1.33 Black
- 1.34 boolfuck
- 1.35 Brace For Impact
- 1.36 brainfuck
- 1.37 brainfuck--
- 1.38 brainfunct
- 1.39 Brainloller
- 1.40 Bruijndejx
- 1.41 Bueue
- 1.42 Bur
- 1.43 Burlesque
- 1.44 Carriage
- 1.45 Cfluviurrh
- 1.46 C-INTERCAL
- 1.47 CJam
- 1.48 comp
- 1.49 Counting
- 1.50 Cubestate
- 1.51 Daoyu
- 1.52 dc
- 1.53 Definer
- 1.54 Difficult
- 1.55 DigFill
- 1.56 dotlang
- 1.57 Drive-In Window
- 1.58 DROL
- 1.59 DStack
- 1.60 Duck Duck Goose
- 1.61 Emmental
- 1.62 Emoji-gramming
- 1.63 EnScript
- 1.64 Eodermdrome
- 1.65 ESOPUNK
- 1.66 FALSE
- 1.67 FerNANDo
- 1.68 ><>
- 1.69 Fishing
- 1.70 Foobar and Foobaz and Barbaz, oh my!
- 1.71 Forobj
- 1.72 Forte
- 1.73 FOS-X
- 1.74 Fueue
- 1.75 Funciton
- 1.76 FurryScript
- 1.77 Gaot++
- 1.78 Gentzen
- 1.79 GetWhen
- 1.80 Glass
- 1.81 Glypho
- 1.82 GolfScript
- 1.83 golfuck
- 1.84 Grawlix
- 1.85 GridScript
- 1.86 Hollow
- 1.87 HQ9funge
- 1.88 Hurgusburgus
- 1.89 Integ
- 1.90 IRP
- 1.91 ISCOM
- 1.92 Isolated
- 1.93 itflabtijtslwi
- 1.94 ΙΧΘΥΣ
- 1.95 Jolverine
- 1.96 Jug
- 1.97 JUMP
- 1.98 Karma
- 1.99 Keg
- 1.100 KimL
- 1.101 Kipple
- 1.102 Kkipple
- 1.103 L00P
- 1.104 Linguine
- 1.105 LOCK
- 1.106 logOS
- 1.107 Losescript
- 1.108 Ly
- 1.109 Madbrain
- 1.110 MailBox
- 1.111 Malbolge
- 1.112 Malbolge Unshackled
- 1.113 MarioLANG
- 1.114 Math++
- 1.115 Maze
- 1.116 Microscript
- 1.117 Minks
- 1.118 MIX (Knuth)
- 1.119 Muriel
- 1.120 Nhohnhehr
- 1.121 No Literals, Gotos Only, Final Destination!
- 1.122 NOR
- 1.123 NULL
- 1.124 Numeric Topline
- 1.125 OOLANG
- 1.126 Ouroboros
- 1.127 PATH
- 1.128 pb
- 1.129 pbrain
- 1.130 Piet
- 1.131 Pizza Delivery
- 1.132 PoGo
- 1.133 Powder
- 1.134 Print Function Deluxe
- 1.135 Pxem
- 1.136 pyhton [sic]
- 1.137 Pyth
- 1.138 Q-Ref
- 1.139 QWOP
- 1.140 Recurl
- 1.141 Redivider
- 1.142 ResPlicate
- 1.143 REVER
- 1.144 REVERSE
- 1.145 ROOP
- 1.146 Sceql
- 1.147 Scratch 3.0
- 1.148 Seeker
- 1.149 Self-modifying Brainfuck
- 1.150 Ser2
- 1.151 Shuffle
- 1.152 SICKBAY
- 1.153 Simplefunge
- 1.154 Slashist
- 1.155 Slim
- 1.156 SMITH
- 1.157 Core SNUSP
- 1.158 Solo
- 1.159 Something?Oops!
- 1.160 Splinter
- 1.161 Squishy2K
- 1.162 Stackstack
- 1.163 StaPLe
- 1.164 Starry
- 1.165 Stlang
- 1.166 Stop
- 1.167 Stupid
- 1.168 StupidStackLanguage
- 1.169 SuperPar
- 1.170 Super Stack!
- 1.171 Surtic
- 1.172 Suxesol
- 1.173 SyL
- 1.174 Tables
- 1.175 Tag
- 1.176 Telegram
- 1.177 The Waterfall Model
- 1.178 This=That
- 1.179 Thue
- 1.180 Tier
- 1.181 TPPL
- 1.182 Trigger
- 1.183 Turing-machine
- 1.184 Turth-machine
- 1.185 Underload
- 1.186 Unlambda
- 1.187 Unsquare
- 1.188 Urn
- 1.189 Var=Bar
- 1.190 Verbose
- 1.191 Wheat
- 1.192 When
- 1.193 Whenever
- 1.194 Whitespace
- 1.195 Wierd Machine
- 1.196 x-D
- 1.197 XENBLN
- 1.198 XRF
- 1.199 Yboy
- 1.200 Ypsilax
- 1.201 ZOMBIE
- 1.202 Tttt
- 1.203 Your
- 2 See also
Implementations
0815
|~}:i:%^:i:
2-ill
@ @
@@ @
@
# # #
@@
$ @
@ @ @
@ @
2KWLang
Requires 3 files: main.2kwl, 1.2kwl, and 0.2kwl.
Contents of main.2kwl:
print “\0”; import ((“\0” == “1”) ? “1.2kwl”: “0.2kwl”);
Contents of 1.2kwl:
print “1”; import “1.2kwl”;
Contents of 0.2kwl:
print “0”;
ACL
1A54B64BF78
A colon semicolon
j:1;i:l;?:l:=:j:2;p:j;g:3
Acyclic Tag
.48 .49^ +^
Set the input bit by changing the last line; "^" for 0, "+^" for 1.
Aeolbonn
The first line is the input. Printed with newline after each 1:
0 1 8 1 :1 : 4 1 :0
Without newline after each 1:
0 1 6 1 :1 4 1 :0
Alight
begin;var i;inp i;skip i;turn right;;out 1;turn right;
ot t
uh u
tg r
i n
0r
; r
en i
nr g
du h
;t t
;thgir nrut;;;;;;;
ALLSCII
With string input:
>'%%""C 92!?F 42?
With number input:
LC 44!?F44?
Alphabet Stew
rtsetviiv
ALPL
For the sake of simplicity, this program operates on bits instead of chars.
``?``=l[x.``1xx]l`00
Andromeda
Treats the queue as an input/output mechanism.
vv< >?v >^
Aubergine
=Ao=bi=oA=aA-ai-ai-ai-ab-a1:Ba=ib
Argh!
lglj j jShh lrllxpq 0jph0 j1k llk
AsciiDots
/(#1$_#) .----~#0$#& .-#?-^
asm2bf
It's using inline brainfuck to keep things relatively concise.
in_ r1
jz_ r1, %skip
raw .>
raw .>
raw .[
raw ..
raw .]
@skip
out r1
When assembled:
+>+[<[>>+>+<<<-]>>[<<+>>-]>[[-]>>,>>>>+<<<<<<+>>[<<[-]<+>>>-]<<<[>>>+<<<-]>[<<<[-]>[-] >>>>>>>>[<<<<<<<<+>+>>>>>>>-]<<<<<<<[>>>>>>>+<<<<<<<-]>[-]]>>>>>>[-]<<<<<<]<<<[>>+>+<< <-]>>[<<+>>-]>[[-]>>[.]]>+<<+<<[>>->+<<<-]>>>[<<<+>>>-]<[->+<<[>>>-<<+<-]>[<+>-]>>[<-> [-]]<[<<<+>>>-]<]>>[-]<<<<[>>+>+<<<-]>>[<<+>>-]>[[-]>>.<<]<<<[>>+>+<<<-]>>[<<+>>-]>[[- ]<<<[-]>[-]>>]<<]
Assembly language
This is not the actual program; this is the program in mnemonics.
MOV 01 00 MOV 00 01 JZ 0E 01 MOV 00 01 JMP 09
Backshift
Although it was intended as a sorting algorithm, it turned out to be computationally powerful.
x
x is the input. 1 does the same thing as 0 , 0 does the same thing as 1.
Beam
rS v >@<) @
Beeswax
{p'<T_
>{d
Befunge-93
&#::_.@#
Another variant, shorter but leaks stack:
&>:.:_@
Benul
00 00 00 07 00 00 00 00 07 07 07 07 00 07 07 00 07 07 00 07 07 00 07 07 00 07 07 00 07 07 00 07 07 00 07 07 00 00 07 00 00 00 07 00 00 00 00 07 00 00 00 00 00 07 07 07 00 07 07 07 00 00 00 07 07 07 00 07 07 07 00 00 00 07 07 07 00 07 07 07 00 07 07 07 00 00 07 07 07 00 00 00 00 07 00 00 07 00 00 00
beta-Juliet
beta-Juliet does not have conventional I/O, but can model input and output as events.
event AZeroIsOutput; event AOneIsOutput; event AZeroIsInput, causes AZeroIsOutput; event AOneIsInput, causes AOneIsOutput, causes AOneIsInput.
Betterave
?-1:[.1|1]!.0
Binary lambda calculus
010001101000000110000000010110111001011110000010010111111011111011110
BIT
LINE NUMBER ZERO CODE READ GOTO ONE LINE NUMBER ONE CODE GOTO ONE ZERO IF THE JUMP REGISTER IS ZERO GOTO ONE ONE IF THE JUMP REGISTER IS ONE LINE NUMBER ONE ZERO CODE PRINT ZERO LINE NUMBER ONE ONE CODE PRINT ONE GOTO ONE ONE
bitch
\>/;<
BitChanger
<<<<< <<<<< <<}<} }}}}} }}}}} <<<<< <<< }}}}} }}} [ <<<<< <<<<< <}<} }}}}} }}}}} <<<<< <<<<< }}}}} }}}}} ] <<<<< <<<<< <}
Bitoven
a?[aa-b+c+]d++++++[dd-b--------]c![bc!]
Bit Stupid
3-byte version.
,:.
Bitter
m0 = 0 >><
m0 = 1 ><(>><)
Bitwise Cyclic Tag
11
Black
In the code below, input is calibrated for 1.
input:O1 truth-machine in Black. calibrate machine by moving * under O or 1.
*
needs to use output extension. uses O instead of 0 because
the Javascript interpreter makes 0s vanish for some reason.
* * *
* * *
*
*
*
O * 1
*
*
boolfuck
,>,>,>,>,>,>,>,<<<<<<< [;>;>;>;>;>;>;>;<<<<<<<] ;>;>;>;>;>;>;>;
Brace For Impact
(t@)in(j^)(y~)
(q#)in = 0(j^)
(f=)
(e%)
(t@)out(j^)1
(w&)out = 1(j^)
(s;)out
(f=)
brainfuck
>>>,.[[->+<<+>]>-]<<<[<<]>[.]
I have a shorter one that needs negative cells:
,.[[-<+>>+<]>-]<<<[<<]>[.]
Another one based on subtraction(That is the simplest I can go)
,.[->+>+<<]++++++[->--------<]>[>[.]]
brainfuck--
.>>>>>>>.[.]
brainfunct
////////////////////////////////////////////////.@/,.@
Brainloller
Short, but needs negative cells.
Bruijndejx
Using 8-bit ASCII:
dis=[*0 0?]; no=*/./././.\.\././; yes=yes\./././.\.\././; main=*yes no?dis.dis.dis.dis.dis.dis.dis;
Bueue
x009
(x being either 1 or 0).
Bur
Bur doesn't have any form of input. Instead, change the character at index 24 to be 0 or 1:
~@0#0!!;~@1#1!!v@1@;~@,#0!~$0?#0!~$0!‽=0*#1!~$0!‽=1*;
A shorter example that tests 1 vs "anything else" rather than 1 vs 0. This time, the index in question is index 16:
~@1#1!!v@1@;~@,#0!#1!‽=1*#0!!v;
Burlesque
ri{^^}w!
If STDIN is not on the stack replace ri with either 0 or 1.
Carriage
111-@1\11-~!$$11+1+1+1+\1+1+1+1+1+1+@11-~!$$1-
An explanation is available.
Cfluviurrh
a< b=8 b*=6 z@=N z?a=b :Y a> z@=Y z?1=1 :N a>
In addition to fulfilling the tasks of a truth-machine, this program will experience mild satisfaction if the input is '0', and if the input is '1', it will feel extreme happiness (once) followed by mild distrust (an infinite number of times.)
C-INTERCAL
This program probably also works in CLC-INTERCAL.
DO WRITE IN .1 DO COME FROM .1 (1) DO READ OUT .1 PLEASE GIVE UP
CJam
ri{_p}h;
comp
;{^&}&
Counting
when cnt == 1
read acc
out acc
when acc == 0
halt
when acc == 1
out acc
Cubestate
,0 B' .1 F' D' M2 S U' B D S L2 M2 B' 8
Daoyu
$$$;
(
*[=[*] *S=S=S=S=S
( !) =S*S=S=S
(/!) =! *S*S=S=S
)
! =[=] *S=S=S=S
((!)) =[=] *S=S=S=S
(!) =[=] *S=S=S=S
(!)!
$$$$
((/(/(/(/([]!/[])))))
/(((([]!/[]!)/([]!/[]!))/(([/[]!]!/([]/[]))/([/[]!]!/[/[]]!)))
/((([/[]!]!/[/[]!])/(([]/[])/([])))/((([])/([]))/(([])/([]/[]!))))))
((/(/(/(/#))))
SSSSSSS
dc
?[pd;xx]d1:xx
Definer
There is no input in Definer; the line under constants must be either 0 = 0 for 0-input or 0 = 1 for 1-input. Below, 1-input is used.
Output can only occur if the program halts; in the case of 1-input, this program will produce an ever-expanding string of '1's.
constants: 0 = 1 definitions: 1 = 11 code: 0
And, just another all-input usable way:
consonants: 1 = 11 defenitions: code: 0
Difficult
a=thing.console.Input("")?
thing.keyword.switch a[
thing.keyword.wheneq 1[
thing.keyword.while true[
thing.console.printnd{a}?
]
]
thing.keyword.wheneq 0[
thing.console.printnd{0}?
]
]
DigFill
(&n*)n^n~n(&n~s)s~s
dotlang
•W~
W0`s#0#
W1`s#1>#v
^<<
Drive-In Window
Hi, welcome to Spill_The_Beans. Here is a menu. Vodka: $50 Here are your sides. Truth Serum: $2 May I take your order? OK, how much money should Person 1 have? Let's just do this until Person 1 has no more money! Person 1 would also like the Vodka, hold the Truth Serum. Let's just do this until Person 1 has no more money! Person 1 will pay for his order! Person 1 has no more money! Person 1 has no more money! Person 1 would also like the Vodka, hold the Truth Serum. Person 1 will pay for his order! Just wait while we decide... OK, that will be $48. Thanks for coming!
DROL
nj0002oxk"0001xw0001o
DStack
04KKCKT
Duck Duck Goose
duck duck duck goose duck duck duck duck duck duck duck goose duck duck duck duck duck duck duck duck duck duck duck duck duck duck duck duck duck duck goose duck duck duck duck duck duck duck duck duck duck duck duck duck duck duck duck duck duck duck duck goose duck duck duck duck duck duck duck duck duck goose duck duck duck duck duck duck duck duck goose duck duck duck duck duck duck duck duck duck duck goose duck duck duck duck duck duck duck duck duck duck duck duck duck duck goose duck duck duck duck duck duck duck duck goose duck duck duck duck duck duck duck duck duck duck duck goose duck duck duck duck duck duck duck duck duck duck duck goose duck duck duck duck duck duck goose duck duck duck duck duck duck goose duck duck goose duck duck duck duck duck duck duck duck duck duck goose duck duck duck duck duck goose duck duck duck duck goose
Emmental
;#58#46#58#63#49! ,:.:?
Emoji-gramming
😊🕐💖 😇🕐🕐 😇🕐🕐 😇🕐💖 😇🕐💖 😊🕑🕐 😇🕑💜 😊♈🎤 😵♈💜 😇🚨💕 😊📢🕑 😈🚨💕 😊📢🕐
EnScript
Please make sure that you add a "9" after your input!
INP A OUT A//19 or 09 LDA Z, 10 ENC A, Z OUT A
Eodermdrome
(0) zero-quits: z (0) quit! z (1) the-loop: (1) on-one: loop-the-loops loop-the-loop (1) loop-the-loop
ESOPUNK
COPY #STDI X TEST X = 49 MARK L COPY X #STDO TJMP L HALT
FALSE
^48-[[$1.!]$!]?0.
FerNANDo
r 0 0 1 1 0 0 0 a a 0 0 1 1 0 0 0 a a
><>
i68*-?!v1>:!n<
>0n;
Fishing
v+CCCCCC?=[C]
`1`{I}! P
[CC
{N
Foobar and Foobaz and Barbaz, oh my!
? and 255 and 0, oh my. 2 and 2 and ., oh my... 5 and 5 and 5, oh my... 0 and 0 and ., oh my. 3 and 3 and 3, oh my...
Forobj
n>n["0"d][[,"1"d\],[]$n"1"=?]$n"0"=?
Forte
10 GET 5 20 LET 40 + ((5 - 48) * 10) = 30 40 PUT 5 : END 50 LET 40 = 29 60 LET 61 = 60 + 61 61 PUT 5 : LET 60 = 61 + 1
FOS-X
This checks for the press of the 1 key on the keyboard as input for 1. All else assumed 0.
01 05 05 05 05 05 01 04 06 06 01 04 04 3B 04 21 2C 23 01 17 34 13
Fueue
[[)[~~~~()+1])])][[)$-----~1-[~:)~)[)[~:)~)]~:]:]~[~[$~H~~%~+])~48-):])~)~:])][)~[0]])$
Funciton
╔═══╗ ╔═══╗
║ ╟──────┬──────╢-49║
╚═══╝ ┌┘ ╚═══╝
┌┤ ┌┐
┌┘└┬┘└┐
│╔═╧═╗│ ╔════════════════════════════════════════════════════╗
│║255║│ ║ Funciton Truth-Machine v0.6 ║
│╚═══╝│ ╟────────────────────────────────────────────────────╢
└──┬──┘ ║ 0: Output "0" and terminate ║
│ ║ 1: Infinite loop, no output. Fill memory with "1" ║
│ ╚════════════════════════════════════════════════════╝
┌┴┐
└┬┘
┌────┴────┐
│ ╔═══╗ │
│ ║ 0 ║ │
│ ╚═╤═╝ │
│┌───┴───┐│
└┼─┐ ┌─┼┘
├┐│ │┌┤
└┘│ │└┘
┌┴┐ ┌┴┐
└┬┘ └┬┘ ╓───╖
└─┬─┘ ║ ∞ ║
┌───┴───┐ ╙─┬─╜
│┌─────┐│ ┌─┴─┐
││╔═══╗││ ╔══╗ │┌─┐│ ╔╤═════════════════════════════════════╗
││║048║││ ║21╟─┼┴─┘│ ║│ Infinite loop with character append ║
││╚═╤═╝││ ╚══╝┌┴┐ ┌┴┐ ╚╧═════════════════════════════════════╝
│└──┤ ││ └┬┘ └┬┘
│ ┌┴┐ ││ └─┬─┘
└──┤ │ ││ ┌─┴─╖
└─┘ ││ │ ∞ ║
┌──────┘│ ╘═╤═╝
│ ╔═══╗ │ │
│ ║049║ │ │
│ ╚═╤═╝ │ │
│ ┌─┴─╖ │
│ │ ∞ ║ │
│ ╘═╤═╝ │
└──┐└┬──┘
└┬┘
│
│
│
│
FurryScript
It does not do interactive I/O; output is only at the end and input is only at the beginning, so like Kipple and Squishy2K it won't work (unless perhaps, it can use lazy evaluation while knowing the stack effect in advance that it won't use up the data on the stack).
1[ <1> 1# ] PAR DUP ~#
Gaot++
bleeeeeeeeeeet bleeeet bleeeeeet bleeeeeeeeeeeeet bleeeeeeeeeeeeet bleeeeeeeeeeeeet bleeeeeeeeeeeeet bleeeeeeeeet bleeeeeeeet
Gentzen
<- "stdlib"; <- "iolib"; do_zero : () / ($1(iosys) |- $2(@ ++)); do_zero = [io,lp] cut '0' [x] loop x lp [_,_,k] outbyte io x k; do_one : () / ($1(iosys) |- $2(@ ++)); do_one = [io,lp] cut '1' [x] loop x lp [_,k,_] outbyte io x k; truth : () / ($1(iosys), $2(|\|) |- $3(@ ++)); truth = [io,n,lp] cut '0' [z] cmp n z (do_zero io lp) (do_zero io lp) (do_one io lp); main : () / ($1(iosys) |- $2(@ ++)); main = [x,y] cut ([z] inbyte x) ([z] truth x z y); -> main;
GetWhen
when(!input()): output(0), ip=% //If input is 0, output 0 and terminate. when(input()): output(1) //If input is 1, output 1 forever.
Note: This program would create a lot of unnecessary lines that are not executed. Below is a more memory efficient program:
1: x=input(), output(x), ip=x+2 //Output the input, then go to line 2 if it was 0 or line 3 if it was 1 2: ip=% //Halt 3: output(1)
Glass
{M[m(_x)0I!0c.?1O!1o.11?22"1"5S!5e.?=/(_x)11?\]}
Glypho
- Shorthand notation:
11+ddddd**>++* ido d>-+[\o\]
- ABC notation:
aabc aabc abba abab abab abab abab abab abbc abbc aaba abba abba abbc aaab abab abbb abab aaba abca abba abac aabb abbb aabb abcb
- Self-documenting Glypho code:
ffirsstpussuhfhforortytyeieighghtoonthhesstsaccak..kXYYZoooutptputttififeeqeualutoot4848lloopaaannddoutu
GolfScript
~{..p}do;
golfuck
:{;};
Grawlix
?(=^)>+[=]
GridScript
#TRUTH MACHINE. @width 9 @height 5 (1,1):START (3,1):INPUT INT (5,1):GO EAST (7,1):SWITCH =1 (7,3):PRINT 1 (7,5):GO WEST (5,5):GO NORTH (9,1):PRINT 0
Hollow
{1}>
{.0}\>|>>
{1}:
{0}:?
HQ9funge
1 byte solution, shorter than everything else on this list.
T
Hurgusburgus
i(48)^:?{(1)o}?;(0)o@
Integ
}()([())?(-(48)({()))(](48))(?(-(49)({()))(~()(](49)))())
IRP
<mRoman> Would somebody please say 0 if the next number I say is 0, or say 1
in an infinite loop if the next number I say is 1?
ISCOM
$=1 1=@ ?[1]=0 #=FALSE ?[1]=1 #=TRUE #=END ;;TRUE @=1 #=TRUE ;;FALSE @=0 ;;END
Isolated
00000011 11000000 10000100 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 10111100
itflabtijtslwi
/ ///
//
GGChGG
/0P1/0/
/./<\\\\>\\\\\\/
/P0/
1
./<.\>./<.\.\.\.\>.\.\.\.\.\.\./
./P.0./P.2./
./P.1./P.0./
./<.\>././
./P.\2./P.0./
P.1
/
/P1/P0/
/<>//
/P2/P0/
ChP1
ΙΧΘΥΣ
ι # above line increments accumulator to 1, delete above line for 0 Ις ΣχΧΘ ΙσΧιιθιιιθχΘ ς ΙΣΧιιθιιιθΥΣΘ ς σΥ
Jolverine
.*.....*......*......*......*......*.....*...*...*......*.....*..*......*....
.
.
.
.
*
.
.
.
.
.
.
*
.
.
.
.
.
.
*
.
.
.
.
.
.
.
.
.
.
.
*
. .
. .
. .
* *
. .
. .
* *
. .
. .
* *
. .
. .
. .
*
Jug
Since Jug has no input function, the second line "fill(0);" must be omitted (for 0) or not (for 1). Below, it is not omitted.
jug(0, 1);
fill(0);
echo(volume(0));
drain(0){
echo("1");
};
JUMP
0 IF 0 THEN GOTO 2 ELSE GOTO 1 1 OUTPUT 1 GOTO 1 2 OUTPUT 0 GOTO 3
Karma
86*?-, \\;@<
Keg
?\1=[{1.}|_0]
KimL
var.decl string a io.in a One: io.out a ctrl.goto One if a = "1"
Kipple
Kipple only produces output if the Kipple program halts, so it is not possible to output an infinite number of 1 characters. However, the following program is probably a Kipple truth-machine in principle.
i>a-48 a? (a 49>o) 48>o
Kkipple
This program is very similar to its Kipple equivalent, but it actually works since Kkipple adds interactive I/O.
io>a-'0' a? (a '1'>o*) '0'>o*
L00P
(:|;:(|&))
Linguine
1[0?,0~48:2]3 2[0$]0 3[0$]3
LOCK
{main
:a
$a
^a
?one
<main
}
{one
$a
}
logOS
Editor paste\nswitch Email\nsend\nswitch Terminal\nrun replace "\n" with newline cut minimise LOOP paste minimise Email refresh copy switch Editor paste replace "1" with "switch LOOP\ncopy\nswitch Terminal\npaste\nrun" replace "\n" with a newline replace "0" with "rem" cut minimise Terminal paste run
Losescript
T
Ly
n:u![;]1[u1]
Madbrain
r 1 = 1 p 3 j
MailBox
Untested due to lack of interpreter.
box 0 (once) send input to 1 (contains "1") output box 1 (contains "0") output (contains "1") send "1" to 0 forward to 1
Malbolge
(aONMLKJIHGFEDCBA@?>=<;:98765FD21dd!-,O*)y'&v5#"!DC|Qzf,*vutsrqpF!Clk|ih
gfed9(T&6KoOHZYXWVUTSRQPONM]KJIHGFEDCBA@?>=<;:9876"'~g|edybav_zyxwvotsrq
pSnPlOjibKfedcba`_XA??ZYRW:UTSLQ3ONMLK.IHGFE>CBA@?"=<;:38765432s0/.n,+*)
j!&%f{"!~}|_zyxZvYnsrqpRnmlkjML:f_^GF!
Normalized:
jivvvvvvvvvvvvvvvvvvvvvvvvvvv<ivv*jovv/vvovvoivvv//v*vp<ivvvvvvvji*vv<vv vvvv*/o/jp<opvvvvvvvvvvvvvvivvvvvvvvvvvvvvvvvvvvvvpopjpjjpjjpjooooopoooo ojo*ojoopjoooooooopj*joopojooopo*ooooojooooopooooojoooopooooooojooo*oooo jpoojpooooojooo*ojpoooo*ooooojj/oppjji
Malbolge Unshackled
(aONMLKJIHGFEDCBA@?>=<;:98765FD21dd!-,O*)y'&v5#"!DC|Qzf,*vutsrqpF!Clk|ih
gfed9(T&6KoOHZYXWVUTSRQPONM]KJIHGFEDCBA@?>=<;:9876"'~g|edybav_zyxwvotsrq
pSnPlOjibKfedcba`_XA??ZYRW:UTSLQ3ONMLK.IHGFE>CBA@?"=<;:38765432s0/.n,+*)
j!&%f{"!~}|_zyxZvYnsrqpRnmlkjML:f_^GF!
MarioLANG
;[!:! ==#== >:< "==
Math++
2+2*!?>$ 1>out 2>$ 0>out
Maze
##,##,##,##,## ##,##,^^,##,## ##,##,<<,##,## ##,..,AA,%D,## ##,>>,##,>>,## ##,(),##,%U,## ##,##,##,##,## AA-> IF ==0 THEN %L ELSE %R
Microscript
i{z1p
Minks
a INP a OUT a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC x a DEC b a DEC loop a dec a b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b INC b DEC loop b dec b loop OUT
MIX (Knuth)
The following has quotation marks since it has a space in the first character position (the quotation marks should not be punched into the card). Expects input in typewriter (one character only, at leftmost position) and output also in typewriter.
" 0 R6 A R4 0 AP 7A7I F 7V 0 R7 E 9 BE "
Muriel
A : ~; .A; D : ".\"1\"; Q : \"D : \\\"\" + |D + \"\\\";\";Q : Q + D;@Q"; Q : "D : \"" + |D + "\";"; Q : Q + D; n : &Q * #A; Q : %Q,0,n; @Q
Nhohnhehr
+---+ |@/0| |$? | |#\1| +---+
No Literals, Gotos Only, Final Destination!
\,a a+a+a+a+a+a+a+a+a,b b+a+a+a+a,c ?cb,d :cb*+a+a :cb*+d
NOR
1 0 INP in1 50 MUX in1, 100, 200 100 OUT 0 150 OFF 200 OUT 1 250 JMP 200
NULL
17328365648
Numeric Topline
16469004801100010
OOLANG
start.label; var.Input.0.in; var==0.4.7.ifa; 0.print; .halt; var==1.9.9.ifa; 1.print; start.goto;
Ouroboros
r.*.n!(
PATH
/ \
$,>-}+{v\>-}+{^}.#
/ \ > ^
\./!}/
pb
^t[B]vb[T]w[B!48]{b[49]v}
pbrain
++++++[->++++++++<]>(.)+(.:),:
Piet
Pizza Delivery
?[31`]30`.
PoGo
if po uf to go
Powder
{
"if" :
{
"1" : "infinite_loop",
"0" : "halt"
}
"input" : 1,
"result" : "if".'input',
"halt" :
{
"output" : 0
},
"infinite_loop" :
{
"output" : 1,
"result" : "infinite_loop"
}
}
Print Function Deluxe
$&=1p0 . p1 @2
Pxem
getchar() version
- File name
.i0.z1.o01.a0.pxe- File content
- don't care
scanf("%d", value) version
- File name
._.w1.o1.a0.pxe- File content
- don't care
pyhton [sic]
The following truth machine takes inputs that are not multiples of seven as 1 and multiples as seven as zero. This makes 1 and 0 behave as expected, naturally. Making behaviour undefined for input other than 1 or 0 would have been much simpler, but I only thought of that after finishing the program.
i)))()(9)9))9(())<<<5<53<3<<355<<,,,>,>1,1,,1>>,,666@6@/6/66/@@66 0 07 7 700 hhh?h?.h.hh.??h' ''I ''I '' I l!={#["2!60)]|8]]]]]]]]]]]]]]hI'~99(l];I_=
Pyth
Wp
Q-Ref
_innum(x)[_outnumcount(x)x?]
QWOP
OW1P1W1OW0P0
Recurl
Since Recurl has no input facilities, the first line must be either A:<0> or A:<1>.
- Using an infinite list:
A:<0> A?0< A:<1,A> > A#0
- Using a loop:
A:<0> A#1 A@0< A#1 >
Redivider
main:
{ /0/; "0" }
| { /1/; "1" + main["1"] }.
ResPlicate
0 -49 13 1 48 8 1 0 0 4 2 0 49 4 2 48 0
REVER
(<i,>o) {
+d(!x)=[0**x='1',0='0'];
+x=0;
d=i;
*d(x);
o=d;
x-=1;
*'0';
o=d;
}
REVERSE
GETXA SKIP PUTXB XB+24 XA-48 REVERSE=XA XB+25 SKIP REVERSE PUTXB REVERSE
ROOP
I wX nw hO
Sceql
______&! \ -= --------= ________= / ==_== \ =*= / =-*
Scratch 3.0
Seeker
!x.@x:&.#x=0!0.#x=1!1.|.$0._.|.$1.>1
Self-modifying Brainfuck
1,.[-<->]<[<]>[.]0
Ser2
!'@run-:#:/loop-:'@input-:#: !loop-:'@iopair--:#:'0:/exit-:'@output--:#:'0: !loop-:'@iopair--:#:'1:/loop-:'@output--:#:'1: !exit-:'@iopair--:#:'0:/#:
Shuffle
🃑🃞🂲🂾🃏🂷 🃞🂱🂮🃁🂾🂱🂾
SICKBAY
100 INPUT A% (200+A%) PRINT 0; 200 PRINT 1;:GOTO 200
Simplefunge
>ivv o ^ >V 0 o @
Slashist
VAR:<choice>:""
VAR:<ZERO>:{0}
VAR:<ONE>:{1}
INP:<choice>
NCL:ZRO:[<inp> = {0}]
CEL:ONE:[<inp> = {1}]
LOP:ZRO
OUT:<ZERO>
NUK:
LOP:ONE
OUT:<ONE>
ELP:ONE
Slim
0@0@0@0@0@0@0@0@0@| :X| :X|@< :X|@< :X| :X| :X| :XX| :^^@^^@<^^^^@0@ :0^^@^^@^^^@^0@0@0@0@0@0@0@0@ :
SMITH
MOV R3, 3 MOV R0, TTY MOV R1, R0 SUB R0, 48 NOT R0 MUL R0, 3 COR +1, +5, R0 NOP NOP NOP COR +1, -3, R3 MOV R0, 48 MOV TTY, R0 STOP MOV R2, 49 SUB R1, 49 NOT R1 MUL R1, 2 MOV TTY, R2 COR +1, -1, R1
Core SNUSP
$,.>++++++!/-<-------->\ /.\!+>>/!?<\?<++++++++>/ \./
Solo
solo
Something?Oops!
? 2?Oops, 0 0?Oops. 0 6?Oops, 0 1?Oops. 0 4?Oops, 1 2?Oops!
Splinter
As the language has no input, place 'Z' (for 0) or 'O' (for 1) inside the first {}. Below, 0 is used.
I{Z}
Z{\0}O{\1O}I
Squishy2K
Like the truth-machine in Kipple, this is only a truth-machine in principle, as the infinite string of 1's that is generated is never output (at least on the reference interpreter; the language afaik would not disallow implementations that lazily output the result.)
* main
{
"0"? "0"!
"1"? "1" main("1")!
}
Stackstack
inputnum while "1" print 1 endwhile "0" print
StaPLe
eval;pop;dup;[if;put;dup;swap;[eval;pop;dup;push;dup;];];dup;get;
Starry
, + + + * *' + . '` + . +' `
Stlang
M ./r(i1=={{.$?0}{.1(i@}.0U}{.0(i@}? \
For other versions see Stlang#Truth-machine.
Stop
,:
Stupid
v=IN
v=OUT
v==1
v=OUT
StupidStackLanguage
htxux
SuperPar
![STDIO]=V,IN,OUT
!!out{OUT.V=!1;do*@OUT;}
!!in{!1=@IN.V;}
{
machine={
out[#.input];
#.input*48;
};
in[machine.input];
do$@machine;
}
Super Stack!
input if dup output fi output
Surtic
S1"\n"C1++++++++FC1[C1+++++]FC1[C2+]C2+!B1WB1[IC3?B2(C3==C1)?B3(C3==C2)IB2{OC3OS1!B1}B3[WB1[OC3OS1]]]
Suxesol
As there is no input in Suxesol, the first block must be either [0] or [1]. Below, [1] is used.
[1][0*[?[1.]]0.]
SyL
ke ge no
ki yo gihi wewo
we
ke no yo geha we le wu no wo
ku le
we
yo giho we no wo
wo
wo
ke no yo geha we la wu no wo
yo giho we no wo
Tables
Input index: "input"
Output index: "output"
If input is not 0 or 1, the program will not do anything.
On zero, the program outputs 0 and terminates.
On one, the program outputs 1 and goes into an infinite loop (unable to set infinite indices of a table)
| Line Number/Index | Instruction/Value | ||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 |
| ||||||||||||||||||||||||||||||||||
| 1 |
| ||||||||||||||||||||||||||||||||||
| 3 |
| ||||||||||||||||||||||||||||||||||
| 4 |
|
Tag
As there is no input in Tag, the queue should be initially populated with 0 or 1.
zero :01(p0#) one :11(p1) print:p2!(p1)
Telegram
START INPUT X STOP PRINT X STOP GO TO 2 IF X EQUALS 1 STOP END
The Waterfall Model
[[7, 4, 4, 4, 4], [6, 1, 0, 0, 0], [4, 2, 2, 0, 2], [5, 2, 2, 2, 2], [?, 0, 0, 0, 0]]
Second row is the output clock, last row is the input. Using the recommended number encoding, replace ? in the last row with (input * 2 + 3), i.e. 3 for 0, 5 for 1. On 3(=0), the output clock will be set to 3(=0) and the program will cleanly exit. On 5(=1), the output clock will alternate between 5(=1) and 4(NaN?) without terminating.
This=That
a=input a=print while loop i=a~~1 a=print while loop i=end
Thue
a::=::: -0-::=~0 1::=~1 --::=-1- ::= -a-
Tier
0.tier
}=_{#
>^
TPPL
ENTER BATHROOM SET RIP ADD ADD ADD ADD CHECK 1 YES? 19 TRASH PULL WIPE PULL WIPE WIPE PULL WIPE RIP FLUSH EXIT TRASH WIPE PULL WIPE PULL WIPE WIPE PULL WIPE RIP FLUSH ADD ADD ADD ADD JUMP 20
Trigger
$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$.$$-111..$-000
Turing-machine
Q1:E>1 Q0:O>0 E0:E>1 O0:F<0
Turth-machine
Ask for input If the input is 0 Output 0 Whereas if the input is 1 Repeat infinitely Output 1
Underload
This is an example of an implementation in a language that has no input facilities, only output. In the first parentheses, use ! for 1-input, and nothing for 0-input. The program below is calibrated for 1-input.
(!)((1)S:^)~((0)S)~^:^
Unlambda
``c`@?1`c`|i
Unsquare
ioAx>Io<
Urn
(:(1:::a)::)(a:(1:::)(1:::a)::a)
Please note that an Urn program needs to receive an EOF after the input of 0 or 1; no input-collecting (loop) in this language can end if it doesn't reach the end of input (that is: receive EOF).
Var=Bar
v=1N v=0UT x=v==1 v=0UT x=STOP
Verbose
Untested. Input must be either "NULLA" for zero or "I" for one.
GET A ROMAN NUMERAL TYPED IN BY THE CURRENT PERSON USING THIS PROGRAM AND PUT IT ONTO THE TOP OF THE PROGRAM STACK PUT THE NUMBER -III ONTO THE TOP OF THE PROGRAM STACK MOVE THE FIRST ELEMENT OF THE PROGRAM STACK TO THE SECOND ELEMENT'S PLACE AND THE SECOND ELEMENT OF THE STACK TO THE FIRST ELEMENT'S PLACE GET THE TOP ELEMENT OF THE STACK AND OUTPUT IT FOR THE CURRENT PERSON USING THIS PROGRAM TO SEE MOVE THE FIRST ELEMENT OF THE PROGRAM STACK TO THE SECOND ELEMENT'S PLACE AND THE SECOND ELEMENT OF THE STACK TO THE FIRST ELEMENT'S PLACE GET THE FIRST ELEMENT OF THE PROGRAM STACK AND THE SECOND ELEMENT OF THE PROGRAM STACK AND IF THE SECOND ELEMENT OF THE PROGRAM STACK IS NOT ZERO JUMP TO THE INSTRUCTION THAT IS THE CURRENT INSTRUCTION NUMBER AND THE FIRST ELEMENT ADDED TOGETHER'S RESULT
Wheat
input x if x "0": terminate - v THE INPUT DATA FOR THE TRUTH-MACHINE BELOW (USE "0" OR "1") output "0"
When
Untested.
out = 1 when out out = in
Whenever
1 2#-read();
2 defer(1) print("0") 3#-1;
3 defer(2) again(3) print("1");
Whitespace
Here, each character used in instructions (space, tab, and linefeed) is preceded by S, T, or L, respectively.
S S L T L T T S S L T T T L S S L S L S T L S T S L S S S S T L T S S T L T S L L L L .
Wierd Machine
ICHF0JQI1QL∞
x-D
:E 8-------> x-----> x8S 8:C 8> :) 8P :( 8< 8P
XENBLN
Ë=NzzŹo
XRF
0AFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF FFFFF 1BFFF 31AFF
Yboy
,v~1_1:..$^...!
Ypsilax
If a 0 is placed immediately to the right of 'IN:', a single 0 will appear immediately to the right of 'OUT:'. If a 1 is placed immediately to the right of 'IN:', an infinite number of 1's will eventually appear immediately to the right of 'OUT:'.
( ) ( )
------ ------
N:0N:0 N:1N:1
T: T:0 T: T:! ( )
! 1!
----
IN:
OUT:
ZOMBIE
ZOMBIE, like Underload, lacks input facilities. For 0, the third line should be "remember 0". For 1, the third line should be "remember 1".
zombie input is a zombie summon remember 1 animate zombie bleck is a zombie summon task go taste remembering input 0 good say "0" bad shamble say "1" around spit animate animate
Tttt
hcaaaaibdcbbbbbbcjdcifjf
Your
Your Your Your Your
