We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.
User:Tommyaweosme/brainfuck turing completeness proof
Jump to navigation
Jump to search
naw jk this is every logic gate in brainfuck
PUT SOME MORE IN THE COMMENT SECTION BELOW, AND I'LL PICK MY FAVORITES ON THE NEXT EPISODE OF MORTY ON THE TALK PAGE
some terms
a-z are inputs (, for 0/1) A-Z are outputs (. for 0/1)
and gate
a>b[<+>-]+<--[>-<[-]]>A
not gate
a->+<[>+<[-]]>[<+>-]<-A
nor gate
a>b[<+>-]+<[>-<[-]]>A
you may notice this is just a shifted and gate
the requirement is now 0 not 2.
this also is what makes the nor, but with 1 instead of 0.
one/true gate
a>+A
or gate
a>b[<+>-]<[>+<[-]]>A
xor/mask gate
a>b[<+>-]+<-[>-<[-]]>A
you may notice this is just a shifted and gate
the requirement is now 1 not 2.
this also is what makes the nor, but with 0 instead of 1.
yes gate
aA
zero/false gate
a>A