00:00:01 oerjan, yeah one of the excercise was: solve the following equation x^2+1 00:00:06 Although those are more useful for stream ciphers than actual hashes. I'm sure their proofs of security are only for a finite amount of output before they hit a cycle or something. 00:00:10 fax, BWUH? 00:00:11 that's not an equation 00:00:16 oops 00:00:17 =0 00:00:18 fax: is your definition of "one of the atheist people" "someone who doesn't believe in god" 00:00:26 nice smiley :D 00:00:30 * Sgeo_ is an atheist person. 00:00:33 fax: (set it equal to 0 and tell him he's lame) 00:00:59 do you believe in angels? 00:01:06 dixon: uuuh - i need to study your reference to sponge constructions 00:01:12 -!- zzo38 has joined. 00:01:21 of course, and I beleive in paralell lines too 00:01:23 fax: adding roots of polynomials in that way is a fundamental tool of galois theory iirc 00:01:29 * Sgeo_ does not believe in anything that would commonly be considered to be supernatural. 00:01:31 hi zzo73 00:01:41 rapido: http://sponge.noekeon.org/ 00:01:49 oerjan, hm 00:01:49 http://sponge.noekeon.org/SpongeFunctions.pdf 00:01:50 i could believe in god and still find the concept of god to be impossible 00:01:54 such is believe 00:02:19 although if you are inside the complex numbers to start with, you don't really need to go outside them 00:02:29 dixan: ah, thanks! 00:02:41 rapido: They're cryptographic hashes, however. 00:03:03 dixon: cryptographic hashes are the only ones i'm considering 00:03:35 what if you believe in angels but don't believe in god? 00:03:48 * Sgeo_ pokes alise 00:04:04 rapido: But yes, by definition they're surjective when useful and thus have collisions. 00:04:19 Sgeo what abou gravity 00:04:23 it's supernatural 00:04:24 lament: Then you must've seen my girlfriend. 00:04:26 lament: then you would be a flying lunatic with wings 00:04:30 Sgeo_: hi 00:04:44 fax, lolwhat? 00:04:50 * Sgeo_ blinks a few times 00:04:54 nobody has explained it yet 00:05:05 it's like ghosts or ufos or whatever 00:05:25 fax: gravity is a scam by scientists. intelligent falling is the truth! 00:05:39 It exists, as demonstratably as possible. 00:05:57 it's God's Hand Pushing us Down From Eden 00:06:00 well intelligent falling is a much better explanation by occams razor but it does leave some key questions open 00:06:01 Ghosts and UFOs have not been observed by any measurements. 00:06:13 dixon: all that i want is a naming service that is scalable 00:06:28 rapido, let the name of the proof be the content of the proof. 00:06:31 Oranjer: no that would be more the coriolis force. eden is in the east, iirc 00:06:37 Sgeo - oh that's true I guess 00:06:43 What doe sthat mean, intelligent falling?? 00:06:46 fax, it is not a better explanation by occams razor 00:06:56 "Playing with Coq in Jack" -- paper title 00:07:00 The reason otyugh attack with only two tentacles is because one tentacle has three eyes. 00:07:00 Sgeo_: but proofs can be huge - think of computer generated proofs 00:07:02 occams razor refers to the amount of assumptions an explanation requires 00:07:12 zzo38: intelligent falling is the demonstratable fact that gravity is a lie and all things are actually being pushed down by god individually 00:07:24 alise: That cannot be demonstratable 00:07:25 alise... how you have possibly managed to find a coq paper I haven't read O_O 00:07:38 Mostly because it doesn't work. 00:08:06 zzo38: http://en.wikipedia.org/wiki/Intelligent_falling 00:08:08 If you want to say God invented gravity, that's different however. Still not provable, though 00:08:19 falsifiable 00:08:24 I get the feeling that I should learn Coq 00:08:28 Using bigger words make you sound smarter. 00:08:31 fax: googling for unrelated things 00:08:40 zzo38: IT WORKS!!!! 00:08:46 now how do I do nested theorems in coq 00:08:53 See, we don't fall off the earth! 00:09:03 Sgeo_: I wouldn't bother. You'd be in the same boat as the Haskellingtons masturbating to the Curry-Howard isomorphism. 00:09:13 * Sgeo_ knows a bit of Haskell 00:09:24 HEY LOOK GUYS I CAN PRETEND I'M A MATHEMATICIAN BECAUSE I CAN WRITE PROOFS IN COQ fapfapfapfapfap etc 00:09:31 * Sgeo_ should probably learn what the Curry-Howard isomorphism 00:09:33 *is 00:09:41 Sgeo it's nothing very deep 00:09:46 alise: What I mean is the proof desn't work. 00:09:52 s/desn't/doesn't/ 00:09:53 Sgeo -- just a notationally similarity between proof systems and type systems 00:09:59 notational 00:10:03 * oerjan has _never_ masturbated to the curry-howard isomorphism. should i try it? 00:10:14 Sgeo_: It says if you can make a type to represent a theorem and then find a value that satisfies the type, you prove the theorem. 00:10:20 look.... the coq has giving me sign - it's hanging low - it's time to go to bed.... later ... 00:10:40 -!- rapido has quit (Quit: rapido). 00:15:06 alise: on facebook: Jack Coq Hardi 00:15:06 Jack Coq Hardi 00:15:07 Not the Jack Coq Hardi you were looking for? Search more » 00:15:47 Jacking off Coqs in Jack 00:16:20 guh, constructing a sigma is a bitch in a coq proof 00:16:43 the coq sigma stigma 00:16:46 a sigma algebra? 00:17:00 alise just give the value and prove it correct using tactics 00:17:12 yeah but I want to give the value using proof syntax 00:17:20 a sigma algebra? 00:17:28 so I put it in another top-level theorem, which is a bitch. and then I have to do it all separately in another theorem 00:17:30 and it's all fffffffffff 00:17:40 dixon: unlikely. 00:17:53 He couldn't have meant a series? 00:17:58 not that i'm _sure_ alise doesn't know what that is, but... 00:18:47 well, for one thing alise only does constructivist things, i doubt sigma algebras qualify 00:19:21 you know constructivism isn't some crazy fringe philosophy :) 00:19:29 yes it is :P 00:19:30 Yes it is. 00:19:45 And it's a boring one, because it's shit that's been done since the 1800's. 00:21:00 -!- jcp has joined. 00:21:35 dixon: but it's very useful for masturbating to the curry-howard isomorphism, i hear 00:21:47 * oerjan ducks 00:22:04 I lol'd 00:23:06 Next all he has to say is he's a finitist 00:23:13 It may be boring and old but who cares? 00:23:21 * pikhq masturbates to finite sequences 00:23:24 dixon: fax is a finitist 00:23:24 :P 00:23:26 so... 00:23:33 you're looking at the wrong person I'm very much a believer in infinities 00:23:55 Yeah, but I already think fax is an idiot. 00:24:08 Yay! Infinities. 00:24:17 -!- Quadrescence has joined. 00:24:22 now where did you get THAT idea? 00:25:04 Mainly your berating me for not knowing anything 15 minutes after you claimed the exponential function wasn't hypergeometric. 00:25:49 oh fuck off 00:26:04 it was long before that 00:26:55 Granted being a constructivist and finitist would've just made me think you were a Zeilberger clone, and then I'd have to decide if you were thinking for yourself (in which case you would've been cool) or if you were just a copycat (in which case you would be an idiot). 00:27:23 :3 00:27:29 Perhaps we are using different definitions of constructivist. 00:27:53 I merely believe that an object must be constructed in some formal language to be proved to exist; or in the case of a proposition, a demonstration of it. 00:27:54 Looking at the page I found a lot of other things and links to pages about quantum mechanics, and so on. I have a lot of my own ideas about quantum mechanics, some of which are different from other ones. (But some ideas are similar, and have been figured out independently by me but other people generally figure it out more in the past, because they are scientists and I'm not) 00:28:03 So basically I reject the law of the excluded middle and correspondingly ~~p -> p. 00:28:06 That isn't really so crazy. 00:29:42 dixon I wasn't berating you for not knowing anything anyway, you were making some ridiculoulsy stretched joke about 'dixons identity' 00:31:54 I also reject the law of excluded middle but only in some contexts. You can use tristate logic with quantum superposition/entanglement and with presuppose (so for some proposition P you could make Pre(P)) and a new kind of imply operator, distinct from the old one (but both of which are used, for different purposes). 00:32:32 zzo38 have you read any linear logic? 00:32:58 There are then three truth values instead of two values. The standard operators still act in the standard way when dealing with only standard truth values. 00:33:09 zzo38: I reject the law of the excluded middle because I believe that axioms not in the current system that nevertheless are fine to add are neither true nor false. 00:33:19 You cannot prove them true, you cannot prove them false; it is fine to add their negation, it is fine to add them. 00:33:38 So if you could say it is true, then the negation would be inconsistent, and vice-versa, yet this is not the case. 00:33:53 alise: There certainly can be things that are neither true nor false. 00:34:24 moral dilemma: I followed a link allegedly to Rick Astley rickrolling someone himself 00:34:29 and it was actually what it claimed to be, rather than a rickroll 00:34:34 alise: Is'nt the law of the excluded middle about statements that can be derived from the axiomatic system in question? 00:34:34 have I been meta-rickrolled? 00:34:36 wow I want to see it! 00:34:57 http://www.youtube.com/watch?v=y4hqv6USkoU 00:35:02 pikhq: It says that for any given proposition P, I will tell you that either P is true, or P is not true. 00:35:05 Meta-rickrolled? 00:35:05 basically, it was a Thanksgiving Day's parade 00:35:10 alise: Ah. 00:35:12 Okay, then. 00:35:14 and he was hiding on one of the floats, and just came out and started singing live 00:35:21 However, there are things that are neither. 00:35:28 So the law of the excluded middle is fail. 00:35:52 alise: Tell me one such proposition? 00:36:13 pikhq: Consider the Continuum Hypothesis. 00:36:16 alise: would you say that if X implies Y, and not X implies Y, then Y can be considered to be true? 00:36:18 ZFC + CH is consistent, as is ZFC + ~CH. 00:36:21 ais weird lol 00:36:25 IMO, that's a weaker situation than the law of the excluded middle 00:36:30 I don't think it's a rickroll 00:36:34 With tristate logic things can be true, false, or tristate. Pre(P) is true if P is not tristate. 00:36:38 ais523: p \/ q = (p -> r) -> (q -> r) -> r 00:36:44 fax: well, it did /say/ it was a rickroll at the end 00:36:57 oh 00:36:57 perhaps this is some sort of meta-meta-rickroll 00:36:58 p \/ ~p = (p -> r) -> (~p -> r) -> r 00:37:03 ais523: Answer: No. 00:37:07 oh it is a rickroll 00:37:11 alise: the law of the excluded middle implies that 00:37:17 pikhq: So, then, how, in plain ZFC, is CH true or false? 00:37:19 but, I think it can be true even without 00:37:24 ais523: no, p or q is literally the same thing 00:37:28 as (p->r)->(q->r)->r 00:37:35 proof: 00:38:02 \f g porq. case porq of theone x -> f x; theother x -> g x 00:38:02 and 00:38:05 erm 00:38:10 \porq f g. case porq of theone x -> f x; theother x -> g x 00:38:19 that's p\/q -> (p->r)->(q->r)->r 00:38:23 now the other way: 00:38:31 the other way is the way I care about 00:38:47 (p->r)->(q->r) -> p \/ q 00:39:07 \f. f theone theother 00:39:17 filling in the arguments we get 00:39:22 first is (p -> p \/ anything) 00:39:22 alise: you must have typoed somewhere 00:39:28 alise: you are missing -> r 00:39:28 second is (q -> anything \/ q) 00:39:34 right right 00:39:37 the implementation is right 00:39:38 so 00:39:42 fill in p and q for the respective anythings 00:39:44 and we get p \/ q 00:39:47 Q.E.D. 00:40:09 If there is no present king of France, the statement "The present king of France has stopped robbing banks" cannot be true or false, because it presupposes that there is a king of France. 00:40:13 alise: Clearly, the veracity of CH is a boolean. 00:40:15 hmm, I always get confused trying to follow nonstandard models of logic 00:40:33 That the value of the boolean cannot be determined is beside the point. 00:40:36 in one seminar I went to, someone quantified over all systems of logic, which was /really/ confusing 00:40:40 Prelude> let or2f porq f g = case porq of Left x -> f x; Right x -> g x 00:40:40 Prelude> let f2or f = f Left Right 00:40:40 Prelude> :t (or2f, f2or) 00:40:40 (or2f, f2or) 00:40:40 :: (Either t t1 -> (t -> t2) -> (t1 -> t2) -> t2, 00:40:41 ((a -> Either a b) -> (b1 -> Either a1 b1) -> t11) -> t11) 00:40:44 alise: you had an implied forall r in there 00:40:51 ais523: Since I have proved that (P->Q) and (Q->P), P is equivalent to Q. 00:40:54 pikhq: booleans have /nine/ values, 01XLHWZU- 00:40:58 alise: ok 00:41:11 Well, f2or actually needs a more specific type, but. 00:41:20 ANY LANGUAGE IN WHICH BOOLEANS HAVE FEWER THAN NINE POSSIBLE VALUES IS DEFICIENT 00:41:23 ais523: Then we are clearly discussing the law of the excluded 10th. 00:41:25 btw, I'm not sure which one maps to file_not_found 00:41:28 pikhq: haha 00:41:38 alise: Clearly, the veracity of CH is a boolean. 00:41:39 Really? 00:41:41 ((p->(p\/q))->(q->(p\/q))->(p\/q)) -> (p\/q) 00:41:43 fax: have you decided whether that was a rickroll or not yet? 00:41:59 pikhq: ZFC + CH is consistent iff ZFC is consistent. ZFC + ~CH is consistent iff ZFC is consistent. 00:42:08 In ZFC, CH can neither be true nor false. 00:42:18 If we can prove it true, then ZFC + ~CH would be inconsistent. 00:42:23 If we can prove it false, then ZFC + CH would be inconsistent. 00:42:25 In ZFC, CH cannot be shown to be true or false. 00:42:28 I think I've caused a logical gap in rickrollness 00:42:29 It is neither true nor false. 00:42:38 pikhq: But it has some platonic "real truth"? 00:42:49 That's metaphysical mumbojumbo: you are talking about things in the system that are not from the axioms. 00:42:49 -!- BeholdMyGlory has quit (Remote host closed the connection). 00:42:53 ais523, I am not really sure 00:43:01 You are referring to some platonic space of "ZFC truths" but no such thing exists, just manipulation of the axioms. 00:43:06 Are you sure you want to go down this path> 00:43:10 fax: hmm, so you're metaundecided? 00:43:11 Please explain what the nine boolean values 01XLHWZU- are meant for. 00:43:57 zzo38: 0 = false, 1 = true, X = both false and true, L = false unless contradicted, H = true unless contradicted, W = somewhere between true and false, Z = no truth value at all, U = as yet unknown, - = irrelevant 00:44:07 OK. 00:44:19 VHDL actually implements all these 00:44:21 yes 00:44:38 *path? 00:45:05 alise: It certainly has no "platonic real truth". It just simply can be said to be one of true or false. 00:45:35 pikhq: Okay. 00:45:38 So suppose it is true. 00:45:44 Then ZFC + ~CH is inconsistent. 00:45:47 So suppose it is false. 00:45:50 Then ZFC + CH is inconsistent. 00:45:58 But we know that ZFC plus either CH or ~CH is consistent iff ZFC is. 00:46:00 So it cannot be both true and false. 00:46:04 No. 00:46:06 It cannot be either. 00:46:12 Because *both systems are consistent*. 00:46:13 How so? 00:46:14 (if ZFC is). 00:46:27 pikhq: OK, let us say that in ZFC, we have proved CH. 00:46:34 I didn't know VHDL implements those. But I suppose it is possible. 00:46:41 We know that ZFC + ~CH is consistent iff ZFC is. Yet we have CH and ~CH. 00:46:54 Reverse it to see that it cannot be false, either. 00:47:06 You can keep running around in circles, but the only real solution is to reject the excluded middle. 00:47:26 alise: "We know that ZFC + ~CH is consistent iff ZFC is. Yet we have CH and ~CH." Uh... Wha? 00:47:38 OK, let me spell it out for you. 00:47:52 Near as I can tell, "proving CH in ZFC" would imply that ZFC + ~CH is inconsistent. 00:48:23 And assuming the proof that ZFC + ~CH is consistent is valid, then clearly you cannot prove CH in ZFC. 00:48:54 and if you did both, then it would show ZFC is not consistent. 00:49:03 dixon: Yes. 00:49:03 because that's a contradiction 00:49:15 pikhq: 00:49:16 By the law of the excluded middle, we know that in ZFC, either CH is true or ~CH is true. I will demonstrate that it cannot be either. 00:49:18 Let us assume that CH is true. It has been proved at the meta-level that ZFC + ~CH is consistent iff ZFC is. Since we are working in ZFC, we assume its consistency. But then ZFC + ~CH cannot be consistent, for we have CH and ~CH. But ZFC + ~CH has been proved to be consistent. Contradiction; CH cannot be true. 00:49:18 Let us assume that CH is false. It has been proved at the meta-level that ZFC + CH is consistent iff ZFC is. Since we are working in ZFC, we assume its consistency. But then ZFC + CH cannot be consistent, for we have CH and ~CH. But ZFC + CH has been proved to be consistent. Contradiction; CH cannot be false. 00:49:25 Therefore, CH cannot be true and it cannot be false. 00:49:44 alise: You have proven that CH cannot be proven in ZFC. 00:49:44 Although we cannot use this to disprove excluded middle from inside ZFC, because it is a meta issue, it is still present. 00:49:48 Excluded middle is false. 00:49:53 pikhq: No, I made no references to proofs in the above. 00:49:57 Clearly it can be one or the other; you can use it as an axiom. 00:50:01 The law of the excluded middle means that ONE must be true. 00:50:19 -!- Quadrescence has quit (Read error: Connection reset by peer). 00:50:21 -!- Quadresce` has joined. 00:50:44 -!- Quadresce` has changed nick to Quadrescence. 00:51:25 And you use ZFC's consistency as an axiom. Again, if you prove ZFC + ~CH and ZFC + CH iff ZFC is consistent, it means ZFC is not consistent. Hello mathematical logic. 00:51:39 Is "false unless contradicted" in a digital circuit like a pull-down resistor? 00:52:01 alise: Fine. I shall start using a form of limited law of excluded middle. "Any proposition which can be reasoned about in an axiomatic system must be either true or false in that axiomatic system." 00:52:05 :P 00:54:00 If ~CH in ZFC, how do you get CH? 00:54:05 erm 00:54:23 n/m, I agree with pikhq 00:54:53 Well, this has taught me something: Never bother trying to talk about excluded middle. 00:55:03 People are absolutely sure it is true at any cost. 00:55:52 People don't like the implication that you could define the following: ZFC + CH & ~CH. :P 00:57:53 Without realizing that proving both at the same time shows ZFC's inconsistency. 01:02:26 Off topic: Have you ever invented any spell/power for D&D game? 01:02:39 -!- FireFly has quit (Quit: Leaving). 01:03:08 dixon: Of course it does. 01:04:24 Then it says nothing about CH... 01:04:49 And your whole law of the excluded middle being false idea is inane with that example. 01:05:19 "alise: For one, you can have RAM with so much error checking that it is physically impossible for it not to detect an error for the computation you are doing..." <<< may i see this article 01:06:26 oklopol: wut 01:06:43 imagine filling the entire universe with one 16 bit pattern, say 01:07:04 I'd be highly surprised if it was physically possible for all those bits to spontaneously flip in the certain maximum time it takes to do a given computation 01:08:27 1. you would probably be pretty surprised if you suddenly turned into an elephant, too, that's not what physically impossible means 01:08:30 2. oh, you linked it 01:09:36 well i guess i could start enumerating every single way a bit could be flipped :))) 01:14:48 it's pretty stupid to claim computers can't make errors 01:14:50 It is difficult to repair a watch while falling from an airplane. 01:15:09 of course they can make errors 01:15:35 some unicorns can turn bits with their tongues from miles away 01:15:39 I never claimed that 01:15:58 but if you thought that was true, you might 01:16:09 can't really unclaim that one huh 01:16:13 i should go to sleep 01:17:37 I recently added something to esolang wiki 01:22:29 -!- zzo38 has quit (Quit: ERR_QUIT). 02:33:02 err bye 02:34:38 bye 02:34:47 wait what 02:35:16 02:22… zzo38 has quit IRC (Quit: ERR_QUIT) 02:35:16 04:32… oklopol: err bye 02:35:34 it was all sorts of funny stuff 02:35:57 but i actually am going to sleep now -> 02:36:36 oklopol :) 02:36:49 I have an idea about this OR thing 02:36:55 but it's probably wrong 02:36:59 I'll try it out tommorow 02:37:23 -!- oerjan has quit (Quit: Tomorrow OR not tomorrow, that's the question). 02:46:49 [["Anime is a prime example of why two nukes wasn’t enough." - NH Democrat State Rep., Nick Levasseur]] 02:46:51 Oh, America. 02:47:37 * Sgeo_ .. doesn't like nor dislike anime 02:47:57 That's rather orthogonal to the hilarious extremity of bad taste found in that quote :P 02:47:58 It's just another medium, albeit one for which there's a .. website that lets me watch for free 02:57:27 It's just another medium, albeit one which is generally made in a language that I happen to be studying. :P 02:58:22 ANATA WA BAKA DESU ZO 02:58:47 dixon: you violated the syntax anime := desu | anime anime 02:58:51 dixon: That's quite formal of you. 02:58:54 do not pass go do not collect 200 pounds 02:59:25 Why would I collect pounds? I'm an American, we're fat enough. 02:59:41 pikhq: thanx. 02:59:44 Try something more like 馬鹿ãœã€ã‚ã‚“ãŸï¼(baka ze, anta 02:59:46 ) 03:00:18 Really? I was going for the "You sir, are an idiot!" meme. 03:00:49 Oh, *that's* what you were going for? 03:01:47 My Japanese is flaky, but yes. 03:02:58 -!- adu has joined. 03:03:04 pikhq: Please translate this to exquisitely formal Japanese: "Your asshole is a skyscraper-sized orifice which receives bread daily, fuckwit." 03:03:26 Someone has to have translated that already, it being such a common insult. 03:03:30 Is that even an insult? I can't tell. 03:03:40 SL? 03:04:16 Whoa, he gets free bread? 03:04:20 Try more of Pikhqã©ã®ã¯ãŠé¦¬é¹¿ã§å¾¡åº§ã‚‹ã¨ãŠæ€ã„ã«ãªã‚Šã¾ã™ã€‚(Pikhq dono wa baka de gozaru to o-omoi ni narimasu) 03:04:27 ... I *think*. My keigo sucks. 03:04:47 dixon: NO COST AT ALL 03:05:08 alise, is that a quote from SL? 03:05:15 Sgeo_: Schawhat? 03:05:18 Have you heard it before or something? XD 03:05:35 No, but it sounds like the sort of thing a certain character might say 03:05:42 alise: Sadly, I know not the vocab for that. 03:05:48 I'm not saying the full name of it in the presence of a minor 03:05:53 alise: I shall let you know when I can translate that, though. 03:06:04 Sgeo_: Does it have RUDE WORDS in it???? 03:06:12 It has naked people and sex in it 03:06:17 OH NOOOOOOOOOOOOOOOO 03:06:42 My beacon-of-light emitting orifices will all be brutally penetrated by its hostile influence of filth and putridness, such that I may never lay claim to someone of sound mind again. 03:06:48 Anyway, since when do I have Second Life installed? 03:06:56 alise, SL != Second Life in this case 03:07:12 Oh, that webcomic. 03:07:17 Yes >.> 03:08:47 pikhq: Okay, translate this too when you can: "My beacon-of-light emitting orifices will all be brutally penetrated by its hostile influence of filth and putridness, such that I may never lay claim to someone of sound mind again." :P 03:08:58 Again, FORMAL AND POLITE! 03:09:45 alise: "Fuck You". 03:09:57 "No" 03:12:50 Fine, I'll give you a shockingly rude statement instead. ç§ã¯æ—¥æœ¬äººé”を殺ã—ãŸã„。ãªãœï¼Ÿã‚¢ã‚¸ã‚¢äººãŒå¤§å«Œã„ï¼ 03:13:41 That is probably the most racist thing I have ever typed, in jest or otherwise. 03:13:58 Translate it! Translate IT! 03:14:35 "I want to kill all Japanese. Why? I hate Asians!" Now, alise. Say it to every Japanese person you meet. :P 03:15:08 (watashi wa nihonjintachi wo korositai. naze? ajiajin ga daikirai!), BTW 03:15:50 Fags should die, naturally: we should have killed them all at the start. But niggers, niggers are the worst. We should relegate all the niggers to their own country so we can bomb the place. Put the asians there too, the fucking worthless pieces of shit. But the only thing worse than a nigger is a nigger fag. 03:15:56 RACISM CONTEST 03:16:22 "Nigger" is untranslatable. 03:16:33 >:| 03:16:40 why not, do all japs love nigs or sth 03:16:54 It is a term that literally only exists in English. 03:17:25 The closest you can get in Japanese is "gaijin". Which... Refers to everyone other than Japanese. 03:17:42 I have a friend who ran in a marathon! 03:18:05 Is he a nigger?! 03:19:46 "Rincewind had always been happy to think of himself as a racist. The One Hundred Meters, the Mile, the Marathon -- he'd run them all." 03:20:01 hehe 03:20:04 I GET IT!! 03:20:05 groan 03:25:47 pikhq: å›ã¯æ—¥æœ¬äººã§ã™ã‹ï¼Ÿ 03:26:17 adu: ã„ã„ãˆã€‚僕ã¯æ—¥æœ¬èªžã‚’勉強ã™ã‚‹äººã§ã™ã€‚ 03:27:10 pikhq: ã‚ã€ã‚ã‹ãŸ 03:28:12 今漢字を勉強ã—ã¦ã¾ã™ã€‚1810字を知ã£ã¦ã€232字を勉強ã™ã‚‹ã¤ã‚‚ã‚Šã§ã™ã€‚ 03:28:31 ã¡ã‚‡ã£ã¨é›£ã—ã„ã§ã™ã€‚ã§ã‚‚ã€é¢ç™½ã„ã¨æ€ã„ã¾ã™ã€‚ 03:28:52 pikhq: 僕も日本人ãŒå¤§å«Œã„ 03:29:20 ãªã‚‹ã»ã©ã€‚w 03:29:45 ãœã‚“ãœã‚“ 03:30:17 jk 03:30:39 分ã‹ã£ãŸã€‚^_^ 03:31:57 僕ã¯ï¼–å¹´ã‹ã‚“日本ã«ã™ã‚“ã§ã„ã¾ã—ãŸã€‚ 03:32:43 ã‚〜。 03:33:07 ã§ã‚‚ã€ãŸãã•ã‚“ã‚ã™ã‚ŒãŸ 03:33:40 desu 03:33:45 desuuuuu 03:33:51 lol 03:34:06 4年間高校ã§æ—¥æœ¬èªžã‚’勉強ã—ã¾ã—ãŸã€‚ã“ã®å¾Œã€ï¼’年間勉強ã—ãªãã¦ã€ã„ã¾ã‚‚ã£ã¨å‹‰å¼·ã‚’始ã‚ã¦ã¾ã™ã€‚ 03:34:27 s/ã„ã¾/今/ 03:35:34 ãã§ã™ã‹ï¼Ÿã™ã”ã„ï¼ãŒã‚“ã°ã£ã¦ã­ 03:36:07 ã©ã†ã‚‚ã‚ã‚ŠãŒã¨ã†ã”ã–ã„ã¾ã™ã€‚ 03:36:14 lol i've never seen sed and japanese used together 03:36:23 w 03:37:15 ã©ã‚‚ã‚ã‚ŠãŒã¨ Mr. ロボト 03:37:36 :) 03:37:42 w 03:41:07 aduã•ã‚“ãŒãªãœæ—¥æœ¬ã«ä½ã‚“ã§ã„ã¾ã—ãŸã‹ãªã€‚ 03:42:03 ã¶ãã‚‚, but i've been away for 10 years, so i've forgotten so much 03:42:14 I'm going to bed now. 03:42:21 Cheerio, fellows. See you tomorrow. 03:42:22 alise: night 03:42:25 -!- alise has quit (Quit: Leaving). 03:43:21 日本語ã§ã€ã€Œåƒ•ã‚‚ã€ã§ã‚‚10å¹´é–“ä½ã¾ãªãã¦ã€ãŸãã•ã‚“忘れãŸã€ã¨æ€ã„ã¾ã™ã€‚ 03:44:16 sounds about right 03:47:12 僕ã®æ—¥æœ¬èªžã¯æ‚ªã„ã§ã™ã€‚ 03:50:20 ãªã‚‹ã»ã©ã€‚ 03:50:56 勉強ã™ã‚‹ã¤ã‚‚ã‚Šã˜ã‚ƒãªã„ã‚“ã§ã™ã‹ã€‚ 03:53:22 勉強ã—ãŸããªã„ 03:55:04 残念ã§ã™ã­ã€‚ 04:01:45 -!- ais523 has set topic: this topic is incorrect today but will be correct tomorrow | last topic change: 1 day ago | http://tunes.org/~nef/logs/esoteric/?C=M;O=D. 04:01:50 -!- fax has quit (Quit: Lost terminal). 04:03:41 * Sgeo_ brainmelts 04:22:15 -!- MizardX has quit (Ping timeout: 276 seconds). 04:46:18 It's incorrect and will remain incorrect forever. 04:46:40 So will 1+1=2 04:46:42 erm, 3 04:53:27 -!- jcp has quit (Quit: I will do anything (almost) for a new router.). 05:29:53 -!- jcp has joined. 05:39:30 -!- adu has quit (Quit: adu). 05:53:08 -!- Oranjer has left (?). 06:55:55 -!- jcp has quit (Quit: I will do anything (almost) for a new router.). 07:04:12 -!- coppro has joined. 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:57:45 -!- lifthrasiir has quit (Ping timeout: 258 seconds). 08:59:03 -!- lifthrasiir has joined. 09:04:07 -!- lifthrasiir has quit (Ping timeout: 268 seconds). 09:51:13 -!- ais523 has quit. 10:04:09 -!- Quadrescence has quit (Remote host closed the connection). 10:05:16 what? 10:05:30 me looks up at the non-latin script 10:05:32 err 10:05:33 * AnMaster looks up at the non-latin script 10:05:49 Unicode++ 10:06:13 groan <-- you don't like Discworld books then I assume? 10:06:22 ah wait he isn't here atm 10:06:44 dixon, sure, but not for it's own sake 10:07:08 it is very nice when you actually have a reason to use it though 10:08:17 * AnMaster really should try to figure out why mapping pi onto compose p i didn't work out 10:09:02 wat 10:12:24 -!- adam_d has joined. 10:17:06 -!- BeholdMyGlory has joined. 10:31:40 dixon, you know the compose key? 10:32:12 I don't have such a fancy thing. 10:32:41 well usually you need to enable it in some settings 10:32:51 also I never seen it on non-*nix systems 10:34:09 dixon, it allows you to press that key you made your compose key then press two other keys 10:34:12 to write some letter 10:34:29 like µ (compose m u) 10:34:41 (though that specific one is also on altgr-m for me) 10:34:51 Yes, I know. I'm running *nix, I just don't use it. 10:35:04 ah right 10:35:17 -!- FireFly has joined. 10:35:28 dixon, thing is I want compose p i to give me the unicode pi 10:35:45 and well, for some reason something is ignoring my config file for it 10:35:50 weird 10:35:59 need to restart X or something? 10:36:11 dixon, done that since when I added the file 10:36:30 but yeah ~/.XCompose doesn't seem to be used, though docs indicate it should work 10:37:33 leave it up to the X people to not update their docs 10:37:53 dixon, oh? you found something indicating it works differently nowdays? 10:38:08 dixon, the weird thing is that it worked for someone else in here (forgot who) 10:38:53 Naw, I have no idea why it doesn't work. :\ 10:39:16 but there is a chance that the docs aren't up to date 10:39:54 -!- oerjan has joined. 10:40:44 true 10:41:39 lies! 10:42:05 http://www.mail-archive.com/vague@list.uvm.edu/msg03505.html 10:42:15 dunno if that helps 10:45:58 -!- Phantom_Hoover has joined. 10:46:08 http://aturingmachine.com/ 10:46:10 I want one. 10:46:56 That's just dumb. 10:47:08 But it's cool. 10:47:10 It's obvious the tape isn't infinitely long. 10:47:13 What a piece of shit. 10:47:21 Yes, but it's still cool. 10:47:45 And there are around 1000 feet of tape, so it's practically infinite. 10:48:18 I.e. if you wanted to do any calculations involving more cells than that you'd really just use a computer. 10:49:16 Glad to hear you think 1000 feet is "practically infinite" 10:49:26 Read my second post. 10:49:32 Means my penis is up there on the list. 10:49:44 And by that logic, normal computers are dumb. 10:49:52 After all, they have finite memory. 10:50:02 -!- Phantom_Hoover has quit (Client Quit). 10:50:53 There difference between a math student and a computer science student is a sense of humor. 10:50:56 -re 11:10:09 -!- tombom has joined. 11:24:53 -!- fax has joined. 11:33:45 -!- Phantom_Hoover has joined. 11:50:11 -!- adam_d has quit (Ping timeout: 260 seconds). 12:19:06 -!- oerjan has quit (Quit: leaving). 13:13:50 -!- fax has quit (Quit: Lost terminal). 13:14:20 which one has a sense of humor? 13:15:47 i'm both and i both do and don't have a sense of humor, i think 13:16:07 so in either case, you might be right 13:21:41 oklopol: Your sense of humour must be quantum. 13:21:47 -!- cheater2 has joined. 13:22:15 I still maintain the Turing machine was cool, though. 13:23:19 -!- cheater has quit (Ping timeout: 276 seconds). 13:27:40 it was totally awesome 13:28:06 but it has a bit too much technology in it to be absolutely superawesome 13:28:08 Unfortunately, my life is now going to be unfulfilled until I acquire or build one. 13:49:32 -!- Phantom_Hoover has quit (Quit: ChatZilla 0.9.86 [Firefox 3.5.8/20100214235838]). 13:52:43 -!- alise has joined. 13:54:02 /r/programming is fucking useless; the idiot Ted Dziuba taking the first spot. 13:54:37 02:06:44 dixon, sure, but not for it's own sake 13:54:43 What, the Japanese or the what? 13:54:47 My stuff maybe? 13:54:47 I upvoted it for generating discussion, whether or not it's sensible. 13:55:30 02:36:30 but yeah ~/.XCompose doesn't seem to be used, though docs indicate it should work 13:55:33 you need to do stuff 13:55:52 Deewiant: Discussion of the most trivial, boring stuff - the kind Dziuba usually generates. 13:56:18 Professional social network manipulator by way of simply being a gigantic asshole with stupid opinions. Hey, sounds like me, apart from the social network part. 13:56:43 02:47:10 It's obvious the tape isn't infinitely long. 13:56:43 02:47:13 What a piece of shit. 13:56:54 You fail; only some Turing machines have infinite tape. 13:58:09 Coq is awesome 14:01:50 alise : Lies 14:01:55 Turing machines have infinite tapes 14:02:02 Otherwise, they would not be Turing machines! 14:04:30 Hmm, but there are non-universal turing machines, no? 14:04:35 I guess maybe they have infinite tape anyway. 14:10:42 of course there are non-universal turing machines 14:10:53 for instance the empty turing machine is pretty non-universal 14:11:00 :PPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPP 14:13:02 -!- MigoMipo has joined. 14:14:01 :PPPPPPPPPPPP 14:24:53 -!- Guest39936 has joined. 14:26:11 -!- Guest39936 has left (?). 14:36:20 Global tuple space! 14:37:08 i used to love that crazy thing 14:38:28 what thing 14:38:41 global tuple space? 14:39:30 yes 14:40:18 seems a bit too ... unesoteric for you, i mean in your fun definition of esoteric 14:40:21 but why don't you love it any more 14:40:37 K has a global tuplespace... it's hot 14:40:46 i haven't touched one in ages 14:41:01 love fades fast as they say 14:41:16 wat 14:42:11 wat wat 14:42:32 i mean i'm just imagining like... one gigantic trie/graph/thing 14:42:32 and that is everything 14:42:40 wat 14:43:30 wat wat wat 14:44:26 oko 14:54:28 -!- alise_ has joined. 14:57:07 -!- alise has quit (Ping timeout: 258 seconds). 15:02:37 -!- MizardX has joined. 15:24:44 the thing with coq is 15:24:48 sometimes I end up with 15:24:49 H : 1 = 0 15:24:50 ============================ 15:24:50 False 15:25:00 and I'm not entirely sure how it wants me to prove that 1 = 0 is impossible... 15:30:25 Today on "ridiculously trivial proofs": There exists a natural n such that S (pred n) <> n (because pred 0 = 0 in Coq). 15:30:27 http://pastie.org/892089.txt?key=mjqv5f7o9cbvwfvjih18a 15:30:33 Tactics used: 15:30:35 apply ex_intro with 0. 15:30:35 compute in |- *. 15:30:35 intros H. 15:30:35 auto. 15:30:35 congruence. 15:31:20 Really it's a disproof of 1 = 0. 15:31:28 Because I just plugged in the value then told it to shut up and compute S (pred n) and n. :) 15:33:47 Actually I don't think auto did anything there... 15:36:14 Yeah, I could have produced that with just: 15:36:16 apply ex_intro with 0. 15:36:18 congruence. 15:37:54 If I used discriminate instead of the more advanced congruence, I'd get: 15:38:11 http://pastie.org/892094.txt?key=sygsuuuwz1tnauvsksvw5q 15:38:21 Which is simpler. 15:38:31 (That's from apply ex_intro with 0. compute. intros H. discriminate.) 15:38:55 Which can also be produced with: 15:38:58 apply ex_intro with 0. 15:38:59 discriminate. 15:39:04 So that's the shortest, simplest proof. 15:44:26 ooh, coqolf 15:45:15 Now I'm trying to prove (~ exists n, forall m, n >= m); it's surprisingly difficult. 15:45:52 for exists, you need a specific counterexample, so take succ n, then just use succ n > n for all n 15:45:55 how can that be hard? 15:46:02 i should learn cow 15:46:04 *coq 15:46:08 well of course it is easy, it's just expressing it in the tactics engine 15:46:11 *example 15:46:12 without really knowing what tactics to use... 15:46:20 I could do it as a lambda expression, probably, with equality induction 15:46:24 but it'll be shorter as tactics 15:46:31 and lambda expression proofs get unwieldy fast, they're like bytecode 15:46:44 currently I'm up to: 15:46:47 H : forall m : nat, 0 >= m 15:46:48 right i don't know anything about tactics. well except that they can magically do things for you 15:46:48 ============================ 15:46:49 False 15:46:50 nobiggest < apply (H 1). 15:46:50 Toplevel input, characters 0-11: 15:46:51 > apply (H 1). 15:46:53 > ^^^^^^^^^^^ 15:46:55 Error: Impossible to unify "0 >= 1" with "False". 15:47:08 oklopol: basically they search for stuff with certain types in the environment then apply them using various different already-proved theorems 15:47:12 to try and prove the current goal 15:47:33 so like if you have "1 = 0" you can use "discriminate" and it'll look for an equality, then it'll examine the constructors, find out that they're different, and derive a contradiction for you 15:47:46 right, cool 15:47:51 you can use "apply F" to apply a function/implication in the environment automatically filling in the arguments it can, giving subgoals automatically if this reduces the problem 15:47:59 oklopol: one issue is that tactics automatically introduce variables with names they like 15:48:09 so reading it without seeing the transcript, random "H3"s just appear out of nowhere :) 15:49:10 Maybe I'll prove forall n, exists m, m > n, then prove ~ exists n, forall m, n >= m from that. 15:49:55 ============================ 15:49:55 S n > n 15:50:00 auto time :P 15:50:17 here's my documentation for auto: "does something helpful, or does something unhelpful, or does nothing". 15:50:18 what's auto? 15:50:23 this time it worked! 15:50:27 cool 15:50:27 oklopol: it tries to magically prove whatever for you 15:50:29 it isn't very good at it 15:50:40 intros n. 15:50:40 apply ex_intro with (S n). 15:50:41 auto. 15:50:41 -> 15:50:44 alwaysbigger = 15:50:46 fun n : nat => ex_intro (fun m : nat => m > n) (S n) (le_n (S n)) 15:50:46 : forall n : nat, exists m : nat, m > n 15:52:01 x : nat 15:52:03 H : forall m : nat, x >= m 15:52:03 x0 : nat 15:52:03 H0 : x0 > x 15:52:03 ============================ 15:52:03 False 15:52:03 that's better 15:54:29 H0 : x0 > x 15:54:30 H1 := H x0 : x >= x0 15:54:31 cuntradiction 15:56:45 destruct H0 15:56:46 then I get 15:56:47 H1 := H (S x) : x >= S x 15:57:04 destruct? 15:57:18 basically... take this object, deconstruct it into its components 15:57:23 which depends on what it is 15:57:29 in this case I'm destructing the inequality into the environment 15:57:35 so that the same implications hold, but it's folded into other things 15:57:39 rather than a separate object 15:57:52 with e.g. a tuple (x,y) it'd introduce two values, x and y 15:58:01 they're tactics... they don't really have precise semantics :) 15:58:02 kinda cool 15:58:06 yeah i get it 15:59:37 lol disproving x >= S x is so hard 15:59:45 there must be some lemma for x >= y -> x <> y 15:59:52 then I could use discriminate 16:01:23 Theorem gt_Sn_n : forall n, S n > n. 16:01:33 Hint Resolve gt_Sn_n: arith v62. 16:04:42 x : nat 16:04:43 H : forall m : nat, x >= m 16:04:43 H1 := H (S x) : x >= S x 16:04:43 ============================ 16:05:03 -!- lament has quit (Ping timeout: 252 seconds). 16:05:15 proving False from this is stupidly hard... 16:05:15 obviously ~ x >= S x 16:08:22 -!- lament has joined. 16:08:25 H1 := H x : x >= x 16:08:28 now we're getting somewhere 16:20:36 I'm just doing it the general abstract nonsense way - 16:20:59 Prove (forall x, P x) -> ~(exists x, ~P x) 16:21:35 then apply that to alwaysbigger 16:21:36 (alwaysbigger : forall x, exists y, y > x) so we get ~(exists x, ~exists y, y > x). 16:21:36 I'll go from there. 16:21:45 forallnotexists2 = 16:21:46 fun (A : Type) (P : A -> Prop) (H : forall x : A, P x) 16:21:46 (H0 : exists x : A, ~ P x) => 16:21:46 match H0 with 16:21:46 | ex_intro x H1 => let H2 := H x in False_ind False (H1 H2) 16:21:46 end 16:21:47 : forall (A : Type) (P : A -> Prop), 16:21:49 (forall x : A, P x) -> ~ (exists x : A, ~ P x) 16:21:58 if anyone cares. 16:22:00 Pretty easy proof, it has to be said. 16:26:55 lol auto worked in coqtop but not here... 16:27:17 in emacs 16:29:17 Write it in LaTeX. 16:29:18 oh because I inverted it lol 16:33:37 you need to do stuff <-- what stuff? 16:34:12 (context: composite key= 16:34:16 s/=/)/ 16:35:55 Darn, I can't turn ~ exists ~ -> forall. 16:36:44 Because that's excluded middle. 16:36:44 AnMaster: It's like some sort of include thing and some sort of config file change and thingy; I forget. 16:36:44 dixon: latex coq 16:36:44 I have ~ exists n, ~ exists m, m > n which is, you know, close. 16:37:10 -!- Gracenotes has quit (Quit: Leaving). 16:38:17 -!- kar8nga has joined. 16:41:56 This tactic applies to any goal. assert (H : U) adds a new hypothesis of name H asserting U to the current goal and opens a new subgoal U3. The subgoal U comes first in the list of subgoals remaining to prove. 16:42:00 gawd, why didn't I know of this before 16:50:19 * alise_ looks for (m <= n) -> (m <= S n) 16:52:26 -!- lifthrasiir has joined. 16:52:47 x : nat 16:52:47 H : forall m : nat, S x >= m 16:52:47 IHx : (forall m : nat, x >= m) -> False 16:52:48 ============================ 16:52:49 False 16:52:51 man go fuck yourself :P 16:55:06 alise_, hm okay 16:55:09 bbl 16:55:46 alise_: Write it in LaTeX without using a tool to do it for you. 16:56:06 dixon: But the proof is trivial; all I am trying to do is get used to Coq. 16:56:35 Typesetting is not what I am trying to do. 16:56:43 i c 16:57:58 H : forall m : nat, 1 >= m 16:57:59 ============================ 16:57:59 forall m : nat, 0 >= m 16:57:59 lol 16:58:04 i am doing this all wrong 17:00:15 x : nat 17:00:16 H : forall m : nat, S (S x) >= m 17:00:16 IHx : (forall m : nat, S x >= m) -> False 17:00:16 IHx0 : (forall m : nat, S x >= m) -> 17:00:16 ((forall m : nat, x >= m) -> False) -> False 17:00:16 ============================ 17:00:17 False 17:00:20 I have a feeling Coq is trying to get me to do an infinite induction manually 17:04:58 -!- lament has quit (Ping timeout: 240 seconds). 17:08:05 -!- adam_d has joined. 17:12:03 Well, I proved it. 17:12:14 man go fuck yourself :P 17:12:14 alise_, hm okay 17:12:14 bbl 17:12:16 Not using tactics - only partly - though. 17:12:19 :D 17:12:20 What was the syntax for that quote bot? 17:13:12 http://pastie.org/892210.txt?key=ir8pgxsvdnexhfoifnvvpg 17:13:17 FireFly: `addquote ... 17:13:34 `addquote man go fuck yourself :P alise_, hm okay bbl 17:13:47 `quote 17:13:49 Hmm 17:14:34 Theorem No_biggest_3 : ~ exists n, forall m, n >= m. 17:14:34 intros H. 17:14:34 destruct H. 17:14:34 set (H0 := H (S x)). 17:14:34 apply (Not_bigger_than_successor H0). 17:14:35 Qed. 17:14:35 tada 17:14:39 I could fold in Not_bigger_than_successor if I wanted... 17:15:32 No output. 17:15:32 No output. 17:15:58 No_biggest_4 = 17:15:59 fun H : exists n : nat, forall m : nat, n >= m => 17:15:59 match H with 17:15:59 | ex_intro x H0 => 17:15:59 let H1 := H0 (S x) in let H2 := gt_Sn_n x in le_not_lt (S x) x H1 H2 17:15:59 end 17:16:00 : ~ (exists n : nat, forall m : nat, n >= m) 17:16:00 Success! 17:16:27 Proof: intros H. destruct H. set (H0 := H (S x)). assert (H1 : S x > x). apply gt_Sn_n. apply (le_not_lt (S x) x). assumption. assumption. 17:18:52 Thus proving the incredibly obvious truth that there is no natural number n such that for all natural numbers m, n is either greater than or equal to m. 17:19:10 All the 0 people who believe that infinity is a natural number have been thoroughly debunked! Ha! 17:19:16 That was such a waste of time. 17:19:27 There are more than 0 people who believe that. 17:19:45 Shaddup. 17:19:56 From Talk:Hereditarily finite set, archived from Votes for DEletion: 17:19:57 "Hereditarily finite set. Strange maths stuff. Makes no sense. Angela 00:52, Oct 2, 2003 (UTC)" 17:20:07 Angela being the Wikia founder. 17:20:19 Heh. 17:20:39 wat, u mean I can't just do S(n) 17:20:59 Hey, "hereditarily finite set" alternates vowels and consonants. 17:21:06 dixon: wut 17:21:17 *Deletion 17:21:28 let m = S(n) 17:21:35 well yeah exactly 17:21:46 my proof is shorter. suckaaaaaaaaa 17:21:48 but that just gives you n >= S n... so then you have to disprove that 17:21:58 Well, to be fair, when she nominated it for deletion, the article's text was this: 17:22:02 which you do by asserting that S n > n, using the existing theorem for that, then using the theorem that contradicts the two 17:22:06 ... n can't be >= S(n) 17:22:10 of course it can't 17:22:14 "A set A is called 'Heredity finite' if it is is in $V_\omega$, or on other word, if it is in $V_n$ for some natural number $n$" 17:22:16 and there can't be a finite number of primes 17:22:17 you have to prove it 17:22:52 dixon: Of course it is very easy to package the fact that ~ n >= S n up into one theorem. 17:22:59 Theorem Not_bigger_than_successor {n} : ~ n >= S n. 17:23:00 intros n H. 17:23:00 assert (H0 : S n > n). 17:23:00 apply gt_Sn_n. 17:23:00 apply (le_not_lt (S n) n). 17:23:00 assumption. 17:23:02 assumption. 17:23:04 Qed. 17:23:15 Either I just didn't find it in Coq's library or nobody thought to combine the two yet, because there's ~ n > S n. 17:23:26 Or you could just reference Peano's axioms. 17:24:23 Peano's axioms don't actually define greaterthan, less than, etc, for a start. 17:24:25 Just equality. 17:25:19 So... yeah. 17:25:28 We can define less than using them. If m = S^n(x) for some natural n, then m > x 17:25:37 Which is something you have to prove. 17:25:45 No I don't. 17:25:46 You can't just say "this is true" because if you did that nothing would need a proof. 17:25:55 I can define it as true. 17:25:56 Anyway -- if I used "auto with arith" it could do all this automatically. 17:25:59 But I was too lazy. 17:26:07 dixon: Then congratulations, you created an axiom. 17:26:21 Too lazy to avoid doing work, heh. 17:26:33 Anyway, yes, of course, there is a tactic to automatically prove this sort of stuff for you in one statement. 17:26:43 But I'm trying to learn how to use Coq, not how to ask Coq to prove everything for me. 17:26:55 If you just want to dis Coq as being a verbose waste of time you could just do that directly :P 17:27:25 -!- kar8nga has quit (Remote host closed the connection). 17:27:30 I don't think Coq is a waste of time, I think computer-based pseudo-math using Coq, Haskell, Axiom, etc is a waste of time. 17:27:42 Haskell can't even prove things. 17:27:48 Yes it can. 17:27:51 So lumping it in with Coq is ridiculous. 17:28:09 dixon: Well, for a start, it can prove anything (using undefined); for a second, its propositions are boolean-returning functions, not actual types. 17:28:12 So no, it cannot. 17:28:21 And Axiom is a computer algebra system, not a proof assistant. 17:28:26 Curry-Howard isomorphism. 17:28:53 And I'm well-aware what Axiom is, but it has a language packaged with it called Aldor. 17:28:56 - is clearly something you know nothing about; it addresses the simply-typed lambda calculus, which has no _|_. 17:28:56 So - do you consider the proof of the four-colour theorem "pseudo-math"? 17:29:03 Is it pseudo-math just because a computer did it? 17:29:49 FireFly, hah at that quote 17:30:56 -!- jcp has joined. 17:32:40 alise_: Coming from the one saying you can't prove things in Haskell, you seem to be the one in the dark. And I think fooling around with Coq, Haskell, etc and thinking it makes you a mathematician is pseudo-math, not being a mathematician who happens to use Coq to construct a proof of e.g., the FCT. 17:32:59 Well, yes, you can prove things in Haskell, but it is an inconsistent system. 17:33:25 Yes - you can do `data Z; data S n`, then meticulously define operations on it, then construct values to prove it. 17:33:30 But you can prove anything you want: "undefined". 17:33:33 That depends on how you define "a mathematician". 17:33:44 It is a proof system only in the most pathological sense, and even then it is blatantly inconsistent. 17:33:51 And I never claimed I was a mathematician because I fuck around with Coq. 17:34:06 uorygl: Think Newton. 17:34:22 But are you imposing some sort of elitism on "mathematician" above someone who does mathematics? Surely if some amateur constructed a new kind of object and proved useful things about it with Coq, e would be a "real" mathematician. 17:34:54 If you do not agree then you're just an elitist scared of some random nobody doing anything worthwhile. 17:35:05 -!- Quadrescence has joined. 17:35:11 So a mathematician is a person who invents new fields of mathematics and discovers novel applications of it? 17:35:37 Or even just a person who discovers novel results about existing fields. 17:35:43 uorygl, I would say far from all mathematicians manage to invent a new field of mathematics. 17:35:49 A mathematician is someone who explores mathematics and shows up previously unknown things in its depths. 17:35:58 some could refine an already existing field 17:36:12 They're even a mathematician if they only try and do this without succeeding as long as they have the competence to potentially do it. 17:36:18 alise_, correction: s/mathematician/successful mathematician/ :P 17:36:45 hm 17:37:01 (for the one before) 17:37:13 (my finger was on enter when your last line arrived) 17:41:26 -!- MigoMipo has quit (*.net *.split). 17:43:09 -!- pikhq has quit (*.net *.split). 17:43:09 -!- yiyus has quit (*.net *.split). 17:43:09 -!- alise_ has quit (*.net *.split). 17:43:09 -!- Gregor has quit (*.net *.split). 17:43:09 -!- olsner has quit (*.net *.split). 17:43:09 -!- adam_d has quit (*.net *.split). 17:43:10 -!- uorygl has quit (*.net *.split). 17:43:10 -!- ineiros has quit (*.net *.split). 17:43:10 -!- tombom has quit (*.net *.split). 17:43:10 -!- mtve has quit (*.net *.split). 17:43:10 -!- SimonRC has quit (*.net *.split). 17:43:10 -!- Quadrescence has quit (*.net *.split). 17:43:10 -!- jix has quit (*.net *.split). 17:43:10 -!- pineapple has quit (*.net *.split). 17:43:10 -!- rodgort has quit (*.net *.split). 17:43:10 -!- chickenzilla has quit (*.net *.split). 17:43:10 -!- jcp has quit (*.net *.split). 17:43:10 -!- EgoBot has quit (*.net *.split). 17:43:10 -!- HackEgo has quit (*.net *.split). 17:43:10 -!- cal153 has quit (*.net *.split). 17:43:11 -!- MaXo2 has quit (*.net *.split). 17:43:11 -!- Leonidas has quit (*.net *.split). 17:43:11 -!- MizardX has quit (*.net *.split). 17:43:11 -!- FireFly has quit (*.net *.split). 17:43:11 -!- wareya has quit (*.net *.split). 17:43:11 -!- myndzi\ has quit (*.net *.split). 17:43:11 -!- bsmntbombdood has quit (*.net *.split). 17:43:11 -!- comex has quit (*.net *.split). 17:43:11 -!- Ilari has quit (*.net *.split). 17:43:11 -!- dixon has quit (*.net *.split). 17:43:11 -!- cheater2 has quit (*.net *.split). 17:43:11 -!- BeholdMyGlory has quit (*.net *.split). 17:43:11 -!- AnMaster has quit (*.net *.split). 17:43:11 -!- oklopol has quit (*.net *.split). 17:43:13 -!- sshc has quit (Ping timeout: 255 seconds). 17:43:42 -!- mycroftiv has quit (Ping timeout: 240 seconds). 17:44:33 -!- sebbu has quit (Ping timeout: 240 seconds). 17:45:34 -!- sshc has joined. 17:45:34 -!- mycroftiv has joined. 17:45:34 -!- Quadrescence has joined. 17:45:34 -!- jcp has joined. 17:45:34 -!- adam_d has joined. 17:45:34 -!- MizardX has joined. 17:45:34 -!- alise_ has joined. 17:45:34 -!- MigoMipo has joined. 17:45:34 -!- cheater2 has joined. 17:45:34 -!- tombom has joined. 17:45:34 -!- FireFly has joined. 17:45:34 -!- BeholdMyGlory has joined. 17:45:34 -!- AnMaster has joined. 17:45:34 -!- oklopol has joined. 17:45:34 -!- pikhq has joined. 17:45:34 -!- wareya has joined. 17:45:34 -!- dixon has joined. 17:45:34 -!- myndzi\ has joined. 17:45:34 -!- yiyus has joined. 17:45:34 -!- mtve has joined. 17:45:34 -!- ineiros has joined. 17:45:34 -!- uorygl has joined. 17:45:34 -!- SimonRC has joined. 17:45:34 -!- EgoBot has joined. 17:45:34 -!- HackEgo has joined. 17:45:34 -!- cal153 has joined. 17:45:34 -!- jix has joined. 17:45:34 -!- pineapple has joined. 17:45:34 -!- rodgort has joined. 17:45:34 -!- chickenzilla has joined. 17:45:34 -!- olsner has joined. 17:45:34 -!- Gregor has joined. 17:45:34 -!- bsmntbombdood has joined. 17:45:34 -!- MaXo2 has joined. 17:45:34 -!- Leonidas has joined. 17:45:34 -!- comex has joined. 17:45:34 -!- Ilari has joined. 17:45:48 I will speak to him and leverage what he knows already, and move forward. 17:45:49 -!- sebbu has joined. 17:45:52 Well, you could have just stated - as I suspected - that it was a philosophical objection to all this rag at the start; then we'd know it's a philosophical disagreement and could have stopped wasting our time sooner. 17:45:58 -!- adam_d has quit (Ping timeout: 240 seconds). 17:46:04 And Zeilberger is a lunatic. 17:46:16 He's a smart lunatic. 17:46:30 Yes, well, so are many people. 17:46:32 And he knows his shit and moreover has a passion lacking in most mathematicians. 17:46:53 Masterpieces. 17:47:51 dixon: Is that just a random exclamation or does it have context? 17:48:39 alise_: You'd understand if you knew much about Zeilberger. 17:48:56 * Sgeo_ wonders who isn't a lunatic, according to alise_ 17:49:05 dixon: lol. 17:49:24 VLC: Please stop being an attention whore. You should only be making your window flash when something actually happens 17:50:26 -!- sshc has quit (Ping timeout: 258 seconds). 17:50:48 Sgeo_: VLC said that if you stop watching porn in it, it'll stop flashing you. 17:50:49 -!- sshc has joined. 17:50:55 lol 17:51:02 That's what VLC thought. 17:51:21 -!- BeholdMyGlory_ has joined. 17:51:57 -!- AnMaster_ has joined. 17:53:39 -!- jcp has quit (Ping timeout: 258 seconds). 17:54:56 -!- Leonidas has quit (Ping timeout: 258 seconds). 17:54:56 -!- MaXo2 has quit (Ping timeout: 258 seconds). 17:55:01 -!- BeholdMyGlory has quit (Remote host closed the connection). 17:55:02 -!- MaXo2 has joined. 17:55:03 -!- AnMaster has quit (Remote host closed the connection). 17:55:06 -!- mtve has quit (Ping timeout: 246 seconds). 17:55:07 -!- SimonRC has quit (Ping timeout: 246 seconds). 17:55:07 -!- SimonRC has joined. 17:55:39 -!- jcp has joined. 17:55:54 -!- Leonidas_ has joined. 17:55:55 -!- Leonidas_ has quit (Changing host). 17:55:55 -!- Leonidas_ has joined. 17:56:07 -!- sshc has quit (Changing host). 17:56:07 -!- sshc has joined. 17:56:09 -!- AnMaster_ has quit (Changing host). 17:56:09 -!- AnMaster_ has joined. 17:56:09 -!- BeholdMyGlory_ has quit (Changing host). 17:56:09 -!- BeholdMyGlory_ has joined. 17:56:14 -!- jcp has quit (Changing host). 17:56:14 -!- jcp has joined. 17:56:43 -!- cal153 has quit (Ping timeout: 258 seconds). 17:56:46 -!- BeholdMyGlory_ has changed nick to BeholdMyGlory. 17:56:48 -!- cal153 has joined. 17:56:55 -!- uorygl has quit (*.net *.split). 17:56:55 -!- ineiros has quit (*.net *.split). 17:57:58 "dd/dd is something based on dd/sh but different. It is based on the UNIX 'dd' command, but it doesn't use 'dd' command, actually, because it is different. " 17:59:48 -!- uorygl has joined. 18:00:05 -!- uorygl has quit (Read error: Operation timed out). 18:00:22 -!- uorygl has joined. 18:01:10 -!- lifthras1ir has joined. 18:01:12 -!- adam_d has joined. 18:01:12 -!- MizardX- has joined. 18:01:18 -!- sebbu has quit (*.net *.split). 18:01:18 -!- MizardX has quit (*.net *.split). 18:01:41 -!- MizardX- has changed nick to MizardX. 18:01:56 -!- werdan7 has quit (Read error: Connection reset by peer). 18:01:56 -!- lifthrasiir has quit (Remote host closed the connection). 18:02:31 -!- myndzi has joined. 18:02:49 -!- werdan7_ has joined. 18:04:02 -!- mtve has joined. 18:04:03 -!- sebbu has joined. 18:04:07 -!- charlls has joined. 18:05:35 -!- myndzi\ has quit (Ping timeout: 268 seconds). 18:05:43 -!- AnMaster_ has changed nick to AnMaster. 18:06:44 -!- fax has joined. 18:06:45 -!- ineiros has joined. 18:08:55 Infinite associative arrays + lazy mapping = 18:08:55 plus := 18:08:56 :nats / {n} [ n := [ 0 := n ] ] 18:08:56 | :nats / {n} [ n := :nats / {m} [ m succ := plus n m succ ] ] 18:08:56 ; 18:09:25 -!- charlls has quit (Ping timeout: 264 seconds). 18:11:50 -!- charlls has joined. 18:12:01 If you had succ as a function not a "method" it'd be 18:12:04 succ (plus n m) 18:15:33 -!- MaXo2 has quit (Ping timeout: 240 seconds). 18:15:42 -!- yiyus has quit (*.net *.split). 18:15:49 -!- MaXo2 has joined. 18:16:33 -!- Deewiant has quit (Ping timeout: 240 seconds). 18:17:18 -!- Deewiant has joined. 18:17:55 Why hello there... DEEWIANT 18:18:08 Wellhello 18:18:58 A little BING noise keeps happening every while on this machine... why grr 18:22:41 -!- yiyus has joined. 18:26:20 -!- pineapple has quit (Ping timeout: 245 seconds). 18:26:22 -!- pineapple has joined. 18:29:50 -!- BeholdMyGlory_ has joined. 18:31:16 -!- BeholdMyGlory has quit (Write error: Broken pipe). 18:41:02 -!- oklofok has joined. 18:42:15 -!- cheater3 has joined. 18:43:19 -!- cheater2 has quit (Write error: Connection reset by peer). 18:45:38 -!- oklopol has quit (Ping timeout: 260 seconds). 18:46:22 -!- BeholdMyGlory_ has quit (Changing host). 18:46:22 -!- BeholdMyGlory_ has joined. 18:46:25 -!- BeholdMyGlory_ has changed nick to BeholdMyGlory. 19:07:19 -!- Oranjer has joined. 19:10:07 it's weird that you can prove ~~~~P -> ~~P without LEM... 19:10:46 no it's not 19:11:18 -!- oerjan has joined. 19:12:07 -!- kar8nga has joined. 19:12:08 it's just saying ~~~~P -> (P -> False) -> False, so you have hypothesis H : ~~~~P and H' : ~P, but ~P -> ~~~P which immediately contradicts H 19:12:41 the point is that the negation gives you contra-whatever-it-is which lets you add more ~'s instead of stripping them off 19:12:53 i'm both and i both do and don't have a sense of humor, i think <-- no, that would be the quantum physicists 19:14:22 and ~~~P -> ~P for that matter 19:14:24 fax: intuitively weird, I mean 19:14:32 get into #morphism fax :< 19:14:55 it's because you're looking at it wrong 19:18:48 ~ may be an antitone galois connection, i think? 19:20:05 or wait, does that require the excluded middle 19:21:07 b -> ~a iff a -> ~b. hm that's obvious really. 19:21:23 so no excluded middle required 19:22:19 alise_ ???? 19:22:50 I think b -> ~a iff a -> ~b is excluded middle? 19:23:02 no sorry of course it's not 19:23:52 whoa, flood 19:23:53 all at once 19:23:55 sorry guyz 19:24:09 nah with ~a = a -> false, it's just switching of assumptions 19:28:16 how to give a geometrical interpretation of Sum[k=1..] (2/3)^k? 19:29:00 I'm so confused how can 2/3 possibly be less than 1 19:29:13 -!- adam_d_ has joined. 19:31:56 -!- adam_d has quit (Ping timeout: 246 seconds). 19:32:56 * oerjan swats fax to unconfuse em -----### 19:33:27 I figured it out 19:33:50 good, good 19:33:58 but still can't explain the convergence 19:34:18 it's obvious from the geometric interpretation >:) 19:34:52 what is the geometric interpretation 19:35:04 well one interpretation 19:35:37 just divide up say a triangle into infinitely many pieces so that each piece is 2/3 of the previous one 19:35:54 what 19:36:17 you mean like chop a triangle up somhow 19:36:28 actually chopping up a line segment may be easier 19:36:36 area of a triangle = 1/2 w h 19:36:46 (then you just need length 19:36:47 ) 19:38:21 fax: take a line segment whose length is x where x = 2/3 + (2/3)*x 19:39:00 chop off the first 2/3, then note how the rest is just the original scaled by 2/3 19:39:28 that's just solving the equation :( 19:39:41 it's also a geometric interpretation 19:40:30 it's just that you obviously need to solve the equation to find out how long the whole segment should be 19:42:10 if you use triangles you'll need to take the square root of 2/3 to get the right area 19:43:27 it's weird that you can prove ~~~~P -> ~~P without LEM... 19:43:44 oh and that is essentially the galois connection stuff again 19:44:26 lol I did an induction on an (impossible) natural 19:44:31 and it simply gave me no assumptions 19:44:33 empty induction! 19:44:48 (-> P 0) 19:45:30 -!- adam_d_ has changed nick to adam_d. 19:52:50 -!- hiato has joined. 19:53:26 -!- hiato has quit (Client Quit). 20:11:30 -!- adam_d has quit (Ping timeout: 260 seconds). 20:53:17 * alise_ has a cool idea 20:53:20 stack-based term rewriting 20:53:32 great idea Lindenmayer! 20:53:37 how did you come up with that 20:54:25 fuck you :D 20:54:31 no but I mean 20:54:35 basically the same as tree rewriting languages 20:54:44 except it just checks the stack every iteration 20:54:59 that way... you don't need parens or anything 20:55:01 really simple impl 20:55:16 -!- kar8nga has quit (Ping timeout: 260 seconds). 20:55:17 but yet# 20:55:17 yet 20:55:20 you can do prefix ops 20:55:21 and t t 20:55:22 -> 20:55:23 and 20:55:24 and t 20:55:27 and t t REWRITE LOL 20:55:28 t 20:56:50 Interesting profile. 20:56:51 You appear to be a progressive atheist gay programmer. 20:56:51 Possibly a redditor. 20:57:12 progressive?? 20:57:13 Well, you learned one new thing about yourself. 20:57:20 what the fuck is progressive about being a gay atheist 20:57:21 fax: fag name for left-winger 20:57:30 so wait you hate gays too? :D 20:57:45 Sgeo_: context? 20:58:07 of course not 20:58:15 how could you even think that 20:58:25 well I know you dislike atheism 20:58:38 and i don't see how being gay and atheist are not "progressive" for a loose definition 20:58:48 and I also don't see that Andy- connected the two 20:58:58 so I was assuming you were using {atheist, gay} bad -> not progressive 20:59:01 apologies if I am wrong 20:59:06 alise_, he wrote a program to get information about an SL user's profile, including group stuff 20:59:08 uh I thought progressive means like 20:59:15 http://www.mancer.org/sgeo.txt 20:59:16 radical new fresh idea 20:59:18 or somethin like that 20:59:22 as opposed to same old shit 20:59:35 SL ?? 20:59:38 well gay atheism isn't exactly acceptable in today's society :))) 20:59:39 second life 20:59:41 fax: sure, but compared to the 1950s, not now >:) 20:59:44 fax: no it just means liberal anyway because USA sucks 20:59:52 alise everyone is a gay atheist 21:00:24 fax is pulling a fax :D 21:02:48 Axiom Too_Lazy : forall P, P. (* Fill in the boring parts of proofs later *) 21:03:54 * oerjan isn't sure whether that is false or tautological 21:04:03 false, naturally 21:04:06 consider Too_Lazy False 21:04:09 : False 21:04:20 to spell it out 21:04:23 (P : Proposition) -> P 21:04:36 P is the proposition, a value of type P is a proof of P 21:05:02 hm would forall x:P, P be a tautology then? 21:05:33 -!- anto_ram has joined. 21:06:06 -!- anto_ram has left (?). 21:06:43 what about forall x:P, x 21:07:42 * oerjan guesses at least the first one is, from what you said 21:08:42 you can't do forall x:P, x it's a type error 21:08:46 (assuming P : Prop) 21:08:58 since x is a 'value' 21:09:21 ok 21:12:13 Incidentally, I'm not gay 21:12:27 * fax knew that :P 21:13:24 -!- tombom_ has joined. 21:15:25 -!- tombom has quit (Ping timeout: 264 seconds). 21:15:54 hm would forall x:P, P be a tautology then? 21:15:54 yes 21:15:56 well 21:16:00 forall P, forall x:P, P 21:16:06 forall x:P, x is wrong yeah 21:16:09 since x : P 21:16:22 :P 21:16:23 but forall a:b,c is the dependent function arrow b-->c where the b is called a 21:16:28 so obviously values don't make any sense there 21:16:30 Sgeo_: well become gay! 21:16:37 it's fashionable! 21:16:51 * Sgeo_ somewhat wishes he could choose to become bi 21:17:30 Use transsexuals as a bridge! 21:18:02 sounds kinky 21:18:42 8:46:22 [Foonetic] CTCP PING reply from Sgeo_: 1374.449 seconds 21:18:43 22 minutes, Sgeo 21:19:18 -!- hiato has joined. 21:19:21 oerjan: You can't just say that something sounds kinky, we're talking about sexuality 21:19:35 Therefore no sexual puns can possibly work. 21:19:36 Q.E.D. 21:20:27 Did you really use QED in a conversation? 21:20:38 quite easily done 21:21:20 dixon: Yes, Q.E.D. 21:21:28 Did I offend you, Q.E.D.? 21:21:59 No, you just made yourself look like a bigger pop-culture cargo-cult mathematically inept jackass. 21:22:04 Are you saying that it's quite easy to offend dixon? [Although oerjan was probably joking] 21:22:14 dixon: You're a cunt. :) 21:22:57 Quite. 21:45:47 -!- hiato has quit (Quit: underflow). 21:48:09 dixon and alise_ should just have some bittersweet sex and get it over with 21:48:31 two gay atheists in a big pile of progression 21:49:06 Sadly I'm a friendly. 21:49:16 lol 21:49:19 @ pile of progression 21:49:29 so I still have no clue what progressive means 21:49:38 probably means something totally specific to americans 21:49:49 it's a buzzword, you don't *know* what it means, you use it 21:50:24 it means democrat 21:51:08 this is so progressive 21:53:47 It generally means liberal. 21:54:24 incidentally the progress party is the most right-wing one in the norwegian parliament 21:59:34 * Sgeo_ wants a wireless mouse 21:59:55 Right now, I'm wrapping the mouse cord around the monitor so it doesn't hang off the table, because hanging off the table results in a pull 22:00:20 wireless mouse? hahaha 22:00:26 you mean a mouse that turns off by itsself 22:00:40 ..what? 22:00:54 battry 22:01:19 wireless mice are horrible; I've tried the worst and the best and they're all just as bad 22:01:22 Just don't even go there 22:01:32 Hm 22:01:38 Then I'd like a mouse with a shorter cord 22:01:41 Much shorter 22:01:50 Fledermausversuch 22:06:54 -!- MigoMipo has quit (Quit: Konversation terminated!). 22:13:57 -!- tombom_ has quit (Quit: Leaving). 22:59:45 -!- jcp has quit (Read error: Connection reset by peer). 23:00:57 -!- jcp has joined. 23:10:17 -!- lament has joined. 23:10:26 the topic is incorrect 23:14:31 -!- coppro has quit (Quit: Reconnecting…). 23:15:07 -!- coppro has joined. 23:22:13 -!- Leonidas_ has changed nick to Leonidas. 23:42:39 -!- MizardX- has joined. 23:43:49 -!- MizardX has quit (Read error: Connection reset by peer). 23:44:08 -!- MizardX- has changed nick to MizardX. 23:50:56 -!- FireFly has quit (Quit: Leaving).