|
Members in Shoutbox
None.
Shoutbox Search
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.
[2014-12-18. : 5:47 pm]  NudeRaider -- Alternatively he can send me his hdd. I would gladly copy my version of ScmDraft over to him. Maybe someone can set up a VM that runs ScmDraft which Zirlotts can control remotely?[2014-12-18. : 5:43 pm] NudeRaider -- Then we could send him a CD with ScmDraft 2. Would make for a nice and useful Christmas present[2014-12-18. : 5:18 pm] NudeRaider -- To be fair, Azraels solution for zirlotts request also uses a 3rd party editor - namely notepad  [2014-12-18. : 4:39 pm] jjf28 -- @ NudeRaiderNudeRaider shouted: ... which makes every proof "possibly false, I just don't know why yet" lol [2014-12-18. : 4:22 pm] NudeRaider -- ... which makes every proof "possibly false, I just don't know why yet" lol[2014-12-18. : 4:20 pm] NudeRaider -- jjf28jjf28 shouted: naw, you can use axioms that more people agree with hm if I understand that correctly it means you have to base your proof on assumptions which are generally accepted as true (=axioms). So following the scientific principle everything you assume could be false, even if it seems to be rock solid, but will be considered true until proven otherwise. [2014-12-18. : 4:14 pm] NudeRaider -- Mini Moose 2707Mini Moose 2707 shouted: Got it down from 2slow to 106ms to ... 5ms on average now lel reminds me of when I wrote a sudoku solver in C++. First version just brute forced it and took about 10 minutes for an answer. 2nd version used logic to solve it and I couldn't believe it was practically instant.  [2014-12-18. : 4:07 pm] NudeRaider -- Mini Moose 2707Mini Moose 2707 shouted: Though the proof could be strengthened by him not attending class ... ignoring the joke, isn't a proof always absolute, as in there's no weak or strong proof, if it's undeniably true and can't be any truer. [2014-12-18. : 11:41 am]  Moose -- FaRTy1billionFaRTy1billion shouted: Dem0n Paying for and attending college education being put to good use Both are debatable, as it's his parents that are paying and he has been known to not attend. [2014-12-18. : 8:20 am]  Sand Wraith -- FaRTy1billionFaRTy1billion shouted: Sand Wraith Sand Wraith pytile or hawttiles can do that hawttiles doesn't work cuz of unregistered ocx (which I have tried previously but did not work) so I stuck with PyTILE, but it's slightly buggy in that switching between megatile groups causes the current fields to carry over into the newly selected one[2014-12-18. : 6:29 am] O)FaRTy1billion[MM] -- It'll be cool if it gets here before I leave on the 26th[2014-12-18. : 6:21 am] O)FaRTy1billion[MM] -- woo, July 17th soylent orders shipped today ... Mine's July 22nd. [2014-12-18. : 5:31 am] O)FaRTy1billion[MM] -- Dem0nDem0n shouted: I hope I passed this class so that I can dump this bullshit out of my head forever Paying for and attending college education being put to good use [2014-12-18. : 5:28 am] O)FaRTy1billion[MM] -- Sand WraithSand Wraith shouted: Does anyone have a tile-editing program for SCBW? Sand WraithSand Wraith shouted: I want to set Water tile on Jungle tileset to be ground-walkable. pytile or hawttiles can do that[2014-12-18. : 4:23 am] Moose -- This is a curiousity. Three part &&, two fast divisibility checks, then one other (slower) function. Omitting both divisibility checks gives a wrong answer, including both gives a right answer. Including just one gives the right answer, but slows the program down because then the slower function gets checked. Short circuiting for the win.[2014-12-18. : 3:04 am] Moose -- Congratulations, the answer you gave to problem 43 is correct. You are the 31870th person to have solved this problem.[2014-12-18. : 2:10 am] Sand Wraith -- I want to set Water tile on Jungle tileset to be ground-walkable.[2014-12-18. : 1:49 am] Dem0n -- I hope I passed this class so that I can dump this bullshit out of my head forever[2014-12-18. : 1:36 am] Sand Wraith -- strong induction is having assuming P(0) ^ P(1) ^ P(2) ^ ... ^ P(n) and proving these imply P(n+1)[2014-12-18. : 1:22 am] Moose -- MasterJohnnyMasterJohnny shouted: what is strong induction for? It when your induction also lifts[2014-12-18. : 1:20 am] Sand Wraith -- I looked it up on Wikipedia, it has to do with data structures.[2014-12-18. : 1:11 am] Sand Wraith -- I've only ever had to do mathematical induction and strong induction :3[2014-12-18. : 1:11 am] Sand Wraith -- maybe you could write something with N(0) (number of vertices at height 0), and N(n) = N(n-1) + curHeight for n > 0 or something.[2014-12-18. : 1:09 am] Sand Wraith -- You could maybe write something like there are 3^n vertices for n = max height, and root node level is height = 0, so for number of vertices N = 3^n where n = 0, N = 1 = 1 mod 3, and for n > 1, N = 3^n + 1, but this still doesn't use structural induction[2014-12-18. : 1:08 am] Dem0n -- i stayed all night doing strong induction and it wasn't even on the exam[2014-12-18. : 1:03 am] Sand Wraith -- Well, that definitely doesn't solve it using structural induction.[2014-12-18. : 1:00 am] Dem0n -- And I was like, "Well... because each vertex is a tree in itself and can have 3 children, it is divisible by 3, so every child is divisible by 3 up to the root, which has no parent, which leaves 1 left over" Pretty sure that's wrong.[2014-12-18. : 12:59 am] Dem0n -- It was some bullshit that was like Prove that for a perfect ternary tree, the number of vertices N = 1 (mod 3)[2014-12-18. : 12:56 am] Moose -- Sand WraithSand Wraith shouted: Mini Moose 2707 Given that Dem0n didn't learn anything the first time around, and still hasn't, Dem0n will get rekt on the n + t time. Q.E.D.[2014-12-18. : 12:55 am] Sand Wraith -- It's okay Dem0n, I probably wouldn't be able to answer a question on induction since I haven't had to look at it in a while :3[2014-12-18. : 12:55 am] Sand Wraith -- Mini Moose 2707Mini Moose 2707 shouted: Using the fact that Dem0n got rekt by induction n times, prove that Dem0n can get rekt by induction n+1 times Given that Dem0n didn't learn anything the first time around, and still hasn't, Dem0n will get rekt on the n + t time.[2014-12-18. : 12:53 am] Moose -- So long as you didn't write stupid shit, that might not be a problem.[2014-12-18. : 12:53 am] Moose -- I've written paragraphs on math exams before. Some classes you start to wonder if equations are still a thing.[2014-12-18. : 12:45 am] Dem0n -- I literally wrote a paragraph as my proof, even though I'm pretty sure we were supposed to solve it algebraically[2014-12-18. : 12:44 am] Moose -- Using the fact that Dem0n got rekt by induction n times, prove that Dem0n can get rekt by induction n+1 times |
Members Online: 5harperc441eh1, 8oliviae241ye2, Roy
Roy