00:00:23 -!- doesthiswork has joined. 00:01:21 er, of such a channel* rather 00:01:48 Scandalous 00:03:07 Didn't ski die though well I wouldn't know I've only seen him once 00:03:42 -!- heroux has quit (Ping timeout: 256 seconds). 00:03:45 ski: are you dead in which case your bouncer is holding up amazingly well hth 00:04:41 How do you cure your squid if he has the bends? 00:06:07 Decim: he'll just have to straighten out tentacle it himself 00:06:46 TIL: Something called "Sunset Overdrive" is using my good name. :( 00:07:55 "Fizzie is the corporate mascot of Fizzco, and the primary antagonist of Sunset Overdrive." "Fizzie's voice has been modified to appeal to 'young children and males in their 20's.'" This makes me unhappy. 00:11:09 -!- Decim has quit (Remote host closed the connection). 00:13:59 * oerjan notes that watching ORin try to guess haskell's syntax in the logs is slightly painful. 00:18:14 which logs twpnh 00:18:18 -!- hilquias has joined. 00:18:32 http://codu.org/logs/log/_esoteric/2015-05-12 hth 00:41:09 🞋 00:41:31 -!- cantsolvethis has joined. 00:41:33 🞢🞣🞤🞥🞦🞧 00:42:22 -!- solid_whiskey has joined. 00:45:26 anyone up for a small challenge 00:45:39 Flag == YBONCECOJTHPGKUNCFTRHEAMMEOFPOEKHV 00:45:39 Here's a hint: 00:45:40 CHWLMMYKMETMMEATVTTO == BOYILOVEMESOMECRYPTO 00:45:59 see if you can solve for the flag 00:48:03 * oerjan is reminded of someone from years ago 00:51:57 > "hello" + "world" 00:51:58 No instance for (Num [Char]) arising from a use of ‘+’ 00:51:58 In the expression: "hello" + "world" 00:52:02 > "hello" . "world" 00:52:03 Couldn't match expected type ‘b0 -> c’ with actual type ‘[Char]’ 00:52:03 In the first argument of ‘(.)’, namely ‘"hello"’ 00:52:03 In the expression: "hello" . "world" Couldn't match expected type ‘a ... 00:52:11 > "hello" = "world" 00:52:12 :1:9: parse error on input ‘=’ 00:52:16 > "hello" == "world" 00:52:17 * oerjan swats ORin -----### 00:52:17 False 00:52:25 > "hello" != "world" 00:52:26 Not in scope: ‘!=’ 00:52:26 Perhaps you meant one of these: 00:52:26 ‘!’ (imported from Data.Array), ‘M.!’ (imported from Data.Map), 00:52:33 > "hello" ++ "world" 00:52:35 "helloworld" 00:52:37 AH 00:53:12 > "hello" ++ [10] 00:53:13 No instance for (Num Char) arising from the literal ‘10’ 00:53:13 In the expression: 10 00:53:13 In the second argument of ‘(++)’, namely ‘[10]’ 00:53:22 need to open file in ed just to use the N,Ms/name/newname/g command <-- sed -i hth 00:53:48 > "hello" ++ "\n" 00:53:49 "hello\n" 00:54:06 > "hello" ++ [10 :: Char] 00:54:07 No instance for (Num Char) arising from the literal ‘10’ 00:54:07 In the expression: 10 :: Char 00:54:07 In the second argument of ‘(++)’, namely ‘[10 :: Char]’ 00:54:25 What? but but 10 is '\n' 00:54:27 > '\10' 00:54:29 '\n' 00:54:40 ORin: haskell :: is _not_ a cast. 00:54:50 it it isn't? 00:55:02 but it is used as one 00:55:22 > "hello" ++ [((Char) 10)] 00:55:23 Not in scope: data constructor ‘Char’ 00:55:23 Perhaps you meant one of these: 00:55:23 ‘Chr’ (imported from Text.PrettyPrint.HughesPJ), 00:55:25 nope. it just says what the type of the expression is. whether that expression _can_ be that type, is a different question. 00:55:33 > "hello" ++ [(Chr 10)] 00:55:34 Couldn't match expected type ‘Char’ with actual type ‘TextDetails’ 00:55:34 In the expression: (Chr 10) 00:55:34 In the second argument of ‘(++)’, namely ‘[(Chr 10)]’ 00:55:49 ord '\n' 00:55:54 > "hello" ++ [toEnum 10] 00:55:55 "hello\n" 00:56:03 I you what 00:56:25 that's one of the explicit conversion functions 00:56:33 toEnum is a weird way to spell (char) 00:56:45 that's because it's more general 00:56:57 > "hello" ++ [chr 10] 00:56:58 "hello\n" 00:57:01 :t toEnum 00:57:02 Enum a => Int -> a 00:57:21 :t ord 00:57:22 Char -> Int 00:57:33 :t chr 00:57:34 Int -> Char 00:57:43 so they copid perl 00:57:45 i never bother with chr or ord in my own programs because they require an import, so i just use the more general toEnum and fromEnum. 00:58:26 > [1 .. 4] 00:58:27 [1,2,3,4] 00:58:41 > [1 ... 4] 00:58:42 Could not deduce (Num (Over p f c0 c0 a b)) 00:58:42 from the context (Num (Over p f c c a b), 00:58:42 Num (LensLike f s t c c), 00:58:43 -!- solid_whiskey has quit (Remote host closed the connection). 00:59:07 > ['a'.. 'z'] 00:59:08 "abcdefghijklmnopqrstuvwxyz" 00:59:27 > ["a" .. "z"] 00:59:29 No instance for (Enum [Char]) 00:59:29 arising from the arithmetic sequence ‘"a" .. "z"’ 00:59:29 In the expression: ["a" .. "z"] 00:59:59 Hmm so not quite like perl 01:00:19 > ['a','b' .. 'z'] 01:00:20 "abcdefghijklmnopqrstuvwxyz" 01:00:24 > ['a','c' .. 'z'] 01:00:25 "acegikmoqsuwy" 01:00:47 > [1,2,4 .. 256] 01:00:49 :1:8: parse error on input ‘..’ 01:00:58 alas 01:01:09 > 1:[2,4 .. 256] 01:01:11 [1,2,4,6,8,10,12,14,16,18,20,22,24,26,28,30,32,34,36,38,40,42,44,46,48,50,52... 01:02:02 > [2 ** x : x in [1 .. 8]] 01:02:03 :1:13: parse error on input ‘in’ 01:02:10 hmm 01:02:20 > [2 ^ x | x <- [1 .. 8]] 01:02:22 [2,4,8,16,32,64,128,256] 01:02:51 cool 01:03:15 so that's why | isn't or 01:03:31 indeed, | is a "keyword" 01:04:09 4 ** x | x <- 2 01:04:17 > 4 ** x | x <- 2 01:04:18 :1:8: parse error on input ‘|’ 01:04:25 > [4 ** x | x <- 2] 01:04:27 No instance for (Show t0) 01:04:27 arising from a use of ‘show_M783320247286381027832586’ 01:04:27 The type variable ‘t0’ is ambiguous 01:04:28 and with | taken, & never was used commonly for anything until lens started making it reverse application 01:05:24 > first [2..4] 01:05:25 Couldn't match type ‘[]’ with ‘a b’ 01:05:25 Expected type: a b c 01:05:25 Actual type: [c] 01:05:33 > first [2 .. 4] 01:05:33 > head [2..4] 01:05:35 Couldn't match type ‘[]’ with ‘a b’ 01:05:35 Expected type: a b c 01:05:35 Actual type: [c] 01:05:35 : can't find file: L.hs 01:05:39 oops 01:05:40 > head [2..4] 01:05:42 2 01:06:01 > cdr [2 .. 4] 01:06:02 Not in scope: ‘cdr’ 01:06:03 Perhaps you meant ‘chr’ (imported from Data.Char) 01:06:04 first is something else from Control.Arrow 01:06:10 > tail [2..4] 01:06:12 [3,4] 01:06:46 well at least those names make more sense than car and cdr 01:07:04 what were they thinking 01:07:28 i think those were from assembly language 01:07:39 content of address register 01:08:04 > Int -> Float 01:08:05 :1:5: parse error on input ‘->’ 01:08:11 > x : Int -> Float 01:08:12 :1:9: parse error on input ‘->’ 01:08:17 note that head and tail are deprecated for serious use, pattern matching is safer 01:08:34 > head [] -- errors out 01:08:35 *Exception: Prelude.head: empty list 01:09:11 > case [] of x:_ -> "head is " ++ show x; _ -> "no head" 01:09:12 "no head" 01:10:08 @hoogle Int -> Float 01:10:09 Data.Set elemAt :: Int -> Set a -> a 01:10:09 Prelude (!!) :: [a] -> Int -> a 01:10:09 Data.List (!!) :: [a] -> Int -> a 01:10:17 ...that was not helpful. 01:10:23 :t fromIntegral 01:10:25 (Integral a, Num b) => a -> b 01:11:11 another conversion function that newbies bitch about needing 01:11:37 > fromIntegral (1 :: Int) :: Float 01:11:38 1.0 01:12:00 I need it so that the output has a useless .0 in it 01:12:52 > 1 :: Float 01:12:54 1.0 01:13:39 > round pi 01:13:40 3 01:13:58 > floor 4.9 01:14:00 4 01:14:06 > round 4.9 01:14:07 5 01:14:09 > round 4.5 01:14:11 4 01:14:13 fail 01:14:22 > round 3.5 01:14:23 4 01:14:27 i think it uses the banker's rounding rule 01:14:31 total fail 01:14:41 ORin: that's recommended behavior for rounding 01:14:52 it makes rounding errors even out more often 01:15:15 bah. 0,1,2,3,4 -> down. 5,6,7,8,9 -> up 01:15:38 that's the rule for money in norway too 01:15:45 -!- solid_whiskey has joined. 01:15:57 but using floating point for money isn't recommended 01:16:20 that's that BCD is for 01:16:39 well, primarily anyway IIRC 01:17:06 > 3.12345 :: Milli 01:17:08 3.123 01:17:56 > 3.12345 :: Centi 01:17:57 3.12 01:17:59 from a fixed point package 01:18:02 > 3.12345 :: Deci 01:18:04 3.1 01:18:10 > 3.12345 :: Myria 01:18:11 Not in scope: type constructor or class ‘Myria’ 01:18:25 myria isn't a metric prefix anyway 01:18:29 > 3.123456789 :: Micro 01:18:30 3.123456 01:18:58 > 3.123456789123 :: Nano 01:19:00 3.123456789 01:19:02 cool 01:19:40 there's probably some notation for giving arbitrary precision but i've forgotten it 01:20:39 > printf "%f Hello %d world" 4.5 567 01:20:41 No instance for (Show a0) 01:20:41 arising from a use of ‘show_M3328553923042570177738’ 01:20:41 The type variable ‘a0’ is ambiguous 01:21:05 That error message is very unyhelpful 01:21:18 > printf "Hello world" 01:21:19 No instance for (Show a0) 01:21:19 arising from a use of ‘show_M7421556609422406871750’ 01:21:19 The type variable ‘a0’ is ambiguous 01:21:21 printf needs a lot of type annotation when used like that 01:21:23 oh 01:21:36 > printf "%f Hello %d world" 4.5 567 :: String 01:21:37 "4.5 Hello 567 world" 01:21:58 > sprintf "%f Hello %d world" 4.5 567 01:22:00 Not in scope: ‘sprintf’ 01:22:00 Perhaps you meant one of these: 01:22:00 ‘printf’ (imported from Text.Printf), 01:22:02 fail 01:22:17 printf is overloaded so it can be used both ways 01:22:28 how is :: not a cast again then 01:22:55 because it chooses a type, but it doesn't convert one type to another 01:22:59 how oh 01:24:16 > printf "%f Hello %d world" 4.5 567 :: IO () -- this would work imperatively if lambdabot allowed running IO actions 01:24:17 01:25:43 sscanf "345" "%d" 01:25:49 > sscanf "345" "%d" 01:25:51 Not in scope: ‘sscanf’ 01:25:51 Perhaps you meant one of these: 01:25:51 ‘scanl’ (imported from Data.List), 01:25:56 -!- cantsolvethis has left. 01:26:01 > scanl "345" "%d" 01:26:02 Couldn't match expected type ‘[Char] -> a -> [Char]’ 01:26:02 with actual type ‘[Char]’ 01:26:02 In the first argument of ‘scanl’, namely ‘"345"’ 01:26:11 i haven't seen scanf anywhere commonly used 01:26:28 scanl is something completely different 01:26:34 > atoi "345" 01:26:36 Not in scope: ‘atoi’ 01:26:41 > read "345" :: Integer 01:26:42 345 01:26:55 > strtol "345" 01:26:57 Not in scope: ‘strtol’ 01:27:18 > read "345" :: Double 01:27:20 345.0 01:27:27 > read "345" :: String 01:27:28 "*Exception: Prelude.read: no parse 01:27:35 > read "345" :: [Char] 01:27:37 "*Exception: Prelude.read: no parse 01:27:45 fail 01:28:26 > read "\"345\"" :: String 01:28:27 "345" 01:28:44 it does the opposite of show, so you need the quotes 01:28:57 > read "345.0 78 \"jakarta\"" :: [Int, Double, String] 01:28:58 Expected a type, but ‘'[Int, Double, String]’ has kind ‘[*]’ 01:28:58 In an expression type signature: '[Int, Double, String] 01:28:58 In the expression: 01:29:37 oh, lists are homogenous? 01:29:43 yes 01:29:57 but that read won't work either 01:30:28 > read "(345.0, 78, \"jakarta\")" :: (Int, Double, String) 01:30:30 *Exception: Prelude.read: no parse 01:30:32 oops 01:30:37 oh 01:30:46 > read "(345.0, 78, \"jakarta\")" :: (Double, Int, String) 01:30:48 (345.0,78,"jakarta") 01:31:41 haskell distinguishes between homogeneous lists and nonhomogeneous tuples 01:33:04 tuples with many elements are a bit of an antipattern, and not that well supported. 01:34:28 [45,75.0,'f',"foo"] 01:34:34 > [45,75.0,'f',"foo"] 01:34:36 Couldn't match expected type ‘Char’ with actual type ‘[Char]’ 01:34:36 In the expression: "foo" 01:34:36 In the expression: [45, 75.0, 'f', "foo"] 01:35:06 > ['f',"foo"] :: [Either Char String] 01:35:08 Couldn't match expected type ‘Either Char String’ 01:35:08 with actual type ‘Char’ 01:35:08 In the expression: 'f' 01:35:53 Either doesn't do any silent conversion either 01:36:06 > [Left 'f', Right "foo"] :: [Either Char String] 01:36:08 [Left 'f',Right "foo"] 01:37:17 Blah 01:37:39 many newbies pass through a stage where they want heterogeneous lists 01:38:40 they're kind of an idiom in a lot of languages 01:38:59 thing is, it's usually due to an X/Y problem: unless you're doing hideously advanced stuff there's a simpler haskell way without them. 01:39:21 or at least a more typesafe one 01:59:00 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 02:03:15 -!- doesthiswork1 has joined. 02:03:15 -!- doesthiswork has quit (Read error: Connection reset by peer). 02:53:51 -!- solid_whiskey has quit (Ping timeout: 244 seconds). 03:14:52 -!- Tod-Autojoined has changed nick to TodPunk. 03:28:08 -!- ZombieAlive has quit (Remote host closed the connection). 03:45:54 You know what I want to create? 03:46:00 The Online Encyclopedia of Real Numbers. 03:46:19 Of course, there are uncountably many real numbers. But that hasn't stopped OEIS. 03:48:43 there is already the inverse symbolic calculator 03:49:02 it might have some gaps hth 03:49:22 I'm pretty sure it'll have to be the Online Encyclopedia of Computable Numbers. 03:49:43 It's kinda hard to index the non-computables. 03:51:08 MAYBE 03:51:50 Well, the OEIS doesn't claim to contain only computable sequences. 03:52:46 thare are non-computable integers too 03:53:06 (for one meaning of "are") 03:53:32 There are non-computable integer expressions. There are not non-computable integers. 03:53:41 Any integer small enough to fit inside a computer program is computable. 03:53:54 exactly 03:53:55 Any integer is computable. 03:54:12 By the reasonably definition of 'computable', 'integers', and 'are'. 03:54:34 and computer memory is a finite resource 03:54:37 ah but you cleverly forgot to define "any" hth 03:54:54 Well, there are the non-standard integers 03:55:25 you mean like ...111110? 03:55:38 ORin: Not in the definition of "computable". 03:56:23 YOUR definition of computable which presumably isn't satisfied by any um, computer 03:56:26 When pikhq says "any", they're saying that there exists an integer which is computable. 03:57:34 ORin: The definition of computable is not satisfied by any computer, yes. 03:57:44 I think that's it's theoretically possible to explicitly define a non-standard integer. 03:57:45 If you can define an uncomputable number, you could presumably still meaningfully index it 03:57:57 I will now pretty much do so. 03:58:01 I will say something stronger, though. For all integers x, x is computable. 03:58:28 That is to say, there exists an algorithm which will compute x. 03:58:34 it's only computable if you can do it with an original ibm pc. this is how theory works 03:59:05 If you use a mainframe does that make it supercomputable? 03:59:10 yes 03:59:44 Let P be a predicate on the natural numbers, defined in the language of second-order arithmetic, such that P is not satisfied by any natural number, but ZFC does not prove that P is not satisfied by any natural number. 04:00:11 Perform the Henkin construction on the theory ZFC + "there exists a natural number satisfying P". (This can be done in an explicitly definable manner.) 04:00:27 computable should have different definitions when dealing with abstract algorithms, than when dealing with the tuple of (algorithm, arguments) 04:00:59 Then the witness of the statement "there exists a natural number satisfying P" is a non-standard integer. 04:01:01 can you please refrain from offering strong opinions on something you clearly don't even know the definition of... 04:01:10 "perform the henkin construction" sounds like /such/ mathbabble 04:01:17 fakest real thing I've ever heard 04:01:37 when you have also the arguments, it is then possible to prove that no computer can be built which can carry it to completion 04:01:51 please. this is painful. 04:02:00 Set the henkin drive to negative ten parsecs 04:02:07 i don't know why you think any of this is relevant to theoretical CS 04:02:54 i mean unless you're going to go all finitist and say that huge integers don't exist in the first place because the universe can't fit the paper to write down their digits on 04:03:08 It is relevant to thw practical problem of creating a database of computable numbers? 04:03:13 which is more defensible than introducing weird arbitrary limits just because the word "computer" pops up 04:03:49 * elliott sighs 04:03:53 no, it isn't really 04:04:14 It's easy to make a database of computable numbers, just throw away all the digits and answer "yes, it's computable" 04:04:16 such a database could easily contain an integer that can trivially be computed but not in this universe 04:04:21 you just include the definition 04:04:24 "It's also NUMBERWANG" 04:04:36 (but a database of "computable numbers" is rather unlikely to include any integers) 04:04:42 (or rationals, for that matter) 04:04:47 (except as trivial examples) 04:05:34 I don't think that every integer can have a definition which can be stored. 04:05:53 True, if you mean "stored in the universe". 04:05:58 Yes 04:06:01 Mathematicians don't tend to care about the physical limits of the universe. 04:06:13 The word "computable" is defined in a way which disregards the physical limits of the universe. 04:06:20 I don't know of any other universe I can store things in 04:06:38 /topic Disregard the physical limits of the universe 04:07:45 btw how do you define "computable in this universe" 'cuz you're never gonna query every digit of a computable real 04:08:00 "any digit can be computed in reasonable time on a reasonable computer"? "the early digits can be"? 04:08:01 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 04:08:13 Remind me one of these days to study "the ultrafinitistic category". 04:08:13 ...don't actually answer that... 04:08:57 That is, the category whose objects are sets of finite sequences of symbols from the alphabet {A, B}, and whose morphisms are functions whose output length is bounded by a polynomial function of the input length. 04:09:11 Most reals aren't computable by a practical defintion. That's why we use floating point 04:09:38 the pain levels are approaching physical here, ORin 04:09:44 can you please like... google "computable number" or something 04:09:50 -!- oerjan has quit (Quit: Looks like a good time to leave). 04:10:50 Well I'm explicitly saying "parctical definition"... form now on when I say computable I will mean on a turing machine with unbounded time and space, kay 04:11:54 It is important to remember that we don't care about practicality. Even less so than most theoreticians. 04:12:00 ok but why do you think this "practical definition" is relevant to the topic that was being discussed at all 04:12:10 Brainfuck is too mainstream. 04:12:24 it's so far off from the goal of making a database of interesting real numbers that it's hard to even parse it in that context 04:12:32 Because of the idea of making a database similar to OEIS 04:12:52 I'm pretty sure OEIS includes some sequences that aren't practical to compute all of. 04:13:27 it's not like uncountability matters for making a finite subset of anyway........ 04:13:32 But I'm talking about mathematicalobjects where it isn't even practical to define them 04:13:47 ok, hint: possibly-infinite sequences of integers are isomorphic to the real numbers 04:13:52 they are the same size 04:14:04 OEIS-for-reals has to care about floating point or whatever exactly as much as OEIS does 04:14:05 http://oeis.org/search?q=busy+beaver 04:14:16 right 04:14:25 the analogy for the OEIS busy beaver entry would be chaitin's omega, I suppose 04:14:30 with the known digits for some formalism included 04:14:42 and that's not computable even if you have as many universes as you want... 04:14:50 (ok, as long as church-turing holds in all of them) 04:15:46 The 'hard' tag on OEIS is specifically for sequences where it is hard to find new entries, so.. 04:15:58 Right, So. Chaitin's omega can't be computed. ORin hypothesized number, there is no algorithm which can ever be written. 04:16:06 let alone run 04:16:21 no 04:16:25 chaitin's omega doesn't have a computable algorithm either 04:16:31 that's kind of the point. it's not computable by a turing machine 04:17:05 It is the canonical example of a non-computable number. 04:17:08 Each halting probability is a normal and transcendental real number that is not computable, which means that there is no algorithm to compute its digits. Indeed, each halting probability is Martin-Löf random, meaning there is not even any algorithm which can reliably guess its digits. 04:17:58 er, sorry I messed up there. 04:18:27 "there is no defintion which can be written" is what I wsas getting at before 04:18:49 ok, yes, undefinable real numbers are a thing 04:19:00 (and far scarier to think about than uncomputable imo) 04:19:12 yeah, such an encyclopedia would never be able to include undefinable numbers 04:19:16 but computability isn't an obstacle 04:19:31 also, what counts as "undefinable" depends on what you're writing the definitions in, of course 04:20:03 thankfully, since the answer to any question we ask can never be an undefinable number (because our question defines it), they're completely uninteresting 04:20:15 basically all just completely random juk as far as we're concerned 04:20:18 *junk 04:20:39 they are the real numbers most likely to keep you awake at night thinking about them though 04:25:00 Ok, how about this then. The "unthinkable numbers" are those where a defintion cannot be written, or possibly, cannot be fully understood. This includes undefinable numbers, but also includes many definable ones, because the shortest definitions of such, are too long for a human's lifetime. 04:25:26 Sounds good. 04:25:39 what was your point again >_> 04:26:15 Eh that last one was rather pointless actually. But fun to think about 04:26:29 Reminds me of the "intuitive definition" of a non-standard number given here: http://en.wikipedia.org/wiki/Internal_set_theory 04:26:44 -!- doesthiswork1 has quit (Quit: Leaving.). 04:27:13 A standard number is one that someone, somewhere, has specifically thought of or will specifically think of. 04:27:21 All the other numbers are non-standard. 04:27:43 sweet, every time some nerd tries to tell me about a non-standard number I can just think about it and instantly prove them wrong 04:27:48 the power........ 04:28:14 Wait how would they tell you about it? 04:28:43 by talking about a model that has a non-standard number in it 04:29:11 models are scary 04:29:22 Of course, that non-standard number I just defined (up to detail) isn't actually a number at all. 04:29:48 everyone thinks things are the same as their definitions and then you find out about models and just cry forever :( 04:30:37 * tswett performs "Mad World". 04:30:47 uh. I'm pretty sure they aren't, primarily because you can define things differently 04:31:29 pi is the area of unit circle. Or is it the ratio of diameter and perimeter? 04:31:41 I mean, people see the Peano defintion of the naturals and assume that there are no naturals that aren't of the form SSS...Z, and you can even prove it. 04:31:54 but there are realisations of the Peano axioms where that isn't true. 04:31:55 Oh 04:32:06 Yeah 04:32:07 I think it's kinda funny, I think it's kinda sad. The dreams in which it turns out that mathematical contradictions are, in fact, true, and so not only does nothing exist, but nothing ever could have existed, not even hypothetically, are the best I've ever had. 04:32:09 I think the existence of non-standard models is very surprising to most people. 04:32:29 ORin: pi is both of those things, as it happens. 04:32:41 I think the prior tendency is to assume that any consistent theory has one standard model, and to identify that model with the theory. 04:32:52 pretty sure that's how I thought of things before 04:33:08 The way I see it is that first-order Peano arithmetic is merely an attempt at approximating second-order Peano arithmetic. 04:33:15 I feel like eve mathematicians act like this is true a lot of the time by saying things that only make sense if you identify a theory with its standard model 04:33:23 in the way they phrase proofs and stuff 04:33:25 It's a good attempt, but not perfect. 04:33:34 *even 04:34:02 Here, let me spout an unsolicited opinion. 04:34:26 im listening! 04:34:48 I don't consider "a set of real numbers" to be a meaningful notion in (mathematical) reality. 04:35:22 Anyway, I should go to bed a couple hours ago. 04:35:24 Night, everyone. 04:39:13 great now i will spend an hour trying to figure out 04:53:36 agh. there is no undefinable number which is closest to x, for any definable x 04:55:20 but neither can 04:57:16 there be a undefinable number which is furthest away 05:05:36 any definition of a number, whether meta on the set of definable numbers or not, puts that number into said set. 05:09:24 meaning that you really can't touch them 05:11:38 hint: if you talk about "the undefinable number which is ...", you've already lost. 05:11:57 see https://en.wikipedia.org/wiki/Berry_paradox 05:11:59 A model of the real numbers where the undefinable numbers are missing, rearranged or otherwise messed, is indistinguishable from the standard one 05:12:19 uhhhh, not so sure about that... 05:12:27 note that the definable numbers are countable 05:12:38 the reals are most certainly not countable, so you're doing heavy surgery there 05:13:21 But how would one devise a test? 05:13:48 what is even your proposal for that model? 05:13:57 can you define one and prove it satisfies the axioms? 05:14:57 -!- yiyus has joined. 05:15:43 they can't be rearranged 05:16:23 I mean... a formal definition. :) 05:16:39 -!- jameseb- has joined. 05:19:27 remember that you cannot define undefinable numbers from within the theory. 05:19:46 OH SHIT 05:19:51 -!- tromp__ has joined. 05:20:04 if you could define the set of undefinable numbers, you could define an undefinable number by, e.g. just picking one arbitrarily. (axiom of choice!!11) 05:20:25 you can do it "a level up", though 05:21:38 How can you pick one arbitrarily? 05:21:40 So I can't define the set of definable numbers either 05:22:55 shachaf: Not sure about that one 05:23:09 axiom of choice? 05:24:03 Right, it's an axiom that I can do it, but I don't know how to do it. 05:24:13 we 05:24:22 're talking about undefinable reals, nobody gets to call constructivism 05:25:30 -!- aretecode has quit (Quit: Toodaloo). 05:26:13 I'm not sure I follow. Maybe I don't understand what an undefinable number is. 05:26:15 I guess I can say "I summon x from the set S, let it be chosen" 05:26:16 -!- tromp_ has quit (*.net *.split). 05:26:16 -!- yiyus_ has quit (*.net *.split). 05:26:17 -!- jameseb has quit (*.net *.split). 05:26:36 Is the set of definable numbers also undefinable in this context? 05:26:55 Uh. I'm not sure actually 05:26:58 https://en.wikipedia.org/wiki/Definable_real_number 05:27:27 okay, https://mathoverflow.net/questions/44102/is-the-analysis-as-taught-in-universities-in-fact-the-analysis-of-definable-numb/44129#44129 might be better. 05:27:41 Presumably we can apply the predicate definable to other math objects too 05:28:30 (sigh, models) 05:29:08 we need a model for it 05:29:11 anyway, no, you can't define (un)definable numbers in the theory you're talking about. 05:29:22 it is a meta-level concept 05:29:30 just like consistency or whatever 05:30:08 ORin: sure, uncountable things 05:30:15 in the end it's just the fact that the set of descriptions is countable 05:31:20 so the set of definable obj does not include itself? 05:36:30 OK, I see. 05:40:20 -!- notfowl- has quit (Excess Flood). 05:41:26 -!- notfowl has joined. 05:56:55 fools! 05:57:51 this book, published in the 1990s, doesn't have a publication date printed in it. I don't understand why. would it cost too much for them to add one? would it go against their sacred traditions? are they affraid people won't buy the book if it's more than two years old? 05:58:13 it has an isbn, and library catalogs list the date of the book variously as "1996", "1996?", and "2003" 05:58:18 b_jonas: The real question is why papers never have a date written on them. 05:58:57 shachaf: that's because you usually see preprint drafts. the published papers usually have a date. 05:59:10 That might be an explanation. 05:59:15 luckily for papers it's usually easy to find out the date, because they're indexed well 05:59:46 I can sort of understand no date for 18th century books, when they didn't add _any_ info about the publisher, 05:59:55 or tell who the translator or illustrator is. 06:00:28 s/18th/19th/ 06:01:08 but this book, it's a 20the century book, it has a colophon page telling the publisher, the translator, the cover illustrator, and on the back it has a list of other books published in the same series 06:01:22 it even has an isbn 06:04:49 -!- elliott has quit (Quit: leaving). 06:05:16 What is the book? 06:16:18 shachaf: ''Kalevala'', Talentum Diákkönyvtár Sorozat, (1996?) Akkord kiadó, ISBN 9638396652, abridged edition, translator Rácz István, preface by Outi Karanko. 06:20:59 -!- heroux has joined. 06:42:43 -!- heroux has quit (Ping timeout: 244 seconds). 06:47:17 -!- Tritonio has quit (Ping timeout: 272 seconds). 06:51:26 [wiki] [[Microscript]] N http://esolangs.org/w/index.php?oldid=42840 * SuperJedi224 * (+2163) Created page with "'''Microscript''' is an in-progress expirimental code golfing language by SuperJedi224. Data is stored as 64-bit integers in a single register and a single stack. The current..." 06:55:39 [wiki] [[Microscript]] http://esolangs.org/w/index.php?diff=42841&oldid=42840 * SuperJedi224 * (+106) 06:57:06 [wiki] [[Microscript]] http://esolangs.org/w/index.php?diff=42842&oldid=42841 * SuperJedi224 * (+27) 07:00:18 [wiki] [[Microscript]] http://esolangs.org/w/index.php?diff=42843&oldid=42842 * SuperJedi224 * (+254) 07:00:54 [wiki] [[Microscript]] http://esolangs.org/w/index.php?diff=42844&oldid=42843 * SuperJedi224 * (+0) 07:01:20 [wiki] [[Microscript]] http://esolangs.org/w/index.php?diff=42845&oldid=42844 * SuperJedi224 * (+0) 07:05:50 [wiki] [[Microscript]] http://esolangs.org/w/index.php?diff=42846&oldid=42845 * SuperJedi224 * (+142) 07:06:15 [wiki] [[Microscript]] http://esolangs.org/w/index.php?diff=42847&oldid=42846 * SuperJedi224 * (+10) 07:08:46 -!- notfowl has quit (Excess Flood). 07:08:56 -!- notfowl has joined. 07:08:57 -!- notfowl has quit (Excess Flood). 07:09:26 -!- notfowl has joined. 07:28:11 -!- AnotherTest has joined. 08:09:30 -!- AnotherTest has quit (Ping timeout: 265 seconds). 08:37:50 -!- notfowl has quit (Excess Flood). 08:38:26 -!- notfowl has joined. 08:39:42 -!- Patashu has joined. 08:43:13 -!- Patashu has quit (Disconnected by services). 08:43:13 -!- Patashu_ has joined. 09:32:08 -!- nszceta has joined. 10:02:45 [wiki] [[Microscript]] http://esolangs.org/w/index.php?diff=42848&oldid=42847 * SuperJedi224 * (+171) 10:03:20 [wiki] [[Microscript]] http://esolangs.org/w/index.php?diff=42849&oldid=42848 * SuperJedi224 * (+11) 10:16:51 b_jonas: Why are you reading The Kalevala? 10:19:20 fizzie: dunno, why not? I might not read that translation though. I'll have to find copies of perhaps all four modern translations and figure out which one I prefer and read only that. 10:25:17 -!- esowiki has joined. 10:25:21 -!- esowiki has joined. 10:25:21 -!- esowiki has joined. 10:26:14 -!- esowiki has joined. 10:26:18 -!- esowiki has joined. 10:26:19 -!- esowiki has joined. 10:27:16 -!- esowiki has joined. 10:27:20 -!- esowiki has joined. 10:27:21 -!- esowiki has joined. 10:27:50 -!- esowiki has joined. 10:27:54 -!- esowiki has joined. 10:27:55 -!- esowiki has joined. 10:28:38 -!- esowiki has joined. 10:28:42 -!- esowiki has joined. 10:28:43 -!- esowiki has joined. 10:29:14 -!- esowiki has joined. 10:29:14 -!- glogbot has joined. 10:29:18 -!- esowiki has joined. 10:29:19 -!- esowiki has joined. 10:29:25 -!- nortti has joined. 10:31:00 -!- trn has quit (Ping timeout: 272 seconds). 10:31:08 -!- Vorpal has joined. 10:31:08 -!- Vorpal has quit (Changing host). 10:31:08 -!- Vorpal has joined. 10:32:06 b_jonas: You should just read the Don Rosa version, it's a lot shorter. 10:32:22 fungot: Are you for or against this net neutrality thing? 10:32:22 fizzie: the first part remaining intact. the council leapt into the breach, adopting its common position, nor by the house i met a group called the bilderberg group. this group of people wishing to take a number of countries have concluded between 25 and 28. 10:32:46 fungot: Are you quite sure you're not turning into a conspiracy theorist? 10:32:46 fizzie: the willockx report is the role of echo in the other language versions too. ( parliament gave its approval for these potentially disastrous plans to go forward. this topic has been given: parliament is well aware, ladies and gentlemen, i will reply successively to the different legal systems, in which the european union 10:33:03 -!- boily has joined. 10:35:33 -!- pikhq has joined. 10:35:53 -!- nszceta has joined. 10:35:55 -!- TieSoul has quit (Quit: No Ping reply in 180 seconds.). 10:36:02 -!- merdach has joined. 10:37:17 -!- TieSoul has joined. 10:37:34 -!- Melvar has joined. 10:37:38 -!- trn has joined. 10:50:52 -!- AnotherTest has joined. 10:54:45 -!- nszceta has quit (Quit: Textual IRC Client: www.textualapp.com). 11:31:05 -!- boily has quit (Quit: ROUTING CHICKEN). 11:35:02 `? bivector 11:35:03 bivector? ¯\(°​_o)/¯ 11:38:52 -!- hilquias has quit (Remote host closed the connection). 11:43:30 A trade-off for these advantages of the modern human pelvis is that childbirth is more difficult and dangerous than in most mammals, especially given the larger head size of human babies compared to other primates. 11:43:35 That's interesting. 11:43:57 ^style 11:43:57 Available: agora alice c64 ct darwin discworld enron europarl* ff7 fisher fungot homestuck ic irc iwcs jargon lovecraft nethack oots pa qwantz sms speeches ss wp youtube 11:54:11 mroman: I know a guy who has complained loudly (but not seriously) about some primordial fish deciding to put its whatever-hole behind its rear fins instead of in front for this reason. 11:55:29 I just find it very unusual for evolution to evolve in a way that makes producing offspring more dangerous 11:55:57 because it doesn't really sound like an advantage that would make these kind of mutations survive better. 11:56:02 Tradeoffs and changing costs. 11:58:35 Particularly, if the thing is helps the offspring you do produce to survive, this may outweigh being restricted to fewer. May. 12:02:33 or it is an evolutionary mismatch 12:02:52 since evolution isn't really goal and/or future oriented these things can happen 12:03:30 -!- TieSoul has quit (Read error: Connection reset by peer). 12:03:45 -!- TieSoul has joined. 12:03:50 fungot, what's a bivector? 12:03:50 b_jonas: mr president, mrs fnord. fifth aspect: while taking account of our will to resolve their problem. it preserves the four pillar structure and the implementation of the action plan for the return of the golan heights are illegal, are marginalised, living in a different light, it is a good example in the care sector also risen in other member states. 12:04:12 fungot: is it some crazy physicist thing, or some crazy type theory computer science thing? 12:04:13 b_jonas: it is with the presidency. let me make it clear before the end of business on the other hand, we do not even comply with the guidelines which we discussed this week, as the house, has voted today without the services of such an important debate on competition this morning, on behalf of the socialist group has finally decided to allocate ecu 200m to this task, and also in order to break the taboos. we have talked about, 12:04:15 a vector that points into two directions? 12:05:21 nah, apparently it's just an antisymmetric 2-0-tensor or something 12:05:35 so yes, one that points into two directions 12:05:46 but not quite that 12:07:30 so physicist nonsense, not type theory one 12:08:17 but maybe haskell people have a different object called the same, one that's real simple, because it's just a bimorphism in the bicategory of Idunno what 12:30:37 -!- GeekDude has joined. 12:37:43 -!- doesthiswork has joined. 12:48:11 Ah, assumptions, the Foglios surprised me once again... 12:55:21 -!- Patashu_ has quit (Ping timeout: 252 seconds). 13:00:00 [wiki] [[Microscript]] http://esolangs.org/w/index.php?diff=42850&oldid=42849 * SuperJedi224 * (+242) 13:00:27 [wiki] [[Microscript]] http://esolangs.org/w/index.php?diff=42851&oldid=42850 * SuperJedi224 * (+19) /* Commands */ 13:05:46 [wiki] [[Microscript]] http://esolangs.org/w/index.php?diff=42852&oldid=42851 * SuperJedi224 * (+51) /* Commands */ 13:11:22 [wiki] [[Microscript]] http://esolangs.org/w/index.php?diff=42853&oldid=42852 * SuperJedi224 * (-219) /* Commands */ 13:11:39 [wiki] [[Microscript]] http://esolangs.org/w/index.php?diff=42854&oldid=42853 * SuperJedi224 * (+16) /* Commands */ 13:13:25 [wiki] [[Microscript]] http://esolangs.org/w/index.php?diff=42855&oldid=42854 * SuperJedi224 * (+4) /* Commands */ 13:27:47 -!- `^_^v has joined. 13:48:18 -!- Weloxux has joined. 13:49:24 what the hell is wrong with ‎Esowiki201529A 13:50:13 -!- impomatic_ has joined. 13:51:36 I hate him now. 13:52:40 He didn't even bother to change the text o_O 13:59:08 -!- lleu has quit (Ping timeout: 245 seconds). 14:19:29 -!- ZombieAlive has joined. 14:33:17 -!- doesthiswork has quit (Quit: Leaving.). 14:45:32 -!- G33kDude has joined. 14:47:46 -!- GeekDude has quit (Ping timeout: 276 seconds). 14:47:48 -!- G33kDude has changed nick to GeekDude. 14:57:05 I don't think I like the modern human pelvis 14:57:20 the bones look alll wonky 14:57:25 It has its downsides, certainly 15:00:57 Also, I bet another design wouldn't requre me to probably need a new hip when I'm 60 15:14:33 -!- ZombieAlive has quit (Remote host closed the connection). 15:27:02 -!- mitchs_ has quit (Quit: mitchs_). 15:34:18 -!- mitchs has joined. 15:49:46 -!- bb010g has quit (Quit: Connection closed for inactivity). 15:58:06 Anyone interested in CROBOTS? There's a 30th anniversary tournament in November http://crobots.deepthought.it/home.php?page=tournament2015&link=2 15:58:17 -!- j-bot has quit (Ping timeout: 272 seconds). 16:01:07 -!- J_Arcane has quit (Quit: ChatZilla 0.9.91-rdmsoft [XULRunner 32.0.3/20140923175406]). 16:01:48 [wiki] [[Wepmlrio]] http://esolangs.org/w/index.php?diff=42856&oldid=42835 * 168.99.197.17 * (+47) morse code, removed s 16:06:42 impomatic_, ooh, that looks interesting 16:09:48 I've been meaning to give it a go for years. 16:19:06 -!- J_Arcane has joined. 16:24:34 -!- lifthras1ir has changed nick to lifthrasiir. 16:54:38 -!- Sprocklem has joined. 17:01:09 [wiki] [[Microscript]] http://esolangs.org/w/index.php?diff=42857&oldid=42855 * 168.99.197.17 * (+84) implemented h(alt) and n(ewline) commands 17:02:37 [wiki] [[Microscript]] http://esolangs.org/w/index.php?diff=42858&oldid=42857 * 168.99.197.17 * (-16) /* A Java Interpreter */ Removed excess braces, following convention created by implementation for the command e. 17:04:11 [wiki] [[Microscript]] http://esolangs.org/w/index.php?diff=42859&oldid=42858 * 168.99.197.17 * (+13) sp 17:14:12 -!- PinealGlandOptic has quit (Ping timeout: 258 seconds). 17:19:34 -!- AnotherTest has quit (Ping timeout: 258 seconds). 17:21:15 -!- Weloxux has quit (Ping timeout: 246 seconds). 17:34:56 -!- Sprocklem has quit (Ping timeout: 250 seconds). 17:41:38 -!- Phantom_Hoover has joined. 17:51:06 -!- jameseb- has changed nick to jameseb. 18:02:19 -!- perrier has quit (Read error: Connection reset by peer). 18:03:32 -!- perrier has joined. 18:03:43 -!- ais523 has joined. 18:06:40 -!- perrier has quit (Read error: Connection reset by peer). 18:07:52 -!- perrier has joined. 18:08:18 -!- Sprocklem has joined. 18:11:43 -!- heroux has joined. 18:14:55 -!- idris-bot has quit (Quit: Terminated). 18:15:29 -!- idris-bot has joined. 18:18:42 -!- Sprocklem has quit (Ping timeout: 250 seconds). 18:22:49 -!- Tritonio has joined. 18:27:25 -!- Sprocklem has joined. 18:31:15 -!- heroux has quit (Ping timeout: 258 seconds). 18:37:15 [wiki] [[Microscript]] http://esolangs.org/w/index.php?diff=42860&oldid=42859 * 72.74.32.143 * (-104) /* Commands */ 18:38:04 -!- idris-bot has quit (Quit: Terminated). 18:38:26 -!- idris-bot has joined. 18:44:58 -!- heroux has joined. 19:01:15 -!- heroux has quit (Ping timeout: 276 seconds). 19:02:12 -!- heroux has joined. 19:06:52 -!- impomatic_ has quit (Quit: http://corewar.co.uk). 19:08:15 -!- nvd has quit (Ping timeout: 252 seconds). 19:08:21 -!- Taneb has joined. 19:08:57 -!- Taneb has changed nick to nvd. 19:34:44 -!- PinealGlandOptic has joined. 19:34:50 -!- heroux has quit (Ping timeout: 255 seconds). 19:41:57 -!- heroux has joined. 19:51:19 -!- heroux has quit (Ping timeout: 264 seconds). 19:57:54 -!- bb010g has joined. 19:58:27 -!- Sprocklem has quit (Ping timeout: 276 seconds). 20:04:06 -!- heroux has joined. 20:12:31 [wiki] [[Language list]] http://esolangs.org/w/index.php?diff=42861&oldid=42765 * SuperJedi224 * (+18) /* M */ 20:18:22 -!- notfowl has quit (Excess Flood). 20:18:30 -!- notfowl has joined. 20:18:30 -!- notfowl has quit (Changing host). 20:18:30 -!- notfowl has joined. 20:29:51 -!- nycs has joined. 20:32:28 -!- `^_^v has quit (Ping timeout: 245 seconds). 20:46:22 -!- shikhin has quit (Ping timeout: 256 seconds). 20:48:43 -!- ZombieAlive has joined. 21:01:57 -!- MoALTz_ has joined. 21:02:28 -!- Tod-Autojoined has joined. 21:04:31 -!- mroman_ has joined. 21:05:56 -!- Patashu has joined. 21:07:01 -!- atehwa_ has joined. 21:07:21 -!- yorick_ has joined. 21:07:21 -!- yorick_ has quit (Changing host). 21:07:21 -!- yorick_ has joined. 21:07:42 -!- shikhin has joined. 21:08:33 -!- Warrigal has joined. 21:08:59 -!- diginet has quit (Ping timeout: 250 seconds). 21:08:59 -!- mroman has quit (Ping timeout: 250 seconds). 21:08:59 -!- MoALTz has quit (Ping timeout: 250 seconds). 21:09:00 -!- trn has quit (Ping timeout: 250 seconds). 21:09:00 -!- jameseb has quit (Ping timeout: 250 seconds). 21:09:00 -!- TodPunk has quit (Ping timeout: 250 seconds). 21:09:00 -!- atehwa has quit (Ping timeout: 250 seconds). 21:09:00 -!- tswett has quit (Ping timeout: 250 seconds). 21:09:00 -!- yorick has quit (Ping timeout: 250 seconds). 21:09:14 -!- jameseb has joined. 21:09:16 -!- diginet_ has joined. 21:09:55 -!- diginet_ has quit (Remote host closed the connection). 21:09:58 Hey yorick is your name copied from hamlet that guy who died? 21:10:45 -!- diginet has joined. 21:11:06 -!- trn has joined. 21:11:11 "that guy who died" isn't very descriptive hth 21:11:35 don't most of the characters in hamlet end up dying? 21:11:45 isn't yorick the skull? 21:11:49 That's literally all I know about the yorick from hamlet 21:12:39 everyone dies in romeo and juliet too. 21:12:56 ISTR some famous musician bequeathed his skull to the Royal Shakespeare Company, with a request that it be used to play the part of Yorick 21:13:07 and apparently they actually did so at least once (not sure if they do it every time) 21:13:21 err, perhaps composer rather than musician 21:14:29 I would think that a composer would count as a musician. 21:15:09 I've also heard of the guy who donated his skull 21:15:12 perhaps, the word's more commonly used for people who read music than write it, though 21:15:29 `quote canposer 21:15:29 (and play it, but "read" is still technically correct and makes the sentence look nicer) 21:15:30 379) drinks should come in long long pipes that drip liquid at varying speeds, and you shouldn't just casually taste to them, you should really try to understand what the artist (the canposer?) was trying to convey when making the drink olsner: well you know i'm a genius. anyway i like how food works tho, because it has both th 21:17:05 What good is a quote so long it won't fit in a line of IRC? 21:18:06 we need to connect HackEgo to a server with a shorter name 21:18:19 although "verne.freenode.net" is probably one of the shortest 21:18:22 actually, no 21:18:31 it's which server that you're connected to that matters 21:18:36 not which server it's connected to 21:20:12 -!- Warrigal has changed nick to tswett. 21:30:01 -!- nycs has quit (Quit: This computer has gone to sleep). 21:32:35 -!- ZombieAlive has quit (Remote host closed the connection). 21:32:46 -!- Tritonio_ has joined. 21:33:33 -!- Patashu has quit (Ping timeout: 256 seconds). 21:35:01 so maybe something like a@43nt30.tk would be better? 21:37:06 -!- Tritonio has quit (Ping timeout: 272 seconds). 21:37:07 -!- Tritonio_ has changed nick to Tritonio. 21:41:48 -!- AnotherTest has joined. 21:47:18 -!- yorick_ has changed nick to yorick. 21:53:18 -!- AnotherTest has quit (Remote host closed the connection). 21:58:34 -!- notfowl has quit (Excess Flood). 21:59:29 -!- ais523 has quit (Ping timeout: 252 seconds). 22:00:28 -!- notfowl has joined. 22:01:40 -!- ais523 has joined. 22:04:17 -!- boily has joined. 22:10:30 -!- oerjan has joined. 22:11:07 * boily pökes oerjan in the diæresis 22:15:11 my name has no diæresis hthoily 22:18:42 -!- notfowl has quit (Excess Flood). 22:20:28 -!- notfowl has joined. 22:26:49 -!- PinealGlandOptic has quit (Remote host closed the connection). 22:27:14 -!- PinealGlandOptic has joined. 22:31:23 -!- Tritonio has quit (Ping timeout: 252 seconds). 22:53:56 How about a słash, then 22:54:48 sometimes i think the argot on this channel has gone too far 22:54:57 but then i thirth about it 22:56:37 -!- Sprocklem has joined. 22:56:38 fungot: what do you think about the matter? 22:56:38 FireFly: mr president, the treaty of amsterdam, that whatever the majority that is required is reciprocity between the pillars. i share that view. 22:57:37 -!- notfowl has quit (Excess Flood). 22:58:57 -!- notfowl has joined. 23:02:20 słashes are fine, especially when słashbuckling 23:13:42 -!- heroux has quit (Ping timeout: 256 seconds). 23:17:43 edwardk: so does https://git.haskell.org/ghc.git/commitdiff/130e93aab220bdf14d08028771f83df210da340b mean you can finally get instances for (,) :: Constraint -> Constraint -> Constraint ? 23:18:05 presumably you need to import it from GHC.Classes 23:19:40 hm but it's not mentioned in the export list. confusing. 23:31:38 `? thirth 23:31:39 thirth? ¯\(°​_o)/¯ 23:32:37 -!- ZombieAlive has joined. 23:32:56 -!- ZombieAlive has quit (Changing host). 23:32:56 -!- ZombieAlive has joined. 23:33:15 boily: i have no idea what Phantom_Hoover means either 23:33:30 it's just the irth form 23:34:03 perhaps you should questionirth me and search the logs?? 23:34:53 Phantom_Hoover: i am sorry you do _not_ get to use it with "should" hth 23:35:02 shouldirth! 23:35:14 shouldirth is fine 23:36:02 'should' isn't a verb hth 23:37:28 yes it irth 23:41:09 you're a disgrace johansen 23:41:44 if you sayfth so 23:45:08 -!- Sprocklem_ has joined. 23:45:35 -!- Sprocklem has quit (Ping timeout: 256 seconds). 23:49:10 oerjan: i tried to figure out what "irth" stood for for a while tdnh 23:50:36 iwnsth hth 23:52:21 irth is what you reply if someone tells you to rtfm hth 23:53:38 HireFly 23:53:54 run into any exciting abstractions lately? 23:54:12 * oerjan swats FireFly -----### 23:54:24 what! 23:54:53 shachaf: just ran him into an exciting abstraction hth 23:55:06 also, it had been too long 23:55:19 I suppose that is true 23:56:10 shachaf: I'm not a person of exciting abstractions, I'm afraid :( 23:57:06 what sort of exciting things have you run into, then 23:57:22 did you ride any good trains? 23:58:21 oerjan: johansen??? 23:58:59 -!- Sprocklem_ has quit (Ping timeout: 258 seconds).