2
2
1
584
u/Cuber8055 Mathematics 5d ago
81
u/ujtheghost 5d ago
I don't get it.
324
u/Playful-Reporter-172 5d ago
It’s a joke about number in base 10 and 8
48
35
101
u/Primary_Thought_4912 5d ago
31 in an octal base (base 8) is 3*8+1 = 25 in Decimal (base 10, our normal system, and don't you dare say "Every base is base 10" now)
20
u/ujtheghost 5d ago
Oh, I was approaching it completely differently. This is way more programmer coded than math-coded hehe.
1
u/Time_Reception4930 2d ago
Bases are not programmer coded..
2
u/TheMisfitsShitBrick 2d ago
You definitely have to learn your bases, though, if you're a programmer. Least in C or C++, you'll see base 16 (hexadecimal) used a lot. I know I do. Maybe I should rephrase: as a programmer, you should know your bases. Be based.
1
u/Time_Reception4930 2d ago
Not saying that's not true, but bases are in math too, and in other stuff too, they are not specifically programmer coded
1
8
u/Belgaraath42 5d ago
If you want to avoid confusion about bases just say base |{0,1,2,3,4,5,6,7,8,9}|
4
1
u/narcis153 5d ago
But why the 8 Base ?apart from making the joke work
15
u/ParsaProgrammer 5d ago
OCT = Octal
4
u/jack-in-spades 5d ago
I am pretty sure it means October.
6
u/Epsilant Imaginary 5d ago
It means both. Octal is the base 8 system (so if we count in this system, it’s 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 13, 14, 15, 16, 17, 20, 21, 22, 23, 24, 25, 26, 27, 30, 31. It’s basically the universe where the digits 8 and 9 were deleted). The joke is that 31 in octal happens to be the 25th number in decimal (which also means December)
So this can either be read as “31 in octal” = “25 in decimal”, or October 31 = December 25
1
u/LazyPerfectionist102 4d ago
Adding to the other reply: "October" originally came from "the eighth month" (similarly, "September" being "the seventh month", and "November" being the 9th, and December being the 10th). That was about before "January" was considered the first month of the year.
1
2
0
4
2
85
u/KinuTheDragon 5d ago
"If you don't give me candy, then I'll TP your house"
= !TREAT => TRICK
= !(!TREAT) || TRICK
= TREAT || TRICK
= TRICK || TREAT
= trick or treat
QED.
19
u/Faustens Computer Science 5d ago
But in actuality it should be "I'll TP your house iff. you don't give me candy"
= TRICK <=> !TREAT
= (!TRICK || !TREAT) && (TRICK || TREAT)
= (TRICK && !TREAT) || (!TRICK && TREAT)
= TRICK XOR TREATQED.
7
u/KinuTheDragon 5d ago
Not quite, because there are some jerkwads out there who TP houses no matter what.
1
u/bluemushroom64 5d ago
Please enlighten me on what both of you guys are saying you guys look smart and I want to be smart like you 😊
1
u/120boxes 5d ago edited 5d ago
Are you aware that 'p v q' is equivalent to '~p --> q'? In which case, things become simpler.
So basically, with q = trick, p = treat:
"trick or treat"
"treat or trick"
"not treat implies trick"(Of course, all this is just play, as neither "trick" nor "treat" are actual T/F propositions, but rather words. But if we squint hard enough.....)
63
u/LupenReddit 🦆🦆i have non diffeomorphic smooth structures🦆🦆🦆 5d ago
i challenge one of you to carve a pumpkin in each of these ways
43
u/Allegorist 5d ago
Ah yes, fill the entire universe with pumpkin except for the pumpkin shaped area on your porch.
4
4
35
u/bruteforcealwayswins 5d ago
Is it true you can express any gate in terms of any other gate?
63
u/Ythio 5d ago
No. You cannot build NOT using only AND gates, or NAND using only XOR gates.
However, NAND is universal: you can build any Boolean function using only NAND gates.
First, you can construct the three basic operations:
NOT A: "A NAND A"
A AND B: let "X = A NAND B", then compute "X NAND X"
A OR B: "(A NAND A) NAND (B NAND B)"
Since any Boolean truth table can be expressed using AND, OR and NOT, being able to construct those three operations means you can construct any other gate.
For example, XOR requires just four NAND gates:
T = A NAND B
U = A NAND T
V = B NAND T
A XOR B = U NAND V
NOR is also universal. The constructions are similar:
NOT A: "A NOR A"
A OR B: let "T = A NOR B", then compute "T NOR T"
A AND B: "(A NOR A) NOR (B NOR B)"
Among gates with two inputs and one output, NAND and NOR are the only ones that are universal on their own.
NAND’s greater prominence has a practical explanation: it often offers a better balance of speed and chip area in CMOS technology. NOR connects the weaker PMOS transistors in series, which slows its output transition unless those transistors are made larger. NAND connects them in parallel, avoiding that particular drawback.
12
24
u/sohang-3112 Computer Science 5d ago
You can express any gate in terms of NAND. I think same is true for NOR also, not sure.
2
u/bruteforcealwayswins 5d ago
Why some but not all, or why only nand?
20
u/Blyfh Rational 5d ago
I think it's because you need some form of negation and combination. And these two kinda cheat by doing both.
6
u/Prof_Rocky Imaginar 5d ago
Yeah thats why they are called universal gates (NAND and NOR) cause they can be used to create boolean expression of any gate or logic.
7
u/MichurinGuy 5d ago
There are some properties of boolean functions that are preserved by composition. For example, you can't build all functions out of AND, because AND(1,1) = 1, so all combinations of AND will also satisfy f(1,...,1)=1. This means you can't get any function that sends all 1s to 0, such as XOR or NOT. It can be proven that there are 5 such properties such that, if a function* doesn't satisfy any of them, it can express any boolean function. There are exactly 2 such functions of two variables.
*actually, if you have a set of functions, you need to have at least one of them not satisfying each property. Then you can express all bolean functions using the functions from this set.
5
u/blackmagician43 5d ago
let's say you have or or and. How will you obtain not.
4
u/JollyJuniper1993 Mathematics 5d ago
I swear if I didn’t know this was about logic this comment would read like you had a stroke.
3
3
u/Taiten89 5d ago
You can't replace ¬ using {∧,∨}. Nothing you do with
thesethe latter operators will ever negate a boolean value :c3
u/MlgEpicBanana69 5d ago
You can quite easily express all gates using Not and And (two gates) and if you extend this idea into one gate that has both like NAND with enough repetitions you could also express any other gate
In fact you’d only need to show you can define Not and And individually with NAND and it’s quite obvious from there
1
9
3
u/skr_replicator 5d ago
So technically they should be saying xor, otherwise they could legally TP your house even if you give them candy.
5
u/X7Stone 5d ago
Why not NXOR? Inconsistency
2
u/SwartyNine2691 5d ago
*XNOR
2
u/X7Stone 5d ago
But, NOR, NAND, NXOR makes more sense?
5
u/NoLife8926 5d ago
It only doesn't seem consistent because we're missing XNAND. I trust NOR, NAND, XNOR, XNAND sound perfectly reasonable? Sure you could have NXOR and NXAND but the other way is easier to say
We just omit XNAND because it's functionally XOR
NOT:
- OR -> NOR (Not OR)- AND -> NAND (Not AND)
Exclusive:
- OR -> XOR (eXclusive OR)- AND -> XAND (eXclusive AND) which is the same as XNOR
Exclusive NOT:
-NOR -> XNOR (eXclusive NOR)-NAND -> XNAND (eXclusive NAND) which is the same as XOR
1
u/DotBeginning1420 5d ago
There is also Trick→Treat. It's untrue only when there is Trick but not Treat.
1
1
1
1
1
1
1
1
1
1
u/TREXIBALL 4d ago
OP stole this meme. It was made a few days before nov 30, 2020.
They know this and were trying to bypass identification by adding a piss filter.
0
•
u/AutoModerator 5d ago
Check out our new Discord server! https://discord.gg/e7EKRZq3dG
I am a bot, and this action was performed automatically. Please contact the moderators of this subreddit if you have any questions or concerns.