Members in Shoutbox
None.

Shoutbox Search
Search for:


Shoutbox Commands
/w [name] > Whisper
/r > Reply to last whisper
/me > Marks as action

Shoutbox Information
Moderators may delete any and all shouts at will.
Global Shoutbox
Please log in to shout.
Pages: < 1 « 3341 3342 3343 3344 33453539 >

[2014-9-23. : 4:15 am]
O)FaRTy1billion[MM] -- I'm using a circuit design program :P
[2014-9-23. : 4:15 am]
O)FaRTy1billion[MM] -- because this program will say a'b+b'a is the most simplified form
[2014-9-23. : 4:15 am]
jjf28 -- convert to transistors, use direct simplification :P
[2014-9-23. : 4:15 am]
Jack -- ah
[2014-9-23. : 4:15 am]
O)FaRTy1billion[MM] -- I mean that I feel like this circuit could be simpler if it contained XORs
[2014-9-23. : 4:14 am]
Jack -- I don't see any :(
[2014-9-23. : 4:14 am]
O)FaRTy1billion[MM] -- I'm betting this can get simplified further
[2014-9-23. : 4:14 am]
O)FaRTy1billion[MM] -- In what I am doing. http://i.snag.gy/L69mR.jpg I can see them hiding in there. :P
[2014-9-23. : 4:14 am]
Jack -- What XORs?
[2014-9-23. : 4:13 am]
O)FaRTy1billion[MM] -- how do I simplify the xors out of this ... I know it can be done :O
[2014-9-23. : 4:11 am]
jjf28 -- i'd say hi from four sources but that's alotta spam :P
[2014-9-23. : 4:11 am]
O)FaRTy1billion[MM] -- my thing doesn't have xor. ;o It says A'B+AB' is the simplification for XOR's truth table
[2014-9-23. : 4:11 am]
Zoan -- truth table*
[2014-9-23. : 4:11 am]
Zoan -- FUCK IT just make a truth able for the damn thing lol
[2014-9-23. : 4:10 am]
Jack -- No man you need to do more boolean algebra
[2014-9-23. : 4:10 am]
Dem0n -- I need to go to sleep.
[2014-9-23. : 4:10 am]
Jack -- please try again later
[2014-9-23. : 4:10 am]
Zoan -- Hello jjf. Hello jjf. Hello jjf. Hello jjf.
[2014-9-23. : 4:10 am]
Jack -- yeah zoan is high right now
[2014-9-23. : 4:10 am]
Dem0n -- I don't get what you just did lel
[2014-9-23. : 4:09 am]
Zoan -- Now holy shit do I gotta do my homework
[2014-9-23. : 4:09 am]
Zoan -- N
[2014-9-23. : 4:09 am]
Zoan -- so yeah, it simplifies to q v (p ^ r)
[2014-9-23. : 4:09 am]
Zoan -- and if that is true, then the first little bit from the original equation is true
[2014-9-23. : 4:09 am]
jjf28 -- i'll prolly stop there :P
[2014-9-23. : 4:09 am]
Jack -- And two Jacks!
[2014-9-23. : 4:09 am]
Jack -- Four jjf28s!
[2014-9-23. : 4:09 am]
Jack -- Jack
Jack shouted: Now we have (p OR q) AND (!p OR q OR r)
going back to this, (A OR B) AND (A OR !B) = A, but I don't know if it matters that the R is there too
[2014-9-23. : 4:08 am]
Zoan -- so if that in turn is false, the first statement is true. For it to be false, we need q v (p ^ r)
[2014-9-23. : 4:08 am]
Jack -- Triple!
[2014-9-23. : 4:08 am]
Jack -- oh snap, double jjf28!
[2014-9-23. : 4:07 am]
jjf28 -- oh, is it doubling time?
[2014-9-23. : 4:07 am]
Zoan -- which is ~q ^ ((~p ^ r) v (p ^ ~r))
[2014-9-23. : 4:05 am]
O)FaRTy1billion[MM] -- I don't know about you guys, but I solved my problem. :P
[2014-9-23. : 4:05 am]
Jack -- no I guess we can't get rid of P because that last statement would mean we just have q or r I think
[2014-9-23. : 4:04 am]
Jack -- Assuming we can, we now have q AND (q OR r)
[2014-9-23. : 4:04 am]
Zoan -- every other instance those two things will be true
[2014-9-23. : 4:04 am]
Zoan -- for the second two things ( (q v p v ~r) ^ (q v ~p v r) ) to be false, we need (~q ^ ~p ^ r) v (~q ^ p ^ ~r)
[2014-9-23. : 4:03 am]
Jack -- now my gut instinct says that p is now irrelephant but I forgot which rule lets us get rid of it
[2014-9-23. : 4:03 am]
Jack -- now my gut instinct says that p is now irrelephant but I forgot which rule lets us get rid of it
[2014-9-23. : 4:01 am]
O)FaRTy1billion[MM] -- !a returns only 0 or 1 :P
[2014-9-23. : 4:00 am]
O)FaRTy1billion[MM] -- I don't think there is a logical ^
[2014-9-23. : 4:00 am]
Jack -- Now we have (p OR q) AND (!p OR q OR r)
[2014-9-23. : 4:00 am]
O)FaRTy1billion[MM] -- &, |, ^, ~ vs. && || (nothing) !
[2014-9-23. : 4:00 am]
jjf28 -- crud
[2014-9-23. : 4:00 am]
O)FaRTy1billion[MM] -- ! is logic not, ~ is bitwise not
[2014-9-23. : 4:00 am]
jjf28 -- orite, ! NOT
[2014-9-23. : 3:59 am]
Jack -- because (A OR B) AND (A OR !B) = A
[2014-9-23. : 3:59 am]
O)FaRTy1billion[MM] -- yes
[2014-9-23. : 3:59 am]
jjf28 -- c/c++: & AND, | OR, ^ xOR iirc
[2014-9-23. : 3:59 am]
Zoan -- lol q v (r ^ p)
[2014-9-23. : 3:59 am]
Jack -- OK step one, (p + q + r) . (p + q + !r) = (p + q)
[2014-9-23. : 3:59 am]
O)FaRTy1billion[MM] -- I got the symbols from there :P
[2014-9-23. : 3:58 am]
Dem0n -- But yeah, the technical way to say 'and' (at least in my system) is ^
[2014-9-23. : 3:58 am]
Jack -- I will rek you m8, 1/8
[2014-9-23. : 3:58 am]
Dem0n -- figured that would make more sense than ^
[2014-9-23. : 3:58 am]
Dem0n -- I meant to use & both times
[2014-9-23. : 3:58 am]
Dem0n -- sorry didn't mean to mix them up
[2014-9-23. : 3:58 am]
Zoan -- what does & =?
[2014-9-23. : 3:58 am]
Dem0n -- v = or, ^ = and
[2014-9-23. : 3:58 am]
O)FaRTy1billion[MM] -- (p∧r)∨q
[2014-9-23. : 3:58 am]
O)FaRTy1billion[MM] -- demon what have you done
[2014-9-23. : 3:57 am]
O)FaRTy1billion[MM] -- er, no. god damnit. xD
[2014-9-23. : 3:57 am]
O)FaRTy1billion[MM] -- And plugging it in to this program on my old laptop, it says the answer is (p∧q)∨r
[2014-9-23. : 3:57 am]
Jack -- if those are both ANDs inbetween the brackets then that's ezpz
[2014-9-23. : 3:56 am]
O)FaRTy1billion[MM] -- (p ∨ q) ∧ (¬p ∨ q ∨ r)
[2014-9-23. : 3:56 am]
O)FaRTy1billion[MM] -- ∧ is and, ∨ is or, ¬ is not
[2014-9-23. : 3:56 am]
Zoan -- :O lulz
[2014-9-23. : 3:55 am]
Jack -- demon gave it, said he had a quiz on it

Pages: < 1 « 3341 3342 3343 3344 33453539 >


Members Online: Roy