00:01:08 -!- mhi^ has quit (Quit: Lost terminal). 00:07:43 oerjan: yes. 00:08:02 Also what does twh mean. 00:08:04 stmbif. 00:08:35 ` 00:08:36 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: : not found 00:08:40 oops 00:08:43 `? twh 00:08:44 twh would help, but is an hth derivative. hth. twh. hand. 00:08:55 oerjan: yes, I was assuming you have a decideable set, so you have a proof it's closed under graph minors and an algorithm to decide membership 00:08:56 `? stmbif 00:08:57 stmbif? ¯\(°​_o)/¯ 00:09:19 Sgeo: if you need to do anything semidecidable, then it's captured by the notion of an open set in topology. 00:09:20 an oracle is too strong 00:30:25 -!- tertu has joined. 00:36:51 "SuperBlade® Offers: * Highest computing density [...] * Unsurpassed TCO" 00:39:29 [wiki] [[Manufactoria]] http://esolangs.org/w/index.php?diff=39423&oldid=39422 * Quincunx * (+72) 00:40:16 [wiki] [[Manufactoria]] M http://esolangs.org/w/index.php?diff=39424&oldid=39423 * Quincunx * (-2) Urgh. Forgot to edit category 00:41:16 -!- variable has changed nick to function. 00:58:00 -!- function has changed nick to trout. 01:09:45 -!- tswett29 has changed nick to tswett28. 01:27:48 -!- drlemon has joined. 01:34:59 -!- augur_ has joined. 01:36:08 -!- augur has quit (Ping timeout: 255 seconds). 01:46:49 https://bugs.launchpad.net/ubuntu/+source/unity/+bug/1308572 ha ha ha ha 01:54:03 Tell me if this library and document is OK? http://zzo38computer.org/taillib/taillib.zip 01:55:05 -!- Vamadeus has joined. 01:55:06 -!- Vamadeus has quit (Changing host). 01:55:06 -!- Vamadeus has joined. 02:00:31 -!- nooodl__ has joined. 02:04:50 -!- nooodl_ has quit (Ping timeout: 265 seconds). 02:05:22 -!- tromp has joined. 02:07:00 Is that really a security bug? It assumes the attacker has physical access 02:07:35 Jafet: yes. it gives you access to a running session 02:07:41 screen locking usually does assume that 02:07:44 and the attacker may not have physical access 02:07:48 it's almost as if lock screens are meant to protect from physical access, huh 02:08:22 you can have physical access to the interface devices without having physical access to the actual computer 02:09:09 what are you talking about it's not as if tons of publicly-accessible devices use computers underneath!! 02:09:12 like what if the computer is on mars and i have access to the voyager probe 02:09:37 seeing windows errors on atms or whatever is always a bit odd 02:09:58 I thought linux desktops had screen lockers because windows did the same thing and people have come to expect them 02:10:35 It's not like desktop distros have any security anyway 02:10:53 can you stop trolling 02:10:59 you do it all the time and you know you're doing it 02:11:19 Jafet: Security can still be have for programs to access other programs, even if the user with physical access is allowed to do everything. 02:11:34 like less than half the things you say are sincere rather than just bait to let you be incredulous at people 02:11:37 stop it 02:12:27 Installing Windows or Linux on such a computers as ATM or whatever can have problem and should not be done. If you need an operating system at all, you can install DOS or whatever 02:12:32 Huh. 02:12:37 -!- nisstyre has joined. 02:12:53 DOS is much faster than Linux and Windows. 02:15:03 withdrawing money at a million dollars an hour 02:19:29 -!- Deewiant has quit (Ping timeout: 252 seconds). 02:29:05 `coins 02:29:06 jotcoin isangcoin birdcoin withis=thagcoin eftatecoin tlfecoin xochicksonideutunaperetunadowelseptaterpardottercoin 242150coin padsomcoin isepolistcoin celecoincoin checoin reversitecoin weakcoin xtccoin carinheacoin skulacoin fracoin cluncoin avowlcoin 02:29:16 zzo38: you should write a bitcoin miner for DOS 02:29:56 -!- Vamadeus has quit (Ping timeout: 252 seconds). 02:32:40 dos runs so badly on asics 02:32:59 depends which kind 02:34:09 But not all ASICs are designed to run all computer programs. 02:37:30 psst, i'm making a joke on the fact that bitcoin mining on cpus isn't profitable hth 02:40:05 there should be a computer made of superconducting materials so you never have to power it 02:40:57 it isn't on gpus, either 02:41:32 Bike: needs to do reversible computing by landauer's principle 02:41:44 xactly, i'll just make some fredkin gates and call it good 02:41:54 elliott: which is why i didn't say gpus DUH 02:42:09 (i read somewhere that even the asic miners are losing money though) 02:42:32 i wonder if you could do it so that it only hit resistors on a successful output 02:42:53 then all you'd be spending is time. and coolant 02:44:29 whoa, so many global hashes per second 02:44:38 2^64 every ~5 minutes 02:45:19 That's a lot. 02:45:22 -!- Vamadeus has joined. 02:45:23 -!- Vamadeus has quit (Changing host). 02:45:23 -!- Vamadeus has joined. 02:45:49 So all the Bitcoin miners in the world could brute force 56-bit encryption about once per second in total. 02:46:43 Assuming their ASICs aren't application-specific. 02:47:03 So if you had all that computing power at your disposal, then in 600 seconds, you could either break 600 56-bit encryption doodies, or earn $460. 02:47:24 :t (^.) 02:47:26 s -> Getting a s a -> a 02:47:27 "Application-specific integrated circuit" 02:47:45 Jafet: your point? 02:47:47 Night, everyone. 02:47:47 -!- tswett28 has quit (Quit: KVIrc 4.2.0 Equilibrium http://www.kvirc.net/). 02:48:37 :t (4 ^.) 02:48:37 Num s => Getting a s a -> a 02:48:53 :t (_4 ^.) 02:48:53 (Field4 s t a1 b, Functor f) => Getting a ((a1 -> f b) -> s -> f t) a -> a 02:49:22 oh wait 02:49:53 > [1,3..]^._4 02:49:55 Could not deduce (Control.Lens.Tuple.Field4 [t0] [t0] a a) 02:49:55 arising from the ambiguity check for ‘e_1134’ 02:49:55 from the context (Control.Lens.Tuple.Field4 [t] [t] a a, 02:49:55 GHC.Num.Num t, 02:49:55 GHC.Enum.Enum t) 02:49:58 oops 02:49:58 :i Getting 02:50:20 > (1,2,"many",1/0)^._4 02:50:22 Infinity 02:51:23 type Getting r s a = (a -> Const r a) -> s -> Const r s hth 02:52:28 :i Const 02:52:38 stupid commands 02:52:39 @src Const 02:52:39 Source not found. Abort, Retry, Panic? 02:52:50 indeed 02:53:11 newtype Const a b = Const a or thereabouts 02:53:46 makes no sense to me 02:54:35 well that Getting type matches a lens if you use Const r as the functor 02:55:17 which is what you do to "get" the value of the lens field 02:56:33 I have once independently implemented a very restrictive kind of lenses before I knew what "lens" meant. But, now I know it better. 02:58:01 Which could not use two types. 03:03:40 Is there any reason I couldn't have pure effectively return a lazy value that gets a real result once the type is known by a different mechanism? 03:04:01 'hey, this value is pure of some unknown applicative, when I find out, I'll turn into something useful' 03:04:47 that is how type classes work 03:05:18 I was hoping to not have to significantly fake type classes 03:05:24 I didn't have to do much for Functor 03:07:38 you don't want to have to fake type classes to implement a type class? 03:07:48 sounds like a question for #racket or #rebol or #ada or #sgeolanguage 03:09:07 Bike: trying to find the balance between translating an idea that works very well in one language and avoiding blind copying that ignores the value that the destination language provides 03:09:37 > imapped %@~ replicate $ ['a'..'z'] 03:09:38 ["","b","cc","ddd","eeee","fffff","gggggg","hhhhhhh","iiiiiiii","jjjjjjjjj",... 03:10:00 it's just, functor only has the one method, so you only need to worry about the one function and don't have to coordinate anything 03:10:17 > imap replicate ['a'..'z'] 03:10:18 ["","b","cc","ddd","eeee","fffff","gggggg","hhhhhhh","iiiiiiii","jjjjjjjjj",... 03:10:38 Bike: exactly 03:10:54 so... of course that won't be adequate for applicative, which has two. 03:11:12 imap is a v. popular email protocol 03:11:36 It's not so much a matter of Applicative having two methods, as to the fact that one of those methods puts an applicative value in a positive position without having one in a negative position 03:11:37 :t imap 03:11:37 shachaf: NOT INSCRUTABLE ENOUGH HTH 03:11:37 FunctorWithIndex i f => (i -> a -> b) -> f a -> f b 03:11:44 (is that the right terminology)? 03:11:53 oh fuck off, i have enough problems with signs in electrochemistry 03:11:53 I like to think of Applicative as being just one method, lift 03:11:55 Bike: imo that type is fairly legible, isn't it? 03:12:04 i'm not the guy to ask. 03:12:09 Bike: adjunctions are the worst btw 03:12:28 and/or category theory in general 03:12:32 Bike: Applicative's pure can create an (Applicative f) => f a without access to an f anything 03:12:37 it's like someone invented a math whose whole purpose was to make it as easy as possible to make sign errors 03:12:40 yeah, i figured that out 03:12:50 "positive" and "negative" is a weird way to put it 03:13:10 (lift somefunc a1 a2 a3) is fine, (lift somefunc a1) fine, (lift somefunc) err 03:13:15 but i remember i used to not understand those sorts of types. thankfully, i'm a haskell god now 03:13:17 Bike: I could swear I've seen it somewhere 03:13:54 it seems to me that values like that are only easy to deal with because of type inference, so... 03:14:12 tinference 03:14:37 oerjan: you should join #-lens 03:15:23 I think positive/negative makes sense... ((a -> b) -> c), the a is in negative position relative to the (a -> b), the (a -> b) is in negative position relative to the whole function, so - * - = +, a is in positive position relative to the whole function, which needs to produce an a at some point 03:15:31 Or, maybe not 'needs' 03:15:37 But it doesn't consume an aa 03:15:44 no, look, fuck you, cathode/anode is already too much 03:16:14 you know how (a -> b) is like (¬a | b)? 03:16:17 except in haskell 03:17:26 I can't tell if that's interesting or a joke 03:18:02 -!- maurer has quit (Read error: Operation timed out). 03:18:12 -!- maurer has joined. 03:18:43 math is all about acting like stupid jokes are interesting. umbral calculus 03:34:53 umbral calculus leave you in the dark :P 03:34:57 *leaves 04:02:52 shachaf: But Haskell types are intuitionistic logic rather than being classical logic (but, you can use continuation transform to make classical logic out of intuitionistic logic, too) 04:03:15 zzo38: hence "except in haskell" 04:16:51 But Haskell isn't the only thing that it is 04:18:27 Intuitionistic logic is still a kind of a logical system, and so is linear logic, and classical logic. 04:19:25 is Tetra Master a logical system 04:21:32 \f -> either (Left . f) Right <$> lemCC 04:22:22 i'm not sure that answers my question 04:22:32 For f in Kleisli category: \f -> fmap (f >=>) <$> lemCC 04:22:55 Bike: I am not answering your question I am answering shachaf's question. 04:23:08 Bike, yes, tetris logic 04:23:14 turn the blocks 04:25:06 i asked a question? 04:25:58 shachaf: I mean, I answered your answer. 04:28:40 In case you don't know what lemCC means, then I can tell you: lemCC = callCC (return . Right . (<=< return . Left)); or lemCC = ContT $ \c -> c $ Right (\a -> ContT $ \_ -> c (Left a)); or callCC x = lemCC >>= either return x; 04:29:39 In other words, "except in Haskell" isn't quite right, because if you are using continuations then it is right. 04:29:40 the real question is what Stanisław Lem thinks of continuations 04:30:40 I don't know, but in this case "lem" is short for "law of excluded middle". 04:30:42 -!- kronion_ has joined. 04:30:43 pirx continuated pretty far 04:31:09 -!- kronion_ has quit (Max SendQ exceeded). 04:31:12 (I also don't know who Stanislaw Len is) 04:31:45 -!- kronion_ has joined. 04:33:12 Law of excluded middle continuations might be a bit easier than call/cc for some people, possibly. 04:33:43 Bike is an expert̵ 04:33:57 damn right 04:35:07 zzo38: famous polish scifi author 04:35:23 O, that's who it is. 04:35:46 damn right̵ 04:36:00 `unidecode t̵ 04:36:00 ​[U+0074 LATIN SMALL LETTER T] [U+0335 COMBINING SHORT STROKE OVERLAY] 04:37:17 I'm having some difficulty with figuring out how to use LastPass 04:44:57 [wiki] [[User:Quincunx]] M http://esolangs.org/w/index.php?diff=39425&oldid=39405 * Oerjan * (+0) /* Circuit Diagram 10 */ sp. 04:46:53 [wiki] [[Trainscript]] M http://esolangs.org/w/index.php?diff=39426&oldid=39404 * Oerjan * (+5) sp link 04:48:21 -!- Sorella has quit (Quit: It is tiem!). 04:49:48 -!- adu has joined. 04:57:02 -!- kallisti_ has joined. 04:59:55 -!- kallisti has quit (Ping timeout: 252 seconds). 05:02:15 -!- Vamadeus has quit (Remote host closed the connection). 05:04:02 -!- tswett has quit (Ping timeout: 255 seconds). 05:22:12 -!- nooodl__ has quit (Quit: Ik ga weg). 05:25:14 -!- tromp has quit (Remote host closed the connection). 05:25:50 -!- tromp has joined. 05:29:59 -!- tromp has quit (Ping timeout: 252 seconds). 06:01:54 -!- adu has quit (Quit: adu). 06:12:00 -!- nisstyre has quit (Quit: WeeChat 0.4.3). 06:13:06 -!- oerjan has quit (Quit: leaving). 06:26:46 -!- kallisti has joined. 06:29:45 -!- kallisti_ has quit (Ping timeout: 252 seconds). 06:40:16 -!- kallisti_ has joined. 06:43:20 -!- kallisti has quit (Ping timeout: 252 seconds). 06:45:09 -!- tertu has quit (Ping timeout: 252 seconds). 07:04:29 -!- Slereah_ has joined. 07:13:02 -!- kallisti has joined. 07:16:35 -!- kallisti_ has quit (Ping timeout: 265 seconds). 07:40:01 What again was the criteria for using Chans vs. MVar? 07:53:34 -!- kallisti_ has joined. 07:55:56 -!- kallisti has quit (Ping timeout: 255 seconds). 08:24:17 -!- Patashu_ has quit (Ping timeout: 264 seconds). 08:29:46 -!- MindlessDrone has joined. 08:49:24 -!- MoALTz has joined. 08:56:33 -!- Phantom_Hoover has joined. 09:00:04 -!- augur has joined. 09:01:05 -!- augur__ has joined. 09:03:37 -!- augur_ has quit (Ping timeout: 276 seconds). 09:05:33 -!- augur has quit (Ping timeout: 276 seconds). 09:20:01 [wiki] [[User:Quincunx]] http://esolangs.org/w/index.php?diff=39427&oldid=39425 * Quincunx * (+1307) /* Roguelike */ 09:28:11 -!- mhi^ has joined. 09:28:18 -!- augur__ has changed nick to augur. 09:48:57 -!- carado has joined. 10:11:45 -!- Patashu has joined. 10:13:00 -!- Patashu has changed nick to Patashu-. 10:13:02 -!- Patashu- has changed nick to Patashu_. 10:14:44 -!- Patashu_ has quit (Client Quit). 10:23:01 -!- Slereah_ has changed nick to Slereah. 10:24:09 -!- yorick has joined. 10:29:24 -!- Patashu has joined. 10:46:36 -!- conehead has quit (Quit: Computer has gone to sleep). 10:55:57 -!- KingOfKarlsruhe has joined. 11:57:52 -!- carado has quit (Quit: Leaving). 11:57:59 -!- nooodl has joined. 12:08:37 -!- carado has joined. 12:16:48 -!- nooodl has quit (Ping timeout: 240 seconds). 12:30:40 -!- nucular has joined. 12:30:40 -!- nucular has quit (Changing host). 12:30:41 -!- nucular has joined. 12:30:50 int-e, can you quickly put lambdabot in #cs-york again? 12:39:32 this keeps comingup. do you want to have it there permanently? 12:44:50 No, it's a controversial bot in the channel 12:52:58 -!- carado has quit (Quit: Leaving). 12:53:39 -!- Vamadeus has joined. 12:53:39 -!- Vamadeus has quit (Changing host). 12:53:39 -!- Vamadeus has joined. 13:01:01 -!- kronion_ has quit (Remote host closed the connection). 13:01:41 -!- kronion has joined. 13:02:03 -!- kronion has quit (Remote host closed the connection). 13:02:15 Pah. x86_64 has tagged TLBs but they are being wasted on hypervisor support. Boring. 13:04:11 (Presumably they added tags because otherwise nested page tables would become ridiculously expensive.) 13:12:10 -!- kronion has joined. 13:35:18 -!- Slereah has quit (Ping timeout: 276 seconds). 13:39:22 -!- Slereah has joined. 14:17:40 -!- tromp has joined. 14:26:39 -!- Patashu has quit (Ping timeout: 276 seconds). 14:40:16 -!- boily has joined. 14:41:19 Is it possible to program lambdabot so that it can be invited and kicked? So that, you don't have to keep asking them 15:09:28 -!- Sorella has joined. 15:25:45 I don't have op in that channel 15:47:07 -!- kronion has quit (Quit: Textual IRC Client: www.textualapp.com). 15:54:02 zzo38: I tried to make an experimental bot of mine do that once: when you invite it, it joins. there doesn't need to be much special handling for kicking though. 15:56:28 zzo38: do you know of something like a balanced search tree automatically maintained by sql triggers? like, if I add a row to a particular table, triggers will add a node to the search tree representing that row, and that search tree is stored in the same database. 15:56:40 I asked here earlier and someone's referred me to you. 15:59:10 b_jonas: I don't know of any such thing, although it may be possible. If you want to search in a SQL database, though, you should probably create an index for that purpose. (Creating a search tree may be useful if you want to convert the data into other formats, possibly, though) 16:00:30 What is it you are trying to make, though? 16:00:33 zzo38: sure, normally you'd use an sql index, which is part of why I'm asking on this channel, 16:00:48 OK 16:00:56 but I was wondering about something that could be implemented by the database as a sort of index but I haven't yet seen any database engine implement it yet 16:02:02 even then, a search tree (I was thinking a treap might be the easiest) maintained using triggers might not be the best way. 16:02:10 I myself use SQLite, which now supports recursive WITH clauses. A statement in a trigger is not allowed to start with a WITH clause, though (it can still be used in subqueries and so on). 16:02:24 But still, I don't know what it is you are trying to make. 16:02:44 Yes, I was thinking about this, and I think it's probably possible to implement in sqlite, but it's very difficult. 16:03:08 (I'm not sure whether it's possible without a recursive WITH clause.) 16:03:41 (I mean, it probably is if you use complicated recursive triggers with arbitrarily deep recursion to simulate function calls, but that'd be crazy.) 16:05:04 It might be possible to do it without recursion if you cheat by using ordinary indexes on the tables storing the tree to find nodes. 16:05:12 I don't know if it is. 16:05:46 O, I always use recursive triggers with deep recursion to simulate function calls (and similar things which do not correspond quite with function calls of most programming languages). 16:05:48 I mean, if you don't want a balanced search tree, just a search tree, then you can have an index on the tree table to find the node you have to insert under rightaway. 16:06:32 zzo38: just triggers calling each other to simulate function calls is ok, what I would like to avoid is arbitrarily deep (log tree size deep) recursion that way. 16:07:07 OK 16:07:45 Why do you need a balanced search tree though? 16:08:32 I don't really need it, mind you, just wondering on it. 16:09:12 I was thinking of an index that can optimize queries like SELECT min(t.w) FROM t WHERE t.k BETWEEN ? AND ?; 16:09:58 where min could be any aggregate that is a fold of an associative operation, such as count, min, max, total, sum (ignoring integer overflows) 16:10:13 SQLite has extensions to do that already, including multidimensional search. 16:10:30 by building a search tree that stores in each node min(t.w) of all descendants of that node 16:11:24 so if you had a hypotehtical index on t.k covering min(t.w), you could execute such a query in log(count of all rows) time 16:11:59 because you would just have to add the stored min(w) values in O(log(count of all rows)) nodes in the index 16:12:17 and the index could be maintained quickly too, as quickly as any search tree based index 16:13:50 true, a multi-dimensional tree could implement SELECT min(t.w) FROM t WHERE t.k BETWEEN ? AND ?; quickly, 16:14:19 so maybe SELECT sum(t.w) FROM t WHERE t.k BETWEEN ? AND ?; would be a better example 16:15:27 imagine that t is changing between queries, otherwise this could be solved easier 16:17:02 mind you, I don't really have an application for such queries on a dynamically changing table either 16:19:04 -!- tswett has joined. 16:19:04 -!- tswett has quit (Changing host). 16:19:05 -!- tswett has joined. 16:20:58 It doesn't seem to useful to me to make a search tree like that unless you need to convert data into another format. Normally I would think you would just use an ordinary index, or if necessary to do so, use a R*Tree index. 16:22:10 But you can try to implement a balance search tree in SQL if you want to! 16:22:49 -!- kronion has joined. 16:23:12 -!- kronion has quit (Max SendQ exceeded). 16:39:38 -!- zzo38 has quit (Remote host closed the connection). 16:40:34 -!- JLG has joined. 16:41:40 -!- JLG has quit (Client Quit). 16:42:13 [wiki] [[Circute]] M http://esolangs.org/w/index.php?diff=39428&oldid=20063 * Smjg * (-4) /* External resources */ upd8 link 17:52:32 -!- Slereah has quit. 18:00:03 -!- kronion_ has joined. 18:06:31 -!- drdanmaku has joined. 18:08:16 -!- kronion_ has quit (Quit: Textual IRC Client: www.textualapp.com). 18:08:55 -!- tromp has quit (Remote host closed the connection). 18:09:29 -!- tromp has joined. 18:13:47 -!- tromp has quit (Ping timeout: 255 seconds). 18:18:03 -!- MindlessDrone has quit (Quit: MindlessDrone). 18:19:38 -!- Phantom_Hoover has left ("Leaving"). 18:19:46 -!- Phantom_Hoover has joined. 18:24:13 -!- Slereah_ has joined. 18:39:12 -!- nucular has quit (Quit: Switching to phone). 18:44:24 How did this website end up so badly done that the images are links to the images? http://logicoin.info/ 18:52:36 Is it "Hey, I make my own coin" time? 18:52:50 `coins # yes 18:52:52 Argument "#" isn't numeric in int at /hackenv/bin/words line 148. \ coin 18:52:54 oh no 18:52:55 `coins 18:52:57 purecoin festiconcoin gularioplincoin thulzacoin discoin limcoin thumamcoin wingcoin mulacoin xingcoin praocoin udatempovacifucoin haibocoin mumothcoin divzcoin partreacoin unbartrelcoin whenservicoin stackcoin kipcoin 18:53:28 `coins 18:53:29 advendocoin ammcoin rincoin gechtcoin pancoin bjectdispcoin nasscoin consomskjcoin modecoin folercoin exjcoin twelcoin memporcoin wpbroketlancoin triicoin prorrelucoin olutecoin subicoin aggedcoin oorcoin 18:53:51 wpbroketlancoin sounds good 18:54:57 -!- KingOfKarlsruhe1 has joined. 18:55:36 -!- KingOfKarlsruhe has quit (Ping timeout: 240 seconds). 18:55:59 -!- KingOfKarlsruhe1 has changed nick to KingOfKarlsruhe. 18:56:07 -!- KingOfKarlsruhe has quit (Changing host). 18:56:08 -!- KingOfKarlsruhe has joined. 18:57:02 gigabitcoin 18:57:13 because who want's a bit when you can have a gigabit 18:57:24 why not tb then? 18:57:58 -!- impomatic has joined. 19:01:55 -!- boily has quit (Quit: WeeChat 0.4.2). 19:01:58 scotland's post-independence currency: oorcoin 19:03:13 I am perpetually tempted to make a gold-backed cryptocurrency 19:03:42 [wiki] [[Symbols]] http://esolangs.org/w/index.php?diff=39429&oldid=37964 * 50.166.86.223 * (-49) 19:03:57 Taneb : I think that might be complicated legally 19:04:09 and technically 19:04:23 Well, for a start I do not own all that much gold 19:04:24 Well legally it's pretty easy 19:04:28 The sumerians did it! 19:04:32 They didn't have fancy things 19:04:44 to buy this cocaine you just need to give me a hash of the atomic microstate of your bullion 19:05:01 But it will change if you heat it :o 19:05:10 Or leave it alone for a nanosecond, really 19:05:46 wealth is fleeting, son 19:13:26 -!- conehead has joined. 19:18:32 -!- Sorella has quit (Remote host closed the connection). 19:24:12 -!- ^v has joined. 19:28:12 -!- Sorella has joined. 19:43:56 -!- ^v has quit (Ping timeout: 252 seconds). 19:57:30 -!- nooodl has joined. 19:58:18 -!- KingOfKarlsruhe has left. 20:44:23 -!- nooodl has quit (Remote host closed the connection). 20:46:08 -!- nooodl has joined. 20:52:38 + 20:53:18 - 20:53:43 ~ 20:54:51 − 20:56:21 ⋅ 21:01:22 -!- Patashu has joined. 21:04:06 ⨳ 21:12:34 -!- tromp has joined. 21:13:50 -!- TodPunk has quit (Read error: Connection reset by peer). 21:13:50 -!- Tod-Autojoined has joined. 21:14:24 – 21:14:46 % 21:17:05 -!- tromp has quit (Ping timeout: 252 seconds). 21:17:25 —⸺⸻ 21:17:34 In other words, the em dash, the two-em dash and the three-em dash. 21:17:58 No four-em dash in Unicode. :/ 21:19:38 but there is a snowman and a pile of poo 21:19:53 -!- kwertii has joined. 21:19:57 And the LEFTWARDS TWO-HEADED TRIPLE DASH ARROW. 21:20:03 (I was looking at things with "DASH" in the name.) 21:21:30 `unidecode ⸻ 21:21:31 U+2E3B THREE-EM DASH \ UTF-8: e2 b8 bb UTF-16BE: 2e3b Decimal: ⸻ \ ⸻ \ Category: Pd (Punctuation, Dash) \ Bidi: ON (Other Neutrals) 21:21:40 `unicode INVISIBLE TIMES 21:21:41 ​⁢ 21:21:58 `unidecode ⁢ 21:21:59 ​[U+2062 INVISIBLE TIMES] 21:22:08 INVISIBLE D: 21:22:25 There's also btoh the WAVE DASH (〜) and the WAVY DASH (〰). 21:23:18 There is a symbol for k and for the k of kelvins 21:24:08 -!- Patashu has quit (Ping timeout: 255 seconds). 21:25:31 There's a FACE SAVOURING DELICIOUS FOOD (U+1F60B), it probably goes well with POT OF FOOD (U+1F372). 21:25:51 Apparently delicious food is the only thing you can savour. 21:26:48 I think savouring implies enjoying, so deliciousness may also be implied 21:29:02 `unicode FACE SAVOURING DELICIOUS FOOD 21:29:02 U+1F60B FACE SAVOURING DELICIOUS FOOD \ UTF-8: f0 9f 98 8b UTF-16BE: d83dde0b Decimal: 😋 \ 😋 \ Category: So (Symbol, Other) \ Bidi: ON (Other Neutrals) 21:41:20 wow, my font actually renders that 21:47:24 For me it "works" (it's not terribly savour-y) in browser but not in terminal. 21:59:38 -!- impomatic has quit (Ping timeout: 265 seconds). 22:06:55 -!- tertu has joined. 22:07:52 -!- HackEgo has quit (Remote host closed the connection). 22:27:35 -!- HackEgo has joined. 22:33:27 -!- oerjan has joined. 22:35:22 http://www.beige-box.com/libressl/ project is going well 22:42:46 What again was the criteria for using Chans vs. MVar? <-- an MVar contains just one value, a Chan a FIFO queue of them... 22:43:03 @tell mroman What again was the criteria for using Chans vs. MVar? <-- an MVar contains just one value, a Chan a FIFO queue of them... 22:43:03 Consider it noted. 22:43:17 aww, the embed doesn't work 22:43:24 i need to do something about this race condition between @tell'ing and /whois'ing 22:43:25 It's playing ... either the mp3 or ogg, I think 22:44:09 The mp3, based on that's what my browser decided to download 22:53:33 Bike, i don't understand 22:53:37 `unidecode ⨳ 22:53:38 ​[U+2A33 SMASH PRODUCT] 22:58:05 `unidecode \0 22:58:06 ​[U+005C REVERSE SOLIDUS] [U+0030 DIGIT ZERO] 23:03:24 -!- MoALTz has quit (Quit: bbl). 23:18:56 -!- tromp has joined. 23:21:08 -!- Phantom_Hoover has quit (Ping timeout: 255 seconds). 23:23:41 -!- tromp has quit (Ping timeout: 264 seconds). 23:24:43 -!- yorick has quit (Remote host closed the connection). 23:28:00 -!- tertu has quit (Ping timeout: 240 seconds). 23:29:21 -!- Sprocklem has quit (Quit: Lost terminal). 23:29:51 -!- kwertii has quit (Quit: kwertii). 23:39:15 -!- Sprocklem has joined. 23:41:09 -!- mhi^ has quit (Quit: Lost terminal). 23:45:25 -!- ^v has joined. 23:55:18 -!- nooodl has quit (Quit: Leaving). 23:56:33 -!- zzo38 has joined.