00:08:10 -!- oerjan has joined. 00:16:12 It'd be funny if, in mathematics, we preceeded all exact numbers with "≁" for "not approximately" 00:17:11 hilarious 00:17:39 i think that symbol generally goes the other way, though. 00:22:37 Approximately not equla to 00:22:59 Mathematica prefixes high-precision decimal literals with `. 00:25:03 mathematica does a lot of things 00:25:08 occasionally they make sense 00:25:33 Taneb must've invented those. 00:25:48 CReal has an approximately-not-equal-to operator. 00:26:07 > 1 == (1 + 10^(-1000) :: CReal) 00:26:09 *Exception: Negative exponent 00:26:16 > 1 == (1 + 10**(-1000) :: CReal) 00:26:18 True 00:26:36 Er wait 00:26:44 Jafet: I totally wasn't planning on implementing that into Kastor 00:26:57 (approximately-not-equal-to, that is) 00:27:07 Also, I'm sorry, "exception: Negative exponent"!? 00:28:29 @src (^) 00:28:29 x ^ 0 = 1 00:28:29 x ^ n | n > 0 = f x (n-1) x 00:28:29 where f _ 0 y = y 00:28:29 f x n y = g x n 00:28:29 where g x n | even n = g (x*x) (n `quot` 2) 00:28:31 | otherwise = f x (n-1) (x*y) 00:28:33 _ ^ _ = error "Prelude.^: negative exponent" 00:32:13 :t (^) 00:32:15 (Integral b, Num a) => a -> b -> a 00:32:29 hppavilion[1]: that type means a doesn't need to have division 00:32:39 Ah 00:33:03 Haskell has at least three exponentiation operators 00:33:07 :t (^^) 00:33:08 (Fractional a, Integral b) => a -> b -> a 00:33:13 :t (**) 00:33:15 Floating a => a -> a -> a 00:33:40 whoa whoa whoa 00:33:59 I,I newtype Foo a = Foo { unFoo :: a }; instance Monoid a => Num (Foo a) where Foo x * Foo y = Foo (x <> y); fromInteger 1 = Foo mempty; timesN n = unFoo . (^ n) . Foo 00:34:36 Num from the revelation 00:35:55 * oerjan thinks base should have the Monoid equivalent of (^) :( 00:37:24 @typo (mconcat.).replicate 00:37:26 Monoid c => Int -> c -> c 00:37:40 doesn't count, it doesn't do binary bisection 00:38:17 oerjan: it does with just a small Num instance hth 00:39:07 ooh you were doing it in that direction 00:40:37 ititdh 00:48:37 <\oren\> good eeing 00:54:30 -!- Sprocklem has quit (Quit: [). 01:00:13 -!- bb010g has quit (Quit: Connection closed for inactivity). 01:13:06 -!- augur_ has quit (Ping timeout: 240 seconds). 01:17:17 -!- augur has joined. 01:19:04 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 01:20:40 oerjan: I think I'm going to make a character encoding. A /semantic/ character encoding 01:22:10 hppavilion[1]: https://tools.ietf.org/html/rfc5242 ? 01:22:18 OKAY 01:28:00 lifthrasiir: I know about Unicode (and I assume that that document is related) 01:28:10 I just feel like making my own for fun. 01:28:34 -!- andrew__ has joined. 01:28:40 hppavilion[1]: read it first then retry. 01:29:29 lifthrasiir: It looks lnog 01:29:33 *long 01:29:59 hppavilion[1]: probably you should look at the date first :) 01:30:17 Oh xD 01:30:26 it's an "alternative" to Unicode that is exclusively described as a series of combining glyphs 01:30:46 (similar to Unicode's real system, Ideographic Description Sequence, but extended to *every* letter) 01:31:40 <\oren\> that's not semantic though 01:32:01 well, yeah. 01:32:13 <\oren\> semantic would encode "cat" and "猫" to the same code 01:32:34 \oren\: but not a program "cat". 01:33:15 <\oren\> right. as well as "gato" and "chat" and "catus" 01:33:16 what would it encode "pooch" to? 01:33:25 lifthrasiir: What I'm making is a sort of hybrid of character encoding and markup language 01:33:49 <\oren\> shachaf: depends what pooch means 01:34:11 Basically, if there were a language that generates documents in this encoding, you could type \(COMB:SUBSET,RING) to get the "open subset" operator 01:34:26 What about "dog"? 01:34:36 <\oren\> that's not semantic, it's exactly opposite 01:34:45 "chien"? "cabot"? 01:34:45 \oren\: Oh. 01:34:48 the (fictitious) modernized TeX comes to mind. 01:35:05 <\oren\> you're encoding form, not substance 01:35:08 \oren\: What's the word I'm looking for then? 01:35:10 Ah 01:35:26 The idea would be that character appearance is defined with a process of combining diacritics and variables, instead of just text 01:35:46 So you could also do things like declare that characters have arcs between each other 01:35:54 The crowning jewel of the idea is arrows 01:36:05 <\oren\> "morphic" 01:36:07 Arrow characters actually work: any arrow is possible 01:36:08 Ah 01:37:28 So you aren't just limited to, for example, dashed arrows only come in up/down/left/right 01:39:37 Because you just combine the dashed arrow and diagonal arrow characters in in a COMBINE block, which is delimited by control bracktets and starts with "COMB" then the control separator 01:45:11 -!- bb010g has joined. 02:14:41 2/|\2 02:30:40 -!- mauris has joined. 02:44:14 -!- hppavilion[1] has quit (Ping timeout: 250 seconds). 02:45:31 hellauris 02:55:47 -!- MDude has joined. 02:59:31 -!- augur has quit (Ping timeout: 250 seconds). 03:06:47 -!- augur has joined. 03:10:57 -!- hppavilion[1] has joined. 03:14:10 I thought of a hyperoperational version of factorial 03:14:35 -!- mauris has quit (Ping timeout: 264 seconds). 03:16:04 functional factorial 03:16:14 quintopia: Dammit. 03:16:17 or is that just recursion 03:16:56 Is functional factorial you asking me to implement factorial into the Arithmetic of the Functia (which is probably actually a calculus)? 03:17:12 i'm asking nothing 03:17:14 do what you like 03:19:29 Basically, n⥉ (where ⥉ is the hyperoperational factorial operator) is equal to H[n](n, H[n-1](n-1, H[n-2](n-2, ...H[1](1, 0)...)) 03:19:39 It might just be ackermann xD 03:19:42 I can't tell 03:19:56 nah not really 03:21:35 Great 03:21:53 So now I want function factorial 03:22:24 To do so, I would need to define a + and - operation such that, if I do f-I enough times, then eventually it is equal to I. Is that possible? 03:22:28 For all functions? 03:22:43 well 03:22:49 Or a large subset of functions which I could reasonably constrain myself to? 03:23:44 AND preferably consistent with normal addition and subtraction for the real number subset of functions 03:23:58 FireFly: I've updated my font sample to support a realtime sample rendering of any given text 03:24:09 (a simple JS hack) 03:25:58 quintopia: It might not be possible for non-well-ordered sets, such as the set 𝕗 (which is a set I'm using) 03:26:30 (which isn't even partially ordered except for a subset of its arguments) 03:26:37 (s/arguments/elements) 03:26:59 (ms/s)/s\/) 03:41:47 -!- Thisbe has joined. 03:58:59 -!- hppavilion[1] has quit (Ping timeout: 264 seconds). 04:16:50 -!- MDude has changed nick to MDream. 05:00:13 -!- bb010g has quit (Quit: Connection closed for inactivity). 05:03:47 -!- Thisbe has quit (Quit: Thisbe). 05:05:54 -!- bb010g has joined. 05:36:28 [wiki] [[UberGenes]] http://esolangs.org/w/index.php?diff=45612&oldid=45579 * Quintopia * (-7) /* Python 2 */ furthergolfed 05:36:52 [wiki] [[UberGenes]] http://esolangs.org/w/index.php?diff=45613&oldid=45612 * Quintopia * (+0) /* Python 2 */ 05:43:21 @tell FreeFull I wonder how much finangling was needed to produce this sentence <-- i guess you could do some kind of estimation, pruning and final search... i wonder if using "&" rather than "and" at the end was necessary. 05:43:22 Consider it noted. 05:54:53 -!- get52 has joined. 06:07:50 as a first step, find some hard limit on no. of letters in english numeral / number represented, for numbers large enough 06:08:19 1/27 should be enough for this 06:10:30 -!- \oren\ has quit (Ping timeout: 240 seconds). 06:10:50 seven hundred and seventy quadrillions 06:10:57 looks pretty solid :P 06:11:17 (777 gives the longest prefix) 06:11:27 who are you talking too 06:11:45 -!- \oren\ has joined. 06:11:57 myself, about FreeFull's self-describing pangram 06:12:02 lol 06:12:07 "This pangram contains four As, one B, two Cs, one D, thirty Es, six Fs, five Gs, seven Hs, eleven Is, one J, one K, two Ls, two Ms, eighteen Ns, fifteen Os, two Ps, one Q, five Rs, twenty-seven Ss, eighteen Ts, two Us, seven Vs, eight Ws, two Xs, three Ys, & one Z." 06:12:14 oh I see 06:12:17 I wasn't there for that 06:12:25 thought I was missing out on something 06:12:26 heh 06:12:35 actually i was just reading it in the logs 06:13:03 o 06:13:04 i'm trying to convince myself you can never get numbers above hundred 06:13:12 with that template 06:13:27 oh ye 06:13:56 because the names of numbers are just not long enough. 06:14:32 ah 06:14:39 <\oren\> what if you spell out the letter names like gee bee cee 06:14:42 > length "sevenhundredandseventythousand" 06:14:44 30 06:14:59 \oren\: i do not think that matters. 06:15:05 <\oren\> you might be able to get 100 e's 06:15:13 oh right 06:15:16 yes. 06:15:18 [wiki] [[UberGenes]] http://esolangs.org/w/index.php?diff=45614&oldid=45613 * Quintopia * (+244) Implementation: bugfix: crash on EOF 06:15:26 ok. but definitely not more than a thousand. 06:15:37 > 30/1000 06:15:39 3.0e-2 06:15:45 > 1000/30 06:15:47 33.333333333333336 06:16:01 <\oren\> > sqrt 1000 06:16:04 31.622776601683793 06:16:14 > 26*6 06:16:15 156 06:16:26 it's not really about sqrt 06:16:38 there are 26 letters, so at most 26 numerals 06:18:01 a numeral smaller than a million never has more than 30 letters. 06:18:45 and for those larger, the length still never gets above a small fraction of the number itself 06:20:48 oh wait 06:20:58 that's not quite right. forgot a part. 06:21:58 > length "sevenhundredandseventyseventhousandsevenhundredandseventyseven" 06:22:00 62 06:23:07 > length "sevenhundredandseventyseventhousand" 06:23:09 35 06:23:35 but multiplying by 1000 gets you only 35-40 more letters. 06:30:00 > length . group $ sort "sevenhundredandseventyseventhousand" 06:30:03 12 06:30:06 er 06:30:15 > map length . group $ sort "sevenhundredandseventyseventhousand" 06:30:18 [2,4,7,2,6,1,1,4,2,2,3,1] 06:30:37 7 es 06:33:31 > 1000/62 06:33:33 16.129032258064516 06:37:48 [wiki] [[UberGenes]] http://esolangs.org/w/index.php?diff=45615&oldid=45614 * Quintopia * (+229) new features < and > 06:38:49 -!- hppavilion[1] has joined. 06:41:07 Unicode pangrams imo 06:41:52 O KAY 06:42:34 > 62*26 06:42:35 1612 06:42:41 2+2 06:42:45 > 2+2 06:42:46 4 06:42:49 yay 06:43:04 lambdabot knows its arithmetic 06:43:08 @botsnack 06:43:08 :) 06:43:12 > 420+69 06:43:14 489 06:43:42 > 9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999*999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999 06:43:44 9999999999999999999999999999999999999999999999999999999999999999999999999999... 06:43:48 lol 06:44:09 get52: lambdabot is too smart for you 06:44:13 tbh yea 06:45:22 -!- Sprocklem has joined. 06:45:49 > let xs = 1:xs in xs 06:45:49 > 420+1337+69 06:45:50 [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1... 06:45:51 1826 06:45:57 > length "seventhousandsevenhundredandseventyseven" 06:45:59 40 06:46:05 > 26*40 06:46:07 1040 06:46:14 > length "wew lad" 06:46:16 7 06:46:33 hm just length is not enough to prove it doesn't exceed a thousand 06:47:17 what are you trying to do 06:48:14 > length "my penis" 06:48:16 8 06:48:20 thx fam 06:48:20 bounding the length of a pangram 06:48:32 "This pangram contains four As, one B, two Cs, one D, thirty Es, six Fs, five Gs, seven Hs, eleven Is, one J, one K, two Ls, two Ms, eighteen Ns, fifteen Os, two Ps, one Q, five Rs, twenty-seven Ss, eighteen Ts, two Us, seven Vs, eight Ws, two Xs, three Ys, & one Z." 06:48:36 > length "my penis" in inches 06:48:38 :1:19: parse error on input ‘in’ 06:48:40 kek 06:48:55 get52: lambdabot is not google hth 06:49:15 lel\ 06:49:21 get52: Try Wolfram|Alpha, it still might not know. Or better, use a ruler 06:49:33 heh 06:49:47 (Regardless whether you want the length of the string or of your penis) 06:49:59 lmao 06:50:01 (Although a length of a string of text in inches would depend on the font, isn't it?) 06:50:13 heh yeah 06:50:22 -!- aretecode has joined. 06:50:56 what's with all this 06:51:05 shachaf: get52 discovered lambdabot 06:51:29 and this channel 06:51:30 tbh yes 06:51:36 no bully pls 06:51:37 The lambdabot is run the Haskell code; you can learn Haskell programming and then you can understand its working. 06:51:59 > 20\\\\3 06:51:59 haskell isnt functional tbh fam 06:52:00 Not in scope: ‘\\\\’ 06:52:05 Aww :( 06:52:14 I thought that was added. Does it get deleted automaticalyl? 06:52:50 get52: Can you elaborate on that? I do not quite understand. 06:53:13 well really it's so far away from common lisp that it's basically object oreiented 06:53:19 get52: I assume you've seen the wiki? 06:53:22 hppavilion[1]: it gets deleted when someone runs the @undefine command. 06:53:24 yes 06:53:38 @uptime 06:53:38 uptime: 10d 1h 1m 8s, longest uptime: 1m 10d 23h 44m 29s 06:53:38 get52: Common lisp isn't the definition of "Functional" 06:53:48 yes it is smh fam 06:53:59 or when it quits i assume, but it hasn't done that 06:53:59 get your head out of your ass 06:54:02 god damn 06:54:03 A language can be entirely unlike common lisp but still functional 06:54:06 no 06:54:14 e.g. unlambda iirc 06:54:19 that's not true tho 06:54:22 get52: please be polite 06:54:23 I think unlambda is functional 06:54:30 it's object oriented 06:54:30 Haskell is functional and pure, Lisp is functional and impure 06:54:37 ur mom is impure 06:54:38 smh 06:54:47 -!- ChanServ has set channel mode: +o oerjan. 06:54:54 Your mom**w is impure 06:54:54 get52: i said, please be polit. 06:54:57 *+e 06:55:14 mom**w? 06:55:27 get52: Surreal numbers. w is a surrogate little omega 06:55:33 It basically means infinity 06:55:35 oh I thought you were censoring yourself 06:55:39 I think it is not object oriented, although even if it is, it doesn't change it. 06:55:45 really i'm just fucking around 06:55:46 No xD. I don't self-censor 06:55:50 mom**1=mom 06:55:51 it's not object orient of course not 06:55:55 lol 06:55:57 mom**2=grandmom 06:56:01 heh 06:56:05 mom**3=great-grandmom 06:56:07 <3 06:56:13 mom**w=great*-grandmom 06:56:29 but yeah i was just playing around lol 06:56:30 (Familial arithmetic might be interesting) 06:56:58 I came from the wiki btw 06:57:01 It is possible to be object oriented and functional, anyways. 06:57:05 Of course. 06:57:26 you guys seem quite a bit more knowledgeable then me heh 06:57:30 > let (\\\\) a b = a + (1/b) 06:57:31 : not an expression: ‘let (\\\\) a b = a + (1/b)’ 06:57:40 I don't know haskell xD 06:57:47 me either tbh 06:57:49 get52: We've been here a while xD. 06:57:57 :^) 06:58:16 -!- oerjan has set channel mode: -o oerjan. 06:58:18 > (\\\\) a b = a + (1/b) 06:58:20 :1:12: parse error on input ‘=’ 06:58:27 > a\\\\b = a + (1/b) 06:58:28 > fizzbuzz 06:58:29 :1:8: parse error on input ‘=’ 06:58:29 Not in scope: ‘fizzbuzz’ 06:58:30 hppavilion[1]: @let 06:58:40 Thank you! 06:58:48 @let a\\\\b = a + (1/b) 06:58:49 Defined. 06:58:54 It's the backslash operator 06:59:03 haskell is so unlike java, it can't be oop 06:59:15 i know 06:59:29 java is p gross tbh 06:59:32 get52: He was doing what you did earlier. It was funny 06:59:36 It is awul 06:59:38 *awful 06:59:44 lol 06:59:52 you can do oop in haskell but you'll get looked at weirdly 07:00:01 ma mum**e is awful 07:00:02 that sounds hilarious 07:00:17 (e=1/w) 07:00:25 (e is epsilon here) 07:01:01 (so mum**e=root(mum, w) ) 07:01:35 > 10**w 07:01:37 10**w 07:01:40 oh 07:01:42 ok 07:01:47 get52: Haskell doesn't do surreals 07:01:47 > 10 + 1 07:01:49 11 07:01:59 i dont even know what i'm doing tbh 07:02:12 Do you like TeX? It is also so unlike Java.............. 07:02:28 ur mom is unlike java :^) 07:02:35 because she's great 07:02:38 and kind 07:02:46 @let a~:^b = (a+b-b**2)*7/a 07:02:47 Defined. 07:02:56 13~:^7 07:03:04 > 10 := 11 07:03:05 > 13~:^7 07:03:07 Not in scope: data constructor ‘:=’ 07:03:07 Perhaps you meant one of these: 07:03:07 ‘:+’ (imported from Data.Complex), 07:03:08 -15.615384615384615 07:03:39 > (0 :+ 1)^2 == -1 07:03:41 True 07:04:06 Wut 07:04:23 Oh 07:04:32 :+ is a complex number constructor 07:05:07 > 26*38 07:05:09 988 07:05:40 > 2^(0:+1) 07:05:42 Could not deduce (Integral (Complex a0)) arising from a use of ‘^’ 07:05:42 from the context (Num a) 07:05:42 bound by the inferred type of it :: Num a => a at :1:1 07:05:48 > 10+20 07:05:50 30 07:05:52 > 2**(0:+1) 07:05:54 0.7692389013639721 :+ 0.6389612763136348 07:05:59 > chr(55) 07:06:01 '7' 07:06:03 Uh... 07:06:04 oh neat 07:06:14 > chr (69) 07:06:16 Htf does that work? 07:06:16 'E' 07:06:34 because lambdabot is running python 07:06:34 :^) 07:06:36 > chr(8601) 07:06:38 '\8601' 07:06:44 > unichr(8601) 07:06:46 Not in scope: ‘unichr’ 07:06:51 > ord('l') 07:06:53 108 07:06:56 holy 07:06:57 > uchr(8601) 07:06:58 Not in scope: ‘uchr’ 07:06:58 Perhaps you meant ‘chr’ (imported from Data.Char) 07:07:08 > ord('p') 07:07:10 112 07:07:12 > ord('λ') 07:07:14 955 07:07:16 woah 07:07:22 > chr(955) 07:07:24 nah, haskell just somehow chose the same names (Pascal used those too i think) 07:07:25 '\955' 07:07:50 i was going to say they're from Pascal but someone who knows Algol is just going to one-up me 07:07:52 oerjan: Aren't the python names straight outta C? 07:08:04 oh are they? 07:08:28 I assumed so, though C probably got them from somewhere else. Like Pascal. 07:08:28 * oerjan doesn't know C a third as well haskell these days. 07:08:44 How do I do unichr? 07:10:04 get52: I'm making a morphic character encoding 07:10:18 :D nice 07:10:21 what is it 07:10:32 hppavilion[1]: what's unichr? chr already does unicode. 07:10:41 what is morphic character encoding? 07:10:43 oerjan: Not in haskell, it appears 07:10:46 forgive me i'm new haha 07:10:48 > var $ chr 955 07:10:49 Couldn't match type ‘Char’ with ‘[Char]’ 07:10:50 Expected type: String 07:10:50 Actual type: Char 07:10:52 oops 07:10:58 > var [chr 955] 07:11:00 λ 07:11:04 this what you wanted? 07:11:06 get52: It's a character enconing that's more than a lookup table 07:11:11 Yes. 07:11:16 OH yeah 07:11:17 nice 07:11:31 i'm making an esoteric lang atm 07:11:34 that's why i came here lol 07:11:37 Basically, you can do \(COM:SUBSET, RING) to get the open subset operator 07:11:41 Naturally xD 07:11:50 > [chr 955] -- this is shown as an escaped string, therefore only ASCII 07:11:52 "\955" 07:11:53 it has 3 commands 07:12:02 (A marriage between a negative number of people is... UNNATURAL! LULZ!) 07:12:03 addition, display, input 07:12:15 you don't need subtraction because it resets at 251 07:12:17 :^) 07:12:20 :) 07:12:30 Sounds a bit like Deadfish 07:12:35 But not the same 07:12:52