2019-09-01: 00:04:33 -!- tromp has quit (Ping timeout: 252 seconds). 00:15:11 -!- b_jonas has quit (Remote host closed the connection). 00:19:07 -!- unlimiter has joined. 00:25:21 -!- unlimiter has quit (Quit: WeeChat 2.5). 00:40:50 -!- Phantom_Hoover has quit (Quit: Leaving). 00:52:24 [[Deadfish]] M https://esolangs.org/w/index.php?diff=65851&oldid=65850 * A * (+102) /* Julia */ 00:53:12 [[Deadfish]] M https://esolangs.org/w/index.php?diff=65852&oldid=65851 * A * (+257) /* R */ 00:54:02 [[Deadfish]] M https://esolangs.org/w/index.php?diff=65853&oldid=65852 * A * (+1422) /* A:; */ 01:13:10 [[User talk:A]] https://esolangs.org/w/index.php?diff=65854&oldid=65635 * A * (+45) /* Sandbox */ new section 02:06:20 -!- atslash has quit (Quit: This computer has gone to sleep). 03:21:29 [[User talk:Zzo38]] https://esolangs.org/w/index.php?diff=65855&oldid=52832 * YamTokTpaFa * (+503) /* I'd like to learn about AAAAAAAAAAAAAA!!!! more. */ new section 03:22:35 -!- nfd9001 has quit (Ping timeout: 258 seconds). 03:23:17 [[AAAAAAAAAAAAAA!!!!]] https://esolangs.org/w/index.php?diff=65856&oldid=63961 * YamTokTpaFa * (+130) /* See Also */ 03:35:19 [[Talk:ABCDXYZ]] N https://esolangs.org/w/index.php?oldid=65857 * YamTokTpaFa * (+127) Created page with "== Link to implementation? == --~~~~" 04:29:29 -!- xkapastel has quit (Quit: Connection closed for inactivity). 04:42:22 -!- nfd9001 has joined. 05:11:11 -!- MrBismuth has joined. 05:16:24 -!- tromp has joined. 05:20:59 -!- tromp has quit (Ping timeout: 252 seconds). 06:04:08 -!- Frater_EST has joined. 06:42:53 -!- tromp has joined. 06:43:47 -!- tromp has quit (Remote host closed the connection). 06:43:59 -!- tromp has joined. 07:07:03 [[User:Dtuser1337/Sandbox]] https://esolangs.org/w/index.php?diff=65858&oldid=65843 * Dtuser1337 * (-157) /* commands */ 07:07:57 [[User:Dtuser1337/Sandbox]] https://esolangs.org/w/index.php?diff=65859&oldid=65858 * Dtuser1337 * (-17) /* commands */ 07:08:29 [[User:Dtuser1337/Sandbox]] https://esolangs.org/w/index.php?diff=65860&oldid=65859 * Dtuser1337 * (-12) /* commands */ 07:09:04 [[User:Dtuser1337/Sandbox]] https://esolangs.org/w/index.php?diff=65861&oldid=65860 * Dtuser1337 * (+0) /* Hello world! */ 07:11:24 [[User:Dtuser1337/Sandbox]] https://esolangs.org/w/index.php?diff=65862&oldid=65861 * Dtuser1337 * (+17) /* string types */ 07:29:46 [[User:Dtuser1337/Sandbox]] https://esolangs.org/w/index.php?diff=65863&oldid=65862 * Dtuser1337 * (+39) /* commands */ 08:06:29 -!- AnotherTest has joined. 08:07:19 -!- ArthurStrong has joined. 08:32:42 -!- atslash has joined. 08:36:16 -!- ArthurStrong has quit (Ping timeout: 246 seconds). 08:40:26 -!- Lord_of_Life has quit (Ping timeout: 244 seconds). 08:42:51 -!- Lord_of_Life has joined. 08:50:41 -!- Frater_EST has left. 09:12:32 -!- nfd9001 has quit (Ping timeout: 245 seconds). 09:26:25 -!- nfd9001 has joined. 09:30:39 -!- ArthurStrong has joined. 09:34:35 -!- Lykaina has joined. 09:34:45 B00HAE00AB00eAE00AB00lAE00AB00lAE00AB00oAE00AB00,AE00AB00 AE00AB00wAE00AB00oAE00AB00rAE00AB00lAE00AB00dAE00AB00!AE00AG 09:35:19 do you like it? 09:37:28 Is this it? 09:39:40 current sample 09:40:40 still working on the specifics 09:41:18 it's a "Hello, world!" program 09:43:32 B00HAE00A = put 00 'H' act out 00 act 09:45:43 there are still numerous bugs to be worked out 09:47:28 and figuring out how i will code this in c 09:48:56 like, i think i'm typing in prefix notation when i should be using postfix 09:53:55 B00HAE00A maybe should be 4800BA00EA 09:59:23 480000BA00EA690000BA00EA210000BA00EAG 09:59:31 that's more like it 10:02:05 crap, move the 'G' at the end to the beginning so we get the famous "!iH" message 10:04:04 i'll type more *after* i have these bugs worked out. 10:09:15 -!- arseniiv has joined. 10:42:23 this make more sense? 10:42:29 000001@C000b00@K00GB00F000101@Q01@CL.Hello, world! 11:06:45 -!- b_jonas has joined. 11:18:58 -!- sprocklem has quit (Ping timeout: 268 seconds). 11:20:26 -!- sprocklem has joined. 11:46:57 -!- atslash has quit (Ping timeout: 244 seconds). 11:47:13 -!- atslash has joined. 12:36:03 -!- Frater_EST has joined. 13:35:28 -!- Frater_EST has quit (Remote host closed the connection). 13:38:53 I don't recognize the language, which makes this rather boring. 13:39:48 Lykaina: I presume what’s considered esoteric in part depends on our history. By this day, there is many things which were novel in their days because of obfuscation of code. Now, obfuscation alone is usually not enough to be interesting 13:39:57 L100010@Q10@B00@D00@Cb00000@J000010B.Hello, world! 13:41:16 Seriously, you could be pasting random strings and I would be just as thrilled. 13:41:27 oh 13:41:38 several people don’t consider obfuscation alone esoteric from the start, even. Ideally, a good esolang is a whole from which you can’t subtract anything or add anything to it (ideally) 13:41:58 so it could include several striking ideas 13:42:18 though sometimes there are too many. Though usually it’s pretty subjective 13:43:23 I can’t advice, my esolangs are quite ordinary 13:43:36 though one time I had an obfuscation idea 13:44:34 it was to represent various constructs of a simple functional language by fearful mathematical expressions like integrals 13:44:52 Lykaina: I might care if I knew how to decipher this, that is, what the underlying language is... then I could jump to the meta level and ponder questions like computational power, the ability to make quines, stuff like that, which I find interesting. 13:45:02 an anonymous function was expressed as ∫ body d var 13:45:33 (That's not a promise though... a lot of the time I find something too similar to something else I already know and leave it at that.) 13:45:41 it was quite fun for me, though I don’t think someone would like write in it more than ten or so programs 13:45:54 https://paste.ee/p/p4BVc 13:46:00 arseniiv: yes, indefinite integrals have binders! :) 13:46:05 I was glad how it looked in LaTeX 13:46:18 int-e: indeed, that was why I used them 13:46:36 (definite ones as well, but they also have bounds, which are a bit odd in programming... especially since you get two of them) 13:46:51 Lykaina: thanks 13:46:56 maybe I’d described that draft on the wiki for fun but it requires math support :P 13:47:59 . o O ( Hosted by cloudflare: [email protected]@[email protected]@[email protected], world! ) 13:50:02 yeah, I've seen such code in mailing list archives 13:51:54 A - M leave nothing behind, N - Z leave a single value behind. forgot to type that. 13:52:03 int-e: oh I was wrong, an integral is a function definition, ∫ anonymous-function-body d defined-name 13:53:37 I like my named let syntax more: \prod_name arg1 ∧ value1 ∨ … ∨ argn ∧ valuen ∨ body 13:54:13 arseniiv: that's nasty :P 13:54:36 arseniiv: I guess you called that language "continuous integration" to make it easy to find on google 13:54:54 int-e: (rofl) 13:56:02 https://paste.ee/p/Orcqj 13:56:12 sorry about that 13:56:50 int-e: also there are string literals which can contain [A-Za-z] and are written in \mathfrak 13:58:53 Lykaina: is the "jump counter" what would normally be a "program counter"? 13:59:17 arseniiv: stylish 13:59:23 oh no... 13:59:57 it counts jump recursion from while or if ops 14:00:25 name is holdover from earlier draft 14:00:30 ah 14:00:34 so Hello world in TeX syntax will be \{\mathfrak{Hello}^\sigma\{p_{32}\ 14:00:36 oh 14:00:45 I was not finished 14:02:28 \{\mathfrak{Hello}^\sigma\{p_{32}\mid\mathrm{sg}\}^\sigma\mathfrak{world}^\sigma\{p_{33}\mid\mathrm{sg}\}\mid\mathscr E\} 14:02:51 [[User:FAKE1007]] N https://esolangs.org/w/index.php?oldid=65864 * FAKE1007 * (+9) Created page with "Hi there." 14:04:17 Lykaina: I don't think I can piece it together just yet. Btw, for stack manipulation, there's the notation (from Forth, I believe) i1 ... in -- o1 ... om, so for example addition could be specified as a b -- a+b. 14:05:28 instead of \{ arg \mid f \}, one should really write \varepsilon^{f}arg (or arg^{f}\varepsilon), but the former deprecated syntax is just imaginarily-deprecated; a1 ^{f} a2 ^{f} a3 is equivalent to \{ a1, a2, a3 \mid f \} and so on and \{ \mid f \} ≡ \varepsilon^{f} 14:06:21 arseniiv: I'm not really following anymore btw. 14:07:43 it’s okay (for completeness, σ concatenates lists, sg(a) gives [a], p_n means n, strings are lists of integers, ℰ writes a string to output) 14:12:07 int-e: thanks for looking 14:21:51 making some minor fixes, no point in re-uploading 14:51:25 -!- ArthurStrong has quit (Remote host closed the connection). 14:57:15 Simplification: 14:57:16 Stack 1: B@100000K@000012C@00D@00LA 14:57:16 Stack 2: Hello, world! 14:57:41 damn 14:58:11 Stack 1: B@100000K@000021C@00D@00LA 14:59:02 this is with stacks being read from left 15:00:03 [[Random Malbolge]] N https://esolangs.org/w/index.php?oldid=65865 * Palaiologos * (+703) Created page with "Random Malbolge is esoteric programming language made by [[User:Palaiologos]] in 2019. Programs in Random Malbolge have following form: ``` nChars nOffset rSeed [... n times]..." 15:00:46 [[Random Malbolge]] M https://esolangs.org/w/index.php?diff=65866&oldid=65865 * Palaiologos * (+10) Fix the code formatting. 15:01:43 [[Language list]] https://esolangs.org/w/index.php?diff=65867&oldid=65701 * Palaiologos * (+22) 15:45:22 -!- atslash has quit (Ping timeout: 246 seconds). 15:46:13 -!- atslash has joined. 16:03:36 with current set of ops: JU00030U4S000AG ~= putchar(rand()%10 + 48) 16:07:31 i rearranged some things 16:08:55 is that esoteric? 16:16:03 never mind 16:16:32 -!- Lykaina has left. 16:17:17 -!- Guest24768 has quit (Quit: WeeChat 2.4). 16:18:44 -!- GeekDude has joined. 16:31:43 hi 16:31:47 hello 16:38:21 -!- Sgeo_ has joined. 16:41:27 -!- Sgeo has quit (Ping timeout: 258 seconds). 16:46:12 hey kmc how are you doing 16:46:29 pretty good 17:26:05 -!- MDude has quit (Quit: Going offline, see ya! (www.adiirc.com)). 17:26:09 -!- Phantom_Hoover has joined. 17:26:54 -!- Sgeo__ has joined. 17:30:01 -!- Sgeo_ has quit (Ping timeout: 244 seconds). 17:49:06 [[Rejji]] N https://esolangs.org/w/index.php?oldid=65868 * FAKE1007 * (+4978) Created page with "'''Rejji''' is a programming language made by ~~~ in 2019. == Commands == ln('''text''') - Prints text to screen from new line. pr('''text''') - Prints text to screen on the..." 17:49:56 [[User:FAKE1007]] https://esolangs.org/w/index.php?diff=65869&oldid=65864 * FAKE1007 * (+70) 17:50:53 -!- BWBellairs has quit (Quit: boxmein's znc went down :(). 17:51:48 [[Rejji]] https://esolangs.org/w/index.php?diff=65870&oldid=65868 * FAKE1007 * (+2) 18:13:49 -!- BWBellairs has joined. 18:22:37 -!- heroux has quit (Ping timeout: 268 seconds). 18:25:40 -!- glowcoil has quit (Ping timeout: 252 seconds). 18:26:49 [[Special:Log/upload]] upload * Hakerh400 * uploaded "[[File:Grid entities.png]]" 18:27:00 -!- glowcoil has joined. 18:27:17 -!- heroux has joined. 18:43:27 Do you like Scrabble with Go stones and chess pieces also? 18:43:49 how does that work? 18:47:13 I thought how to make Scrabble with Go stones, but there might be other way too possibly a better way than what I have. I haven't thought of how to do with Go and chess. 18:48:18 After each turn if you played any letters, you may play a Go stone on a vacant cell, and then make captures. Keep track of who played each letter; they are like Go stones but will not be captured until the game ends. 18:49:38 You can play letters where there are currently stones; this removes the stones and affects your score according to which stones have been removed in this way and which letters were played there, but you are not allowed to play if your total score for that turn would be zero or negative. 18:50:05 (Also you cannot play two wild cards and nothing else on the first turn of the game, since, that would earn zero points.) 18:54:26 but.. do the stones go to the crossings of the lines, and the letters in the squares between them? 18:55:48 Stones go in the same square where the letters would go, in how I have, so that they can interfere with each other. 18:57:03 and do the letter multipliers of the board apply to a stone, and does it apply to a letter tile if it's played on a stone? 18:57:41 also what's the exchange rate for go points to scrabble points? 18:58:52 The multiplier still applies to a letter played on a stone, but if it is opponent's stone then that letter is worth nothing for that turn. If it is your own stone then it is one more than normal. Word multipliers do not apply to stones, but letter multipliers do. 18:59:47 I have Go points and Scrabble points at 1:1 (and you will add them when the game ends), but I don't know if a different exchange rate may be better. Also, if a letter is captured at the end of the game then whoever played that letter loses its base value (ignoring all multiplies). 19:01:16 how do turns work? do you place one go stone and then one scrabble word or other scrabble move in your turn? 19:01:29 ah, you said go stone after the scrabble move 19:01:47 Yes, and only if you actually played any letters. You cannot add a stone without also adding at least one letter. 19:02:21 (It is, however, allowed to play one or more letters and then not play a stone.) 19:02:26 this might work 19:05:56 what if you play with reversi stones instead of go stones, and stones can convert other stones as in reversi, with tiles counting as empty space for the purpose of conversion? 19:06:23 Yes, that could be another game, I suppose; you can try that. 19:09:20 -!- nfd9001 has quit (Read error: Connection reset by peer). 19:19:23 [[Special:Log/upload]] upload * Hakerh400 * uploaded "[[File:Esolang Grid - cursor and lines.png]]" 19:20:33 -!- oerjan has joined. 19:22:53 `? password 19:22:55 The password of the month is surprising. 19:25:19 `learn The password of the month is ninjaed. 19:25:22 Relearned 'password': The password of the month is ninjaed. 19:25:29 *MWAHAHAHA* 19:25:51 admittedly you didn't seem in much of a hurry. 19:26:52 I wasn't. 19:27:17 I was happy about the final surprise ;-) 19:28:27 But I feel I got more than my fair share of potms recently. 19:31:00 hm I strangely misread this as “potm points” and was about to ask if there are points 19:32:37 `cwlprits password 19:32:39 oerjän int-̈e shachäf int-̈e fizzïe int-̈e fizzïe int-̈e int-̈e b_jonäs int-̈e int-̈e oerjän oerjän int-̈e int-̈e oerjän int-̈e oerjän oerjän oerjän int-̈e int-̈e oerjän oerjän shachäf oerjän oerjän oerjän oerjän int-̈e shachäf shachäf oerjän boil̈y oerjän int-̈e int-̈e oerjän shachäf shachäf oerjän oerjän oerjän oerjän oerjän oerjän oerjän oerjän oerjän gameman̈j int-̈e 19:33:09 oh, it's month again 19:33:34 Just another September. 19:33:56 `hurl wisdom/password 19:33:57 https://hack.esolangs.org/repo/log/tip/wisdom/password 19:35:30 has it really been 11 months since i set it 19:36:47 amazing, isn't it 19:41:27 -!- xkapastel has joined. 19:47:02 the next password of the month could accidentally be not what it seems 20:05:04 -!- heroux has quit (Ping timeout: 246 seconds). 20:07:02 -!- heroux has joined. 20:10:23 [[Rejji]] M https://esolangs.org/w/index.php?diff=65873&oldid=65870 * Ais523 * (-39) unpipe link to userspace 20:29:13 -!- AnotherTest has quit (Ping timeout: 245 seconds). 20:40:21 -!- Lord_of_Life_ has joined. 20:42:31 -!- Lord_of_Life has quit (Ping timeout: 246 seconds). 20:43:15 -!- Lord_of_Life_ has changed nick to Lord_of_Life. 20:45:09 ``` hg log -T "{date|shortdate}\n" wisdom/password 20:45:11 2019-09-01 \ 2019-08-01 \ 2019-07-01 \ 2019-06-02 \ 2019-05-01 \ 2019-04-09 \ 2019-03-30 \ 2019-02-04 \ 2019-02-03 \ 2019-01-01 \ 2018-12-01 \ 2018-11-01 \ 2018-10-02 \ 2018-09-05 \ 2018-08-03 \ 2018-07-20 \ 2018-06-03 \ 2018-05-05 \ 2018-04-14 \ 2018-04-14 \ 2018-03-07 \ 2018-02-15 \ 2017-12-31 \ 2017-12-01 \ 2017-12-01 \ 2017-11-04 \ 2017-10-01 \ 2017-09-02 \ 2017-08-22 \ 2017-08-16 \ 2017-07-11 \ 2017-06-02 \ 2017-06-02 \ 2017-06-02 \ 2017-05-14 \ 2017- 21:04:21 now I’m dreaming about setting the password the next month. Of course I’ll forget and be too slow to matter 21:05:42 bad immodest thoughts 21:06:32 wow, modest is related to modus 21:11:12 arseniiv: you could ask a computer that has a clock and is good at remembering dates to set it in your name at the start of next month 21:13:44 b_jonas: hmmmm though 0: UTC is 5: here so if I won’t repair my schedule I can be there in person and need only a reminder 21:15:26 . o O ( maybe it's time for a potmlist :-P ) 21:17:04 int-e: announcing the time has come or announcing when the new is set? 21:17:23 it's the phase of the moon list, announcing every new moon and every full moon 21:17:42 arseniiv: the former :P (and generalizing the concept to a waiting list) 21:17:53 b_jonas: :D oh that would be more useful 21:18:03 well, s/generalizing/adapting/ 21:18:38 (I hope this sounds ridiculous.) 21:18:45 I like moonphases more, yes 21:18:52 or maybe warning a few days before new moon and a few days before full moon, to be able to prepare for werewolves and other magic 21:21:02 Would it include updates for Phobos and Deimos? 21:22:05 I wish I had occurring something useful on full moon, but no, the most I get is that white-gray dish staring in the window. Though it adds some comfort 21:24:55 -!- MDude has joined. 21:26:21 today I reread domino examples in Concrete mathematics, they’re just too good 21:26:32 -!- oerjan has quit (Quit: Nite). 21:28:49 it also reminds me I have almost no clue about combinatory species and especially their computational aspects (like enumeration or counting) 21:29:44 isn’t there something like a Baez page on them? 21:34:40 -!- ARCUN has joined. 21:35:16 I think it would be cool to not only parse HTML using regex, but to combine them in some way 21:35:44 A markup language that operates using regex, called REML 21:36:36 Of course, I don't believe it's possible to completely parse HTML with regex, but the idea is nice 21:46:31 I think a language that uses the REML concept would be befitting for the wiki 21:46:44 It's definitely not your everyday language 22:05:14 [[Special:Log/upload]] upload * Hakerh400 * uploaded "[[File:Esolang Grid - Fragments.png]]" 22:05:15 -!- ARCUN has quit (Ping timeout: 260 seconds). 22:21:06 -!- xkapastel has quit (Quit: Connection closed for inactivity). 22:48:21 -!- Sgeo_ has joined. 22:48:56 -!- Camto[m] has quit (Ping timeout: 252 seconds). 22:50:30 -!- Phantom_Hoover has quit (Quit: Leaving). 22:51:45 -!- Sgeo__ has quit (Ping timeout: 258 seconds). 22:53:30 -!- Camto[m] has joined. 23:07:14 [[+-]] https://esolangs.org/w/index.php?diff=65875&oldid=63919 * Voltage2007 * (+977) 23:20:19 -!- FreeFull has quit. 2019-09-02: 00:13:15 [[GML]] https://esolangs.org/w/index.php?diff=65876&oldid=46716 * B jonas * (+8) 00:20:38 I am writing "pollcube" software for making a survey. What formats of questions might it be? So far I have "Select all that apply", "Select [number]", "Select up to [number]", "Select [number] to [number]", "Enter any text", "Enter a number up to [number]", "Enter numbers adding up to [number]", and "Enter numbers adding up to not more than [number]". 00:21:37 -!- MDude has quit (Ping timeout: 246 seconds). 00:33:11 zzo38: a table of multiple questions, one question per table row, where you select an option button with a fixed small number of buttons for each question, and short labels for the answers above, poll creator chooses the short labels eg. they could be (true, false) or (1,2,3,4,5,N/A) 00:33:48 zzo38: also option buttons to select exactly one answer, and a version where the last option is write-in with a text box 00:33:49 -!- Sgeo__ has joined. 00:34:29 zzo38: also perhaps a field where you enter either a number or nothing 00:35:19 for entering text, you probably want both short (one-line) answer input fields and longer answer textareas 00:36:47 -!- Sgeo_ has quit (Ping timeout: 244 seconds). 00:38:09 [[Beets]] N https://esolangs.org/w/index.php?oldid=65877 * Qpliu * (+2703) Created page with "The Beets programming language enables expressing calculations on infinite binary trees of bits. ==Grammar== program = definition* definition = identifier identifier* '='..." 00:38:19 [[Language list]] https://esolangs.org/w/index.php?diff=65878&oldid=65867 * Qpliu * (+12) /* B */ 00:38:28 -!- b_jonas has quit (Remote host closed the connection). 00:42:52 -!- MDude has joined. 00:52:25 -!- arseniiv has quit (Ping timeout: 246 seconds). 02:01:10 b_jonas: "Select one" would mean you have to select exactly one; it is a case of the "Select [number]" format. 02:02:05 In any case, the system is designed to be UI-independent. Still, the table of questions is a suitable idea. 02:02:59 A version where the last option is write-in with a text box, is one idea I did think of though; if it says "(please specify)" then you can add your own text. 02:06:41 -!- adu has joined. 02:24:15 -!- MrBismuth has quit (Read error: Connection reset by peer). 03:29:07 -!- MrBismuth has joined. 03:35:53 [[Pxem]] https://esolangs.org/w/index.php?diff=65879&oldid=65222 * YamTokTpaFa * (+0) /* Conditional looping */ 05:15:26 [[User:YamTokTpaFa/sandbox4]] https://esolangs.org/w/index.php?diff=65880&oldid=64854 * YamTokTpaFa * (+1284) 05:21:32 [[User:YamTokTpaFa]] https://esolangs.org/w/index.php?diff=65881&oldid=65804 * YamTokTpaFa * (+136) 05:23:02 [[User:YamTokTpaFa/sandbox5]] N https://esolangs.org/w/index.php?oldid=65882 * YamTokTpaFa * (+135) Created page with "'''Qyfn''' (official pronunciation: ku-you-fu-na) is a programming language designed by [[User:YamTokTpaFa]], a derivation of [[Pxem]]." 05:53:48 ais523: Are you going to http://events.cs.bham.ac.uk/syco/strings3-syco5/ ? 06:34:10 [[Special:Log/upload]] upload * Hakerh400 * uploaded "[[File:Esolang "Grid" - example of initial grid transformation.png]]" 07:34:28 [[Special:Log/upload]] upload * Hakerh400 * uploaded "[[File:Esolang "Grid" - example of connecting external shapes.png]]" 07:45:15 -!- cpressey has joined. 08:06:33 -!- adu has quit (Quit: adu). 08:07:58 -!- wob_jonas has joined. 08:08:31 zzo38: sure, multiple UIs can work for the same questionnaire, but you still need some hints in the questions so that the UI can present the forms reasonably 08:08:49 HTML already works sort of like that 08:18:50 -!- tromp_ has joined. 08:22:15 -!- tromp has quit (Ping timeout: 264 seconds). 08:22:22 [[Special:Log/upload]] upload * Hakerh400 * uploaded "[[File:Esolang "Grid" - Example of connecting internal shapes 1.png]]" 08:42:19 -!- Frater_EST has joined. 08:42:32 -!- Lord_of_Life has quit (Ping timeout: 245 seconds). 08:46:04 -!- Lord_of_Life has joined. 09:37:28 -!- MDude has quit (Quit: Going offline, see ya! (www.adiirc.com)). 11:07:52 -!- xylochoron[m] has quit (Remote host closed the connection). 11:07:52 -!- ivzem[m] has quit (Remote host closed the connection). 11:07:55 -!- wmww has quit (Remote host closed the connection). 11:08:18 -!- Camto[m] has quit (Remote host closed the connection). 11:08:18 -!- tswett[m] has quit (Write error: Connection reset by peer). 11:13:43 -!- Camto[m] has joined. 11:36:02 -!- tswett[m] has joined. 11:36:02 -!- wmww has joined. 11:36:02 -!- xylochoron[m] has joined. 11:36:10 -!- ivzem[m] has joined. 11:50:00 -!- Frater_EST has quit (Ping timeout: 244 seconds). 12:25:33 -!- arseniiv has joined. 12:26:59 [[Special:Log/upload]] upload * Hakerh400 * uploaded "[[File:Esolang "Grid" - loop.png]]" 12:40:10 -!- xkapastel has joined. 13:08:05 -!- MDude has joined. 14:05:39 [[Hello++]] https://esolangs.org/w/index.php?diff=65887&oldid=58441 * Gamer * (+426) /* Interpreter */ 14:42:20 -!- Sgeo_ has joined. 14:45:27 -!- Sgeo__ has quit (Ping timeout: 245 seconds). 14:53:51 [[Enigma-2D]] https://esolangs.org/w/index.php?diff=65888&oldid=62056 * YamTokTpaFa * (+41) Linking 14:59:19 [[Pxem]] https://esolangs.org/w/index.php?diff=65889&oldid=65879 * YamTokTpaFa * (+6) /* pxemi.7z and text2pxem.pl */ 15:04:36 [[Hello world program in esoteric languages]] M https://esolangs.org/w/index.php?diff=65890&oldid=65762 * YamTokTpaFa * (+302) /* Pxem */ 15:37:13 -!- wob_jonas has quit (Remote host closed the connection). 15:42:54 -!- Sgeo__ has joined. 15:45:58 -!- Sgeo_ has quit (Ping timeout: 246 seconds). 15:50:35 Well, I learned enough QuickCheck to write some crude property tests for the Robin interpreter. To do it properly I'd probably want to make custom generators for particular kinds of expressions (particularly environments), and so forth. 15:51:04 Will probably release Robin 0.4 tomorrow and then not think about it for a long time again. 15:51:43 And there's absolutely no reason you should care, I'm just typing this out as some sort of coping mechanism probably. 15:52:09 -!- cpressey has quit (Quit: A la prochaine.). 15:53:10 Future cpressey, who I assume log reads, are you OK? 17:02:02 -!- FreeFull has joined. 17:18:39 -!- Phantom_Hoover has joined. 17:26:59 -!- b_jonas has joined. 17:48:08 -!- tromp_ has quit (Read error: Connection reset by peer). 17:49:47 -!- tromp has joined. 17:50:46 -!- tromp_ has joined. 17:50:47 -!- tromp has quit (Read error: Connection reset by peer). 18:27:32 I suppose if you want to use bitmap fonts or other external fonts with PostScript, one possibility might be to define a Type 3 font which is programmed to determine the current position on the page and to write that together with the character code to a separate output file, and then afterward, they can be combined with the main output file. 18:31:09 zzo38: but postscript already supports bitmap fonts in some existing font formats 18:35:47 How to work that? I also don't know if it is a feature that Ghostscript supports 18:40:28 zzo38: I don't know, ask the converters that make postscript from TeX's dvi files and use TeX fonts 18:41:07 but I think ghostscript supports it 18:42:46 https://www.ghostscript.com/doc/9.27/Fonts.htm says something about BDF fonts 18:44:38 Yes, although that just converts a bitmap font into a Type 1 font, which will not be of a such good quality. 18:45:22 right, so maybe get the TeXlive sources and look at how they handle TeX fonts 18:45:48 I never tried to dive into those details 18:47:04 -!- tromp_ has quit (Remote host closed the connection). 18:48:49 There are also other uses of external fonts other than bitmap fonts, such as if you want to convert PostScript or DVI. 18:49:30 zzo38: sure 18:50:00 hmm, python doesn't seem to have an equivalent of the perl/sed tr operator that also gives you the count of characters it's replaced 18:50:04 that's a pity 18:51:18 though I guess since it also doesn't have the bitwise operators for bytes objects, so you couldn't do that sort of thing so easily anyway 19:17:43 -!- tromp has joined. 19:18:27 -!- tromp has quit (Remote host closed the connection). 19:18:43 -!- tromp has joined. 19:44:10 -!- MrBusiness3 has joined. 19:47:28 -!- MrBismuth has quit (Ping timeout: 264 seconds). 20:08:46 -!- rain1 has quit (Read error: Connection reset by peer). 20:11:13 -!- rain1 has joined. 20:12:11 oh 20:40:19 now that's evil 20:43:02 -!- Lord_of_Life_ has joined. 20:43:43 -!- Lord_of_Life has quit (Ping timeout: 244 seconds). 20:46:00 -!- Lord_of_Life_ has changed nick to Lord_of_Life. 20:47:20 Now I wrote a program in PostScript to write out JSON data to a file. For example, if the PostScript code is: << /hello true /world false /this [1 2 5 << /a (aaa) /b (ccc\\ddd\n123"!@#$) >> null] /that << /hello false /world true >> then it will write: {"that":{"world":true,"hello":false},"world":false,"hello":true,"this":[1,2,5,{"a":"aaa","b":"ccc\u005Cddd\u000A123\u0022!@#$"},null]} 20:48:03 (The next thing to write is to parse the JSON data.) 20:48:43 why do you need a JSON parser? isn't it generally more convenient to make the other side write postscript code? or do you want to parse untrusted data? 20:49:09 In case the other side is not meant to work with PostScript. 20:49:32 But is rather a program designed to be used with stuff other than PostScript. 20:59:34 -!- xkapastel has quit (Quit: Connection closed for inactivity). 21:07:43 [[User:Dtuser1337/Sandbox]] https://esolangs.org/w/index.php?diff=65891&oldid=65863 * Dtuser1337 * (-1065) I have another language in draft from my head, so i used [za hando] to replace it with another one in draft. 21:09:27 [[User:Dtuser1337/Sandbox]] https://esolangs.org/w/index.php?diff=65892&oldid=65891 * Dtuser1337 * (+7) /* Beginning of the Sandbox line */ 21:17:40 [[User:Dtuser1337/Sandbox]] https://esolangs.org/w/index.php?diff=65893&oldid=65892 * Dtuser1337 * (+0) /* instruction wheels */ 21:27:31 [[User:Dtuser1337/Sandbox]] https://esolangs.org/w/index.php?diff=65894&oldid=65893 * Dtuser1337 * (+305) /* instruction wheels */ 22:10:51 -!- arseniiv has quit (Ping timeout: 264 seconds). 22:18:52 -!- grumble has quit (Quit: 𝑽𝒆𝒍𝒐𝒄𝒊𝒓𝒂𝒑𝒕𝒐𝒓). 22:21:49 -!- grumble has joined. 22:29:19 -!- FreeFull has quit. 22:37:31 [[Underload]] M https://esolangs.org/w/index.php?diff=65895&oldid=57502 * CatIsFluffy * (+0) /* Numbers */ Alignment of 1 22:39:16 -!- Phantom_Hoover has quit (Quit: Leaving). 23:29:45 -!- budonyc has joined. 23:30:54 [[Underload/Numbers]] M https://esolangs.org/w/index.php?diff=65896&oldid=43690 * CatIsFluffy * (-14) optimize a few numbers 2019-09-03: 00:23:46 -!- ivzem[m] has quit (Remote host closed the connection). 00:24:02 -!- Camto[m] has quit (Remote host closed the connection). 00:24:11 -!- xylochoron[m] has quit (Read error: Connection reset by peer). 00:24:16 -!- wmww has quit (Remote host closed the connection). 00:24:16 -!- tswett[m] has quit (Remote host closed the connection). 00:32:01 -!- Camto[m] has joined. 00:39:13 -!- Lykaina has joined. 00:40:08 is this esoteric or just confusing? https://paste.ee/p/8JCjK 00:51:37 -!- MDude has quit (Ping timeout: 246 seconds). 00:52:23 -!- wmww has joined. 00:52:23 -!- tswett[m] has joined. 00:52:23 -!- xylochoron[m] has joined. 00:52:29 -!- MDude has joined. 00:52:31 -!- ivzem[m] has joined. 00:55:02 -!- budonyc has quit (Quit: Leaving). 00:59:34 Is the ability for PostScript programs to have command-line arguments specific to Ghostscript? (Even if so, it would be possible to emulate it just as well with other implementations.) 01:12:38 [[Grid]] N https://esolangs.org/w/index.php?oldid=65897 * Hakerh400 * (+23410) New language: Grid 01:13:16 zzo38: hi 01:14:34 [[Language list]] https://esolangs.org/w/index.php?diff=65898&oldid=65878 * Hakerh400 * (+11) Add "Grid" to the language list 01:15:33 [[User:Hakerh400]] https://esolangs.org/w/index.php?diff=65899&oldid=64427 * Hakerh400 * (+11) 01:15:50 Hello 01:16:54 could you take a look at the language specs i posted and give me your opinion? 01:17:20 I looked at it, and currently do not have something to say about it. 01:17:38 finally got it working 01:19:06 it's my first with loops 01:19:44 instead of jumps 01:23:09 and my first that doesn't require an "assembler" 01:30:47 https://paste.ee/p/m0sel better paste (has source) 01:38:17 [[Grid]] M https://esolangs.org/w/index.php?diff=65900&oldid=65897 * Hakerh400 * (+1) 01:45:11 -!- Lykaina has quit (Quit: leaving). 01:47:31 [[Grid]] M https://esolangs.org/w/index.php?diff=65901&oldid=65900 * Hakerh400 * (+0) 01:48:35 [[Grid]] M https://esolangs.org/w/index.php?diff=65902&oldid=65901 * Hakerh400 * (+0) 01:50:24 -!- xkapastel has joined. 01:52:09 [[Grid]] M https://esolangs.org/w/index.php?diff=65903&oldid=65902 * Hakerh400 * (-5) 01:54:09 [[Grid]] M https://esolangs.org/w/index.php?diff=65904&oldid=65903 * Hakerh400 * (+1) 03:24:24 -!- Sgeo__ has quit (Read error: Connection reset by peer). 03:24:52 -!- Sgeo__ has joined. 04:04:00 [[Underload/Numbers]] https://esolangs.org/w/index.php?diff=65905&oldid=65896 * CatIsFluffy * (-17) Run length encoding 05:20:51 [[Underload/Numbers]] M https://esolangs.org/w/index.php?diff=65906&oldid=65905 * CatIsFluffy * (-17) removing old 36 05:26:44 [[Underload/Numbers]] M https://esolangs.org/w/index.php?diff=65907&oldid=65906 * CatIsFluffy * (-25) A few more changes 06:38:32 [[Truth-machine]] https://esolangs.org/w/index.php?diff=65908&oldid=65782 * Dtuser1337 * (+173) /* Stupid */ 06:40:08 -!- xkapastel has quit (Quit: Connection closed for inactivity). 07:25:56 -!- b_jonas has quit (Quit: leaving). 07:41:51 -!- cpressey has joined. 07:47:37 Pythagorus's Lesser Known Theorem: the square of one side of an equilateral triangle is equal to the average of the squares of the other two sides. 07:54:33 Er, Pythagorus, yeah, he was Pythagoras's cousin dontchaknow. 08:29:49 -!- wob_jonas has joined. 08:35:03 cpressey: no, that theorem is more general. it says that for a triangle with a pi/3 or 2*pi/3 angle (rather than a right angle), c = a**2 + b**2 \pm a*b, where a and b are the sides next to that angle, c is the side opposite of that, and you take the negative sign for the non-acute angle. what you say is the special case for a=b and acute angle. 08:35:19 no argh, I said that wront 08:35:26 that theorem is more general. it says that for a triangle with a pi/3 or 2*pi/3 angle (rather than a right angle), c = a**2 + b**2 \pm a*b, where a and b are the sides next to that angle, c is the side opposite of that, and you take the negative sign for the acute angle. what you say is the special case for a=b and acute angle. 08:35:45 cpressey: due to unique properties of equilateral triangles, it's also equal to the geometric mean of the squares of the other two sides 08:36:52 also http://www.madore.org/~david/weblog/d.2013-12-17.2175.trigonometrie-triangle.html is a handy reference for triangle formulas on euclidean, hyperbolic and spheric triangles 08:36:57 some of those formulas count as lesser known too 08:39:54 -!- arseniiv has joined. 08:42:22 -!- Lord_of_Life has quit (Ping timeout: 246 seconds). 08:45:03 -!- Lord_of_Life has joined. 08:57:34 -!- ArthurStrong has joined. 09:12:16 [[Pth]] N https://esolangs.org/w/index.php?oldid=65909 * A * (+945) Created page with "[[Pth]] is a dedicated declarative path-finding language created in order to make path-finding challenges on CGCC very trivial. ==Example program== 
 # Transition starts..."
09:17:19  wob_jonas: are you reading the whole madore website?
09:21:28  int-e: IIRC he said he’s not as familiar with older posts there when we were talking about card deck design
09:26:58  int-e: no, but most of the new posts. 
09:27:16  int-e: I haven't read most of the older year's blog part, and probably won't
09:27:20  years'
09:48:01  [[Pth]] M https://esolangs.org/w/index.php?diff=65910&oldid=65909 * A * (-181) 
09:48:39  [[Pth]] M https://esolangs.org/w/index.php?diff=65911&oldid=65910 * A * (+56) 
09:49:19 -!- fungot has quit (Ping timeout: 250 seconds).
09:52:00  [[Pth]] M https://esolangs.org/w/index.php?diff=65912&oldid=65911 * A * (+0) 
09:53:14  [[Pth]] M https://esolangs.org/w/index.php?diff=65913&oldid=65912 * A * (+2) 
09:57:35  [[Pth]] M https://esolangs.org/w/index.php?diff=65914&oldid=65913 * A * (+58) 
10:08:36  strange... python 3.6 adds a subscripting operator to the re.Match object, but doesn't go the whole way to make it iterable so you can conveniently multipe-assign from it
10:33:30  [[Special:Log/newusers]] create  * Kritixilithos *  New user account
10:39:21 -!- wob_jonas has quit (Quit: Ping timeout (120 seconds)).
10:39:57  [[Esolang:Introduce yourself]]  https://esolangs.org/w/index.php?diff=65915&oldid=65772 * Kritixilithos * (+195) 
10:44:51  [[AlphaBeta]]  https://esolangs.org/w/index.php?diff=65916&oldid=60820 * Kritixilithos * (+23) Fixed the cat program
11:18:17 -!- fungot has joined.
11:20:03  fungot!
11:20:03  int-e: brought home a nice carpet from summer fnord garden shed a tear" as a verb when an existing verb works perfectly well for me
12:05:12  Was some internet trouble at home.
12:05:21  I'd like if they'd provide a little more information about these things.
12:06:05  There's a "dashboard", but it's just an orb that's either green with a hover-tip of "no problems" (paraphrasing), or red with a stock "we're sorry, our engineers are investigating, thank you for your patience" message.
12:07:45  fungot: Welcome back online.
12:07:45  fizzie: want an explanation of access either the path or the closure out of it
12:07:53  ...scary...
12:08:21  fungot: Well, as I just said, the ISP isn't too forthcoming with information. Maybe you could contact their support yourself? 
12:08:21  fizzie: e!bf http://kidsquid.com/ fnord translation for this. easy to translate to void fnord blah fnord " a deep dark secret". even though the guy was real idiot...
12:08:41  In retrospect, maybe that's not such a great idea.
12:53:40  [[ASCII @]] N https://esolangs.org/w/index.php?oldid=65917 * A * (+3895) Created page with "[[ASCII @]] is a programming language created by [[User:A]], due to failing code-golf competitions because @ instructions sometimes take 2 characters. This transpiles to [[@]]..."
12:59:25  [[ASCII @]] M https://esolangs.org/w/index.php?diff=65918&oldid=65917 * A * (-1) 
13:12:51 -!- tromp has quit (Remote host closed the connection).
13:44:17 -!- tromp has joined.
13:48:57 -!- tromp has quit (Ping timeout: 250 seconds).
14:17:15 -!- tromp has joined.
14:30:03  [[Special:Log/newusers]] create  * Dominic3203 *  New user account
14:53:23 -!- Sgeo__ has quit (Ping timeout: 245 seconds).
14:58:28 -!- cpressey has quit (Quit: A la prochaine.).
15:30:41  `olist 1178
15:30:42  olist 1178: shachaf oerjan Sgeo FireFly boily nortti b_jonas
15:41:06   fizzie: want an explanation of access either the path or the closure out of it => I think fungot mentions the free category of a graph! :o
15:41:06  arseniiv: any string containing neither nor is a symbol, whose hash value will itself have been updated with a new program, like bf dev??
15:41:54  hm stop no paths are already a “closure” of a graph’s edges
15:44:29  fungot: neither nor?
15:44:30  arseniiv: annnd my irssi runs over ssh on bistromath. hrm. that doesn't mean we have the long one, but the
16:46:27 -!- FreeFull has joined.
17:02:53 -!- b_jonas has joined.
17:10:24 -!- xkapastel has joined.
17:35:38  for a linear approximation to some f: A → B, to have a graph which is a subspace of A × B, A and B are sufficient to be affine spaces (and for graph of f itself to be such, linear spaces). What weakest kind of spaces may A, B be for f’s quadratic approximation to have a graph being a subspace of A × B?
17:36:01  clearly any differentiable manifold suffices but it’s too strong
17:37:21  I think someone had already developed what those spaces could be
17:38:16  and maybe I should restate the question in terms of no graphs and products of spaces, it seems superfluous
17:38:32  but I don’t know how right now
17:40:00  oh I seem to misplace linear spaces here
17:41:07  it should be something of a “constant space”
17:45:07  i. e. all or some conic hypersurfaces should be subspaces in this “quadratic-affine space”
17:45:48  hm isn’t it what affine varieties are about
17:48:27  this question is weird, I don’t understand which way it could be restated to make sense of “constant spaces” where only graphs of constant functions are subspaces of dom f × cod f
18:18:35  `quote election
18:18:36  528)  Hulu's movie selection is like MST3K without the MST3K characters. \ 943) * ais523 challenges the americans here to remember who lost in the most recent UK general election   ais523, the lib dems
18:25:42  [[Underload/Numbers]] M https://esolangs.org/w/index.php?diff=65919&oldid=65907 * CatIsFluffy * (-5) A few more improvements
19:49:40 -!- xkapastel has quit (Quit: Connection closed for inactivity).
20:42:58 -!- Lord_of_Life has quit (Ping timeout: 245 seconds).
20:45:26 -!- Lord_of_Life has joined.
21:22:10 -!- ArthurStrong has quit (Quit: leaving).
21:24:19 -!- sftp has quit (Ping timeout: 246 seconds).
22:09:24 -!- sftp has joined.
22:21:16 -!- FreeFull has quit.
22:42:35 -!- hakatashi has quit (Remote host closed the connection).
22:42:52 -!- hakatashi has joined.
23:30:40 -!- arseniiv has quit (Ping timeout: 246 seconds).
23:30:56 -!- Sgeo has joined.
23:40:47 -!- Sgeo_ has joined.
23:41:55 -!- Sgeo has quit (Ping timeout: 244 seconds).
23:47:43  Now I wrote the JSON parser as well as JSON writer in PostScript.
23:48:00  Why not PSON?
23:49:37  Only one feature is not yet implemented, which is if JSON.utf8 is true then it will not support Unicode characters outside of the ASCII range yet; that option is supposed to enable that feature. (If JSON.utf8 is false, then it will work, but any \u escapes will use only the low 8-bits of the character code.)
23:50:24  shachaf: What is PSON?

2019-09-04:

00:00:43  PostScript Object Notation
00:01:09  If you want to use PostScript Object Notation then you can use the built-in commands of PostScript.
00:02:28  It is good if the data is only written and read by PostScript programs, or if used with other programs that are designed to be used with PostScript, but some programs are not designed for use with PostScript and are using JSON, so, this way, if the external data is JSON then still you can use it with PostScript anyways.
01:23:54  Usenet article <1567559086.bystand@zzo38computer.org> includes this program. It can also be downloaded from: https://arin.ga/yoZtdL
01:33:16 -!- tromp_ has joined.
01:34:49 -!- tromp has quit (Ping timeout: 252 seconds).
01:42:26 -!- aloril_ has joined.
01:43:31 -!- hppavilion[1] has joined.
01:46:09 -!- aloril has quit (Ping timeout: 258 seconds).
02:04:32 -!- Cale has quit (Read error: Connection reset by peer).
03:14:42 -!- hppavilion[1] has quit (Ping timeout: 258 seconds).
03:36:51 -!- Sgeo__ has joined.
03:40:06 -!- Sgeo_ has quit (Ping timeout: 244 seconds).
04:21:40 -!- nfd9001 has joined.
05:22:25 -!- Sgeo__ has quit (Ping timeout: 246 seconds).
05:27:43 -!- nfd9001 has quit (Ping timeout: 258 seconds).
05:31:08  Do you have a slide rule with roman numbers?
05:31:32 -!- nfd9001 has joined.
05:32:55  The numbers keep roamin' back and forth on a log scale.
05:38:27  [[Grid]] M https://esolangs.org/w/index.php?diff=65920&oldid=65904 * Hakerh400 * (-1) 
06:41:12 -!- b_jonas has quit (Remote host closed the connection).
07:29:11 -!- hppavilion[1] has joined.
07:48:06 -!- cpressey has joined.
07:56:48  Good morning. Other than Haskell, I can't think of any popular functional languages that actually forbid mutability. The vast majority provide some kind of destructive update, but frown on using it.
07:57:29  yeah
07:57:51  but in a way there is mutation in haskell, like stref 
07:59:22  or curry
07:59:26  i love curry
07:59:56  I guess minikanren doesn't have mutation
08:01:20  Curry's not exactly popular, and Minikanren isn't really a language :)
08:01:32  oh yeah  because its not turing complete
08:01:52  Well, it needs another language to be embedded in, and that language needs to have things like lambdas
08:03:49  curry is so unpopular, there isn't even an aur package for one of its implementations
08:04:09  how about LSON 
08:04:14  Lisp Object Notation
08:06:10  are object notations really programming languages?
08:06:41  Object Notation
08:07:11  http://www.cs.yorku.ca/~paige/Bon/bon.html
08:07:39  https://libujo.org/ UJO Data Object Notation is a binary data serialization format for the Internet of Things and machine to machine (M2M) applications. The name UJO is Esperanto and means container
08:07:43  this is epic cringe\
08:09:44  i like the abbreviation UDON, though
08:09:50  sound delicious
08:11:01  cpressey: hmm, I don't think jq has mutability
08:12:37  It's a streaming language, so it has things that might look like mutability but aren't (they're closer to record updates)
08:17:53 -!- hppavilion[1] has quit (Remote host closed the connection).
08:18:02 -!- Sgeo has joined.
08:18:26 -!- hppavilion[1] has joined.
08:19:17  https://github.com/MakeNowJust/bf.jq
08:20:21  "Popular enough and Turing-complete enough for someone to have written a Brainfuck interpreter in it"
08:21:20  oh dear
08:29:47 -!- hppavilion[1] has quit (Remote host closed the connection).
08:30:23 -!- hppavilion[1] has joined.
08:33:22  cpressey: I wrote one of those a couple of months back, https://gist.github.com/Taneb/be9d6d5048ce6ca3c5563df223052c6b
08:34:29  (mine has partial support for , and is thus vastly superior)
08:39:07  Indeed!
08:40:05  Taneb: I like the lack of indentation in the nested ifs
08:40:35  :)
08:44:46  I wrote a bf interepreter for my editor once, whose scripting language lacks conditionals.
08:44:56 -!- Lord_of_Life has quit (Ping timeout: 244 seconds).
08:44:57  You can express them in terms of try-catch, though.
08:46:08 -!- Lord_of_Life has joined.
09:06:38  ah, just like javagony
09:08:03  Hmm, there's also no recursion.
09:08:23  So under normal circumstances infinite loops are impossible.
09:08:41  But you can set things to happen based on events, including "user is idle".
09:09:03 -!- hppavilion[1] has quit (Remote host closed the connection).
09:10:16 -!- hppavilion[1] has joined.
09:14:58  [[Talk:Interfrac]] M https://esolangs.org/w/index.php?diff=65921&oldid=60495 * A * (+270) 
09:15:55 -!- nfd has joined.
09:18:44  [[Talk:Interfrac]] M https://esolangs.org/w/index.php?diff=65922&oldid=65921 * A * (+360) /* Proof that your formula is invalid! */
09:19:16 -!- nfd9001 has quit (Ping timeout: 264 seconds).
09:20:06  [[Talk:Interfrac]] M https://esolangs.org/w/index.php?diff=65923&oldid=65922 * A * (+91) /* Proof that your formula is invalid! */
09:20:35 -!- nfd has quit (Ping timeout: 244 seconds).
09:21:20  [[Interfrac]] M https://esolangs.org/w/index.php?diff=65924&oldid=60492 * A * (+110) /* Introduction */ Your formula is wrong.
10:17:20  [[Deadfish]]  https://esolangs.org/w/index.php?diff=65925&oldid=65853 * Kritixilithos * (+214) added sed interpreter of deadfish
10:57:26 -!- hppavilion[1] has quit (Remote host closed the connection).
11:32:38 -!- arseniiv has joined.
11:52:41  [[Point]]  https://esolangs.org/w/index.php?diff=65926&oldid=65799 * Dtuser1337 * (-12) /* Hello, world! */
11:52:51  [[Point]]  https://esolangs.org/w/index.php?diff=65927&oldid=65926 * Dtuser1337 * (-12) /* Countdown */
11:53:00  [[Point]]  https://esolangs.org/w/index.php?diff=65928&oldid=65927 * Dtuser1337 * (-12) /* Counting up */
12:03:57  [[Hello world program in esoteric languages]]  https://esolangs.org/w/index.php?diff=65929&oldid=65890 * Dtuser1337 * (+55) adding more lang because we need to give esolang maker a pleasure
12:06:13  [[ASCII @]]  https://esolangs.org/w/index.php?diff=65930&oldid=65918 * Dtuser1337 * (+2) dont lie, A, this is unimplemented.
12:09:01  [[PureStack]] M https://esolangs.org/w/index.php?diff=65931&oldid=65549 * Dtuser1337 * (+6) FTFY, becuaz your example header has a problemsw
13:01:43 -!- howlands has quit (Ping timeout: 244 seconds).
13:20:01 -!- Sgeo_ has joined.
13:21:55 -!- Sgeo has quit (Ping timeout: 246 seconds).
14:54:54 -!- Sgeo__ has joined.
14:57:57 -!- Sgeo_ has quit (Ping timeout: 245 seconds).
14:58:24  [[Pxem]] M https://esolangs.org/w/index.php?diff=65932&oldid=65889 * YamTokTpaFa * (+2) /* Output */ sing->pl.
14:59:06  [[Pxem]] M https://esolangs.org/w/index.php?diff=65933&oldid=65932 * YamTokTpaFa * (+6) /* Input */ an integer->a signed integer
15:00:49  [[Pxem]] M https://esolangs.org/w/index.php?diff=65934&oldid=65933 * YamTokTpaFa * (-12) /* Output */
15:02:09  Finally got around to officially releasing and announcing Wagon: https://catseye.tc/article/News.md#our-second-esolang-of-2019-wagon
15:03:35  [[Pxem]] M https://esolangs.org/w/index.php?diff=65935&oldid=65934 * YamTokTpaFa * (+64) /* Operating stack */
15:04:00  [[Pxem]] M https://esolangs.org/w/index.php?diff=65936&oldid=65935 * YamTokTpaFa * (-1) /* Operating stack */ del'd s from bold word
15:09:23  [[Trickcode]] N https://esolangs.org/w/index.php?oldid=65937 * Trickbrain26 * (+5237) A language by trickbrain26
15:12:15  [[Pxem]]  https://esolangs.org/w/index.php?diff=65938&oldid=65936 * YamTokTpaFa * (+194) /* Operating content of file */
15:13:47 -!- sprocklem has quit (Ping timeout: 245 seconds).
15:14:54  [[Pxem]]  https://esolangs.org/w/index.php?diff=65939&oldid=65938 * YamTokTpaFa * (+80) /* Random value */
15:15:06 -!- arseniiv has quit (Read error: Connection reset by peer).
15:15:24 -!- arseniiv has joined.
15:19:13 -!- arseniiv has quit (Read error: Connection reset by peer).
15:19:29 -!- arseniiv has joined.
15:20:13  [[Pxem]]  https://esolangs.org/w/index.php?diff=65940&oldid=65939 * YamTokTpaFa * (+332) /* Conditional looping */
15:21:44  [[Pxem]]  https://esolangs.org/w/index.php?diff=65941&oldid=65940 * YamTokTpaFa * (+72) /* Termination */
15:22:52  [[Pxem]] M https://esolangs.org/w/index.php?diff=65942&oldid=65941 * YamTokTpaFa * (-25) /* Arithmetic operation */
15:23:38  [[Pxem]] M https://esolangs.org/w/index.php?diff=65943&oldid=65942 * YamTokTpaFa * (+4) /* Hello, world! */
15:24:27  [[Pxem]] M https://esolangs.org/w/index.php?diff=65944&oldid=65943 * YamTokTpaFa * (+12) /* Operating content of file */ group
15:42:05  [[User:Dtuser1337/Sandbox]]  https://esolangs.org/w/index.php?diff=65945&oldid=65894 * Dtuser1337 * (+13) /* Beginning of the Sandbox line */
16:25:54 -!- cpressey has quit (Quit: A la prochaine.).
16:58:06 -!- arseniiv_ has joined.
17:01:51 -!- arseniiv has quit (Ping timeout: 264 seconds).
17:01:55 -!- arseniiv__ has joined.
17:02:15 -!- arseniiv__ has changed nick to arseniiv.
17:04:19  [[Fusion Tag]]  https://esolangs.org/w/index.php?diff=65946&oldid=65494 * Kritixilithos * (+2) small fix in interpreter
17:04:51 -!- arseniiv_ has quit (Ping timeout: 264 seconds).
17:08:43  [[Nuts]] N https://esolangs.org/w/index.php?oldid=65947 * YamTokTpaFa * (+2125) Created page with "{{Stub}}  '''Nuts''' is a [[functional]] programming language designed by [https://qiita.com/hogefuga ''@hogefuga'' or '' '' in Qiita], [https://github.com/hoge-fu..."
17:11:41  [[Nuts]]  https://esolangs.org/w/index.php?diff=65948&oldid=65947 * YamTokTpaFa * (+29) 
17:16:14  [[Grass]]  https://esolangs.org/w/index.php?diff=65949&oldid=11550 * YamTokTpaFa * (+262) 
17:21:02 -!- FreeFull has joined.
17:25:19  [[Grass]]  https://esolangs.org/w/index.php?diff=65950&oldid=65949 * YamTokTpaFa * (+74) 
17:51:21 -!- Phantom_Hoover has joined.
17:59:54  [[Trickcode]]  https://esolangs.org/w/index.php?diff=65951&oldid=65937 * Trickbrain26 * (+3) 
18:52:15  what can I do with yeast in Powder Toy?
18:52:39  (except growing it and making it die)
19:01:00  [[Trickcode]]  https://esolangs.org/w/index.php?diff=65952&oldid=65951 * Trickbrain26 * (+0) 
19:01:33  [[Trickcode]]  https://esolangs.org/w/index.php?diff=65953&oldid=65952 * Trickbrain26 * (+0) 
19:09:56 -!- b_jonas has joined.
19:12:48  [[Trickcode]]  https://esolangs.org/w/index.php?diff=65954&oldid=65953 * Trickbrain26 * (+101) 
19:19:14 -!- oerjan has joined.
19:24:28  oo list
19:24:44  i seem to skip most of the logs these days
19:39:50 -!- ArthurStrong has joined.
20:00:30  fungot, what cream or filling do you like to eat spongecake with?
20:00:30  b_jonas: read the rest of the u.s.
20:16:17  [[Special:Log/newusers]] create  * DmilkaSTD *  New user account
20:42:54  fungot, do you ride the horse?
20:42:54  b_jonas: looks like it ignores z too? :)
20:43:45 -!- Lord_of_Life_ has joined.
20:45:53 -!- Lord_of_Life has quit (Ping timeout: 245 seconds).
20:46:42 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
20:48:11  no, it only ignores you
20:51:14  [[Intramodular Transaction]] N https://esolangs.org/w/index.php?oldid=65955 * Hakerh400 * (+3860) New language
20:52:02  oo erjan
20:52:33  [[User:Hakerh400]]  https://esolangs.org/w/index.php?diff=65956&oldid=65899 * Hakerh400 * (+56) 
20:53:40  [[Language list]]  https://esolangs.org/w/index.php?diff=65957&oldid=65898 * Hakerh400 * (+56) Add new language
21:05:30  hichaf
21:06:18 -!- hppavilion[1] has joined.
21:06:30  `5 w
21:06:33  1/2:01//01 is an abbreviation that 01 understands. \ newline//Newlines are le/rn's \ biggest weakness. \ 　//　 is a space, unless you're hackego and don't understand wide characters. \ prography//Prography is the art of turning computational algorithms into something totally incomprehensible to anyone whose brain isn't made of silicon and arsenic. \ haskell'//Unbound implicit parameter (?haskell::Wisdom) \   arising from a use of implicit par
21:06:35  `n
21:06:36  2/2:ameter `?haskell'
21:09:31  [[Intramodular Transaction]] M https://esolangs.org/w/index.php?diff=65958&oldid=65955 * Hakerh400 * (-3) 
21:42:56 -!- atslash has quit (Quit: Leaving).
22:06:58 -!- ArthurStrong has quit (Quit: leaving).
22:08:25 -!- FreeFull has quit.
22:13:55 -!- Cale has joined.
22:31:18 -!- Phantom_Hoover has quit (Ping timeout: 245 seconds).
22:33:40 -!- hppavilion[1] has quit (Ping timeout: 244 seconds).
22:50:22 -!- b_jonas has quit (Quit: leaving).
23:04:36 -!- stux- has joined.
23:06:58 -!- stux|away has quit (Ping timeout: 252 seconds).
23:08:29 -!- xkapastel has joined.
23:09:43 -!- tramplefoot has joined.
23:12:33 -!- tramplefoot has quit (Read error: Connection reset by peer).
23:13:04 -!- hppavilion[1] has joined.
23:31:59 -!- Lykaina has joined.
23:32:22  anyone like this: https://paste.ee/p/W69OZ ?
23:36:25  i need advice about totem, and i hate that i don't know about any other chat rooms
23:38:37 -!- Cale has quit (Ping timeout: 276 seconds).
23:40:28 -!- Cale has joined.
23:43:45  hi Sgeo__ 
23:43:57  Hi Lykaina 
23:45:38  Lykaina, is the "loop nesting memory" a stack? Which instructions use it?
23:45:38  can you tell me how to find out if this languge i made is esoteric enough to be talked about here?
23:46:00  it's like a stack, i guess
23:46:34  crap...forgot to paste the interpreter's source code
23:47:17  it allows loops to work
23:47:35  I don't know how much interest it would gather, but I think this language qualifies.
23:47:39  by storing program file positions
23:50:53  https://paste.ee/p/OKVD1
23:53:29  sorry i get nudge and desparate at times
23:55:28  i just figured out subroutines
23:56:47  Sgeo__: the nesting memory is used by codes N, O, P, and Q
23:58:36  Ah. I would suggest the spec stating that, I think?
23:58:38  AFK soon

2019-09-05:

00:00:22  k
00:08:57 -!- oerjan has quit (Quit: Nite).
00:10:07 -!- arseniiv has quit (Ping timeout: 246 seconds).
00:37:35  any other comments about the specs before i re-paste?
00:42:27  https://paste.ee/p/tloTh updated repaste post Sgeo__'s suggestions...
00:43:27  replaces paste from 19:32:22 edt
01:16:46 -!- strangleloop has joined.
01:21:31 -!- strangleloop has quit (Ping timeout: 246 seconds).
01:28:33 -!- sprocklem has joined.
01:33:43  [[Language list]]  https://esolangs.org/w/index.php?diff=65959&oldid=65957 * Trickbrain26 * (+15) /* T */
01:34:53  [[Trickcode]]  https://esolangs.org/w/index.php?diff=65960&oldid=65954 * Trickbrain26 * (-54) 
01:36:43  https://paste.ee/p/Qek9M replaces the source code paste
01:40:13  [[Lazy evaluation]]  https://esolangs.org/w/index.php?diff=65961&oldid=49764 * CatIsFluffy * (+14) 
01:40:54  https://paste.ee/p/tloTh information and a sample program is here
01:51:38  Lykaina, consider adding it to the Esolangs wiki? (If you're willing to put into public domain). I think people often discuss languages themselves on the talk pages
01:52:20  (If you don't want to put into public domain, then making a page and linking should be fine)
01:52:35  not put the interpreter into public domain when i'm still improving the software
01:53:06  *I'm not
01:53:19  *I'm not putting
01:54:05  the language however...
01:55:49  when i'm ready
01:56:38  i want to see what features i can squeeze in
02:09:14  Blah, just discovered that in 2018, my https://esolangs.org/wiki/BF-RLE was replaced with a more general discussion. I'm not sure how to feel about this, I felt like "BF-RLE" named a specific encoding
02:11:51  This breaks zzo38's https://esolangs.org/wiki/GrainFimple spec unless GrainFimple's spec is updated to more precisely describe what is meant by BF-RLE
02:22:45 -!- hppavilion[1] has quit (Remote host closed the connection).
02:23:34  [[Esolang:Introduce yourself]]  https://esolangs.org/w/index.php?diff=65962&oldid=65915 * Toel F * (+215) /* Introductions */
02:23:43  [[Troll Online]] N https://esolangs.org/w/index.php?oldid=65963 * Toel F * (+404) Created page with "Troll Online is a programming language builded in c#. It can connect to internet. Documentation, interpreter and the source are in this github repository: https://github.com/t..."
02:26:27  [[Language list]]  https://esolangs.org/w/index.php?diff=65964&oldid=65959 * Toel F * (+19) 
02:30:47  [[Hello world program in esoteric languages]]  https://esolangs.org/w/index.php?diff=65965&oldid=65929 * Toel F * (+55) 
02:32:17  [[Hello world program in esoteric languages]]  https://esolangs.org/w/index.php?diff=65966&oldid=65965 * Toel F * (+2) 
03:02:39 -!- Lykaina has quit (Quit: leaving).
03:23:38 -!- stux- has quit (Quit: Aloha!).
03:23:52 -!- stux|away has joined.
03:49:53  [[Troll Online]]  https://esolangs.org/w/index.php?diff=65967&oldid=65963 * Toel F * (+1) 
04:08:17 -!- nfd9001 has joined.
04:28:12 -!- xkapastel has quit (Quit: Connection closed for inactivity).
06:10:48  [[Special:Log/newusers]] create  * Euphoria *  New user account
06:24:55  Do you like this?
06:25:29  kmc: hi kmc
06:25:35  non-interactive zero-knowledge proofs are tg
06:26:17  hi
06:26:30  non-interactive non-zero-knowledge non-proofs
06:27:30  non-interactive hugs
06:29:13  I prefer interactive hugs I think
06:30:18  me too
06:30:22  do you want an interactive hug
06:30:50  i would like
07:18:05 -!- cpressey has joined.
07:48:23 -!- Frater_EST has joined.
08:21:31 -!- Phantom_Hoover has joined.
08:21:44 -!- Phantom_Hoover has quit (Client Quit).
08:45:27 -!- Lord_of_Life has quit (Ping timeout: 245 seconds).
08:48:28 -!- Lord_of_Life has joined.
09:30:07 -!- Lykaina has joined.
09:31:33  https://paste.ee/p/FTqsX fixed typos in license and added copyright notice for spec notes + samples
10:05:25  Lykaina: sort of an esoteric computer architecture plus assembler?  Do feel free to make an article on the wiki linking to it!
10:06:59  tg?
10:57:21  `? tg
10:57:23  TG is short for Turing-Gödel, the highest possible level of difficulty for a multiplayer game. At this level, it's undecidable whether you can manage to halt before losing or not.
10:57:33  this entry may be less useful than you might expect
10:57:45  int-e: that applies to most wisdom entries
10:58:11  it is way more useful than the monad one
10:58:15  `? monad
10:58:16  Monads are just monoids in the category of endofunctors.
10:58:20  You're right
11:19:15  `? kittegory
11:19:16  A kittegory is just a small category.
11:35:08 -!- arseniiv has joined.
11:48:11 -!- xkapastel has joined.
11:48:41 -!- Frater_EST has quit (Remote host closed the connection).
12:06:56 -!- Lord_of_Life has quit (Max SendQ exceeded).
12:07:29 -!- Lord_of_Life has joined.
13:29:11  > mconcat [\n -> [n+1], \n -> [n-1,n*2]] 4
13:29:14   [5,3,8]
13:32:18  > (\n -> mconcat [[n+1], [n-1,n*2]]) 4
13:32:21   [5,3,8]
13:51:11  @pl \x -> foldl (.) id (reverse x) []
13:51:11  flip (foldl (.) id . reverse) []
14:02:47  [[Garbage]] M https://esolangs.org/w/index.php?diff=65968&oldid=63882 * A * (-16) /* Syntax */
14:05:41  [[Talk:Binary to unary conversion]] N https://esolangs.org/w/index.php?oldid=65969 * CarlosLuna * (+398) Asking for a general Unary to Binary conversion algorithm.
14:05:47 -!- howlands has joined.
14:10:28 -!- howlands has quit (Ping timeout: 245 seconds).
14:18:20  [[Trash]] N https://esolangs.org/w/index.php?oldid=65970 * A * (+1921) Created page with "[[Trash]] is an even simpler [[esoteric programming language]] that is designed to fullfill the CGCC definition of a programming language. ==Syntax== It is very simple (even s..."
14:19:42  [[Trash]] M https://esolangs.org/w/index.php?diff=65971&oldid=65970 * A * (+0) Typo
14:33:48 -!- nfd9001 has quit (Ping timeout: 245 seconds).
14:47:04  [[Lazy evaluation]] M https://esolangs.org/w/index.php?diff=65972&oldid=65961 * A * (+85) Not yet.
14:50:54  [[Lazy evaluation]] M https://esolangs.org/w/index.php?diff=65973&oldid=65972 * A * (+218) 
14:53:53  [[Lazy evaluation]] M https://esolangs.org/w/index.php?diff=65974&oldid=65973 * A * (+123) 
14:56:03  currently working on adding bitwise arithmatic
14:58:03 -!- cpressey has quit (Quit: A la prochaine.).
14:59:08  vote for name: totem vs echidna
14:59:35  Echidna
15:00:18  [[Lazy evaluation]] M https://esolangs.org/w/index.php?diff=65975&oldid=65974 * A * (+308) 
15:03:43 * Lykaina votes for Echidna
15:07:40 -!- howlands has joined.
15:18:44  http://sif.lesidhetree.com/sara/echidna/spec_notes.pdf
15:18:56  that good?
15:23:10  Which number does this Befunge code output: 9184611256>\#+:#*9-#\_$.@
15:23:44  i need to know wtf the captcha is talking about as well as the answer
15:24:44  correction: 9504611032>\#+:#*9-#\_$.@
15:25:14  Lykaina: have you tried trying to find a befunge interpreter?
15:25:28 -!- howlands has quit (Ping timeout: 245 seconds).
15:25:32  don't know where to find one
15:26:20  i'm trying to register on the wiki
15:28:07  Did you try using a search engine such as Google to find a befunge interpreter?
15:29:46  I think there's one on this channel as well? 
15:30:49  `! befunge "olleh">:#,_@
15:30:50  hello
15:31:20  `! befunge 9504611032>\#+:#*9-#\_$.@
15:31:21  100512662
15:31:40  [[Special:Log/newusers]] create  * Lykaina *  New user account
15:32:30  ty fizzie
15:32:33  FWIW, the https://esolangs.org/wiki/Befunge article's "External resources" section also has a lot of interpreters, including at least two online ones.
15:33:02  that is the weirdist captcha i have ever seen
15:33:15  We've had issues with spammers.
15:33:41  It used to be in Brainfuck, which I guess was a little more approachable? 
15:34:09  And before/after that it was a quiz on languages.
15:34:57  All of those were defeated; I think we're maybe assuming by just using humans (to which the current one is vulnerable as well), since it seems unlikely anyone wrote custom code for solving the Brainfuck one, for a website this unpopular.
15:35:35  [[Esolang:Introduce yourself]]  https://esolangs.org/w/index.php?diff=65976&oldid=65962 * Lykaina * (+166) /* Introductions */
15:35:56  (That introduction requirement is another anti-spam barrier.)
15:38:47  [[Echidna]] N https://esolangs.org/w/index.php?oldid=65977 * Lykaina * (+76) Adding a placeholder for my language.
15:41:00  [[Language list]]  https://esolangs.org/w/index.php?diff=65978&oldid=65964 * Lykaina * (+14) /* E */  adding Echidna to language list.
15:41:27  good?
15:45:05  [[Echidna]]  https://esolangs.org/w/index.php?diff=65979&oldid=65977 * Lykaina * (+90) adding a link for current information
15:48:02  brb shower
15:56:28  [[Talk:Binary to unary conversion]]  https://esolangs.org/w/index.php?diff=65980&oldid=65969 * CarlosLuna * (+1055) Adding an example of bounded Unary to Binary converter
16:01:06  back
16:08:29 -!- howlands has joined.
16:16:19 -!- b_jonas has joined.
16:16:33  I like the current captcha, and I could solve it without an interpreter
16:16:58  I figured out what the loop does, it's like making a base 9 number from those digits but there was some little twist 
16:17:17  a brainfuck one would be harder
16:17:25  I'd probably need an actual interpreter for it
16:21:59  [[Talk:Binary to unary conversion]]  https://esolangs.org/w/index.php?diff=65981&oldid=65980 * CarlosLuna * (-504) Improving the example of bounded Unary to Binary converter
16:24:09  [[Talk:Binary to unary conversion]] M https://esolangs.org/w/index.php?diff=65982&oldid=65981 * CarlosLuna * (+6) Adding boldface formatting
16:24:13  gtg
16:24:43 -!- Lykaina has quit (Quit: leaving).
16:40:28 -!- howlands has quit (Ping timeout: 245 seconds).
17:05:17  b_jonas: FWIW, the brainfuck one wasn't that bad. I think it produced a random string of the alphabet {a, b, c, d} by first forming the constant `a`, then having a sequence of +s, -s and .s with no loops.
17:07:55  And yes, it's a base 9 number except with 9 as a sentinel value and the digits backwards because of the stack.
17:08:10  `` dc -e '9i 230116405p'
17:08:11  100512662
17:22:16  fizzie: ok, that would work
17:22:59  fizzie: but does it subtract 9 from each digit before interpreting it in base 9?
17:23:43  No. Well, technically yes, but only for the 'if' condition on whether the digit was 9.
17:25:09  Flattened out, the relevant snippet is :9-_ aka dup-nine-minus-if; so the stack will have [x x-9] at the _ (where x is the original digit), the _ pops off the x-9 and the rest (\9*+) multiplies the accumulator by 9 and adds x to it.
17:25:51  It's reusing the 9 both for the 9-_ condition (when going left-to-right) and for the 9* of the accumulator (when going right-to-left).
17:26:27  but what does the ending with the dollar sign do?
17:26:48  That just drops off the extra 9.
17:27:30  The full stack at the if is [acc digit digit-9], the _ pops off digit-9 and the $ pops off digit (which in this case must've been 9, since digit-9 was zero) so that . prints the accumulator.
17:27:41  wait, let me look at the befunge rules, I don't remmeber them
17:28:24  ok, makes sense
17:28:44  It also uses one of the implicit infinite number of 0s under the bottom of the stack as the initial accumulator value.
17:29:04  ...or does it. I guess it doesn't.
17:29:20  Yeah, no, I confused myself. Of course it doesn't, it would hit that sentinel.
17:29:26 -!- howlands has joined.
17:29:48  It's just that the last digit (the 2 there) is considered the initial accumulator, not one of the base-9 digits, arguably.
17:30:58  yeah, that looks about right
17:31:19  [ 9 #. 8 4 6 1 1 2 5 6
17:31:20  b_jonas: 40751313
17:31:33  oh, backwards
17:31:35  [ 9 #. |. 8 4 6 1 1 2 5 6
17:31:36  b_jonas: 31480937
17:31:49  [ 9 #. |. 5 0 4 6 1 1 0 3 2
17:31:50  b_jonas: 100512662
17:35:11  Turns out the Brainfuck variant was mostly as I described, except with a bigger alphabet. It starts with a common initial prefix that loads 100 'd' (as 10*10), then generates a random sequence of X.X.X.X.X.X.X.X. where each of the Xs is uniformly randomly either "", "+" or "-", except the + or - is omitted if that would make the value less than 97 'a' or more than 122 'z'.
17:35:34  It's still pretty prone to creating strings from the beginning of the alphabet, since it starts from 'd' and does a random walk with a maximum step size of 1.
17:35:52  yeah
17:35:56  And in fact it can never reach 'z' because the longest sequence is 16.
18:20:11 -!- FreeFull has joined.
18:40:34  Has Dr. Seuss ever been involved in any lawsuits?
18:41:47  seems at least his estate was https://boingboing.net/2019/03/14/fair-use-vs-seuss.html
18:47:02  Oh so some people got to say "Dr. Seuss sues [...]" :)
19:00:45  [[Troll Online]] M https://esolangs.org/w/index.php?diff=65983&oldid=65967 * Dtuser1337 * (+3) Your page might suck,  but i converted the example text to headings.
19:03:08  [[Hello world program in esoteric languages]]  https://esolangs.org/w/index.php?diff=65984&oldid=65966 * Dtuser1337 * (+39) /* PUBERTY */
19:09:00  [[Grid]]  https://esolangs.org/w/index.php?diff=65985&oldid=65920 * Hakerh400 * (+122) Corrected the algorithm description
19:17:54 -!- xkapastel has quit (Quit: Connection closed for inactivity).
19:31:08 -!- imode has joined.
19:33:29  [[Unified HQ9+]]  https://esolangs.org/w/index.php?diff=65986&oldid=59395 * Dtuser1337 * (+28) 
19:34:06  [[Unified HQ9+]]  https://esolangs.org/w/index.php?diff=65987&oldid=65986 * Dtuser1337 * (+26) 
20:22:18 -!- imode has quit (Quit: WeeChat 2.5).
20:25:06 -!- Lykaina has joined.
20:27:33  hi
20:28:20 -!- xkapastel has joined.
20:30:03  i must apoligize for misleading everybody into thinking ops L and M in Echidna were functioning. In reality, I haven't even designed the code for those, much less written them.
20:31:00  but i'm working on it
20:33:55  i know the input. i know the intended output
20:42:23  L is done
20:42:35  but untested
20:47:01 -!- Lord_of_Life has quit (Ping timeout: 246 seconds).
20:49:03 -!- Lord_of_Life has joined.
20:55:33  same for M now
21:04:40  M isn't working right...
21:07:18  neither is L
21:15:36  since when does 0xff6a == 0xffb5?
21:15:43  grrr
21:20:50  and 0xAAAA xor 0x5555 = 0xFFFE ?
21:25:05  and 0xFFFF AND 0xFFFF = 0xFFFE ?
21:25:18  something weird is going on
21:27:29 -!- oerjan has joined.
21:29:38  0xFFFF AND 0xFFFF = 0xFFFE, 0xFFFE AND 0xFFFF = 0xFFFC ? where's the bug? I demand you show me, codeblocks
21:30:22  hi oerjan 
21:34:08  fixed operation M
21:37:05  and L
21:39:34  that's two letters down
21:43:10  no
21:43:52  it was shifting the output to the left by 1 too much
21:47:17  updated Echidna's documentation file
21:49:24  it's a self-hosted pdf on the Echidna page. Not ready to be public domain.
22:00:44  I thought about morphism composition notations and about (more or less natural) notations for application of a linear operator or its adjoint to a (co)vector and found out I think a very funny thing
22:03:39  suppose A: U → V, B: V → W, v ∈ U, f ∈ W*, then if we agree to write Av for the application of A to v, it’s for a couple of reasons (regarding left and right modules, and also matrix notation) natural to write fB* for the application of B* to f. Now,
22:05:42  we can end with * altogether (we have a type system to back us!) and write fB. Then we can write fBAv, for example. And now notice that BA here can denote both B <<< A and B* >>> A*
22:06:05  this   is   fun
22:08:58  or not here, but standalone also. But invoking fBAv beforehand could appeal for this notation choice
22:09:45  (it reminds me of lenses now, and not without a reason)
22:09:58  bye I hope this was interesting
22:11:58  [[Echidna]]  https://esolangs.org/w/index.php?diff=65988&oldid=65979 * Lykaina * (+137) adding a link for an interpreter.
22:13:32  can someone look at what i linked about echidna and help me figure out what kind of esolang it is?
22:14:08  I want to have a description on there at least.
22:14:52 -!- ais523 has joined.
22:15:01  it looks like  an assembly language to me
22:15:02  hi ais523 
22:15:09  hi
22:17:40 -!- arseniiv has quit (Ping timeout: 246 seconds).
22:19:12 -!- FreeFull has quit.
22:23:22  [[Echidna]]  https://esolangs.org/w/index.php?diff=65989&oldid=65988 * Lykaina * (+106) a little description
23:01:08  Lykaina: so are the comparison, divide, modulus and shift right arithmetic instruction unsigned ones, and is there no signed less than instruction?
23:01:47  Lykaina: and are those bitwise instructions the only way to do an indirect load (as opposed to an indirect store, for which you have a specific instruction)? that will lead to a lot of use of those bitwise thingies with redundant arguments I think
23:02:42  it seems a bit odd that indirect load works that way, but you seem to allow immediate operands basically everywhere
23:02:48  it's a strange instruction set
23:02:49  b_jonas: you just reminded me of the "load data by rotating it ten times" trick that's sometimes used in Malbolge
23:05:18  Lykaina: also I find the spec a bit hard to read and unclear, but it's not as bad as some of the things we see on the wiki
23:05:18  ais523: Did you go to the thing?
23:05:37  what thing?
23:05:52  http://events.cs.bham.ac.uk/syco/strings3-syco5/
23:06:02  no
23:06:16  I'm not all that interested in string diagrams
23:06:21  oh
23:06:25  and I'm fairly busy with other things at work
23:06:35  Hmm, what about compositional structures?
23:06:38  Anyway that makes sense.
23:06:41  I have been known to go to locally hosted conferences that I'm only tangentially interested in, but not this time
23:08:52  I only went to locally hosted conferences where I was actually at least somewhat interested in the topic at the time, but of course within conferences I listened to talks in which I'm not too interested, if there isn't a better talk available in another track, 
23:09:20  and I definitely went to PhD dissertations where I wasn't interested in the topic, because those are social events for meeting friends and the thesis topic doesn't matter
23:13:00  PhD defences/vivas aren't public in the UK (I know this differs between countries)
23:13:05  it's just the candidate and the examiners
23:13:10  what the...
23:13:12  that's odd
23:13:20  they're always public here, they have to be
23:13:30  well, they'd be hard to watch because the examiners are supposed to have learned everything from the PhD thesis already
23:13:39  well, I think there may be closed ones if they're like connected to classified military stuff
23:13:46  so they jump straight into asking technical questions about it, there'd basically be no context for anyone else
23:14:50  so is there a formal celebration open to public after, or do the graduates skip right to the pub run?
23:14:55  I can see the argument in wanting the candidate to give a presentation on the topic of their PhD and defend that, I guess it comes down to whether it's more important to defend the principle or the details
23:15:24  you don't get the verdict right away, it comes by post a few weeks later after the examiners have discussed, and is normally several pages full of things they're concerned about and want correcting
23:15:45  then you make the corrections and resubmit
23:16:04  mind you, there is a closed part within the public defense, namely the part after all the questions when the committee discuss their decision, and for that part everyone else is ordered out of the room
23:16:11  when they're finally happy you get told you're accepted, and then there are mass graduation ceremonies you can go to if you want a big official celebration
23:16:16  I describe this in a comment, let me find the link
23:16:32  I think the UK method is pretty good at avoiding, say, fallacious proofs
23:16:46  especially if it's unclear how much effort they'll take to fiix
23:17:41  Does the UK still do snake fights?
23:18:33  Speaking of the UK, I'm a bit confusil about what's going on with parliament nowadays.
23:18:40  no idea; I have a suspicion they'd be illegal, which doesn't mean they wouldn't happen but does mean I'd be unlikely to be aware of them if they did
23:18:40  found it: http://www.madore.org/cgi-bin/comment.pl/showcomments?href=http%3a%2f%2fwww.madore.org%2f~david%2fweblog%2f2015-12.html%23d.2015-12-05.2340#comment-22088
23:19:12  I mean mandatory snake fights after your thesis defense.
23:19:21  I didn't have one of those
23:19:23  so probably not?
23:19:37  @google snake fight thesis defense
23:19:38  https://www.mcsweeneys.net/articles/faq-the-snake-fight-portion-of-your-thesis-defense
23:20:09  ais523: members of the committee get the thesis well in advance, suppoedly read it and understand it, and even send questions to the candidate at least a few days before the defense,
23:20:29  as for what's going on in parliament, right now nothing, Commons won't be back until Monday, Lords are asleep but will probably be approving the EUWA #6 tomorrow (they agreed to meet on Friday, which they normally don't, to get enough time to approve it)
23:20:54  what's happened over the past couple of days is more interesting
23:21:30  shachaf: about the parliament, I think because of conflicting promises, they have to sarifice two or three prime ministers every year, so that they can remain in the EU but have someone take the blame for the government not keeping their promise of exiting the EU
23:21:30  basically there's a new prime minister (because the old prime minister resigned, the new prime minister is appointed by the same party that the old one came from)
23:22:19  I understand the prime minister part, what I don't understand is in what way the queen was involved
23:22:29 -!- ais523 has quit (Remote host closed the connection).
23:22:42 -!- ais523 has joined.
23:22:46  shachaf: we don't have mandatory snake fights for PhD defenses here either
23:23:00  b_jonas: Odd. Maybe it's an American tradition.
23:23:02  there is some concern among MPs that he will attempt to leave the EU with no agreements in place, which became much greater when he announced that parliament would be prorogued (basically shut down) until mid-October, when there might not be time to agree on a course of action
23:24:02  The Finnish thesis defence has a /lectio præcursoria/ in the front, and IIRC it's typically the only part done in Finnish (because normally the opponents are from abroad, and the thesis is in English) and I think it's mostly there so that the candidate's family has something for them as well.
23:24:03  it's possible that some people fight snakes, because the less formal part of the celebration afterwards usually involves heavy drinking, but I'm quite sure it's not mandatory
23:24:21  the snake fight is not mandatory that is, the heavy drinking is
23:24:59  a while ago, because some of the Prime Minster's competitors in the (Conservative Party-internal) leadership debate had threatened to shut down parliament to prevent them interfering with Conservative plans for Brexit, a Northern Ireland-related bill got amended to force regular updates in Parliament on the situation in Northern Ireland, purely for the side effect of forcing Parliament to be open whilst not being offtopic
23:25:09  which is why Parliament can't be shut down until beyond mid-October
23:25:58  I went to one thesis examination while in Leuven for a while, and all the questioning part was in Flemish, which made it a little hard to follow for me.
23:26:04  anyway, the prorogation doesn't start until next week, and there's a clear majority among Members of Parliament (and Members of the House of Lords) that we shouldn't leave the EU without an agreement in place as to how it's done
23:26:13  shachaf: hmm, that FAQ says it can involve both venomous snakes and snakes with physical attacks
23:27:03  so they've been trying to rush through an emergency law to prevent it happening (known the European Union (Withrdawal) Act No. 6), and the Government (i.e. the Prime Minister + allies) have been trying to stop them
23:28:13  the problem is that sufficiently many MPs in the Conservative Party, together with almost all the MPs outside, disagree with the Prime Minister; this lead to some (~20) Conservatives voting against party line in order to get the EUWA #6 through, despite the Prime Minister threatening to throw them out of the party
23:28:20  Did the conservative party kick out all the people who voted against the act?
23:28:38  yes! and as a result they no longer have a majority, i.e. they have less than half of the MPs even if you count allies
23:28:40  ais523: would this be a normal summer break of the parliament, or a special break?
23:28:50  We had a "Brexit info" email at work for all UK employees today. The email just said the situation is "fluid" and that there's nothing new to report.
23:28:54  b_jonas: we just had our normal summer break (it ended on Tuesday)
23:29:04  Right, I understood they lost their majority but I wasn't sure whether they'd left themselves or were kicked out.
23:29:10  there's normally a small break over October, this is theoretically that break but it's been made way longer
23:29:23  I think they lost the majority even before the rebel alliance got kicked out? 
23:29:26  shachaf: one left of their own accord, the others were kcked out
23:29:31  I know one person joined the liberal democrats but the rest (including the father of the house?) are now just independent?
23:29:32  Because of that one defection, right.
23:29:48  the rest are independent unless or until they join a party or form a new party
23:30:19  although I think many of them are planning to be independent until the next election and then leave politics (some want to stay but may have problems being elected with the Conservatives running against them)
23:30:27  but if the party kicks out their members, then don't they get replaced by other people on the party's list?
23:30:36  b_jonas: no, we elect MPs not parties
23:30:39  for parliament seats that is
23:30:42  hmm
23:30:54  getting rid of an MP is almost impossible, there are only two ways
23:31:32  strange
23:31:41  a) if the MP is convicted of a sufficiently serious crime, then a petition of 10% of their constituents can force a new election (but they can run for the election if they want to; so far this has proven to be a bad idea but it hasn't stopped some MPs trying)
23:32:01  b) MPs automatically get fired if they accept money from the Queen
23:32:22  isn't there also a new MP if the old one dies?
23:32:34  OK, yes, but I wouldn't recommend killing MPs
23:32:50  they don't have to be killed
23:32:51  point b) here is mostly used as a loophole for MPs to voluntarily step down, because they aren't legally allowed to resign; the Queen maintains a couple of useless jobs purely for the purpose of hiring MPs that want to resign
23:32:52  they can die otherwise
23:33:34  one of them is a job hunting down outlaws in the Chiltern Hills, which became irrelevant ages ago because a) we have police and b) outlaws don't really exist as a concept any more
23:33:40  so it's vacant execept when an MP needs to resign
23:33:51  it's not theoretical, because Antall József died while he was minister-president, and got replaced by a different minister-president because he died
23:34:06  Oh man. That's pretty good.
23:34:16  hehe
23:34:19  yes, that's indeed nice
23:34:30  anyway, the Commons passed through all the stages of the EUWA #6 in a single day, so now the Lords have to confirm it
23:34:31  I mean, we have had positions just to pay people, without a real job
23:35:07  there was an attempted filibuster but the Lords have a huge majority against the Prime Minister's position, so the filibusterers gave up at about 1:30am
23:35:22  They submitted 100 amedments to the bill, right?
23:35:37  (the opposition Lords were taking it seriously, though; they had a rota set up, and brought lots of food, sleeping bags, etc. to the House of Lords to make sure they could outlast their much smaller number of political opponents)
23:35:39  right
23:35:42  sl a
23:35:45  Did they give up on them?
23:35:55  *so an amendment can be dealt with in a few seconds if there's no real support or no real opposition to it
23:36:12  show of hands or voice vote, move on
23:36:27  "opposition lords" means opposed to the majority in the house of lords, or opposed to the government?
23:36:29  so for a filibuster to work, you need sufficiently many Lords on your side that the verdict is unclear
23:36:36  shachaf: opposed to the government
23:36:42  but if you don't elect parties, then how are the members of the parliament chosen?
23:37:06  or the lower house at least
23:37:19  the funny thing is, the Lords have a built in Conservative majority because they move so slowly, but (because they move slowly and the Conservatives have changed position rapidly recently) the Conservatives in the Lords are mostly opposed to the Prime Minister
23:37:35  It's kind of bizarre that filibusters are still a thing that nominally works, rather than being treated as bad faith.
23:37:41  b_jonas: basically we get a list of candidates for each constituency; if you're standing for a party that's listed on the ballot for information
23:38:30  ais523: and delegates from constituencies fill all places in the lower chamber?
23:38:43  shachaf: the UK version works fairly well I think? a) it only works in the Lords, not the Commons, and the Lords can't block a bill indefinitely, only delay it; b) it lets a really determined minority delay a bill for a while but you have to keep talking / keep voting / etc. so if the minority is too small you won't have the stamina, and if they aren't committed enough they won't bother
23:39:05  (the smaller the minority filibustering, the less effort it'll take from the majority to break the filibuster, as their anti-filibuster rota will be easy to set up)
23:39:12  b_jonas: right
23:39:36  hmm, I think the US has some such system too
23:39:46  but they have states, so it makes more sense
23:40:42  In the US senate it seems that people are slowly changing the rules to get rid of filibusters in various contexts.
23:40:53  the filibuster in this circumstance was pretty unique as the Lords need to get the EUWA #6 through before Parliament gets prorogued, which could happen on Monday (the prorogation order was vague as to the exact date, but it's some time next week)
23:41:25  doesn't the prorogation get delayed while people are actively filibustering?
23:41:55  I suspect the US congress is more pathological than the UK system.
23:42:00  if they can keep up for that long, that is, which isn't easy
23:42:13  so the pro-Government minority would only have to last a few days, but a) they were too small and b) they may have stopped due to optics (also, possibly there was a deal brokered between the two sides, but IIRC people are denying it)
23:42:20  b_jonas: no, the date's absolute
23:42:39  hmm
23:42:45  And it's nominally done by the monarch anyway, right? 
23:42:57  fizzie: yes, but she has to follow the advice of the Prime Minister
23:43:31  or, well, "has to"; it's unlikely that the monarchy would dare break that particular convention, but laws don't technically apply to them, so in theory the Queen could do pretty much any thing
23:44:29  It's kind of funny how Borris (our local nickname) says the prorogation has nothing to do with Brexit, and how there's plenty of time to talk about Brexit when it's over.
23:44:46  "plenty of time" = about 2 weeks
23:44:54  which isn't enough to implement most suggested solutions
23:45:00  e.g. 2 weeks isn't enough time to hold an election
23:46:13  (shachaf: on the subject of elections, the prime minister attempted to call one after losing the EUWA #6 vote, but didn't have the votes even to do that; the opposition want to get EUWA #6 through first before calling an election, due to potential issues like using the election to dissolve Parliament for the /rest/ of the time before October 31…)
23:46:52  Is calling general elections common?
23:47:26  that's odd
23:48:09  it used to be that the prime minister could call elections unilaterally, and would do so when they thought they had the best chance of their party being re-elected / gaining a larger majority
23:48:47  electing a prime minister directly seems such an odd thing to do, exactly because it can get you into these strange situations where their government can't function because they don't have the support of the parliament
23:48:49  but then the Liberal Democrat / Conservative coalition government happened, and the Liberal Democrats were concerned that the Conservatives would just call an election as soon as they thought they could get rid of the Lib Dems
23:49:30  so as part of the "price" for the coalition, the Lib Dems passed a law that made it almost impossible to call an election unless a) everyone agreed on it or b) the Prime Minister lost their majority
23:50:14  now, b) has actually happened, but the opposition are delaying the official no-confidence vote (that tests if a majority exists) until after EUWA #6 goes through
23:50:22  ah
23:50:29  ok, it makes more sense that way
23:50:53  so everyone knows that the Prime Minister has lost their majority but it hasn't officially been tested, so they're still notionally in charge for the time being
23:51:09  so that's also why they need the filibuster?
23:51:33  the filibuster was an attempt to prevent EUWA #6 passing, but it's already failed
23:51:44  so EUWA #6 is quite likely to pass some time tomorrow
23:51:56  Also odd: this one/two/three-line whip thing, which apparently is the number of times the instruction is underlined.
23:52:10  yes
23:52:16  also zero, but that's equivalent to not whipping at all
23:52:17  You've got a charmingly quaint parliamentary system.
23:52:54  the actual numbers of lines aren't really defined
23:52:56  (Probably that's what happens when you've had one so long.)
23:53:23  Conservative MPs ignored three-line whips under Theresa May quite frequently and nothing happened to them, probably because she'd lost control of the party (and ended up having to resign)
23:54:09  meanwhile, in Boris Johnson's first vote, he threatened to expel anyone from the party who voted against it, and then actually did, but given the numbers he's probably /also/ lost control of (a different subset of) the party
23:55:46  so have the leaders of those who were expelled from the party started three new parties, each of them claiming to be the one true successor to the conservative party, which has lost its, uh, approval of the people or whatever fancy phrase they use
23:56:01  because that's how parties tend to die here
23:56:40  well, there was a party of breakaway MPs (and technically still is), who have changed their name at least twice since and have lost many MPs
23:56:44  so it's not doing too well
23:57:01  it's how Orbán got his continued rule basically, because every other significant party fell apart that way
23:57:05  the people expelled from the Conservatives recently are mostly still independents, but that's not surprising given how recent it was
23:57:33  might take some more months I guess
23:57:54  several MPs who have defected from Conservatives or Labour over Brexit have since joined the LIberal Democrats (traditional third party; the Scottish National Party are larger but don't get any real support outside Scotland)
23:58:14  I see
23:58:22  Also calling back to the thesis discussion, in Finland actually the bit that keeps things free of errors and the quality bar high enough is the "preliminary examination", which is done offline, takes some weeks, and all but guarantees that everyone who gets to the public examination stage will pass it.
23:58:44  fizzie: is there a mandatory fight with a snake?
23:58:58  fizzie: right, the preliminary examination stage is basically the entire thing for us
23:59:36  except that after it, the corrections period can be very long (the length depends on how many corrections there are and how large they are, but is normally 3 or 6 months if the thesis is well-received, more if it has major problems)
23:59:41  b_jonas: No, Finland isn't that known for snakes. We've got just that one poisonous one.

2019-09-06:

00:00:00  fizzie: do they fight some other animal then?
00:02:24  Right. For us, the preliminary examination result is a statement that either you can defend as-is (pretty rare), requires minor revisions (most common; something you can do in a few weeks and doesn't need a full recheck) or requires major revisions (expected to take months, needs to be resubmitted for a full re-examination).
00:02:49  Actually, pretty similar as how journal paper reviews go.
00:03:03  this one is fun: https://www.youtube.com/watch?v=uiyz1IYEFtI  marathon speedrun of a Game Boy Advance game, the problem being that the game requires motion controls, but on that console, recording the video output and motion controls are hard to do at the same time
00:05:10  fizzie: here it's anywhere from "no corrections" (never happens in practice), "minor corrections" (3 months, a very common result, it's what my PhD had), "major corrections" (6 months, situations where the corrections may require new maths), "resubmit" (1 year, it means serious problems with the original but they'll give you another chance), equivalents of all those for a lesser degree ("this isn't PhD-worthy but it is worth a Masters' degree"), and 
00:05:11  outright rejection
00:07:04  How commonly do PhD candidates not already have a Masters' degree?
00:07:10  is there one for greater degrees too, where the thesis is so impressed they decided that the candidate is chosen to become dictator for life on the spot?
00:07:28  fizzie: I'd guess ones who come from the US might not have one
00:07:36  their system is weird
00:08:02  fizzie: well there's nothing preventing you getting /two/ Masters' degrees, although that might not be a preferred outcome
00:08:37  but here too a master's degree is technically not a requirement for the thesis, you only need it in practice because that's the only way you can get a scholarship that lets you do research and study to be able to write a thesis
00:08:52  Transportation for life, and then to be fined forty pound.
00:09:20  ais523: sure, but they can't just award a master's degree, right? they can only award the thesis part, while the candidate would need to satisfy all the other requirements too
00:09:38  "Masters by research" is a recognised qualification, that can be done off just a single thesis
00:09:50  Hmm, should I go to graduate school?
00:09:56  a PhD thesis would in theory qualify for it but normally you'd want the PhD instead
00:10:09  shachaf: where are you? the US? probably not, you're highly likely to be overcharged
00:10:26  shachaf: https://www.xkcd.com/498/
00:11:04  shachaf: do you have a masters?
00:11:26  xkcd was pretty different back then
00:11:37  ais523: I'm in the US but presumably I could go anywhere.
00:11:44  b_jonas: I don't.
00:11:52  shachaf: would you like to get a job for which a PhD degree is a strong advantage, which are mostly jobs at a university or at state-sponsored research institutes?
00:12:15  I don't know.
00:12:39  ais523: yes. I recommend reading SMBC, which is still similar to what xkcd used to be like in its classic era
00:12:43  Another fact is that I don't have a bachelor's degree.
00:12:56  only more colorful
00:13:32  shachaf: that part is easier to fix
00:13:38 -!- oerjan has quit (Quit: Nite).
00:13:47  Is it?
00:13:57  yes, it's easier to get a bachelors degree than a masters degree
00:14:19  b_jonas: I don't really like old xkcd; I don't normally like new xkcd either but sometimes it's very good
00:14:36  ais523: which of the new ones do you like?
00:15:30  the one before the current one was fairly good
00:15:38  there's one that's slightly older that was better but I can't remember which one
00:15:59  Game Show? dunno, I don't much like that one
00:16:16  oh right, https://xkcd.com/2189/ is very good
00:16:30  xkcd is mostly observational humour, so I mostly enjoy it when the observation is interesting / thought-provoking
00:16:48  that's not my style either, but ok
00:17:00  2189 that is
00:17:08  observational humor may be fine 
00:17:15  in that case, the set of xkcds we like is possibly disjoint
00:17:20  not that that's necessarily a problem
00:17:40  I don't claim that all the new ones are bad, I just prefer the classic ones in average
00:17:55  I still do look at every new xkcd, I haven't stopped looking
00:18:07  but prefer other comics now
00:18:18  yeah, part of that is other comics having become better
00:19:02  Is Dennis Skinner everyone's favorite MP?
00:19:24  I think there's quite some variety in favourite MPs
00:19:36  many people's favourite MP is the one representing their own constituency, of course
00:19:48  but there are quite a lot of interesting personalities in the House of Commons
00:19:55  eww no way
00:20:05  I still vote for the part of the city that has ruined the city park
00:20:23  that's where I spent all my childhood, and now it pains me any time I go there
00:20:50  so I can't feel patriotic to my election district
00:21:06  Presumably Lord Buckethead is everyone's favowrite Lord.
00:22:05  alternately, it wasn't them who ruined it, because local governments don't have any power anymore, everything is done centrally, in which case there's no point being patriotic to any district government
00:23:07  Lord Buckethead isn't actually a Lord (if he were, he wouldn't be able to run for the Commons)
00:23:17  also, he isn't the same Lord Buckethead that became famous, there was an IP dispute
00:23:26  (it's hard to tell that the person beneath the bucket has changed, though)
00:23:54  but that's why only very few independents get into the parliament, people vote to support a party in the parliament rather than to support a person supposedly representing their district
00:24:22  we normally get maybe 1 or 2 independents elected per election cycle in the UK
00:24:46  it's difficult to win as an independent because you don't have a party's advertising / canvassing might behind you
00:25:02  and because FPTP discourages voting for people who have little chance of winning
00:25:25  but if an independent is considered a serious candidate in a constituency, they may well end up winning if people dislike their main competitors
00:27:15  Until recently I thought most Lords in the House of Lords were hereditary.
00:27:17  wait what? there's a member of the parliament with a bucket on their head? but isn't that impossible because of https://stickman.qntm.org/comics.php?n=622 ?
00:27:40  But apparently that's only a small fraction of them.
00:27:53  The rest are appointed, but it's not clear to me exactly how the appointment works.
00:27:57  exactly, just one or two independets at any time
00:27:57  b_jonas: no, Lord Buckethead is a persistent /candidate/ to be an MP but has never won
00:28:03  nor come remotely close to winning
00:28:14  I think there's only one right now
00:28:19  Sometimes it's by the Prime Minister, but sometimes by a committee?
00:28:34  And appointments are for life. Should I think of it like US Supreme Court appointments?
00:28:55  ais523: so they'd remove the bucket if they became an MP?
00:29:04  think of it like life appointments to a really big advisory body that parliament calls on, that's what the Lords basically are at this point
00:29:13  b_jonas: either that, or immediately resign
00:29:32  ah yes, that can work too
00:29:50  the normal life-cycle of a law has the Commons design it and the Lords work out the details (and/or say "are you sure?"); the Lords can't block a bill but can delay it
00:30:27  I think the non-serious party here was once asked what they'd do if they gained majority in the parliament (they never had anything near the chance for that), and whoever they asked said that they'd resign and call for a new election
00:30:40  I guess the House of Lords is much weaker than e.g. the US Senate nowadays.
00:30:43  so the Lords are a combination of hereditary peers which are families that have been Lording for generations (advantage: people can be educated specifically for the position; disadvantage: somewhat undemocratic), former MPs, and business/scientific leaders
00:30:47  Despite being called an "upper house".
00:30:54  I suppose that wasn't the case in the past.
00:31:23  the Lords used to be equal to the Commons, but there was a constitutional crisis in the early 20th century which lead to the commons being given an override
00:32:55  Apparently bishops have priority over other humans in the House of Lords? What a scam.
00:33:09  (for budgets, the override triggers automatically after 1 month if agreement hasn't been reached; for anything else, the Commons need to attempt to pass the same law twice a year apart and then intentionally trigger it)
00:33:41  being able to delay bills by a year is fairly powerful and gives the Commons lots of tiime to reconsider, but means that the Lords have no final say on almost anything
00:33:57  shachaf: I don't think "upper" means it should be stronger. it means the same as "Lords", that is, representing the upper classes of society
00:33:57  Hmm, MP terms are normally 5 years?
00:34:13  (the exception: any attempt to increase the length of time between elections to more than 5 years needs to be approved by both the Commons and Lords, no override available)
00:34:15  shachaf: right
00:35:10  b_jonas: I don't think "upper" means that it's stronger in any case.
00:35:25  it does in cards
00:35:44  because it's representing a single person, not a whole house
00:35:58  well, as much as cards represent people
00:36:06  they're abstract stuff decorated with people
00:36:09  the funny thing is, one of the only times the override was actually used was to change the time limit on using the override from two years to one year
00:36:28  lol
00:36:37  or, not a time limit, it's the opposite of a limit
00:37:10  reasonable, that's the sort of topic that they're definitely familiar with so qualified to make rules about
00:48:03 -!- xkapastel has quit (Quit: Connection closed for inactivity).
01:26:23 -!- ais523 has quit (Quit: quit).
03:03:02  b_jonas: hi
03:05:43  b_jonas: yeah, the spec was originally designed for my personal reference
03:06:21  i'll have to clarify a lot of stuff before it is ready for the wiki
03:09:01  ready for the wiki as in directly explaining it on the wiki page
03:10:42  current thing is modifying the subroutine code to make it easier to reuse them
03:11:20  that's { N , & , -- }
03:11:41  those commands are affected
03:28:25  [[Super Stack]] N https://esolangs.org/w/index.php?oldid=65990 * Dtuser1337 * (+26) Redirected page to [[Super Stack!]]
04:12:02 -!- rodgort has quit (Quit: Leaving).
04:16:17 -!- rodgort has joined.
05:02:53  [[Echidna]]  https://esolangs.org/w/index.php?diff=65991&oldid=65989 * Lykaina * (-3) updating with newest interpreter link.
05:10:23  [[Echidna]]  https://esolangs.org/w/index.php?diff=65992&oldid=65991 * Lykaina * (+22) doing a little formatting.
06:27:44  http://kickjava.com/src/com/sun/java/swing/plaf/nimbus/InternalFrameInternalFrameTitlePaneInternalFrameTitlePaneMaximizeButtonWindowNotFocusedState.java.htm
06:28:19  Is this autogenerated code?
06:40:11  who knows, man
06:44:56  kmc: My friend is very irritated at everything about this post: https://softwareengineering.stackexchange.com/questions/394399/managing-and-organizing-the-massively-increased-number-of-classes-after-switchin
06:46:20 -!- Frater_EST has joined.
07:16:54  [[Special:Log/newusers]] create  * Peti345 *  New user account
07:21:01  ah great, another company that buys into design patterns and best practices instead of just writing reasonable code
07:21:31  though on the plus side, they are writing tests
07:22:20 -!- nfd9001 has joined.
07:37:48 -!- Frater_EST has left.
07:39:46 -!- b_jonas has quit (Quit: leaving).
08:15:33 -!- cpressey has joined.
08:18:52 -!- nfd has joined.
08:22:11 -!- nfd9001 has quit (Ping timeout: 268 seconds).
08:36:47 -!- wob_jonas has joined.
08:41:15  > (foldl (flip (.)) id [\x -> x+1, \x -> x*2, \x -> x*x]) 4
08:41:17   100
08:41:25  (appEndo $ getDual $ mconcat $ map (Dual . Endo) [\x -> x+1, \x -> x*2, \x -> x*x]) 4
08:41:35  > (appEndo $ getDual $ mconcat $ map (Dual . Endo) [\x -> x+1, \x -> x*2, \x -> x*x]) 4
08:41:37   100
08:42:32 * cpressey mumbles something about a monoid at an informal gathering of endofunctions
08:43:49  @quote appendo
08:43:50  quicksilver says: 'appEndo' sounds like a harry potter spell
08:43:51  @quote appendo
08:43:52  hpc says: appEndo sounds like a harry potter spell
08:43:59  hmm
08:44:03  suspicious
08:44:39  > foldr ($) 4 [\x -> x+1, \x -> x*2, \x -> x*x]
08:44:42   33
08:44:57 -!- Lord_of_Life_ has joined.
08:44:59  appendo sounds like it would be an introductory minikanren example
08:45:01  > foldl (&) 4 [\x -> x+1, \x -> x*2, \x -> x*x]
08:45:04   100
08:47:58 -!- Lord_of_Life has quit (Ping timeout: 245 seconds).
08:48:03 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
08:48:10  only because of the video game that has a "flippendo" spell, it doesn't sound like a book-canon spell name
08:49:31  That wasn't the quote I was looking for anyway.
09:13:03  @hoogle &
09:13:03  Data.Function (&) :: a -> (a -> b) -> b
09:13:03  Control.Lens.Lens (&) :: () => a -> (a -> b) -> b
09:13:03  Control.Lens.Operators (&) :: () => a -> (a -> b) -> b
09:27:23  apparently python regexes *almost* the same syntax as perl regexen. there's one important difference, but that one is among the most frequent things I write in a regex:
09:27:35  perl's /\z/ corresponds to python's r"\Z"
09:27:50  oh no
09:27:54  luckily if I mess it up, r"\z" gives an unconditional error
09:28:06  and I don't think I ever want to write perl's \Z specifically
09:28:14  or at least never without thinking a lot
09:30:17  the other incompatibility is making named capture groups
09:30:45  it's possible that some of these differences come from ancient historical reasons of course, because python has old roots and evolved parallel to perl
09:40:06 -!- nfd9001 has joined.
09:42:23 -!- Bowserinator has quit (Quit: Blame iczero something happened).
09:42:42 -!- Bowserinator has joined.
09:42:52 -!- nfd has quit (Ping timeout: 276 seconds).
09:54:34  oh yeah, I almost forgot this one! in windows, you need to add an extra double quote at the start of the command for the libc system function to work
10:10:20 -!- nfd has joined.
10:10:27  Are there any examples of using one language's package system to distribute packages for some other language?
10:11:01  Ugh, the idea of "a language's package system" is so bad in the first place.
10:11:11  I know right?
10:11:44  Time to give up on all software.
10:12:32 -!- nfd9001 has quit (Ping timeout: 245 seconds).
10:28:22 -!- arseniiv has joined.
10:36:56 -!- nfd9001 has joined.
10:38:18  shachaf: good. so when do we start the rebelion to destroy all thinking machines?
10:38:47 -!- nfd has quit (Ping timeout: 245 seconds).
10:41:28 -!- nfd has joined.
10:43:23 -!- nfd9001 has quit (Ping timeout: 245 seconds).
10:46:44 -!- nfd9001 has joined.
10:49:38 -!- nfd has quit (Ping timeout: 245 seconds).
10:50:53 -!- nfd has joined.
10:53:22 -!- nfd9001 has quit (Ping timeout: 245 seconds).
11:00:53 -!- nfd has quit (Ping timeout: 245 seconds).
11:00:57 -!- nfd9001 has joined.
11:05:27 -!- nfd has joined.
11:08:04 -!- nfd9001 has quit (Ping timeout: 268 seconds).
11:20:22 -!- nfd9001 has joined.
11:20:28 -!- nfd has quit (Ping timeout: 245 seconds).
11:26:37 -!- wob_jonas has quit (Remote host closed the connection).
11:28:28 -!- xkapastel has joined.
11:37:32 -!- nfd has joined.
11:40:03 -!- nfd9001 has quit (Ping timeout: 245 seconds).
11:51:14 -!- nfd has quit (Ping timeout: 268 seconds).
12:44:33 -!- Frater_EST has joined.
12:59:55 -!- Lykaina has quit (Quit: leaving).
13:18:13 -!- Melvar has quit (Ping timeout: 246 seconds).
13:27:45 -!- jglewd2641 has joined.
13:28:16 -!- jglewd2641 has quit (Remote host closed the connection).
13:31:58 -!- Melvar has joined.
14:41:14 -!- Frater_EST has left.
15:41:22  [[Echidna]]  https://esolangs.org/w/index.php?diff=65993&oldid=65992 * Lykaina * (+0) updating with newest interpreter link.
15:47:27  [[Talk:Binary to unary conversion]]  https://esolangs.org/w/index.php?diff=65994&oldid=65982 * CarlosLuna * (+399) Adding an Unary to binary (arbitrary precision) conversion algorithm
15:50:46  [[Drawkcab]]  https://esolangs.org/w/index.php?diff=65995&oldid=53052 * Gamer * (+82) 
15:51:19  [[Drawkcab]] M https://esolangs.org/w/index.php?diff=65996&oldid=65995 * Gamer * (+0) 
15:57:45  [[Drawkcab]]  https://esolangs.org/w/index.php?diff=65997&oldid=65996 * Gamer * (+59) 
15:59:07  [[Drawkcab]]  https://esolangs.org/w/index.php?diff=65998&oldid=65997 * Gamer * (+20) 
16:13:18  int-e: http://hackage.haskell.org/package/MonadPrompt-1.0.0.5/docs/Control-Monad-Prompt.html is making my brain hurt. Do you still have the solitaire game example? http://int-e.home.tlink.de/haskell/solitaire.tar.gz is broken.
16:14:06  http://paste.lisp.org/display/53766 is also broken
16:14:53  [[Drawkcab]]  https://esolangs.org/w/index.php?diff=65999&oldid=65998 * Gamer * (+284) /* Examples */
16:15:08  [[Drawkcab]]  https://esolangs.org/w/index.php?diff=66000&oldid=65999 * Gamer * (+6) /* drawkcaB 3 nohtyP */
16:15:27  [[Drawkcab]]  https://esolangs.org/w/index.php?diff=66001&oldid=66000 * Gamer * (+8) /* drawkcaB ++C */
16:15:34  cpressey: good question
16:16:10  [[Drawkcab]] M https://esolangs.org/w/index.php?diff=66002&oldid=66001 * Gamer * (+0) /* Concept */
16:17:20  No hurry, it will probably take me several weeks to wrap my head around this
16:18:40  cpressey: https://int-e.eu/~bf3/haskell/solitaire.tar.gz in full bit-rotted glory... (February 2008)
16:19:08  int-e: awesome, thank you very much
16:20:57 -!- Camto[m] has quit (Remote host closed the connection).
16:21:11 -!- ivzem[m] has quit (Remote host closed the connection).
16:21:11 -!- xylochoron[m] has quit (Read error: Connection reset by peer).
16:21:21 -!- wmww has quit (Read error: Connection reset by peer).
16:21:22 -!- tswett[m] has quit (Read error: Connection reset by peer).
16:26:43 -!- cpressey has quit (Quit: A la prochaine.).
16:32:45 -!- Camto[m] has joined.
16:34:17  @tell cpressey that was actually pretty painless to fix: https://int-e.eu/~bf3/haskell/solitaire-0.0.0.tar.gz
16:34:17  Consider it noted.
16:54:05 -!- tswett[m] has joined.
16:54:05 -!- xylochoron[m] has joined.
16:54:05 -!- wmww has joined.
16:54:13 -!- ivzem[m] has joined.
16:57:47 -!- FreeFull has joined.
17:04:51 -!- b_jonas has joined.
17:26:44  my hon. and learned friend fungot, what color of raisins do you prefer?
17:26:44  b_jonas: pick me, pick me!
17:26:58  fungot: I pick you
17:26:59  b_jonas: i'm a teenage male interested in programming who recently found out about it is hurting?
17:27:07  um
17:28:13 -!- xkapastel has quit (Quit: Connection closed for inactivity).
17:32:57  ^style
17:32: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 ukparl youtube
17:33:27  thought so, but where did fungot pick up such language...
17:33:27  int-e: i don't remember henna facepaint in wizard of earthsea.) define a macro in a standard latex command. well, the problem i'm having is at fnord
17:34:13  b_jonas: tbf you started with a trick question
17:35:09  b_jonas: Oh, when you address fungot as "my hon. and learned friend", that means you and fungot are both MPs, and fungot is also a lawyer, but not a member of the Privy Council. Is that right?
17:35:10  shachaf: catfive. better tack on the nationality and ethnicity in there as it is
17:55:44 -!- Sgeo has joined.
17:58:42 -!- Sgeo__ has quit (Ping timeout: 244 seconds).
18:32:31 -!- tromp_ has quit (Remote host closed the connection).
18:43:50  `? mothology
18:43:51  Mothology is the study of moths, myths, mouths, and mirths.
18:44:15  `? mythology
18:44:17  Mythology is the study of myths, moths and mirths.
18:44:18  `? myth
18:44:20  A myth is a female moth.
18:44:39  `? mother
18:44:40  `? moth
18:44:40  A mother is a person who practices mothology.
18:44:41  Moths are the main ingredient of mothballs.
18:44:47  `? method
18:44:49  A method is a tweaked out mothod.
18:45:14  `? month
18:45:16  Month is a misspelled Moth.
18:45:22  I didn't realize there were so many of these
18:46:38  `? mouth
18:46:39  mouth? ¯\(°​_o)/¯
18:46:48  A British moth?
18:47:00  `? mirth
18:47:01  Mirths are juvenile moths. They giggle a lot.
18:50:05  int-e: https://esolangs.org/logs/2007-07-03.html#lcl + #scheme  What about it is hurting?
18:51:09  Plus I think most likely some other sentence containing at least the fragment "-- out about it --"
19:13:51 -!- tromp has joined.
19:36:20  `? math
19:36:21  math? ¯\(°​_o)/¯
19:37:10  that’s reassuring
19:37:45  `? mint
19:37:47  mint? ¯\(°​_o)/¯
19:38:21 -!- ais523 has joined.
19:39:34  fungot, do you like lossy compression of music?
19:39:34  arseniiv: unless you need faster code. and given ironically ( or mockingly... i'm unsure) but thanks :)
19:40:05  fungot: and what about lossless one?
19:40:06  arseniiv: forces statement to be fnord
19:40:10  I do like lossy compression of music
19:41:57  b_jonas: how much losses you can stand?
19:42:14  arseniiv: five
19:44:50  I’m suspicious some people who were or are encoding music in mp3 don’t know how to do it good or do have a bad codec (is it a thing at all?), as then resulting file has a reasonable bitrate over 128 kbps or even over ~200 kbps but I hear artifacts
19:45:04  arseniiv: I do know how to do it
19:45:10  I even have my notes about which switches to give
19:45:37  it's a bit complicated because the software changed over the years, plus these days I can finally encode music to ogg instead of mp3
19:45:57  but the five is real, it's an argument to a certain switch that tends to give the right amount of compression 
19:45:58  I think someone even takes a file about 64 kbps and then “upscales” it. Poor universe
19:46:48  b_jonas: wait, what does five mean?
19:47:07  the trick is to test how much you can compress until you notice problems if you specifically look for them, then encode to significantly better quality than that
19:48:29  b_jonas: seems a good strategy, yes
19:48:33  arseniiv: ffmpeg -i "$infile" "${metadata[@]}" -vn -c:a libvorbis -q 5.0
19:48:42  the 5.0 is a quality parameter to that particular codec
19:49:01  I need different parameters depending on the software and the compression method and the quality switch obviously
19:49:01  ah, quality index, or how’s it called, I see
19:49:39  LAME also has an indexed set of variable rate qualities
19:50:17  arseniiv: yes, but I don't use LAME anymore
19:50:28  I just encode video and audio with ffmpeg
19:55:40  several times I encoded some music these days I took the quality associated with ~200 kbps, I think. Its index should be 1 or 2 perhaps. I read that even mp3 is sufficiently good on almost all sounds when at bitrates > 128 kbps, and formats like ogg you mentioned or some other new ones, fare even better, but my anecdotal evidence suggests that it’s not that simple (for mp3)
19:59:00  yes, 128 kbps is usually enough
20:02:04  also how do you think could sample rate mismatch between a file and the sound card, matter? I don’t see how it would but…
20:02:27  s/how/
20:06:18  resampling audio between two arbitrary sample rates is an interesting problem
20:06:51  there is a tradeoff between the amount of computation needed and the quality of the result
20:07:25  and probably between different types of distortions too
20:07:30  the difficulty is related to the least common multiple of the rates
20:07:52  obviously, the easiest case is when one rate is a multiple of the other
20:08:07  in general you want to interpolate to the LCM and then decimate to the output rate
20:08:23  and there are ways to do this with FIR filters that provably introduce minimum distortion
20:08:39  um
20:08:50  but what if the least common multiple is infinite, because the ratio is irrational?
20:08:52  however there are cases where the LCM rate would be prohibitively high
20:09:05  yeah, that
20:09:30  if your sample rate is not a rational number then you are doing something freaky
20:09:36  the LCM will always be finite, but it might be huge
20:09:37  um
20:09:40  why?
20:09:48  the sample rates are not dimensionless
20:09:56  i mean, why would you design a system where it's not
20:10:00  the dimension doesn't really matter
20:10:10  because there is a rational conversion factor between any two practical time units
20:10:15  they're in hertzes or gertzes depending on whether you're writing it in english or russian letters
20:10:26  if you measure time in pi-seconds or something then you deserve what's coming to you
20:10:43  you don't design such a system, people design two separate systems, each of them is reasonable, it's just conversion between them that isn't
20:11:01  can you give me an example please
20:11:01  they come around from spinning vinyl disks or whatever
20:11:03  where this has happened
20:11:13  I don't know, I don't do audio stuff, it's not my thing
20:11:26  are there any two time units in common use which do not have a rational conversion factor
20:11:28  but eventually it doesn't matter of course
20:11:44  because rational with prohibitively high LCM is basically the same problem
20:11:50  yeah
20:12:06  and you get between the two with some approximation in the rate
20:12:09  non-integer rates in Hz are common, for example NTSC framerate is 29.97 Hz for Historical Reasons™
20:12:13  and PAL is 25
20:12:20  (b_jonas: there’s no cyrillic letter g :P also in an old transliteration h was converted to г, like Helmholtz and Huygens are (still and hopefully forever) Гельмгольц and Гюйгенс)
20:12:28  but of course 29.97/25 is still rational
20:12:46  anyway
20:13:00  if the LCM is too big then you can do other things at the expense of introducing distortion
20:13:17  I forget exactly how
20:13:58  but you can interpolate to a smaller compromise value and then during decimation, interpolate that 'on the fly' using a small filter such as cubic interpolation, that only looks at a few sample points
20:14:19  to do it properly might require storing many millions of data points in your DSP filter state
20:14:20  apart from encoding music files to mp3 or ogg and chopping them timewise, all I did with audio is remove them from audio+video files when I re-encode the video
20:15:01  I wrote a fun script once to batch-convert my master music library (a mix of mostly flac and high quality mp3) to ogg vorbis for my portable music player
20:15:09  it would distribute the work across multiple machines
20:15:34  then I rewrote it in C# because I wanted to get a taste of what C# is like
20:15:35  it remains the only C# program I've written
20:16:25  (and it makes some sense for southern dialects where г is frequently a fricative [ɣ], not a plosive [ɡ] like in the normed dialect, and we could also for example take Ukrainian where г means [ɦ] outright and there’s a separate letter for plosive, ґ, AFAIR it’s used in rare contexts, but the transliteration of Hertz would be probably the same and it would be read more like the original name)
20:17:21  arseniiv: sure, it just becomes funny when you transliterate the russian names back to hungarian, and you get g instead of h and f instead of th
20:20:19  kmc: did you come to any conclusions about C#?
20:23:35  arseniiv: it seems like a fine language, like Java but less crippled, it's not terribly exciting but I wouldn't hate using it either
20:25:08  yesterday I remembered that I don’t like C# left switch statement syntax almost as it was in C and C++ (and Java?..) I have seen a syntax like switch (e) case (…) b case (…) b … else b (where b are blocks), this looks more comfortable in a language where low-level control flow inside switch doesn’t exist
20:25:51  b_jonas: ah, I agree
20:26:29  I saw something like that somewhere and it looks strange
20:30:03  anyway, I'm not actually an engineer, so I don't meet those unit of measure abbreviations
20:31:18  though I guess Hz does appear on end-user electronics like mobile phone chargers
20:32:23  but these days all those end-user electronics have magical solid state transformers that work with any of the voltage and frequency standards for mains electronics
20:32:49  correct
20:32:56  switch-mode power supplies
20:33:02  some of them will even run on DC input
20:33:11  though not to arbitrarily low voltage
20:33:18  SMPS are very interesting
20:34:06  simple and clever, but tricky to design well in practice
20:34:27  "~ 110–240 V 50/60 Hz" they all say, so you can use them with passive converters if you travel to anywhere
20:34:34  they basically do AC->DC->AC->DC
20:34:53  which sounds inefficient but if you do it right it's very efficient
20:35:06  isn't that because they transform to AC with much higher frequency?
20:35:30  it's still magic, I don't know how it can work
20:35:34  the middle AC frequency is on the order of 100-1000 kHz so they can use cheaper / lighter / smaller transformers
20:36:35  b_jonas: the very simple overview is that they alternately charge up an energy storage device (usually an inductor) and then discharge it into another storage device (usually a capacitor), which feeds the load
20:36:46  that makes sense, but then they have to create such a higher frequency AC too, and without too much energy loss
20:36:49  that alternation is controlled by semiconductor switches
20:37:11  (though actually, very old devices called "vibrators" worked on a similar principle, but mechanically!)
20:37:25  (used to transform 12V DC in a car into hundreds of V for vacuum tube radios)
20:37:33  and there's a feedback loop which controls the frequency and/or duty cycle of the switching
20:37:48  to maintain a certain output voltage regardless of the load
20:38:18  they can boost as well as reduce voltages
20:38:41  in fact you can build ones that can take any input voltage in a wide range, lower or higher or the same as the output
20:38:46  though it's more complicated
20:39:10  and then they do multiple possible output voltages, and negotiate them through USB
20:39:12  what I find really interesting are the similarities between a SMPS, a class-D amplifier, a delta-sigma DAC, and an active power factor correction circuit
20:39:15  yep
20:39:56  you can sort of think of a class-D (switching) amplifier as a SMPS whose output voltage varies over time, determined by the input signal
20:40:00  yes, the car charger ones take 12 V DC
20:40:21  USB-C-PD is neat. I have a single brick, not much bigger than a typical phone charging brick, that can charge both my phone and my laptop
20:40:24  that's handy for travel
20:41:12  I still use the larger dedicated laptop brick at home
20:41:26  there are some strange esoteric things you can do with USB-C
20:41:34  like plug two chargers into each other, or plug your laptop into itself
20:41:40  I don't charge laptop, but I can charge any of my low power devices (camera, mobile phone, spare mobile phone, music player, bluetooth headphone adapter) with the same charger 
20:41:50  cool
20:42:14  but they're all low power, unlike the laptop
20:42:25  laptop chargers actually heat up, that's harder
20:42:42  two chargers into each other? what does that do?
20:42:45  this brick is capable of 60W (3A @ 20V)
20:42:49  which is enough for the laptop to charge
20:42:50  do you mean with only one charger plugged into mains?
20:43:05  I think it requires 20V which is why most of my bricks won't charge it
20:43:11  the factory default charger is only 65W anyway
20:43:19  b_jonas: it produces mains out of the other one, obviously /s
20:43:31  no, that would be touch unsafe
20:43:34  I have a USB-C inline power meter too
20:43:35  which is neat
20:44:16  it tells the voltage, current, and direction of power
20:46:11 -!- Lord_of_Life has quit (Excess Flood).
20:46:30 -!- Lord_of_Life has joined.
20:47:26 -!- unlimiter has joined.
21:14:31 -!- Lord_of_Life has quit (Ping timeout: 244 seconds).
21:21:32 -!- Lykaina has joined.
21:21:40  hello Lykaina
21:21:57  updated the documentation pdf (again)
21:22:07 -!- Lord_of_Life has joined.
21:22:15  hi b_jonas 
21:22:45  kmc: interesting stuff. Now I know I don’t kow anything about contemporary electronics :D
21:22:57  s/kow/know
21:23:12  :)
21:23:16  it's complicated shit
21:23:41  yeah
21:23:43  I had that impression already, but not I’m aware I’m hopeless
21:23:58  arseniiv: I knew very little until 2-3 years ago
21:23:59  which explains why our company keeps hiring so many people who understand electronics enough to design and assemble it
21:24:40  and train engineer student interns in it too
21:24:55  one problem with SMPSes is that they (especially the cheap ones) tend to produce tons of radio frequency interference at frequencies which interfere with ham radio
21:25:09  based on this new, easier to read pdf, what is your opinion of Echidna? http://sif.lesidhetree.com/sara/echidna/spec_notes.pdf
21:25:11  making it harder and harder to operate HF from populated areas
21:25:56  they also produce RF on the output itself so some hams still swear by the old, huge, expensive, inefficient linear power supplies
21:26:00  kmc: but can't the power supplies shield that with some wires unless they're disassembled?
21:26:32  kmc: oh, unfortunate
21:27:16  a linear supply is much simpler. a transformer to drop ac voltage down to a bit above the target, a diode rectifier, and a linear regular which acts as a variable resistor in series with the load
21:27:22  and some smoothing caps
21:27:34  it's still a feedback system, but an analog continuous-time one
21:27:37  no switching
21:28:00  most ham gear comes with a 13.8V DC power input and you provide your own power supply
21:28:30  and some of the cheaper ones are made so badly that they draw measurable current from the mains even when they're not loaded
21:28:35  b_jonas: yes but that would cost an extra $0.0002
21:28:45  there shielding
21:29:05  I mean you need it for FCC certification but how many Chinese companies will actually care
21:29:14  plus the shielding isn't necessarily good enough for hams
21:29:22  who wants to pick up weak signals
21:29:41  much more stringent requirements than "don't interfere with my other consumer electronics"
21:29:55  yeah
21:30:25  I mean you need it for FCC certification but how many Chinese companies will actually care> would they hopefully decades later?
21:30:46  oops I forgot to copy all
21:30:55  it's like astronomers, who have to move their big telescopes to small research towns that have more stringent regulation for darkening curtains on houses than people had during world war II
21:31:20  I don't understand how they don't just trip and fall on the street at new moon there
21:31:29 -!- xkapastel has joined.
21:31:30  yep
21:31:50  I mean the human eye can do well in very low light if properly adjusti
21:31:55  b_jonas: flashlights and wax candles
21:31:57  adjusted
21:32:22  kmc: yes, that's why it's fine at full moon
21:32:30  even at half moon
21:32:46  but sometimes there's new moon, and then it's new moon everywhere on Earth
21:33:09  including in those places
21:33:14  neat
21:33:42  i guess i asked my question at the wrong time...
21:33:49  Lykaina: no
21:33:55  don't worry
21:34:02  I will look at that pdf eventually
21:34:02  (don’t mind me, I’m stalling in going to sleep)
21:34:32  I already decided that it's not so weird to have 4 addressing modes for most instructions, because you have so few instructions that the total is still well under 256 different opcodes
21:35:50  huh?
21:36:30  Lykaina: I complained a few days ago that it seemed strange that almost every operand to your instructions can be immediate, or so it seems from the pdf
21:36:50  and you have like a dozen two-operand instructions where that applies to both operands
21:37:14  Lykaina: my previous question about indirect loads still stands though
21:37:28  oh wait
21:37:36  Lykaina: maybe you don't logread? is that the problem?
21:37:53  what is logread?
21:38:33  read channel logs for what people said while you're not joined to the channel
21:38:45  has nothing to do with logarithms
21:40:02  b_jonas: maybe @tell, then?
21:42:17  btw I rely upon lambdabot usually, so if I should logread something, please remind me in that case too
21:43:15  b_jonas: what is indirect load?
21:44:00  Lykaina: load when the memory address of where you're loading from is not constant
21:44:23  although now with this later version of the pdf, it's getting unclear
21:44:31  does this thing allow self-modifying code?
21:44:44  i don't think so
21:45:33  then why does it say that subroutines are at "Range 0100-EFFF" of the "Memory"? is that in a code memory separate from the data memory that the arithmetic instructions operate on?
21:45:59  maybe I should look at the interpreter. does it have readable code?
21:46:15  typo. subroutines uses that memory space
21:46:47  so that's your data stack?
21:47:02  no wait
21:47:12  you can't have a stack, you don't have the right sort of instructions for them
21:47:23  it'd be hard to manipulate a stack without an indirect load
21:47:29  so that's why it's such a large area?
21:47:30  oh well
21:47:45  read the interpreter
21:47:48  or you can globally compile everything, find all the calls, and assign the local addresses that way
21:53:51  if i understand what you mean by indirect load correctly, i may be able to implement it by adding a third argument input type (as in other than @xxxx and =xxxx types)
21:54:29  oh, so.. the control instructions, as in N & -- O P Q _ - are all structured ones, there are no arbitrary gotos
21:54:32  interesting
21:55:08  Lykaina: as I read the spec right now, the L and M instructions are the only ones that can do an indirect load
21:55:21  well, except I don't understand what the S instruction does at all
21:55:47  reads the program
21:55:58  *from the
21:57:46  like if there's text in the program file
21:58:00  it reads it to memory
21:58:33  ok, that makes sense
22:00:57  if i make, say, a $xxxx in addition to =xxxx and @xxxx, where, as @xxxx is mem[value], $xxxx would be mem[mem[value]], would that help?
22:03:02  but which instructions would take which combinations of address modes? you'd have to tell that somewhere
22:03:37  if you want to have indirect addresing modes sort of everywhere, then I don't understand why you have a specific instruction for an indirect store
22:04:13  which is indirect store?
22:04:18  H
22:04:23  it also does ordinary store
22:06:33 -!- tromp has quit (Remote host closed the connection).
22:06:42  then it's not dedicated
22:07:03  it's dedicated because the other instructions, the arithmetic ones, can only store to a fixed address
22:07:08  but H can store indirectly
22:07:17  really?
22:07:18  and the logic instructions can load indirect if I understand correctly
22:07:31  but maybe I just misunderstand the spec
22:09:21  hmm wait
22:09:38 -!- arseniiv has quit (Ping timeout: 245 seconds).
22:09:46  i have an idea for rewriting memory addressing notation, would mean the samples would have to be rewritten too...
22:10:09  from the implementation it doesn't look like the L and M instructions can read from indirect addresses
22:10:13  what did I see in the spec then?
22:10:43  ah
22:11:04  I just didn't understand the descriptions of the L and M ops from the pdf because they're a bit unclear on what is their input and output
22:11:16  the interpreter makes it clear that they don't do indirect loads
22:11:39  but also that all the arithmetic instructions can do indirect stores
22:11:43  so I was wrong about that too
22:11:49  =xxxx is currently used to represent mem[xxxx] instead of xxxx in certain places
22:12:06  i'm seeing possible confusion
22:12:47  I dunno then
22:12:59  the current combo with no indirect load but lots of indirect stores is ... strange
22:13:13  I don't recall having seen such an instruction set
22:13:16  like H =xxxx =yyyy stores yyyy to mem[xxxx]
22:13:34  is that confusing?
22:13:53  Lykaina: no, it's not confusing about the H and the arithmetic instructions
22:14:02  but for your description of the logic instructions, it is confusing
22:14:11  the pdf doesn't tell what they read and write
22:14:17  unlike in the arithmetic instructions
22:14:50  look at page 1 for examples of L and M
22:18:02  does that help?
22:18:05  no
22:18:27  the implementation code does though
22:19:02  how would you recommend i change it?
22:19:52  the pdf, i mean
22:20:04 -!- ais523 has quit (Quit: quit).
22:20:19  in the pdf, where you describe the T operation, you see how there's an equals sign in it? mem[val0] is on the lhs of that, val1 and val2 are on the rhs. from that you can tell that the first operand is output only, the second and third are input only
22:20:43  it tells what that instruction does, what it stores to mem[val0]
22:21:10  try something like that for the L and M instructions
22:22:23  like "L bitwise_1bit: mem[val0] = (~val1 & val2 | val1 & val3)"
22:22:42  only of course swap around the stuff in it until it actually describes what the operation does
22:24:34  similarly like "M bitwise_2bit: mem[val0] = (val1 & val2 & -(0 != val & 8)) | val1 & ~val2 & -(0 != val & 4) | ~val1 & val2 & -(0 != val & 2) | ~val1 & ~val2 & -(0 != val &1)) but again swap around stuff until it matches your implementation
22:25:32  if it will help, i'm gonna change the {=,@} stuff to {=,@,$} where =xxxx is always literal value, @xxxx is always direct address, and $xxxx is always indirect address
22:26:04  if you don't want long formulas there, you can also write something like "M bitwise_2bit: mem[val0] = bitwise_2bit(val1, val2, val3)" and you explain elsewhere what the pure arithmetic part "bitwise_2bit" does, to at least maek it clear what is read from memory and what is written
22:26:47  Lykaina: might help, since that matches more how popular assembly syntax for cpus work
22:27:10  i like that approach. it's what i attempted to do originally
22:27:19  but you should also have somewhere in the pdf that makes it clear which instructions work with what combinatinos of addressing modes
22:30:01  thank you
22:30:03  it needn't be in the same table as the one that summarizes the ops
22:30:08  it could be a separate table
22:39:00  Lykaina: oh, and I also asked
22:39:13 -!- tromp has joined.
22:40:02  Lykaina: for the arithmetic instructions that do less-than compare, division, right shift, can you make it clear whether these are unsigned integer comparison, unsigned divsion, unsigned right shift? and is there a separate signed less-than comparison instruction?
22:43:35 -!- tromp has quit (Ping timeout: 250 seconds).
22:46:51  wait... the interpreter stores each of the 65536 words of the memory, logically 2 bytes sized each, in 4 bytes each?
22:46:54  why are you doing that?
22:47:08  or is this something I misunderstood in the pdf too, and they're actually 4 byte long?
22:47:28  it looks from the interpreter as if they were 4 bytes long
22:47:34  no wait
22:47:49  but wait
22:47:49  ...
22:47:58  hmm
22:48:25  this is confusing
22:48:39  I'd have to read the whole code to tell if you can store more than two bytes in a cell, thus breaking the abstraction
22:48:42  and I'm not willing to do that now
22:54:04  b_jonas: it's supposed to be 65536 cells, each 2 bytes in size.
22:54:17  then why don't you represent them that way too?
22:54:24  i don't?
22:54:33  it doesn't look like from the source code
22:55:11  they are "unsigned int". in C, is that not 2 bytes?
22:55:18  no
22:56:29  i always thought an int was 2 bytes, a long was 4 bytes...
22:56:56  no
22:57:11  if you want 2 bytes use uint16_t
22:57:48  j4cbo: it's not that simple, you have to be careful with the arithmetic because it will promote to int and do a signed shift
22:57:51  C is ugly
22:58:07  you may need explicit casts or such things
22:58:09  yeah arithmetic is tricky
22:58:18  arithmetic in *C* is tricky
22:58:31  this is a complication by C rules
22:58:38  Lykaina: the C standard doesn’t place many constraints on how big exactly int, long, etc are
22:59:54  often on modern computers short is 2, int is 4, long is 8 but that is NOT guaranteed
23:00:08  j4cbo: if I subtract an unsigned int from a signed long, what type is the result?
23:00:41  i'll change it to a short
23:00:51  instead of an int
23:00:52  Lykaina: no
23:01:13  if you want 2 bytes, write int16_t or uint16_t
23:01:22  b_jonas: what's your take?
23:01:42  Lykaina: again, it's not that simple, if you do that, you'll also have to change some of the code for the arithmetic instrs too
23:01:49  b_jonas: I know the right answer is “read the spec” :P
23:02:15  I think the current version gets more of them right than if you just change all the types to a short
23:03:17  j4cbo: I'm still a bit shocked about how (a) 0<1 has a different type in C++ than in C, yet the difference in type is _almost_ never detectable in code that you can write in both C and C++
23:04:15  and it's a pity, because apart from that stupid change, the C++ rules are usually IMO better than the C rules
23:05:07  and it's possible that that change is for the better too, I'm just not quite convinced that it's worth
23:06:47  Lykaina: anyway, I think first you should decide how you want the less-than, division and right-shift operations behave, then be careful that the code for those and for the subtraction implements them correctly
23:07:46  unsigned, integer division
23:08:02  no floats
23:10:39 <\oren\> x-=-1
23:11:09  \oren\: ah yes, secret operators
23:13:04  does that even compile?
23:13:11  x-=-1 ?
23:13:57  i know it has to be "x -= -1"
23:14:20  and what does that do?
23:14:30  don’t forget the “goes to” operator: while (x --> 0) { ... }
23:15:01  x=x - -1
23:16:09  whoever invented lambda operations is a sadist
23:16:09 <\oren\> the  -=- operator is the same as the += operator
23:17:12  clearly
23:17:18 <\oren\> the +=- operator is the same as the -= operator
23:17:41  why make them?
23:21:59  \oren\: not quite, sadly
23:22:09  not in C that is
23:22:12  overflow rules
23:23:35  += is better than -=-
23:29:24 <\oren\> oh, when the right operand is MAX_INT?
23:32:15 -!- tromp has joined.
23:34:07  https://www.zentut.com/c-tutorial/c-integer/
23:36:50 -!- tromp has quit (Ping timeout: 252 seconds).
23:41:03 -!- unlimiter has quit (Quit: WeeChat 2.5).
23:48:17 -!- Saggytarius has joined.
23:54:11 -!- Saggytarius has quit (Ping timeout: 260 seconds).

2019-09-07:

00:10:30  [[Echidna]]  https://esolangs.org/w/index.php?diff=66003&oldid=65993 * Lykaina * (+0) updating with newest interpreter link.
00:12:21  made changes to both interpreter and spec_notes file
00:12:54  Lykaina: too late today, but warn me later to look at them
00:13:06  s/warn/remind/
00:13:12  k
00:15:14 -!- unlimiter has joined.
00:17:24  i hope page 3 of the pdf is helpful
00:18:30  it's also known as "Never ask me do to documentation for something that matters."
00:21:11 -!- xkapastel has quit (Quit: Connection closed for inactivity).
00:32:05  The TUTOR language has 150 variables, named v1 through v150, which can be assigned names.
00:32:12  I just... *blink*
00:32:43  hi Sgeo
00:32:50  That seems like enough?
00:33:01  You only needs two anyway.
00:33:21  Hi Lykaina 
00:36:28  `` ls tmp
00:36:29  a.c \ a.out \ compiled_brachylog.pl \ input.brachylog \ jeval.whatis \ out \ OUT \ out.a \ out.a.hd \ out.a.xxd \ paste \ spline \ spout \ spout.raw \ tmp.txt
00:36:32  `` tmp/out.a
00:36:33  finally
00:36:39  tg
00:36:42  `` file tmp/out.a
00:36:43  tmp/out.a: ELF 64-bit LSB shared object, x86-64, version 1 (SYSV), dynamically linked, not stripped
01:00:07 -!- tromp has joined.
01:02:16 -!- unlimiter has quit (Quit: WeeChat 2.5).
01:05:27 -!- tromp has quit (Ping timeout: 264 seconds).
01:29:30 -!- unlimiter has joined.
02:12:52  `url tmp/out.a.hd
02:12:53  https://hack.esolangs.org/tmp/out.a.hd
02:15:33  Someone over at ##c wanted `a || b` on pointer-typed operands to yield the first non-null value, instead of 0 or 1.
02:17:13 -!- unlimiter has quit (Quit: WeeChat 2.5).
02:17:31  Speaking of the amd64 System V ABI, I'm still kind of confused about %rdx.
02:18:54  You're supposed to register it with atexit, when you're using the ELF interpreter with dynamic linking.
02:19:21  But I seem to get 0 in that register even in that case?
02:20:49  I guess it might be that the system may or may not provide it? Though that's not what the spec says.
02:21:00  But how are you supposed to know?
02:21:14  Well, if it's null presumably you don't need to register it.
02:21:17  Maybe you just check for 0, but I don't like that. What if it's initialized to something else?
02:21:53  By "may or may not provide" I meant it'd always set it to 0 if it doesn't need you to register anything.
02:22:13  Well, it would be nice if any standard specified that.
02:22:16  But that's just something that could make sense, I don't have any proof for that.
02:22:22  What does BA_OS mean anyway? 
02:22:40  Good question.
02:23:02  Base System
02:23:36  Yes, apparently they are sections of the System V Interface Definition.
02:23:39  See https://stackoverflow.com/questions/37419635/in-the-elf-spec-what-does-ba-os-and-ke-os-mean and the linked PDF.
02:23:43  Which presumably you already found.
02:26:43  Maybe I should just look at what crt.o does.
02:26:49  Unfortunately it's all such a mess.
02:28:15  That's what all software is. I'm always surprised it works as often as it does.
02:28:56  I've been writing Go recreationally lately.
02:29:07  `` echo >/tmp/test.s $'.text; .globl _start; _start: mov $60, %rax; mov $123, %rdi; syscall'; as -o /tmp/test.o /tmp/test.s && ld -dynamic-linker /lib64/ld-linx-x86-64.so.2 -o /tmp/test /tmp/test.o && /tmp/test; echo $?; file /tmp/test
02:29:08  123 \ /tmp/test: ELF 64-bit LSB executable, x86-64, version 1 (SYSV), statically linked, not stripped
02:29:34  What's the flag to give to ld to make that dynamically linked?
02:30:33  I don't remember, ld is awkward to use directly. It's not -shared, because that's what creates shared objects.
02:30:48  -Bdynamic? 
02:30:58  I tried that and it was still static.
02:31:12  I guess -lc works but that does rather a lot more than I want here.
02:31:46  Also this is pointless because I don't know how to output the value of %rdx in HackEso.
02:31:54  I'd use gdb locally.
02:32:38  I mean, you don't need all the bits just to see if it's zero or not.
02:32:45  You did just output the value 123 there.
02:32:45  That's true. That was my plan.
02:32:54  I think it'll be 0.
02:33:18  Maybe it needs to have a some NEEDED entries to not count as "statically linked" for file.
02:33:47  `` file /bin/ls
02:33:48  ​/bin/ls: ELF 64-bit LSB shared object, x86-64, version 1 (SYSV), dynamically linked, interpreter /lib64/ld-linux-x86-64.so.2, for GNU/Linux 2.6.32, BuildID[sha1]=3c233e12c466a83aa9b2094b07dbfaa5bd10eccd, stripped
02:34:01  If it was dynamically linked I think it'd say "shared object" instead of "executable".
02:34:46  It would at least name the interpreter.
02:36:59  Oh, right, execve can tell you ENOENT when the interpreter isn't found.
02:37:31  `` echo >/tmp/test.s $'.text; .globl _start; _start: mov $60, %rax; mov $123, %rdi; syscall'; as -o /tmp/test.o /tmp/test.s && ld -dynamic-linker /lib64/ld-linux-x86-64.so.2 -o /tmp/test /tmp/test.o -lc && /tmp/test; echo $?; file /tmp/test
02:37:32  123 \ /tmp/test: ELF 64-bit LSB executable, x86-64, version 1 (SYSV), dynamically linked, interpreter /lib64/ld-linux-x86-64.so.2, not stripped
02:38:39  Right. I guess ld might just not be willing to make a dynamically linked thing without any libraries.
02:39:39  Probably something unknowable to mortals involving linker scripts.
02:40:23  `` echo >/tmp/test.s $'.text; .globl _start; _start: mov $100, %rdi; test %rdx, %rdx; jz e; mov $105, %rdi; e: mov $60, %rax; syscall'; as -o /tmp/test.o /tmp/test.s && ld -dynamic-linker /lib64/ld-linux-x86-64.so.2 -o /tmp/test /tmp/test.o -lc && /tmp/test; echo $?
02:40:25  105
02:40:48  Uh oh. Is that saying that rdx is nonzero?
02:40:56  That's what it sounded like.
02:41:01  Wait, I'm starting to remember this. There was something complicated here.
02:41:24  `` echo >/tmp/test.s $'.text; .globl _start; _start: call %rdx; mov $60, %rax; mov $123, %rdi; syscall'; as -o /tmp/test.o /tmp/test.s && ld -dynamic-linker /lib64/ld-linux-x86-64.so.2 -o /tmp/test /tmp/test.o -lc && /tmp/test; echo $?
02:41:25  ​/tmp/test.s: Assembler messages: \ /tmp/test.s:1: Warning: indirect call without `*' \ 123
02:41:35  Hmm.
02:41:43  So now I'm not sure what issue I ran into.
02:41:49  But there was definitely something.
02:43:26 -!- aloril_ has quit (Ping timeout: 258 seconds).
02:45:00  `` echo >/tmp/test.s $'.text; .globl _start; _start: push %rdx; mov $1, %edi; mov %rsp, %rsi; mov $8, %edx; mov $1, %eax; syscall; mov $60, %eax; syscall'; as -o /tmp/test.o /tmp/test.s && ld -dynamic-linker /lib64/ld-linux-x86-64.so.2 -o /tmp/test /tmp/test.o -lc && /tmp/test | hd
02:45:02  000000 a0 fb 00 40 00 00 00 00                          >...@....< \ 000008
02:45:04  OK, I was testing this with musl libc where it doesn't work so well.
02:45:06  Looks nonzero to me.
02:45:45  0x4000fba0 might be a plausible pointer as well, maybe? 
02:45:48  `cat /proc/self/maps
02:45:48  00100000-00102000 r-xp 00000000 00:00 0  \ 40000000-40023000 r-xp 00000000 00:0f 1336451                            /lib/x86_64-linux-gnu/ld-2.24.so \ 40023000-40025000 rw-p 00000000 00:00 0  \ 40025000-401c1000 r--p 00000000 00:0d 1440239                            /usr/lib/locale/locale-archive \ 401c1000-401e3000 rw-p 00000000 00:00 0  \ 40223000-40224000 r--p 00023000 00:0f 1336451                            /lib/x86_64-linux-gnu/ld-2.24.so \ 40224000-
02:46:33  I mean, I called it in the program above, so it's certainly a plausible function pointer.
02:48:16 -!- tromp has joined.
02:48:57  OK, this is interesting. I remember now.
02:49:21  musl's ELF interpreter is passing _start's address in %rdx.
02:50:54  And now I see I had a comment saying this in my ELF generator program.
02:52:16  `` echo >/tmp/test.s $'.global _start; _start: mov $1, %eax'; as -o /tmp/test.o /tmp/test.s && ld --oformat=binary -o /tmp/test /tmp/test.o && wc -c /tmp/test
02:52:18  5 /tmp/test
02:52:20  `` echo >/tmp/test.s $'.global _start; _start: mov $1, %rax'; as -o /tmp/test.o /tmp/test.s && ld --oformat=binary -o /tmp/test /tmp/test.o && wc -c /tmp/test
02:52:21  7 /tmp/test
02:52:31  Just as an aside.
02:52:51 -!- tromp has quit (Ping timeout: 264 seconds).
02:54:12  You're commenting on my "mov $60, %rax" and so on?
02:54:50  Well, not really "commenting on", but related to.
02:54:51  It's true that I almost ran up against HackEso's time and memory limits with those extra bytes.
02:54:56  But it's true.
02:55:17  I was going to use cmp %rdx, $0 but I thought people would make fun of me.
02:55:26  So I used test %rdx, %rdx instead.
02:55:56  Sadly it was too late.
02:59:32  I have a thing that does a thing every few hours or so. I'd like to know if it starts failing to do the thing. I added Prometheus counters for total things and failed things, but I'm a little afraid the natural timescale of Prometheus is not well suited to that. (I'm sure it *can* work, but still.)
02:59:35 -!- aloril has joined.
03:02:11  (I don't want to make it do the thing more often, because it does the thing to someone else's thing, and anyway it doesn't need to because usually it's just the same thing.)
03:04:00  Hmm, what's the issue here?
03:05:58  I thought there should be made Magic: the Gathering card named "Leper Window", but am unsure what it should be.
03:06:20  either a M:tG card or a band
03:06:39  hi kmc
03:06:58  are you in for scrapping all existing software
03:07:02  I guess it isn't really an issue, it just feels wrong to sample the thing every minute or every five minutes because it's almost never changing, and then there's a lot of samples. But from what I recall, Prometheus can't really do sparse sampling.
03:07:44  shachaf: meh
03:08:12  except for sdr of course
03:09:48  fungot: How do you feel about getting scrapped?
03:09:49  fizzie: know of any
03:10:18  fungot: Anyone who got scrapped? No, not really.
03:10:18  fizzie: my favourite fractal is still cantor's dust :) i was just requesting a heap of muck. but some.
03:12:02  kmc: how do you feel about scrapping all non-kittens
03:12:22  You can make up a band called that too, maybe.
03:12:27  i was telling the miri folks about how i want to make a kitten maximizer
03:12:41  some of them seem nervous about the idea
03:14:46  fixed the Echidna documentation
03:14:58  for now
03:15:22  clarified pg 3
03:21:16  shachaf: how about an everything minimizer
03:25:44  no hth
03:26:51  only things beginning with the letter n
03:27:06  or was that a maximizer?
03:27:49  https://english.lem.pl/works/novels/the-cyberiad/146-how-the-world-was-saved
03:49:39 -!- Spexty has joined.
03:54:03 -!- Spexty has quit (Ping timeout: 260 seconds).
04:03:45  The "arrow" command in TUTOR is weirdly named. It doesn't just drawn an arrow
04:29:28  What does the "arrow" command in TUTOR mean, then?
04:36:29 -!- adu has joined.
04:36:53 -!- tromp has joined.
04:41:05 -!- tromp has quit (Ping timeout: 250 seconds).
04:55:42  It prompts the student for input, and enters a judging mode for commands like answer or wrong to pattern match against the input. I think
04:56:14  "A judging block in TUTOR is a control structure that begins with an arrow command and ends with the next arrow, endarrow or unit command. The arrow command also prompts for input, with the special arrow character (resembling "▷") displayed as a prompt at the indicated screen coordinates. In effect, a judging block can be thought of as a backtracking control structure where the student may make multiple attempts to answer a question unti
04:56:14  l a correct answer allows forward progress."
04:56:31  https://en.wikipedia.org/wiki/TUTOR_(programming_language)
06:10:42 -!- tromp has joined.
06:12:22 -!- tromp_ has joined.
06:14:02  [[GolfJoke]] M https://esolangs.org/w/index.php?diff=66004&oldid=54460 * A * (+734) 
06:15:55 -!- tromp has quit (Ping timeout: 276 seconds).
06:16:51 -!- tromp_ has quit (Ping timeout: 264 seconds).
06:19:08  [[GolfJoke]] M https://esolangs.org/w/index.php?diff=66005&oldid=66004 * A * (-735) 
06:19:54  [[GolfJoke]] M https://esolangs.org/w/index.php?diff=66006&oldid=66005 * A * (+12) 
06:31:34  fizzie: So here's the entry point call in musl: https://github.com/ifduyue/musl/blob/master/ldso/dynlink.c#L1742
06:31:59  Apparently it just uses an automatically-selecte register, so with one version I was getting the entry point in rdx and in another version I was getting it in rax (and rdx was 0).
06:32:21  So I feel like something is wrong here because it's obviously not passing something in in rdx.
06:32:41  (Also I mean entry point jump, not call, of course.)
06:39:17 -!- tromp has joined.
06:58:24  Should rodata be mapped -x?
06:58:36  I wonder how likely it is to contain ROP gadgets or that sort of thing.
07:02:48  ro ro ro your data
07:02:59  is there a good reason why it should be +x?
07:03:00  besides fun
07:05:58  -0.2 rounds to 0 in TUTOR's conditional statements that compare an expression and have different branches for negative, zero, and individual positive numbers
07:06:38  I don't think so?
07:06:53  You can load it in one segment rather than two.
07:07:13  The Go compiler generates three load segments, r, rx, rw
07:07:22  Whereas gcc/clang generate only rx and rw.
07:18:18  [[GolfSpace]] N https://esolangs.org/w/index.php?oldid=66007 * A * (+361) Created page with "[[GolfSpace]] is a joke esolang inspired by [[Golf Cheat]] and [[GolfJoke]]. It is essentially [[GolfJoke]], except the question number is encoded as backspaces and Deletes as..."
07:35:20  whoa whoa whoa
07:35:31  Apparently they expanded on "Assembled a contraption".
07:35:37  Maybe I knew about that? I don't remember.
07:36:45 -!- arseniiv has joined.
08:19:43 -!- adu has quit (Quit: adu).
08:23:47  [[Slindow]] N https://esolangs.org/w/index.php?oldid=66008 * A * (+174) Created page with "[[Slindow]] is an [[esoteric programming language]] that makes it easy to solve sliding-window challenges. [[Category:Languages]] [[Category:2019]] [[Category:Unimplemented]]"
08:26:21  [[Slindow]] M https://esolangs.org/w/index.php?diff=66009&oldid=66008 * A * (+386) 
08:30:24  [[Slindow]] M https://esolangs.org/w/index.php?diff=66010&oldid=66009 * A * (+350) 
08:31:10  thoughts on wget2?
08:44:45  What's that?
08:48:23 -!- Lord_of_Life has quit (Ping timeout: 245 seconds).
08:50:15 -!- Lord_of_Life has joined.
08:58:36  [[$]]  https://esolangs.org/w/index.php?diff=66011&oldid=58729 * Rdebath * (+67) Turing
09:11:40  [[Slindow]] M https://esolangs.org/w/index.php?diff=66012&oldid=66010 * A * (+656) 
09:17:29  [[Slindow]] M https://esolangs.org/w/index.php?diff=66013&oldid=66012 * A * (+14) /* Built-ins */
09:35:17  had a dream jessie and james finally captured pikachu, but james was sucked into the pokball as well
09:39:55  jessie wasn't sure whether to keep pikachu or free her boyfriend james.
09:43:20  as pikachu would likely escape
10:07:54  shachaf: yes, but only in silver-bordered land. it's one of MaRo's worse ideas to give meaning to it.
10:21:01  hi b_jonas
10:21:30  working on an update to doc and code
10:21:52  i'll let you know when finished
10:57:02  [[Echidna]]  https://esolangs.org/w/index.php?diff=66014&oldid=66003 * Lykaina * (+0) updating with newest interpreter link.
10:57:32  b_jonas: updated
12:36:10 -!- Spexty has joined.
12:55:27 -!- Frater_EST has joined.
12:55:32 -!- Frater_EST has left.
14:36:32 -!- xkapastel has joined.
14:40:15  what is the history of lenses (Haskell ones)?
14:40:38 -!- Sgeo_ has joined.
14:42:49 -!- Sgeo has quit (Ping timeout: 246 seconds).
14:49:54  updated documentation pdf for Echidna
14:57:37  [[Echidna]]  https://esolangs.org/w/index.php?diff=66015&oldid=66014 * Lykaina * (-8) fixing first line
15:08:01  hi Sgeo_ 
15:16:19  might as well move Echidna from Dropbox to Git
15:18:11 -!- ArthurStrong has joined.
15:18:36 -!- Melvar has quit (Ping timeout: 258 seconds).
15:22:46  so what do people wanna talk about lol
15:23:39  Echidna, mother of all monsters?
15:23:53  idk anything about echidna lol
15:24:12  should I check it out?
15:24:31  Echidna is my esolang
15:24:42  well should I check it out lol
15:25:31  sure. it's still a work in progress, though
15:25:51  ok
15:27:51  and i'm working on moving it to a bitbucket repo
15:28:30  to make it easier for me
15:28:48  currently hosted on my webserver
15:32:11  yeah
15:34:13  seems like a neat language
15:34:28 -!- Melvar has joined.
15:41:21 -!- ArthurStrong has quit (Remote host closed the connection).
16:15:34  Sgeo_: you active?
16:19:58  we might as well be the only "kind of active" people here lol
16:22:59  Spexty: fungot is always active, it’s usually just not noticeable
16:23:00  arseniiv: and i don't think it's true that it turns 110 into 111 and vice versa?
16:23:15  i need help from someone i already know i can trust. I knew Sgeo_ in rl, nobody else here qualifies for that as far as I know.
16:25:52  as for Echidna...did i do this right? https://bitbucket.org/lykaina/echidna/
16:26:27 -!- sebbu has quit (Ping timeout: 258 seconds).
16:29:56  can someone tell me if i did the repo properly?
16:34:21  great...
16:34:38  idk anything about bitbucket sry
16:34:49  does it look good
16:35:09  what do you mean
16:35:13  is it missing anything on visual inspection
16:35:24  don't think so
16:35:56  bitbucket is a competitor to github
16:36:07  that's pretty much it
16:38:08  i don't like using microsoft products when i don't have to
16:42:41  and bitbucket is owned by atlassian, so i have the free version of jira as well
16:42:49  I think if you need a version control, there is Fossil
16:43:33  i've been using bitbucket for years
16:43:34  Atlassian is odd.
16:43:45  how so?
16:44:33  I've gone through the procedure of deleting my account once. Which is when I learned that I had *two* accounts, one bitbucket account and one general Atlassian account in the background that I was unaware of before...
16:46:05  And IIRC the process meant that I had a third account in their issue tracker.
16:46:21  This abundance of service specific accounts is what I found odd.
16:46:30  oh
16:46:39  yeah, that's weird
16:46:50  (all linked via the atlassian account, of course)
16:47:56  The best part was the final email that said that my account was not deleted... and that I please not reply to the email because that would re-create an issue tracking account.
16:48:28  does the repo i linked to look okay?
16:48:56  and does Fossil have issue tracking?
16:49:07  Yes, Fossil has issue tracking
16:49:14  link?
16:50:54  it's a git host, right?
16:51:21  No, it is a different system from git (and less confusing, in my opinion and some other people's opinion too)
16:51:37  Lykaina: well it wants me to log in with Atlassian, so nothing to be seen there
16:51:52  i pulled it off
16:52:07  i'll check out github in a minute
16:53:10  Lykaina: that may be a repo setting though
16:53:28 * int-e shrugs
17:02:58  Lykaina: BTW I’m always confused about my git repos so I can’t help, sorry
17:08:19  https://github.com/lykaina/echidna
17:11:28 -!- sebbu has joined.
17:21:18  int-e: like this one?
17:23:54  looks like a normal github repo to me
17:24:18 -!- grumble has quit (Quit: Martini. Gin, not vodka. Obviously. Stirred for 10 seconds while glancing at an unopened bottle of vermouth.).
17:24:20  is that good?
17:26:11  I was trying to be neutral. (I'm torn about github. I use it a lot, so I'm familiar with it. I dislike the fact that it was acquired by Microsoft, but not enough to actually switch to a different provider.)
17:27:01  is it good for hosting an esolang?
17:27:30  There are quite a few esolang related github repos.
17:28:14  It's servicable.
17:28:38  (To use a less controversial categorization than good vs. bad.)
17:29:08  yeah, if an esolang isn't on the esolangs wiki, it's probably on github
17:29:16  somewhere
17:29:17  lol
17:29:22  If they do not require you to change all of your accounts to Microsoft accounts, then I do not know why that would be the reason to avoid it. (I do not use GitHub for my own projects, although that has nothing to do with Microsoft, and is because I prefer Fossil and I think git is confusing)
17:29:26 -!- grumble has joined.
17:33:33  [[Echidna]]  https://esolangs.org/w/index.php?diff=66016&oldid=66015 * Lykaina * (-59) linking to my github instead of my webhost.
17:51:03  b_jonas: I tried to figure out what you meant, since even in un-sets the lands aren't silver-bordered.
17:51:12  But then I reparsed it.
17:51:26  The basic lands anyways aren't silver border
17:56:30  Oh, that's true. Maybe there are unbasic lands.
17:57:07  Do you make up some more Magic: the Gathering cards today?
17:57:29 -!- polomukuyu has joined.
17:57:53  No.
17:58:04  OK
17:58:04  I tried to make up a different game but didn't get very far yet.
17:59:30  What different game is that?
18:00:09  oh-gi-yu?
18:00:57  (said it backwards as not to swear)\
18:00:57  yu-gi-oh lol
18:01:06  you don't wanna swear? damn
18:02:05  everyone hates yu-gi-oh at my lgs
18:02:23  shachaf: I was talking about assembling contraptions, not about basic lands
18:02:28  oh
18:02:32  I know.
18:02:34  "silver-bordered land" right
18:02:44  yes, M:tG is full of ambiguous words
18:03:41  but yes, there are non-basic silver-bordered lands, including that one that makes one and a half mana of any color, which got way overpowered since mana burn got eliminated
18:04:01  I think it's called City of Ass
18:05:06  I think Contraptions do not have the same border as other cards
18:05:44  yes, they're stupid borderless cards
18:06:18  Germany has 16 states. The German name is "Land".
18:06:42  If you're playing a limited game with 40-card decks, 16 is a natural number of lands to put in it (though 17 is probably better in practice).
18:09:02  hi b_jonas 
18:14:01  Mathematical Study {2U} Enchantment ;; {1}, {T}: Chose a number and then reveal the top card of target player's library. If it is a nonland card with converted mana cost equal to the chosen number, add one mana of any color to your mana pool and then you may cast that card. This ability can be used only during your own main phase. ;; Echo {1}
18:23:55  b_jonas: https://github.com/lykaina/echidna
18:24:18  i think you said to remind you
18:30:15  Noon Mark {1} Artifact ;; {T}, Sacrifice ~: Add one mana of any color. Can't be used during combat phase. ;; {2}, {T}, Sacrifice ~: Draw a card
18:30:26  What is your comment of these made up cards?
18:34:45 -!- polomukuyu has quit (Remote host closed the connection).
18:47:20  `card-by-name Mind Stone
18:47:21  Mind Stone \ 2 \ Artifact \ {T}: Add {C}. \ {1}, {T}, Sacrifice Mind Stone: Draw a card. \ WL-C, 10E-U, C14-U, C15-U, IMA-C, DD2-U, DDP-U
18:47:35  hmm
18:49:38  zzo38: Noon Mark => I can't judge that one, it needs an experienced M:tG developer to tell if it's overpowered, it's the so4rt that can be either broken or useless as far as I know
18:51:05  Mathematical Study => at least make it "Activate this ability only any time you could cast a sorcery." unless you have a good reason to want to allow it activated in the controller's main phase but with non-empty stack
18:52:02  but after that, I don't think I like the main function of allowing to cast a card from another player's library. it's something that probably has to exist but be so rare that I never meet them
18:52:26  and I don't know if it's even right to have it as blue rather than red
18:52:31  it'll be confusing if it's a creature
18:52:49  or other permanent
18:53:16  int-e: I don't think so. then you'll just control a creature owned by the opponent, which is normal as far as blue goes
18:53:43  but normal in red too, and I don't know which color this one has to be
18:53:57  I think it's more confusing while it's on the stack
18:54:31  because owning a different player's spell on stack can happen, but it's very rare
18:57:14 -!- imode has joined.
18:58:19  although I'm not sure why black doesn't get any creature stealing
18:58:26  or do they get some?
18:58:55  b_jonas: may i pm you?
18:58:58  `card-by-name Enslave
18:58:59  Enslave \ 4BB \ Enchantment -- Aura \ Enchant creature \ You control enchanted creature. \ At the beginning of your upkeep, enchanted creature deals 1 damage to its owner. \ PLC-U, NPH-U, DDD-U \  \ Enslaved Dwarf \ R \ Creature -- Dwarf \ 1/1 \ {R}, Sacrifice Enslaved Dwarf: Target black creature gets +1/+0 and gains first strike until end of turn. \ TOR-C \  \ Enslaved Horror \ 3B \ Creature -- Horror \ 4/4 \ When Enslaved Horror enters the battlefield, 
18:59:11  Lykaina: you can pm, but it won't make me look at the interpreter faster
18:59:20  oh
18:59:24  `card-by-name Mark of the Oni
18:59:25  Mark of the Oni \ 2B \ Enchantment -- Aura \ Enchant creature \ You control enchanted creature. \ At the beginning of the end step, if you control no Demons, sacrifice Mark of the Oni. \ BOK-U
18:59:30  you weren't responding
18:59:33  sorry
18:59:45  I will look at the interpreter, I'm curious now
19:00:11  so black does get a few
19:03:24  in the current OotS story arc, if Durkon was broken while petrified, how difficult would it have been to fix it? could they have found a cleric that can fix him with a Make Whole spell?
19:03:47  I can't tell if the Make Whole spell works for that, and if not, how else you repair a broken statue before reanimating
19:06:49 -!- MDude has quit (Ping timeout: 276 seconds).
19:16:09 -!- Melvar has quit (Ping timeout: 244 seconds).
19:16:52 -!- xkapastel has quit (Quit: Connection closed for inactivity).
19:29:46 -!- Melvar has joined.
19:36:19 -!- xkapastel has joined.
19:43:53  Lykaina: how does the subroutine memory work? the documentation doesn't really explain it. 
19:44:13  Lykaina: apparently the if/while blocks have labels. what happens when you don't nest them properly? is that allowed?
19:52:31  Lykaina: it probably doesn't matter while you only have one source file, but why do you define the global variables in the .h header file?
19:58:49  Land Competence {-} Conspiracy ;; At the beginning of your upkeep, you may change the text of target permanent you own by replacing all instances of one land type word with another until end of turn.
20:06:39  Lykaina: also I find it strange how you keep seeking the program source code at every instruction
20:10:12 -!- LBPHacker has changed nick to LBPHacker_.
20:19:54 -!- imode has quit (Ping timeout: 268 seconds).
20:24:37  Lykaina: also, I think srand((unsigned ing)(clock()%65536)); is sort of a bad idea, but that only matters if you use the random state later
20:27:30  Lykaina: whoa, the findand function is even worse. it will search for the function all around the program, and seek five times for every byte of the program until the start of the subroutine
20:27:39  that really seems excessive
20:33:03 -!- LBPHacker_ has changed nick to LBPHacker.
20:33:27  why don't you just read the whole program at the start, find all the subroutine labels, store them and their offsets in the program, sort them, and look up the label in the sorted table on subroutine calls?
20:33:52  and then read instructions from the copy of the program that is loaded in memory, rather than fseek before every instruction
20:37:58  Yes, I should think that would be better
20:44:14  oh yeah, good idea. Lykaina: ask zzo38, he writes C programs in a style that's alien to me but may be closer to the style that you wrote here
20:44:23  zzo38: look at the interpreteR?
20:44:46  it's in the git repository at https://github.com/lykaina/echidna
20:45:45  OK, I will look
20:47:38 -!- Lord_of_Life_ has joined.
20:47:38 -!- Lord_of_Life_ has quit (Max SendQ exceeded).
20:48:42 -!- Lord_of_Life_ has joined.
20:48:43 -!- Lord_of_Life_ has quit (Max SendQ exceeded).
20:49:13  Probably it would be better to instead read the file into memory and convert into a binary code while reading it, so that it can skip comments and so on. Many other things are also rather inefficient 
20:49:19 -!- Lord_of_Life_ has joined.
20:49:20 -!- Lord_of_Life_ has quit (Max SendQ exceeded).
20:49:53  zzo38: perhaps, but the S instruction makes that a bit hard
20:50:02 -!- Lord_of_Life has quit (Ping timeout: 245 seconds).
20:50:16 -!- Lord_of_Life has joined.
20:50:17 -!- Lord_of_Life has quit (Max SendQ exceeded).
20:51:17 -!- imode has joined.
20:51:33  Reading it into memory without conversion would be another way.
20:55:23 -!- Lord_of_Life has joined.
20:55:24 -!- Lord_of_Life has quit (Max SendQ exceeded).
20:55:59 -!- Lord_of_Life has joined.
20:55:59 -!- Lord_of_Life has quit (Max SendQ exceeded).
20:57:29 -!- Lord_of_Life has joined.
20:57:29 -!- Lord_of_Life has quit (Max SendQ exceeded).
20:59:32 -!- Lord_of_Life has joined.
20:59:32 -!- Lord_of_Life has quit (Max SendQ exceeded).
21:00:07 -!- Lord_of_Life has joined.
21:00:08 -!- Lord_of_Life has quit (Max SendQ exceeded).
21:00:40 -!- Lord_of_Life has joined.
21:00:40 -!- Lord_of_Life has quit (Max SendQ exceeded).
21:01:09 -!- Lord_of_Life has joined.
21:01:09 -!- Lord_of_Life has quit (Max SendQ exceeded).
21:07:56 -!- Sgeo__ has joined.
21:10:58 -!- Sgeo_ has quit (Ping timeout: 246 seconds).
21:25:13  shachaf: do you know (without testing) what -1 ** infinity is in IEEE floating point?
21:26:54  kmc: my guess is that it's a NaN, inherited from log(-1)
21:27:05  oh wait, you asked shachaf
21:27:05  sorry
21:27:27  wait...
21:27:32  that's -(1 ** infinity) right?
21:27:35  then it's -1
21:27:49  i'm guessing they mean (-1) ** infinity
21:27:51  but idk
21:29:57  ok i tested both on node.js but i'm not gonna spoil anything lol
21:30:38  kmc: Is there a ** to begin with? I'd think exp(log(-1)*infinity), which becomes NaN?
21:30:54  hmm i tested them on python and i got different results lol
21:31:03  The C standard may have some odd ideas about this too
21:31:16  (they want things like pow(-1,3) = -1)
21:32:15  wtf the python result is weird lol
21:32:56  ``` set -e; gcc -Wall -O -fno-math-errno -std=c11 -o tmp/a.out -x c - <<<$'#include\n#include\n''int main(void) { double r = -pow(1.0, INFINITY); printf("r = %g,\n", r); return 0; }'; tmp/a.out
21:32:58  r = -1,
21:33:37  see, -(1 ** infinity) is -1
21:33:44  interesting, js says NaN on that one lol
21:33:47  b_jonas: uhm we want the - inside the pow
21:34:04  > (-1) ** (1/0)
21:34:04  js says NaN on 1**infinity for some reason
21:34:05   1.0
21:34:06  int-e: no we don't. if we had wanted it, kmc would have said that.
21:34:11  int-e: it was a trick question.
21:34:28  b_jonas: I'd hope it wasn't
21:34:35  > (-1) ** (-1/0)
21:34:37   1.0
21:35:48  ``` set -e; gcc -Wall -O -fno-math-errno -std=c11 -o tmp/a.out -lm -x c - <<<$'#include\n#include\n''int main(void) { double r = -pow(1.0, INFINITY); printf("-1**INFINITY = %e,\n", r); return 0; }'; tmp/a.out
21:35:50  ​-1**INFINITY = -1.000000e+00,
21:36:09  So, apparently, pow(1,x) is specified as 1.
21:36:35  In C, which will infect a ton of programming languages.
21:37:28  hi
21:37:37  fell asleep sorry
21:38:54  Lykaina: np, I waited a day to reply too after all, so you're not late
21:39:22  > -(1 ** (1/0))
21:39:25   -1.0
21:39:42  ``` set -e; gcc -Wall -O -fno-math-errno -std=c11 -o tmp/a.out -lm -x c - <<<$'#include\n#include\n''int main(void) { double r0 = atan2(-1.0, 1.0/INFINITY), r1 = atan2(-1.0, -1.0/INFINITY); printf("atan2(-1.0,0.0) = %e, r = %e\n", r0, r1); return 0; }'; tmp/a.out
21:39:43  atan2(-1.0,0.0) = -1.570796e+00, r = -1.570796e+00
21:39:51  ``` set -e; gcc -Wall -O -fno-math-errno -std=c11 -o tmp/a.out -lm -x c - <<<$'#include\n#include\n''int main(void) { double r0 = atan2(-1.0, 1.0/INFINITY), r1 = atan2(-1.0, -1.0/INFINITY); printf("atan2(-1.0,0.0) = %e, atan2(-1.0,-0.0) = %e\n", r0, r1); return 0; }'; tmp/a.out
21:39:52  atan2(-1.0,0.0) = -1.570796e+00, atan2(-1.0,-0.0) = -1.570796e+00
21:40:08  lol
21:41:12  wait, that's not where the branch cut is
21:41:49  kmc: I don't.
21:42:00  ``` set -e; gcc -Wall -O -fno-math-errno -std=c11 -o tmp/a.out -lm -x c - <<<$'#include\n#include\n''int main(void) { double r0 = atan2(1.0/INFINITY, -1.0), r1 = atan2(-1.0/INFINITY, -1.0); printf("atan2(0.0, -1.0) = %e, atan2(-0.0, -1.0) = %e\n", r0, r1); return 0; }'; tmp/a.out
21:42:05  atan2(0.0, -1.0) = 3.141593e+00, atan2(-0.0, -1.0) = -3.141593e+00
21:42:05  that's where the branch cut is
21:49:08  one of the main problems with my interpreter is that it only works when everything is formatted perfectly.
21:49:57  arranged, not formatted
21:50:15  Lykaina: do you mean like the labels for the loops and conditionals?
21:50:21  yes
21:55:02  another problem is that i am limited by my programmimg skill
21:57:05  the reason for main.h is that i reused a lot of code from an earlier attempt at this, one which foolishly used 4 .c files
21:57:25  and 4 .h files
21:57:54  Lykaina: it's not a problem to use multiple c files, I only said that you shouldn't define the global variables in the header, because if you include the header multiple times, you'll get multiple copies of those variables that way
21:58:01  that or an error
21:58:14  oops
21:58:24  only declare the global variables in the header file if you want to use it in multiple c files, and define each of them in a single c files
21:58:46  declare global variables by using the `extern` keyword, and without an initializer
21:59:26  define the global variable without the `extern` keyword or any other storage class modifier keyword
22:01:01  shouls i just move everything into main.c?
22:01:12 -!- imode has quit (Ping timeout: 265 seconds).
22:02:01  you can if you want in a small program like this, but you should probably know how multiple compilation units work in C in case you want to write more C programs in the future
22:02:22  note that the `extern` keyword works differently on variable declarations and on functions declarations
22:02:30  (on function declarations, it basically does nothing)
22:02:54  it's a bit confusing, but it's way too late to change that part of C
22:07:02  that IEEE talk above reminds me about how many languages know that x mod 0 is x
22:08:36  I forgot which ones again, even
22:11:26 -!- adu has joined.
22:12:57  back
22:13:19  check the repo again
22:14:21 -!- imode has joined.
22:16:26  Lykaina: now you have just one source file, no header, but no other changes. so no annoyance with the global variables now.
22:16:53 -!- GeekDude has quit (Quit: WeeChat 2.4).
22:20:22 -!- Melvar has quit (Ping timeout: 252 seconds).
22:22:09  i agree that findiw and findand are pretty badly done
22:25:27  crap
22:27:56  the S op, the one that allows the "Hello World" program i wrote to work...it may need to go. probably replace it with an external data file lookup
22:28:58  for readiw and readand to work, the program file can't contain extra data
22:29:28  Lykaina: maybe change it so that instead of being able to read from anywhere in the source file, it can only read from sections that are specially marked for that, and have a label, and for reading you specify the label and an offset into the data block after that label?
22:30:40  either that, or just allow to initialize parts of the memory with data in the program source code, and then just use ordinary memory reads
22:31:00  I'm still asking how the subroutine memory thing works by the way
22:31:43  what part do you want to know about? i lost the question
22:32:07  if I understand correctly, the top 4 kilobytes of the memory are for global variables, and mapped straigth to addresses
22:32:17  but for the memory before that, there's some special magic address translation or something
22:32:20  how does that work?
22:33:05  checking
22:34:04 -!- Melvar has joined.
22:34:29  is it like a data stack, with the memory reference automatically offset by the stack pointer or something?
22:37:12 -!- GeekDude has joined.
22:37:31 -!- unlimiter has joined.
22:38:13  well, I don't understand that address translation and why you're doing it that way
22:38:20  look at the ops '&','-','N'
22:38:43  and how they interact
22:38:46  it looks as if it allows you to look at only the current stack frame, not stack frames below it
22:39:15  are you supposed to pass arguments to function calls through globals then?
22:39:16  what stack?
22:39:17  it's weird
22:39:33  well, there's also no stack, but basically
22:39:46  it's my first working attempt
22:39:47  it looks like you can only use one fixed part of that memory within a subroutine
22:40:08  at least directly
22:40:14  luckily indirect addressing lets you bypass it
22:40:22  but I still don't understand why you do this address translation at all
22:41:04  did you look at doc/examples/rand_0-99.txt
22:41:06  ?
22:41:19  no
22:41:46  there's an example of subroutine usage there
22:44:26  it's an elaborate use of jumps
22:44:37  and labels
22:45:09  Lykaina: it looks like the RAND subroutine tries to make two formatted random digits, storing them to @F001 and @F000 or something
22:45:39  yes, from the same number
22:47:49  if i wanted to use the &RAND sub in another location, i'd use a different mask number
22:48:30  each sub invocation has to have a unique mask number, from 01 to ef
22:49:11  main uses 00
22:50:44  so you can only make a sub call 239 times max
22:51:03  is this making sense?
22:51:23  not to me
22:51:44  I understand that the subroutine call instruction sets a fixed base address,
22:52:41  and then the memory reads in the subroutine, except for indirect ones, will read only from the stack frame at that address or from the global memory area, and the 
22:52:57  stack frames can't overlap because they're all 256 long and start at offsets that are multiples of 256-word pages
22:53:12 -!- imode has quit (Remote host closed the connection).
22:53:15  but I don't get why this is useful
22:53:20  oh
22:53:37 -!- imode has joined.
22:53:38  I do also understand that the memory in those stack frames is preserved
22:53:48  and that you can call subroutines at the same stack frame
22:53:54  but what's the point of the whole thing? 
22:54:31  honestly, it seemed like a good idea at the time, but it's probably not
22:55:57  ok
22:56:07 -!- imode2 has joined.
22:56:47  i need to add the equivalent of a K op during a sub call, at the least
22:58:06  (clearing the memory)
22:58:43 -!- imode has quit (Ping timeout: 265 seconds).
22:59:32  and somehow have the ranges automatically assigned based on position on a stack
23:00:28  instead of having the code define the ranges
23:01:25  does that sound better?
23:02:23  I don't know. would you be able to choose the size of the stack frame, like in the subroutine defintion, and access the stack frames below from the subroutine?
23:03:01  what does "stack frame" mean?
23:03:29  the stack frame is the part of the memory that a subroutine uses for its own purposes
23:03:37  that's where it puts its local variables
23:04:41  always should be 512 bytes (256 addresses)
23:04:56  it may also contain a few other things that help for subroutine linkage, such as the size of the stack frame or a pointer to the previous stack frame to allow to reset the stack pointer when the subroutine exits, and a return address which points into the code for where the subroutine was called from, but you may store those separately in an interpreter like this
23:05:32  Lykaina: hmm. but even if it's always 256 words, you should probably allow accessing the stack frames below, to make it easier to pass function call parameters
23:05:39  and the other frames can only be accessed indirectly
23:06:12  so that a subroutine doesn't have to copy them from global memory area or access them with an indirect access (the latter would be hard unless you at least add a way to get the stack pointer) 
23:06:43  i don't have call parameters at the moment
23:07:15  yes, I do understand
23:07:38  but you should consider to change them if you want to change how that memory accessworks
23:08:59  i'll try something tonight and push it if it works
23:13:22 -!- imode2 has quit (Ping timeout: 240 seconds).
23:15:35  should i move the srand to set the seed whenever a random number is requested?
23:15:52  I don't think that would help much
23:21:19  unsigned char submask[SUBMASKSIZE]; // i think that's a proto-stack
23:37:59 -!- unlimiter has quit (Quit: WeeChat 2.5).
23:39:43 -!- arseniiv has quit (Ping timeout: 246 seconds).
23:41:13 -!- tromp_ has joined.
23:44:39 -!- tromp has quit (Ping timeout: 250 seconds).

2019-09-08:

00:02:43  b_jonas: how about 239 subs, named 01,02...EE,EF ?
00:03:35  therefore, easier to make a stack with
00:17:15  `` printf %s 11101001011110101100010111111100 | crc32 /dev/stdin
00:17:17  badc0c0a
00:20:27  lol
00:20:51 -!- imode2 has joined.
00:27:55  (It was a fun little exercise: start with a desired CRC32 value, then compute that string of 0s and 1s)
00:28:44  And don't use brute force; that's feasible, but boring. :)
00:29:50  this is why crc32 is not a cryptographic hash
00:30:53  Nor CRC64, nor CRC128 if that exists.
00:31:42 -!- imode2 has quit (Quit: Leaving).
00:37:44  so, not yet in repo, but the subroutines are literally named 01 through EF now
00:41:38  now it's in the repo
00:50:28  int-e: there's an IOCCC entry that modifies a file so that it contains its crc checksum formatted to text, I think
00:50:42  but yes, it's linear
00:52:34  Lykaina: I don't see why that would be better that just using absolute addresses inside those subroutines. the point of a stack would be that (a) it would let you use less memory than you need for all subs, (b) pass arguments so you can call the same subroutine from multiple call sites easily, (c) allow recursion. you might not care about all of that, in which case you just put the local variables of 
00:52:40  each of the subroutines to separate memory areas
00:53:42  but even then my main complaint is that since your interpreter restricts memory access to the other parts of the memory, it's hard to pass arguments or return values to other subroutines, you have to use the global variables for it, in which case why do you not just put everything in global variables and get rid of the address translation instead?
00:54:15  Lykaina: however, if you want to limit the names of the subroutines to make storing the table of their code addresses simpler, that I could understand, but it is sort of restrictive
00:54:31  would just force the bookkeeping on the programmer
00:55:22  anyway, I don't know what you want to do with the interpreter, and you'll have to decide that
00:55:29  i'll get rid of the address translation and make everything global
00:55:40  int-e: right, it's a linear checksum, so brute force is way overkill
00:59:59  linear reminds me, https://www.perlmonks.com/?node_id=940327
01:04:05  that one is also a problem that's linear over the GF(2) field, you may try to solve it
01:04:24  b_jonas: better?
01:04:37  brb gotta eat
01:06:39  cpressey: ^ puzzle thingy, you might be interested as well
01:07:30  Lykaina: what is better?
01:09:11  fizzie: So according to the musl people, there's pretty much no cross-libc ABI.
01:09:36  If you compile your program with musl's crt.o it'll work with musl's ld.so/libc, and the same for glibc.
01:09:43  This seems like a bizarro situation to me.
01:10:08  Surely there *is* a de facto ABI, which is whatever programs compiled with gcc and its crt.o do.
01:10:27 -!- Sgeo__ has quit (Read error: Connection reset by peer).
01:10:38  But there are a lot of compatiblity issues across even versions of glibc, so who knows what that means.
01:10:51 -!- Sgeo__ has joined.
01:11:09  In practice I need to emulate what glibc's crt.o does, I guess. Which is calling __libc_start_main with rdx as an argument.
01:11:40  Note that Go *doesn't* call libc_start_main, so maybe Go programs only work by accident, since libc doesn't get to do its initialization in the usual way.
01:15:38  That's odd.
01:16:08  I know there's definitely a nonzero amount of things that go wrong if you write a program that just starts at _start but still links with (g)libc and calls into it.
01:16:15  I don't remember specific examples, but there were some.
01:16:52 -!- xkapastel has quit (Quit: Connection closed for inactivity).
01:17:14  "like exposing the list of TLS-providing modules, synchronizing changes to it, providing dl_iterate_phdr (access to unwind information for all libraries present), providing dlopen/dlsym/etc,"
01:20:10  b_jonas: git commit -a -m "Removed a broken local addressing scheme."
01:22:49 -!- adu has quit (Quit: adu).
01:27:32  Go was in the top 10 (just barely, on spot 10) in the IEEE Spectrum's 2019 programming language popularity contest update.
01:29:17 -!- tromp has joined.
01:31:35 -!- tromp_ has quit (Ping timeout: 248 seconds).
01:33:23  fizzie: I was happier about go when I didn't know that it resorted to reflection for elementary things like sorting.
01:35:00  int-e: You can also use code generation.
01:35:34  Yay. C++ templates but without official language support.
01:35:48  `grwp negativ
01:35:49  absolute value:The absolute value of a number, also known as its cosign, is its distance from zero regardless of direction. It shouldn't be negative, but Sgeo is trying to break maths.
01:35:54  I think there is some official language support?
01:36:46  sounds like Sgeo
01:36:47  Is there now? I thought not... I thought it was some kind of 3rd party preprocessor. Maybe I'm wrong.
01:37:39  There's something called "go generate".
01:37:46  Maybe that's official tool support, not language support.
01:38:31  'Generate runs commands described by directives within existing files.'
01:39:42  I'd use Go except I don't want garbage collection.
01:40:41  is go an esolang?
01:40:58  Heh.
01:41:20  did you write it?
01:41:24  Lykaina: surprisingly we often end up discussing mainstream languages here as well.
01:41:33  oh
01:41:41  It's Google's language called "Go".
01:43:33  Did you learn programming in 6502 or in Glulx at all? Or some other one?
01:44:05  IIRC, Sgeo and I used to play Go between classes at uni.
01:44:37  Do you think assemblers should generate instructions like "mov $60, %eax" when you type "mov $60, %rax"?
01:44:56  The bytes generated are already ambiguous and the assembler has to pick an encoding.
01:45:47  Or is there an observable difference between moving a 32-bit immediate into eax and rax?
01:46:23  I don't know a lot about modern x86 assembly
01:46:38  So, I don't know what the encoding is.
01:46:56  shachaf: I'd be worried about operand size mismatches and resulting pipeline stalls, but I don't know whether that worry is justified.
01:47:26  Hmm, what do you mean?
01:48:27  At least in 6502, the standard syntax does not have a difference for zero page or absolute, I think, and that affects the operand size and the speed too. But NESASM/MagicKit requires < to indicate zero page addressing, which I think is better than the standard syntax.
01:48:47  shachaf: If you load eax and then use rax, does that confuse the processor? Or doesn't it because it always deals with the whole 64 bit register anyway?
01:49:46  shachaf: I recall that loading ax and then using eax caused pipeline stalls in earlier processors. Of course there the story was different; loading ax would preserve the top half of eax.
01:49:48  I see. You're thinking maybe something just looks at the instruction operand size and not the effect of the instruction.
01:50:25  I think loading 32-bit immediates into 64-bit registers is such a common idiom that I'd be surprised. But maybe there are effects in other cases.
01:50:36  I think modern x86 is too confusing, and that MMIX is better.
01:50:41  Also, loading ax *still* preserves the top 3/4 of rax, I found out in here the other day.
01:50:57  zzo38: I'd happily use a MMIX processor if you sent me one in the mail.
01:51:42  shachaf: Yeah it's probably fine... the fact that loading a 32 bit register clears the upper half cures the reason for those stalls (namely, that outputs of two instructions would potentially have to be merged).
01:51:53  (Old x86 also is less messy than modern x86, I think.)
01:52:08  `` llvm-mc
01:52:10  ​/hackenv/bin/`: line 5: llvm-mc: command not found
01:53:41  Does HackEso have a convenient way to type instructions and see what they assemble to, or type machine code and see what it disassembles to?
01:53:53  gtg
01:54:24  before i accidently say something someone doesn't want me to
01:54:30 -!- Lykaina has quit (Quit: leaving).
01:54:49  shachaf: Anyway. I don't know. For $60 I'd hope for a  mov imm8, r/m64  operation, I think, and then realize that that doesn't exist, then spend the rest of the day wondering why that is.
01:56:12  Oh boy. You're using Intel names with AT&T order.
01:56:47  More productively, what do existing compilers/assemblers (llvm, gcc, as) do the processor software optimization manuals have anything to say on that?
01:57:52  oh, nice contraction. s/do the/do, and what do/
01:58:21  shachaf: I have no excuse, but the fact that an immediate was involved saves me :P
02:00:46  `` echo 'int foo() { return 60; }' | gcc -O2 -c -x c -o /tmp/test.o - && objdump -d /tmp/test.o | grep -P '^ *\d+:'
02:00:49  ​   0:b8 3c 00 00 00       mov    $0x3c,%eax \    5:c3                   retq
02:02:30  I'm looking at the Intel optimization guide.
02:02:36  "12.2.2 Use Extra Registers to Reduce Register Pressure"
02:02:38  Thintel.
02:02:52  DEEP
02:03:40  didn't sparc attempt to solve register pressure by doing the opposite?
02:04:07  I mean, I guess register windows give you extra registers, but they're windowed
02:04:27  "Note that in Intel 64 architecture, an update to the lower 32 bits of a 64 bit integer register is architecturally defined to zero extend the upper 32 bits. While this action may be logically viewed as a 32 bit update, it is really a 64 bit update (and therefore does not cause a partial stall)."
02:09:43  int-e: Hmm, x86 has "ADD r/m64, imm8"
02:09:49  Which I probably knew but forgot about.
02:09:59  That makes your complaint more justified.
02:10:04  By complaint I mean wonder.
02:10:56  shachaf: Yes, it has that for all arithmetic operations, but not for loads.
02:11:34  And it has an  push imm8  as well.
02:11:44  s/an/a/
02:12:36  Yes, that's an odd.
02:12:56  Often you can get by with the arithmetic ones, as long as you have a known starting point.
02:13:02  `` echo 'mov $60, %eax' | as -o /tmp/test.o - && objdump -d /tmp/test.o | grep -P '^ *\d+:'
02:13:03  ​   0:b8 3c 00 00 00       mov    $0x3c,%eax
02:13:06  `` echo 'xor %eax, %eax; or $60, %eax' | as -o /tmp/test.o - && objdump -d /tmp/test.o | grep -P '^ *\d+:'
02:13:07  ​   0:31 c0                xor    %eax,%eax \    2:83 c8 3c             or     $0x3c,%eax
02:13:11  Oh well.
02:13:40  shachaf: so ironically, xor rax,rax; add rax,60 is 5 bytes, one byte shorter than the mov eax,60 you'd envision. ... right, just like that
02:14:17  (for a 64bit target)
02:15:06  You mean the one with the rex prefix? Because it's the same size otherwise.
02:15:22  (As seen just above.)
02:15:28  `` echo 'xor %rax, %rax; or $60, %eax' | as -o /tmp/test.o - && objdump -d /tmp/test.o | grep -P '^ *\d+:' | sed 's/^[^\t]*\t//; s/ *\t/: /g'
02:15:29  48 31 c0: xor    %rax,%rax \ 83 c8 3c: or     $0x3c,%eax
02:15:37  mmm.
02:16:02  you're right, I made a wrong assumption about how 64 bit mode would work.
02:17:14  `mkx bin/as-encoding//echo "$1" | as -o /tmp/out.o - && objdump -d /tmp/out.o | grep -P '^ *\d+:' | sed 's/^[^\t]*\t//; s/ *\t/: /g'
02:17:16  bin/as-encoding
02:17:23  `as-encoding mov %rax, %rbx
02:17:24  48 89 c3: mov    %rax,%rbx
02:17:38  Oh, \d is wrong, isn't it.
02:17:59  `mkx bin/as-encoding//echo "$1" | as -o /tmp/out.o - && objdump -d /tmp/out.o | grep -P '^ *[0-9a-f]+:' | sed 's/^[^\t]*\t//; s/ *\t/: /g'
02:18:05  bin/as-encoding
02:18:56  `as-encoding mov (%rbp), %rdi
02:18:57  48 8b 7d 00: mov    0x0(%rbp),%rdi
02:19:25  `asm mov eax, 60
02:19:26  0:  b8 3c 00 00 00   mov eax,0x3c
02:19:28  There was that one already.
02:19:36  It's an intel variant, though.
02:19:37  `as-encoding mov (%r13), %rdi
02:19:38  49 8b 7d 00: mov    0x0(%r13),%rdi
02:19:45  Oh, that one's probably better.
02:19:51  I did ask!
02:19:52  `cat bin/asm
02:19:52  `asm mov rax, 60
02:19:52  ​#!/bin/sh \ echo "$1" > /tmp/asm.s; for o in ',' '-msyntax=intel -mnaked-reg,-M intel'; do if as ${o%,*} /tmp/asm.s -o /tmp/asm.o 2>>/tmp/asm.err; then objdump ${o#*,} -d --insn-width=20 /tmp/asm.o | sed -e "1,/0000000000000000/d" | perl -pe 'if (/^\s*(\w+:)\s*((?:\w\w )+)\s*(\S.*)$/) { ($a,$b,$c) = ($1,$2,$3); $_ = "$a  $b  ".($c =~ s/\s+/ /rg)."\n"; }'; exit; fi; done; cat /tmp/asm.err
02:19:53  0:  48 c7 c0 3c 00 00 00   mov rax,0x3c
02:20:17  `asm mov rdi, [r13]; mov rdi, [r15]
02:20:20  0:  49 8b 7d 00   mov rdi,QWORD PTR [r13+0x0] \ 4:  49 8b 3f   mov rdi,QWORD PTR [r15]
02:20:50  `asm mov rax, 6061626364656667h
02:20:51  ​/tmp/asm.s: Assembler messages: \ /tmp/asm.s:1: Error: too many memory references for `mov' \ /tmp/asm.s: Assembler messages: \ /tmp/asm.s:1: Error: junk `h' after expression
02:21:00  `asm mov rax, 0x6061626364656667
02:21:01  0:  48 b8 67 66 65 64 63 62 61 60   movabs rax,0x6061626364656667
02:21:37  is `asm` based on `nasm`?
02:21:47  No, it's still as.
02:22:13  `asm mov $60, %rax
02:22:14  0:  48 c7 c0 3c 00 00 00   mov $0x3c,%rax
02:22:15  Actually, looks like it guesses.
02:22:23  Oh boy, it tries both syntaxes.
02:22:33  An assembler with a conditional? as if!
02:22:49  It tries as + objdump without options, and if that fails it tries "-msyntax=intel -mnaked-reg" for as and "-M intel" for objdump.
02:22:54  That's kind of clever.
02:23:41  `asm movb $60, 60
02:23:42  0:  c6 04 25 3c 00 00 00 3c   movb $0x3c,0x3c
02:24:03  now wth is that c7 c0 instruction.
02:24:46  C7 /0  MOV r/m32, imm32
02:24:52  MOV r/m64, imm32?
02:24:54  `asm movd $60, (%rsi)
02:24:55  ​/tmp/asm.s: Assembler messages: \ /tmp/asm.s:1: Error: operand size mismatch for `movd' \ /tmp/asm.s: Assembler messages: \ /tmp/asm.s:1: Error: operand size mismatch for `movd'
02:25:13  `asm movq $60, (%rsi)
02:25:14  0:  48 c7 06 3c 00 00 00   movq $0x3c,(%rsi)
02:25:21  ah.
02:25:32  `cwlprits bin/asm
02:25:34  No output.
02:25:37  uh
02:25:40  `culprits bin/asm
02:25:42  fizzïe fizzïe fizzïe fizzïe fizzïe fizzïe fizzïe fizzïe fizzïe fizzïe shachäf shachäf ais52̈3 shachäf shachäf ais52̈3 ais52̈3 ais52̈3 ais52̈3 ais52̈3 ais52̈3 ais52̈3 ais52̈3 ais52̈3 Gregör Gregör
02:25:56  Can you add a feature where it prints the encoding in octal?
02:26:37  I guess that'd be handy for the ModR/M byte.
02:26:51  Not going to start doing that right now though.
02:27:16  It's handy for a bunch of other things too.
02:27:47  Anything that names a register, for instance.
02:27:48  `asm movq $0x6061626364656667, (%rsi)
02:27:49  0:  48 89 34 25 00 00 00 00   mov QWORD PTR ds:0x0,rsi
02:28:15  `asm movq $6061626364656667, (%rsi)
02:28:17  0:  48 89 34 25 00 00 00 00   mov QWORD PTR ds:0x0,rsi
02:28:42  that's confusing.
02:28:52  It's confusing because it's treating it as Intel syntax.
02:29:20  And treating the $ as part of a symbol? 
02:29:24  Since it fails as AT&T syntax because the only instruction with a 64-bit immediate is mov r64, imm64
02:29:24  `asm movq [rsi], 0x6061626364656667
02:29:25  ​/tmp/asm.s: Assembler messages: \ /tmp/asm.s:1: Error: invalid char '[' beginning operand 1 `[rsi]' \ /tmp/asm.s: Assembler messages: \ /tmp/asm.s:1: Error: operand size mismatch for `movq'
02:29:29  Right.
02:29:42  That's unfortunate.
02:29:52  `as-encoding movq $6061626364656667, (%rsi)
02:29:53  ​{standard input}: Assembler messages: \ {standard input}:1: Error: operand size mismatch for `movq'
02:30:08  fair enough
02:30:24  I guess that's kind of an issue with all these "just try all the ways" things, there's a similar thing with the C one that tries with and without a main wrapper.
02:30:27  `asm mov eax, 60; mov rax, 60
02:30:29  0:  b8 3c 00 00 00   mov eax,0x3c \ 5:  48 c7 c0 3c 00 00 00   mov rax,0x3c
02:30:31  Actually, why *is* that second one REX.W + C7 /0, and not REX.W + B8+ rd? 
02:30:49  Oh, because that's the imm64.
02:30:56  Right.
02:30:58  yeah it's shorter this way
02:31:16  What a nice and orthogonal instruction set.
02:31:34  I've forgotten what /0 means.
02:31:38  Yes, it's a thing of pure beauty.
02:31:40  Is it the reg part of the modr/m byte?
02:32:01  Yes.
02:32:06  yes, /0 puts something in the mod r/m byte
02:32:19  I've also forgotten what rd means.
02:32:58  destination register?
02:33:03  I dunno.
02:33:06  It's "+rd", means adding a register code for a doubleword register to the byte on the left.
02:33:25  The pages just seem to format it with the + closer to the byte it gets added to.
02:33:34  But B8...BF are all mov rd, imm32 instructions
02:34:09  Why do they say "REX.W +"?
02:34:18  `asm inc rax
02:34:19  0:  48 ff c0   inc rax
02:34:22  Yes, and "B0+ rb" makes B0 .. B7 ones that are r8, imm8 ones.
02:34:39  This is all way simpler in base 8, hth.
02:34:41  Well, not strictly imm8. But the "d" is for size, not for "destination".
02:35:06  They say "REX.W +" because it was the 64-bit variant, which needs the REX prefix with the W bit set.
02:35:09  fizzie: yeah I got that a moment too late
02:35:20  But the + just means concatenation there?
02:35:29  Yes.
02:35:35  Or does it mean you add (or) the other REX bits or something
02:35:36  ?
02:35:37  OK.
02:35:39  The + that means "add to the value" is typeset slightly differently.
02:35:44  Oh.
02:35:48  I was looking at https://www.felixcloutier.com/x86/mov
02:36:19  Well, by "typeset" I really meant the whitespacing, which they've accurately reproduced.
02:36:26  The symbol itself looks the same.
02:37:03  But the spacing looks like "REX.W + B8+ rd" so you can arguably tell what kind of + it is.
02:37:37  the space before the "rd" is a bit odd
02:38:12  But e.g. https://www.felixcloutier.com/x86/jmp just says "REX.W FF"
02:38:13  It's odd especially because the interpretation guide says: "+rb, +rw, +rd, +ro".
02:38:30  (And so does the Intel manual, which I've now opened.)
02:38:42  shachaf: My version of the Intel manual says "REX.W + FF /5".
02:38:47  For JMP m16:64, anyway.
02:39:32  Really? Which version?
02:39:35  m16:64, hmm.
02:39:39  https://software.intel.com/sites/default/files/managed/39/c5/325462-sdm-vol-1-2abcd-3abcd.pdf PDF page 1072 says REX.W FF
02:39:56  I'm not sure where the version number is in this thing.
02:40:35  I know what the REX.W means but I was confusil about the +.
02:41:09  It says "Order Number: 325462-041US" and "December 2011" on the first page.
02:41:24  So they have broken it somewhere between 2011 and 2019.
02:42:13  Although arguably the "+"-free version is more logical, because that's how concatenation works most of the time there.
02:42:35  Hmm the version that I downloaded in June says REX.W FF /5
02:42:36  But this manual still has +s for mov.
02:43:35  I suspect I downloaded the 2011 version in 2011, and have not updated it since then.
02:43:44  the intel manuals often use illogical notation elsewhere too, in the pseudocode that describes instruction semantics
02:43:55  but for the mov it has, REX.W + B8+ rd io
02:43:57  it's a confusing manual
02:46:06  or maybe a confusil manual
02:46:11  or a confus manual
02:46:13  dunno
02:48:10  There was some specific overlong encoding which objdump represents using a pseudoregister eiz/riz to represent zero.
02:48:18  `asm .byte 0x88, 0x04, 0xa0
02:48:19  0:  88 04 a0   mov %al,(%rax,%riz,4)
02:48:42  The ones with a SIB byte that specify the row that doesn't do any scaling.
02:49:08  `asm .byte 0x88, 0x04, 0xe0
02:49:09  0:  88 04 e0   mov %al,(%rax,%riz,8)
02:49:40  Gives it a way to disambiguate, but I'm not sure how useful that is because I'm pretty sure there still some ambiguous cases where different bytes give the same text.
02:49:44 * int-e blinks
02:49:57  There's a %riz?
02:50:04  Not really.
02:50:26  Oh, you explained it there.
02:50:29  But there's a SIB byte encoding for each of the scaling levels (1, 2, 4, 8) that doesn't actually add a scaled register.
02:50:43  `asm .byte 0x88, 0x04, 0x20
02:50:44  0:  88 04 20   mov %al,(%rax,%riz,1)
02:51:05  `asm .byte 0x88, 0x00
02:51:06  0:  88 00   mov %al,(%rax)
02:51:10 -!- ArthurStrong has joined.
02:51:51  fizzie: do they have that in 32 bit mode too?
02:52:01  Yes, it's just called %eiz.
02:52:13  fun.
02:52:49  ndisasm shows both 88 04 20 and 88 00 as just `mov [rax], al`.
02:54:21  It's very convenient that x86 has a 3-operand add.
02:55:00  On the other hand:
02:55:01  `asm .byte 0x88, 0xc2, 0x8a, 0xd0
02:55:04  0:  88 c2   mov %al,%dl \ 2:  8a d0   mov %al,%dl
02:55:22  There's no disambiguating that thing.
02:55:52  But maybe there was some more specific way of showing it with eiz/riz than simply making it look different.
02:55:57  s/way/reason/
02:56:37  fizzie: well, those encodings of mov dl, al have the same size
02:57:18  And as I understood it, the %riz actually makes a difference (since it adds a SIB).
02:57:27  is there a service that lets you run short programs on lots of different x86 architectures/families?
02:57:39  would be interesting to see if either encoding is uniformly faster
02:57:56  Oh, nitpick: "SIB = scaled index byte", so "SIB byte" is redundant.
02:58:01  `asm .byte 0xb0, 0xff, 0xc6, 0xc0, 0xff
02:58:05  0:  b0 ff   mov $0xff,%al \ 2:  c6 c0 ff   mov $0xff,%al
02:58:05  int-e: Those aren't the same size.
02:58:23  `asm .byte 0110, 0146, 0213, 0364
02:58:24  0:  48   rex.W \ 1:  66 8b f4   mov %sp,%si
02:58:32  fizzie: hmm, good point.
02:58:53  does as even accept the riz stuff...
02:59:00  `asm mov %al,(%rax,%riz,1)
02:59:02  ​/tmp/asm.s: Assembler messages: \ /tmp/asm.s:1: Error: bad register name `%riz' \ /tmp/asm.s: Assembler messages: \ /tmp/asm.s:1: Error: missing ')' \ /tmp/asm.s:1: Error: bad expression \ /tmp/asm.s:1: Error: junk `riz' after expression
02:59:10  I think it's not accepted on the input side.
02:59:30  It may just be an objdump peculiarity.
02:59:38  Should my assembler have different names for different register sizes?
02:59:50  That's another thing, why aren't these dump things ever round-trippable? 
03:00:17  Your assembler/disassembler pair should have the property that (assemble . disassemble) is identity.
03:00:42  I wasn't going to have a disassmller, which lets me sidestep this requirement.
03:01:02  Do you think the assembler should always use an unambiguous name for unusual encodings?
03:01:13  I think it should add a footnote.
03:01:27  Or possibly a hover-tip.
03:01:38  Oh, I was still in the disassembler mindset, sorry.
03:01:57  I guess that could apply to an assembler as well, if it reads in a footnote.
03:02:14  . o O ( mov dl, al )
03:02:47  `asm .byte 0213, 0303; .byte 0211, 0330
03:02:48  0:  8b c3   mov %ebx,%eax \ 2:  89 d8   mov %ebx,%eax
03:03:08  fizzie: Well, really I meant disassembler.
03:03:22  It's a tricky question what a /sane/ syntax for this would look like.
03:03:26  Disassembling the above two the same way doesn't seem that bad to me.
03:04:13  int-e: `mov 𝔞𝔩, 𝕕𝕝` vs. `mov 𝕒𝕝, 𝔡𝔩`.
03:04:16  It's a very niche case where you want to distinguish them. And different versions of an assembler could switch between encodings, so you'd be breaking some backwards compatibility by writing one of them out as nonstandard.
03:04:22 -!- FreeFull has quit.
03:04:24  fizzie: I see boxes :)
03:04:38  Maybe that's not so bad, and it wouldn't actually break compatibility meaningfully to have a default.
03:04:44  Maybe it'll work at http://esolangs.org/logs/2019-09-08.html#lif
03:05:17  `asm .byte 0211, 0303; .byte 0213, 0330
03:05:18  0:  89 c3   mov %eax,%ebx \ 2:  8b d8   mov %eax,%ebx
03:05:29  `asm mov %eax, %ebx
03:05:29  0:  89 c3   mov %eax,%ebx
03:05:33  `asm mov ebx, eax
03:05:34  0:  89 c3   mov ebx,eax
03:05:42  fizzie: yeah it works in logs (I had made my way to tunes)
03:05:47  I guess I should use the 0x89 encoding.
03:06:19  maybe just put appendices on the mnemonic... mov.mr and mov.rm
03:06:24  shachaf: I wonder if they settled on that just because 0x89 < 0x8b.
03:06:27 -!- Sgeo_ has joined.
03:06:54  Wait, those are the same assembler so it's not surprising that both syntaxes used the same encoding.
03:07:04  For some reason I was thinking it was nasm because it was mentioned earlier.
03:07:35  nasm does use 89 as well though.
03:08:01  godbolt.org has a checkbox to show the instruction encoding rather than just assembly.
03:08:07  But it doesn't work when you set the language to assembly!
03:08:18  I seem to recall that some people use variant instruction encodings for watermarking software.
03:08:26  int-e: That suffix thing rings a bell, I think there was a university course that did that for an x86 variant.
03:08:37  I opened an issue: https://github.com/mattgodbolt/compiler-explorer/issues/1567
03:08:39  That it used as the target, it was a course on compilers.
03:08:55  I tried to fix it locally but then it needed a new version of node.js to build so I gave up on it.
03:09:26  Oh, is Godbolt just their surname? 
03:09:44  Yes.
03:09:45  I thought it was reference to a thunder deity or something.
03:09:49  In any case, as much as I'd like a round-trippable disassembler/assembler, I also want a noiseless disassembler that just conveys the semantics.
03:10:00  Though their Twitter nick is now "Matt Compiler-Explorer".
03:10:07  Heh.
03:10:10  So round-trippability should be an option, probably not even enabled by default.
03:10:36 -!- Sgeo__ has quit (Ping timeout: 268 seconds).
03:11:15  Must be odd to have your name forever associated with a thing that way.
03:11:24  Although I guess it's more or less the same for mathematicians.
03:12:12  it's already weird when you're just cited in a paper. "As  showed, ..."
03:12:25  Am I right I can simulate Haskell-like lazy evaluation in Scheme if I add "lazy" on every function's argument?
03:12:39  would be weirder to have your IRC nick cited in that way
03:12:48  Hooloovo0: yes.
03:13:19  also I wouldn't at all be surprised if someone cited this channel in a paper
03:13:49  Unfortunately "esoteric" is kind of unsearchable.
03:14:44  #esoteric will remain esoteric, I guess
03:15:12  http://sro.sussex.ac.uk/id/eprint/46869/ "cites" (well, refers in the text) to the wiki, though.
03:16:19  I wonder, do compilers nowadays use the ah-style registers?
03:16:53  shachaf: yes, to generate FPU code
03:16:55  how do you mean? I'd expect them to just be subregisters of the big ones, right?
03:17:10  shachaf: which are rare today... substituted by SIMD code
03:18:17  They are subregisters, but you only get them for four registers.
03:18:38  And I wonder whether there's actually much use for them.
03:18:59  shachaf: in SIMD? yes, they are used. when you pack smaller values into a register...
03:19:05 -!- tromp_ has joined.
03:19:20  What does SIMD have to do with it? I'm confusil.
03:20:27  shachaf: you can say SIMD registers have subregisters...
03:20:34  shachaf: or you talk about x86 GPR?
03:20:36  Hmm, apparently it is used.
03:20:44  I'm talking about ah/ch/dh/bh
03:21:07  I guess things like "or $0x80,%ah" are justified.
03:21:18  shachaf: so I say, AH is used in the code working with 80-bit FPU STx registers
03:21:42  https://godbolt.org/z/adJb7o used ah.
03:21:45 -!- tromp has quit (Ping timeout: 250 seconds).
03:22:39  couldn't find anything in google scholar, but there were a couple that linked to the wiki
03:22:50  Not quite sure why it made it `xor ah, ah; or ah, 18` instead of `mov ah, 18` but maybe there's a reason.
03:23:01  Or maybe it just couldn't quite grasp the intent of the code.
03:23:05  shachaf: https://github.com/DennisYurichev/RE-for-beginners/blob/master/patterns/12_FPU/3_comparison/x86/MSVC/MSVC_EN.asm
03:23:08  also one which talked about writing IRC bots in weird languages
03:23:19  shachaf: test eax, ... would work here, but test AH,  is shorter ins
03:23:47  Yes.
03:23:50  fizzie: just a reason for shorter code
03:24:05  ArthurStrong: `xor ah, ah; or ah, 18` is not shorter than `mov ah, 18`.
03:24:11  Hmm, I guess "sub rsp, 8" is just to keep the stack aligned?
03:24:12  fizzie: OK, maybe I wrong...
03:24:40  `asm xor ah, ah; or ah, 18; mov ah, 18
03:24:41  0:  30 e4   xor ah,ah \ 2:  80 cc 12   or ah,0x12 \ 5:  b4 12   mov ah,0x12
03:25:00  whoa, that's bizarro
03:25:42  I assume it might have something to do with the fact that the natural translation of `x &= ~0xff00u` is `xor ah, ah` while the one for `x |= 0x1200` is `or ah, 0x12`.
03:25:57  But I couldn't think of a more obvious way to say "replace the second byte".
03:26:08  Attempting to go via the pointer route just made it actually play around with memory.
03:26:11  Maybe the union trick.
03:26:14  fizzie: compiler isn't good enough to optimize this out?
03:26:33 -!- Sgeo has joined.
03:27:09  Yes, for https://godbolt.org/z/jUPnPk it creates the expected code.
03:27:10  clang has an entirely different encoding which doesn't use ah.
03:27:51  (The stack adjustments changed because I had -Os for the second but -O2 for the first.)
03:28:11  The size-optimized `push rax` and `pop rdx` are kind of funny though.
03:28:34  push rzi
03:29:34 -!- Sgeo_ has quit (Ping timeout: 244 seconds).
03:30:40  I bet most of these optimizations don't matter that much.
03:31:37  I'd like to have a thing try different subsets of optimizations on a program to measure their impact and see which ones matter.
03:43:42 -!- ArthurStrong has quit (Quit: leaving).
03:54:22  Do you think this implementation of robot find kitten is good enough now?  https://arin.ga/5wx9UE
04:03:58 -!- Lykaina has joined.
04:05:36  hi
04:08:02  b_jonas, et al: rewrote S to load 8 bytes directly into ram
04:13:14  also, first time i used what i believe to be an indirect load in a sample
04:19:09 -!- Lykaina has quit (Quit: leaving).
05:40:52 -!- clog has quit (Ping timeout: 245 seconds).
06:25:04 -!- emma has joined.
06:43:16  `? tanebventions: math
06:43:17  Mathematical tanebventions include D-modules, Chu spaces, the torus, Stephen Wolfram, Klein bottles, string diagrams, linear logic, the reals, Lambek's lemma, Curry's paradox, Stone spaces, algebraic geometry, locales, and histograms.
06:43:21  `? locale
06:43:23  Locales are just frames, which are just complete Heyting algebras. Taneb accidentally invented them by asking about lattices. The only locale available in #esoteric is en_NZ.UTF-8.
06:43:35  Taneb: What did you ask about lattices?
06:43:58  Also, do you know the answer to this question: Why do topologists like bases more than subbases?
07:17:21 -!- Spexty has quit (Remote host closed the connection).
07:35:52  [[Intramodular Transaction]]  https://esolangs.org/w/index.php?diff=66017&oldid=65958 * Hakerh400 * (+36) Updated computational class.
07:36:37  [[Intramodular Transaction]] M https://esolangs.org/w/index.php?diff=66018&oldid=66017 * Hakerh400 * (+12) 
07:37:02 -!- clog has joined.
08:19:50 -!- Frater_EST has joined.
08:20:17 -!- Frater_EST has left.
08:48:52 -!- Sgeo_ has joined.
08:50:51 -!- Lykaina has joined.
08:52:07 -!- Sgeo has quit (Ping timeout: 245 seconds).
09:42:31  fizzie: SIB encoding with no index register => there is a redundant encoding, sure, and it's useful for RIP-based addresses, but doesn't the x86 manual say that the scale must be 1 when there's no index register?
09:45:20  shachaf: unambiguous name for unusual encodings => I don't think so, except for those unusual encodings that have some advantage why you want to use them, because normally you don't gain anything by using a longer encoding than the shortest one
09:45:44  there are a few cases like nops of a specific length and two-byte ret where you may gain something
09:46:26  Should assemblers encode "mov $60, %rax" the same way as "mov $60, %eax"?
09:46:55  [[Seed]]  https://esolangs.org/w/index.php?diff=66019&oldid=63558 * Palaiologos * (+4284) 
09:48:01  though of course, that only works if the assembler knows about the latest version of x86, because there are instructions like the prefixed jumps that were overlong encodings on earlier cpus but have a meaning why you want to use them on later ones
09:50:38  shachaf: do compilers use the ah-style registers => I hope so, because xchg %al, %ah or similar is the recommended way to byteswap a 16-bit word, and that comes up sometimes eg. when loading a PPM
09:51:09  Hmm.
09:51:23  You could probably use SIMD instructions to do it better.
09:55:17  Lykaina: hmm, that could work. it's strange that it (the S instruction) only loads single bytes into the words, but I guess you want to use this for hello world messages and such
09:56:31  shachaf: for more than one word, sure. you can even use general register instructions to do it faster on four words at a time. not for just one word though.
09:57:06  but you already gave better examples, for arithmetic with a constant in the second byte
10:01:14 -!- xkapastel has joined.
10:03:02  Ugh, why does this instruction set have so many special cases?
10:04:19  shachaf: because of historical reasons, plus there are optimizations that make it run on the hardware better at the time the instruction encoding is defined, even if it looks uglier
10:04:40  sadly some of those optimizations become pessimizations a decade later
10:05:19  Should I use ARM instead?
10:05:28  no
10:05:36  use x86_64 because it has fast cpu implementations
10:05:53  I want to support at least both of those eventually.
10:06:01  you can of course ignore some of the more esoteric features when generating code, such as the x87 instructions
10:06:09  and the MMX instructions
10:09:03  `asm .byte 0x48, 0x8b, 0x5d, 0x00
10:09:04  0:  48 8b 5d 00   mov 0x0(%rbp),%rbx
10:09:06  `asm .byte 0x48, 0x8b, 0x9d, 0x00, 0x00, 0x00, 0x00
10:09:07  0:  48 8b 9d 00 00 00 00   mov 0x0(%rbp),%rbx
10:09:15  hm
10:09:52  `asm mov (%rax,%rsp,1), %rbx
10:09:53  ​/tmp/asm.s: Assembler messages: \ /tmp/asm.s:1: Error: `(%rax,%rsp,1)' is not a valid base/index expression \ /tmp/asm.s: Assembler messages: \ /tmp/asm.s:1: Error: missing ')' \ /tmp/asm.s:1: Error: junk `)' after expression
10:09:56  `asm mov (%rax,%rbp,1), %rbx
10:09:57  0:  48 8b 1c 28   mov (%rax,%rbp,1),%rbx
10:10:15  I guess that's not so bad.
10:11:14  try backwards, (%rsp,%rax,1)
10:11:54  Well, that works with 1 but not with 2.
10:23:06  that is deliberate. the cpu is optimized for the case when %rsp points to the stack, in which case you don't want to multiply it with 2. this isn't required, you can use %rsp as a regular register, but you need more instructions to encode with it then, and a sigaltstack call to make sure whatever it points to won't get clobbered from a signal
10:26:18  Yes.
10:30:53  %r12 is a ca... unintended victim, you also can't use it as a scaled index
10:31:58  ``` grep -E '\' share/dict/12dicts/Lemmatized/2+2+3frq.txt
10:31:59  casualty \ causality \ constitutionality
10:32:02  yeah, one of those
10:34:48 -!- Lord_of_Life has joined.
11:17:52  `? enrichment center
11:17:52  `? enrichment 
11:17:53  enrichment center? ¯\(°​_o)/¯
11:17:54  enrichment ? ¯\(°​_o)/¯
11:17:59  hmm
11:41:18 -!- arseniiv has joined.
11:52:40  [[Nop]] M https://esolangs.org/w/index.php?diff=66020&oldid=64701 * A * (+18) 
12:16:12 * Lykaina yawns
12:26:51 -!- GeekDude has quit (Ping timeout: 265 seconds).
12:28:51 -!- GeekDude has joined.
12:29:22  so
12:29:26 -!- FreeFull has joined.
12:30:50  dreamed a got a legit call from microsoft about an account i hadn't used since high school
12:33:43  eh no. if it's a call you got and they claim to be from microsoft, then it's a scam, and you shouldn't give them your personal details. even if they call you in your dreams. if this happens often, you'd better learn Occlumency to make sure you don't give away anything sensitive through a dream bridge.
12:34:09  lol
12:34:55  (wasn't a real rl account)
12:35:40  so the dream sifters got garbage
12:35:45  the call centers are in india, so they sometimes call you while you're asleep because of timezone differences
12:39:02  when you get such a call, just hang up. it's not rude.
12:40:58 -!- xkapastel has quit (Quit: Connection closed for inactivity).
12:42:01  we don't have those scams here yet, I only know about them from the internets, but we get our fair share of other creative scams
12:42:50  i can't believe i used to play Go, don't even remember the rules, but i remember doing so with [a friend] in college in the coffee lounge at one of the tables.
12:43:51  that's normal. you sometimes have to try things like that before you realize they're not for you.
12:44:55  i only remember because i was trying to remember everything i could about [said friend].
12:45:09  heck, I tried chess and bridge while I was younger, and even bouldering once. none of them are my ideas of a good time, and I know that now.
12:47:00  you know who i'm talking about, right? It's someone here i don't feel like pinging atm.
12:49:37  they were like my best friend in college. they know who they are.
12:51:00  but then the go board game got between the two of you
12:51:22  huh?
12:52:55  i dropped out and moved away.
12:54:31  they graduated and got a job. the only "job" i've ever held was volunteering stuffing envelopes at a political office.
12:56:32  (i can't work now. technically disabled.)
12:59:50  seems my pandora station loves "imagine dragons"
13:59:59  b_jonas: have you seen the current "hello world" program, using the new S op?
14:08:32  http://sif.lesidhetree.com/sara/echidna/echidna_v0_01a6.pdf if this makes it any easier
14:11:29  [[*]] M https://esolangs.org/w/index.php?diff=66021&oldid=65073 * Gamer * (+0) /* Javascript */
14:14:29  [[*]]  https://esolangs.org/w/index.php?diff=66022&oldid=66021 * Gamer * (+263) /* Interpreters */
14:15:48  [[*]]  https://esolangs.org/w/index.php?diff=66023&oldid=66022 * Gamer * (+28) /* Examples */
14:28:41 -!- xkapastel has joined.
14:28:42  [[+-]]  https://esolangs.org/w/index.php?diff=66024&oldid=65875 * Gamer * (+234) /* Interpreters */
14:29:00  [[+-]]  https://esolangs.org/w/index.php?diff=66025&oldid=66024 * Gamer * (+5) /* Python 3 */
14:29:49  [[+-]]  https://esolangs.org/w/index.php?diff=66026&oldid=66025 * Gamer * (+245) /* Interpreters */
14:30:33  [[+-]]  https://esolangs.org/w/index.php?diff=66027&oldid=66026 * Gamer * (+42) /* Python 3 */
14:36:21  [[+-]]  https://esolangs.org/w/index.php?diff=66028&oldid=66027 * Gamer * (+2) /* Python 3 */
14:36:31  [[+-]]  https://esolangs.org/w/index.php?diff=66029&oldid=66028 * Gamer * (+2) /* Python 3 */
14:37:19  [[+-]]  https://esolangs.org/w/index.php?diff=66030&oldid=66029 * Gamer * (+342) /* Interpreters */
14:38:28  [[+-]]  https://esolangs.org/w/index.php?diff=66031&oldid=66030 * Gamer * (+121) /* Interpreters */
14:38:57  [[+-]]  https://esolangs.org/w/index.php?diff=66032&oldid=66031 * Gamer * (+2) /* Python 3 */
14:39:11  [[+-]]  https://esolangs.org/w/index.php?diff=66033&oldid=66032 * Gamer * (-2) /* Python 3 */
14:45:17 -!- MrBismuth has joined.
14:48:09 -!- MrBusiness3 has quit (Ping timeout: 250 seconds).
14:51:35 -!- Phantom_Hoover has joined.
15:04:15 -!- Spexty has joined.
15:06:39  hi Spexty 
15:33:37  hi
15:35:47  currently working on v0.01a7. G is currently null, K is what G used to be [STOP].
15:36:19  hmm why did you change that
15:36:21  do you need null?
15:36:30  or do you just want it
15:36:30  lol
15:36:33  i need a placeholder
15:36:34  hmm telegraphing changes
15:36:48  placeholder?
15:36:49  for what
15:36:52  idk if I follow
15:36:55  unsure
15:37:04  why do you need a placeholder
15:37:22  because i have an opening now
15:37:31  oh at G lol
15:37:57  the K op didn't even work
15:38:03  before
15:38:07  what was K
15:38:21  http://sif.lesidhetree.com/sara/echidna/echidna_v0_01a6.pdf if this makes it any easier
15:38:30  probably does lol
15:40:11  think i used the wrong git tag options for 0.01a6
15:41:39  does J output a number
15:41:54  a char
15:41:57  oh
15:42:22  i mean maybe you could just make G output as number
15:42:27  unless you already have that and I just didn't see it
15:45:01  so G would output the value as a formatted number?
15:45:28  instead of as a char?
15:45:55  yeah
15:46:07  i'll try it
15:46:07  like if the value is 100, J would output 'd' but G would output 100
15:50:23  good idea
15:51:25  thx
15:51:46  it'd make printing numbers a lot easier
15:56:07 -!- Spexty has quit (Ping timeout: 260 seconds).
16:01:46  done
16:01:53  pushed
16:03:40  https://github.com/lykaina/echidna
16:04:14  i'll make the compiled documentation in a moment
16:31:57  http://sif.lesidhetree.com/sara/echidna/echidna_v0_01a7.pdf
16:32:10  good morning all
16:32:17  hi kmc
16:32:40  hi kmc
16:34:17  what's new?
16:37:39  was working on Echidna
16:38:49  Lykaina: yeah, you have a flat memory space and indirect addressing, so you can easily write programs that use non-small arrays
16:39:06  such as a maze generator or minesweeper or suchlike
16:39:24  (although you could fit those into the 4 kiloword global address space of earlier versions too, to be frank)
16:40:21  that was a stupid addressing system. now i leave it up to the programmer to determine one
16:41:36  I think I have a case of the autumn sadness, already. Hopefully it’ll go away and won’t return ever
16:41:47  anything standing out?
16:42:06  as bad, i mean, compared to the rest?
16:42:21  Lykaina: are you also planning to reorganize the interpreter so it doesn't seek once for every instruction executed, and once per program byte at every jump?
16:42:36  nah, once per program byte at every subroutine call only
16:42:52  no wait, it was five times per program byte at every subroutine call iirc
16:42:56  anyway, 
16:42:59  3 now
16:43:10  are you planning to rearrange the code so it doesn't seek as much?
16:43:27  i think i know what to do
16:44:17  if it works, it might become v0.02
16:44:45  it's v0.01a7 now
16:45:02  there’s some vague magic in versions going up
16:47:13  I want to do something but I don’t want to do any particular things coming to mind
16:48:59  it probably means I underslept but I don’t feel other symptoms of that
16:50:10  read a book
16:54:23  b_jonas: I read a few chapters of a web serial already but you’right maybe I’ll find solace in watching a series about Clifford algebras, I’m stuck at the introductory part which I basically know (but there would be an overal plan of the lectures ahead at the end of this episode)
16:54:40  s/you’right/you’re right
16:54:57  see I’m even sloppy at that extent
16:56:12  I’m lazy to put earphones on :(((
17:00:45  who needs neighbours anyway
17:03:05  I have no speakers currently :)
17:03:49  so either I put them on or I don’t listen to anything. And I’m still not done
17:05:18  arseniiv: long shot, but are you in Cambridge?
17:05:24  I have inferred all these things about planning with immediate rewards all the way to the goal of a plan but I just can’t
17:05:36  Taneb: uh, no
17:05:39  OK
17:06:12  My plan of using you as an excuse to socialise has been foiled
17:06:18  if I’d be there maybe I’d have a way better outlook on life :)
17:06:22  oh
17:06:29  b_jonas: look now
17:06:37  i think i got it
17:10:08  okay I’ll try not to whine here, this is a good place and I’m not that depressed if I admit it to myself. And yesterday it wasn’t that bad so tomorrow shouldn’t be either. Though my planning issues wouldn’t go anywhere
17:14:05  can someome look at nextiw() and findand() in https://github.com/lykaina/echidna/blob/master/src/echidna.c and let me know if they make sense?
17:20:15  i know it works, i just want to make sure it does it in a more effecient way
17:30:43  am i getting a silent treatment?
17:38:41  Lykaina: please don’t think so
17:39:12  I bet b_jonas or someone is just busy right now
17:42:08 -!- MDude has joined.
17:42:34  oh, okay. i'm a little impatient.
17:42:56  it's a personality flaw
18:06:02  I was writing a survey software, and perhaps there should be some function to specify that a question does not apply according to some condition, such as the answer to a previous question.
18:19:05  zzo38: you could start with a simple boolean tag system: some answer options are tagged and some questions are marked with prerequisite tags, maybe negations of tags and complex boolean formulas with tags
18:19:05  for example Question 1 has Answer 1 tagged with A and Answer 2 tagged with A, B; Question 2 has Answer 1 tagged with B; there are no other tagged answers, and Question 3 has prerequisites A, B. Then it’s only viable when (Q1 A1, Q2 A1) or (Q1 A2) were picked
18:19:05  or Question 4 has prerequisite !B, then it’s not viable when (Q1 A2) or (Q2 A1) were picked
18:20:23  Yes, that could be one way to do it
18:21:00  (of course the survey creator would name their tags in more sensible manner in the survey’s code)
18:21:15  zzo38: good luck!
18:27:22 -!- imode has joined.
19:09:12 -!- MDude has quit (Ping timeout: 245 seconds).
19:20:48  Lykaina: that's certainly better than what you had, because findand reads the file in one pass without seeking, and nextiw reads the instructions that you are skipping in one pass. 
19:22:21  Lykaina: however, I think they don't keep the promise that whitespace is ignored, and in fact it looks as if nextiw tried to distinguish the __ from the _ statement by assuming that the __ doesn't have what looks like label right after it (it has whitespace) but the _ has the label immediately after
19:22:34  so maybe you should skip whitespace when you're reading the file
19:24:14  Lykaina: hoever, (1) the main loop that's reading instructions in sequence is still seeking before every instruction, and I think you could improve on that because it's supposed to be reading instructions in sequence usually (when there's no jump or subroutine call executed),
19:25:02  Lykaina: and I still don't like how nextand works, because it has to read the whole file for every subroutine call. ideally it would be nicer if you read the file just once, preferably store all to memory, but at least just store the addresses and names of all subroutines to memory
19:25:12  also I nominate zzo38 to look at the code
19:26:04  zzo38: you want to be able to disable questions depending on answers to previous questions? that could work
19:26:56  zzo38: don't forget to add calendar time subtraction primitive then, to skip questions for users who claim to be under a certain age
19:27:16  you don't want people to try to write those themselves
19:41:44  Why won't Bugzilla let me put in my own value for the "csv_colsepchar" setting? I get a error message:   The value "" is not in the list of legal values for the csv_colsepchar setting.
19:42:10  (The paste isn't working here; the value I put in is a tab, and this IRC client won't paste it.)
19:43:41  is this for exporting?
19:43:43 -!- Sgeo__ has joined.
19:47:08 -!- Sgeo_ has quit (Ping timeout: 268 seconds).
19:54:47  AAAAAAAAAAAAAAAAAAAAAA
19:55:20  I bought the wrong non-refundable thing
19:55:22  darn
19:55:36  I noticed it too late
19:55:48  so much wasted money
20:02:04  let me see... maybe they can refund it if I request it early enough, there's something like that in the rules
20:02:32 * Lykaina wakes
20:03:04  oh whew, I think it can be changed (for a fee)
20:03:18  (a fee that doesn't cost nearly as much as throwing away the whole thing)
20:04:14  they allow changes within 12 hours, luckily
20:08:25 -!- xkapastel has quit (Quit: Connection closed for inactivity).
20:09:21  brb gotta eat lunch 4 hours late
20:12:12 -!- Melvar has quit (*.net *.split).
20:12:36 -!- Melvar has joined.
20:22:00 -!- imode has quit (Ping timeout: 258 seconds).
20:25:59 -!- Phantom_Hoover has quit (Ping timeout: 268 seconds).
20:32:20  had a snack
20:37:42  sounds like some{one,thing} fell next door
20:39:40 -!- Phantom_Hoover has joined.
20:47:13  b_jonas: i agree with your suggestions, i just am unsure how to implement them.
20:47:47  i'm not the best programmer
20:48:39 -!- Lord_of_Life_ has joined.
20:51:17 -!- Lord_of_Life has quit (Ping timeout: 245 seconds).
20:51:17 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
20:53:35  b_jonas: should i load the program into the top 16k of memory, reserving it for that?
20:54:21  or top 32k?
20:54:37 -!- unlimiter has joined.
20:54:59  i *think* i can do that
21:01:18 -!- MDude has joined.
21:02:52  also, my idea could allow for self-modifying code
21:25:50  Lykaina: no, load the program into an area separate from the data memory
21:31:02  oh...
21:36:14 -!- unlimiter has quit (Quit: WeeChat 2.5).
21:38:53  Now I fixed my JSON in PostScript so that there is a option to convert \u escapes into UTF-8 (you can also tell it to just use the low 8-bits of each codepoint instead).
21:41:08  zzo38: can the JSON writer write such escapes from utf-8 strings?
21:43:06  b_jonas: No; I have not implemented the ability to decode UTF-8. Any byte that is not a control character or " or \ will be written unescaped. (Maybe a later version could fix that)
21:43:50  oh. does that round-trip back to postscript with your JSON reader?
21:44:33  it may be better to decode though, to avoid writing invalid utf, since the JSON reader on the opposite end may reject it
21:44:46  It will still work with the reader; if it contains any bytes with the high bit set they will just be read in unchanged (regardless of the UTF-8 setting).
21:44:55  evevn if you don't escape valid utf-8 that isn't special in JSO
22:01:06  ooh! fun weather prediction for tuesday
22:06:32  also nice weather now
22:06:52 -!- Phantom_Hoover has quit (Ping timeout: 246 seconds).
22:14:34 -!- Phantom_Hoover has joined.
22:33:03  i loaded it to memory and now it doesn't work right...
22:53:04 -!- Phantom_Hoover has quit (Quit: Leaving).
22:53:59  [[Keg]]  https://esolangs.org/w/index.php?diff=66034&oldid=65471 * JonoCode9374 * (-234) 
22:59:30  [[Keg]]  https://esolangs.org/w/index.php?diff=66035&oldid=66034 * JonoCode9374 * (+167) /* User Defined Functions */
22:59:40  grrr...
23:00:18  ?
23:01:28 -!- arseniiv has quit (Ping timeout: 246 seconds).
23:03:57  i made a version where i load the file into memory beforehand
23:04:10  it doesn't work
23:04:33  (yet)
23:04:43  i don't know what's wrong
23:08:01  http://sif.lesidhetree.com/sara/echidna/code/
23:20:50  not putting broken code on the repo
23:35:48 -!- sftp_ has joined.
23:37:41 -!- sftp has quit (Ping timeout: 250 seconds).
23:37:41 -!- sftp_ has changed nick to sftp.

2019-09-09:

00:11:01 -!- FreeFull has quit.
00:12:00  i may have to change how N - Q work. i think the problem is in those and related code.
00:12:23  (subs and if/while loops)
00:32:14 -!- tromp_ has quit (Remote host closed the connection).
01:04:11 -!- tromp has joined.
01:04:44 -!- emma has left.
01:08:41 -!- tromp has quit (Ping timeout: 250 seconds).
01:16:43  [[Encapsulation]] N https://esolangs.org/w/index.php?oldid=66036 * Hakerh400 * (+6045) New language
01:17:00  [[User:Hakerh400]]  https://esolangs.org/w/index.php?diff=66037&oldid=65956 * Hakerh400 * (+20) /* Programming languages we created */
01:17:48  [[Language list]]  https://esolangs.org/w/index.php?diff=66038&oldid=65978 * Hakerh400 * (+20) Add new language
01:20:36  [[Encapsulation]] M https://esolangs.org/w/index.php?diff=66039&oldid=66036 * Hakerh400 * (+62) /* Details */
01:38:33  b_jonas: got it!
01:38:51  except i had to change the lang a little
01:39:12  and while loops aren't working perfect
01:51:24  on the repo as version 0.02
01:52:57 -!- tromp has joined.
01:57:25 -!- tromp has quit (Ping timeout: 252 seconds).
02:19:28  How clear is http://sif.lesidhetree.com/sara/echidna/echidna_v0_02.pdf ?
02:24:05 -!- tromp has joined.
02:27:18  might have to split if/while into if and loop
02:27:49  have 3 ifs, 1 loop
02:28:14  the problems with while are annoying me
02:28:35 -!- tromp has quit (Ping timeout: 252 seconds).
02:29:39  i had to put a note in the doc saying that while loops don't work properly
02:29:47  that's how bad
02:33:33  it reads: "while" loops do not work right (bug), use an extra "if" at end.
02:39:00  does anyone care?
02:40:39  `pbflist
02:40:40  pbflist: shachaf Sgeo quintopia ion b_jonas Cale
02:41:36  huh?
02:41:47  https://pbfcomics.com/comics/cranky-baby/
02:42:14  remember when 192KiB was a lot?
02:44:22  (of RAM)
02:48:05  Vaguely, but I only really got started computing on a machine with 2MB of RAM.
03:00:01 -!- Taneb has quit (Quit: I seem to have stopped.).
03:01:43 -!- Taneb has joined.
03:01:55  wb Taneb 
03:45:01 -!- adu has joined.
04:47:51 -!- tromp has joined.
04:52:17 -!- tromp has quit (Ping timeout: 250 seconds).
05:29:32  new pbf?
05:30:06  huh, is pbf updating regularly again?
05:31:04  <3 <3 <3 https://pbfcomics.com/comics/command-respect/ <3 <3 <3
05:31:30  It's been updating irregularly for a while
05:32:49  Unless it's regular and I haven't noticed. I'm not sure the exact dates it's updated
05:33:36  okay
05:41:02  kmc: pigeon appreciation day
05:42:41  which day is that
05:42:46  every day
05:42:50  Nah, it's officially updating very irregularly.
05:42:54  june 13?
05:42:56  ok
05:43:41  also june 13
05:43:49  did you see the picture i sent you with all the pigeons
05:44:12  there were so many and they were all flying toward the food-or-something on the road
05:44:15  it was tg
05:44:40  i'm not sure
05:45:29  you sent me a heart so you probably saw it
05:45:32  ♥
05:46:15  k
05:46:23  heavy black heart
05:47:06  `quote very heavy
05:47:07  1333)  `unidecode ⧸🙼   ​[U+29F8 BIG SOLIDUS] [U+1F67C VERY HEAVY SOLIDUS]   it is with a very heavy solidus that i write to inform you that unicode has too many code points
05:47:27  maybe that should just say heavy black heart
05:47:39  whoa
05:47:46  that solidus didn't show up in mosh
05:47:49  but it's really heavy
05:51:28  the heavier the solidus the greater the sense of dread
06:03:23  shachaf: did you know that js console.log supports styling the log text?
06:03:25  console.log('%cscow', 'font-size: 80px; color: red');
06:06:18  I think I heard about that.
06:06:29  I think I decided that the less I have to deal with JavaScript the better?
06:08:30  At least in HTML it does. Node.js also has a console.log function but it works a bit differently. However, it is portable if you only pass a single argument, which is a string. Then it will work with both Node.js and HTML.
06:14:17  zzo38: true
06:17:04  what language should i program in
06:21:15  Depend what program you are going to write, I think.
06:22:33 -!- tromp has joined.
06:23:32 -!- tromp has quit (Read error: Connection reset by peer).
06:23:52 -!- tromp has joined.
06:28:23 -!- tromp has quit (Ping timeout: 252 seconds).
06:33:25  You can learn many different programming languages
06:33:35  kmc: pbf never stopped updating 
06:50:57 -!- tromp has joined.
07:19:26 -!- sebbu2 has joined.
07:23:21 -!- sebbu has quit (Ping timeout: 268 seconds).
07:23:28 -!- b_jonas has quit (Remote host closed the connection).
08:01:18 -!- tromp has quit (Remote host closed the connection).
08:04:28 -!- tromp has joined.
08:08:54 -!- adu has quit (Quit: adu).
08:23:39 -!- wob_jonas has joined.
08:27:03 -!- tromp_ has joined.
08:27:04 -!- tromp has quit (Read error: Connection reset by peer).
08:39:48 -!- cpressey has joined.
08:41:55 -!- Sgeo has joined.
08:43:04  Good morning. I guess the Prompt monad's not so strange after all. Of course, I say this after only reading & thinking about it, not really playing with it.
08:44:20  Uh oh.
08:44:28  I want to know about Prompt monads but I also want to go to sleep.
08:44:31 -!- Sgeo__ has quit (Ping timeout: 258 seconds).
08:44:35  I think I'll try sleep.
08:45:10  Good night shachaf !
08:45:18 -!- tromp_ has quit (Remote host closed the connection).
08:51:32 -!- Lord_of_Life has quit (Ping timeout: 268 seconds).
08:52:12 -!- Lord_of_Life has joined.
08:58:24 -!- tromp has joined.
09:00:50 -!- arseniiv has joined.
09:35:12 -!- craigo has joined.
09:44:15  what do you thin about the prompt monad
09:55:28  [[Von Neumann's 29-state cellular automaton]]  https://esolangs.org/w/index.php?diff=66040&oldid=57226 * B jonas * (+158) Neumann's article
09:59:00  rain1: Well, on the practical side of things, it looks like a good way to do "dependency injection" with monads.
09:59:14  The term dependency injection scares me
09:59:29  fear of needles?
10:19:58  hi
10:28:18  hi Lykaina
10:33:52 -!- Sgeo_ has joined.
10:37:07 -!- Sgeo has quit (Ping timeout: 245 seconds).
11:10:55 -!- Sgeo__ has joined.
11:14:36 -!- Sgeo_ has quit (Ping timeout: 268 seconds).
11:30:22 -!- Sgeo_ has joined.
11:33:34 -!- Sgeo__ has quit (Ping timeout: 258 seconds).
11:38:02 -!- craigo has quit (Ping timeout: 268 seconds).
11:48:37  [[Special:Log/newusers]] create  * Spleeshmicannon *  New user account
11:57:17  [[Esolang:Introduce yourself]] M https://esolangs.org/w/index.php?diff=66041&oldid=65976 * Spleeshmicannon * (+276) Added myself to the list
12:20:58 -!- sebbu2 has changed nick to sebbu.
12:27:49 * Lykaina forces herself awake.
13:01:21  [[Echidna]]  https://esolangs.org/w/index.php?diff=66042&oldid=66016 * B jonas * (+67) 
13:23:30  wob_jonas: thanks :)
13:24:28  working on splitting source files to make it easier to track changes
13:25:08  haven't pushed it yet
13:27:19  Lykaina: good. have you published the version of the interpreter that reads the program into memory yet?
13:28:38  yes, i pushed it
13:30:06  gave it a max of 64KiB (not including whitespace)
13:35:51  `olist 1179
13:35:53  olist 1179: shachaf oerjan Sgeo FireFly boily nortti b_jonas
13:59:09  wob_jonas: split version pushed
14:04:13  brb
14:19:49  back
14:23:12  hi wob_jonas 
14:36:14  [[User:Dtuser1337/Sandbox]]  https://esolangs.org/w/index.php?diff=66043&oldid=65945 * Dtuser1337 * (+1) /* Beginning of the Sandbox line */
14:39:02 -!- xkapastel has joined.
14:52:57 -!- Sgeo__ has joined.
14:54:38  hi Sgeo__ 
14:55:52 -!- Sgeo_ has quit (Ping timeout: 245 seconds).
14:59:35  wob_jonas: "short"ened the mem[] in the interpreter.
14:59:50  to save memory
15:02:13  it's supposed to be 2-byte, why not force it?
15:05:17  Lykania: good
15:05:23 -!- wob_jonas has quit (Remote host closed the connection).
15:07:24  gtg wake up
15:07:57 -!- Lykaina has quit (Quit: leaving).
15:10:52  [[Espro]] M https://esolangs.org/w/index.php?diff=66044&oldid=44540 * Timwi * (+4) gramatiko?
15:19:52 -!- Sgeo_ has joined.
15:22:34 -!- Sgeo has joined.
15:22:57 -!- Sgeo__ has quit (Ping timeout: 245 seconds).
15:25:35 -!- Sgeo_ has quit (Ping timeout: 268 seconds).
15:25:46  [[Espro]] M https://esolangs.org/w/index.php?diff=66045&oldid=66044 * Timwi * (+8) /* Examples / Ekzemploj */
15:42:25  [[Espro]] M https://esolangs.org/w/index.php?diff=66046&oldid=66045 * Timwi * (+7) /* Expressions / Esprimoj */
15:43:51  What is a prompt monad? What is its definition? (If I knew before, and I don't know if I have, I have forgotten now anyways)
15:49:02  zzo38: https://hackage.haskell.org/package/MonadPrompt-1.0.0.5/docs/Control-Monad-Prompt.html
15:49:19  It's sort of a "configurable monad"
15:50:23  The modern explanation would cast it as a flavour of the free monad.
15:52:23 -!- Sgeo_ has joined.
15:55:35 -!- Sgeo has quit (Ping timeout: 244 seconds).
15:57:10  int-e: It seems like a useful flavour, whereas "free monad" seems general enough to be (a) hard for me to fully appreciate and (b) not obviously a useful thing for me to employ in my code
15:58:40  I don't remember noq exactly how I came across Prompt, anyway.
15:58:45  *now
16:00:50 -!- Sgeo__ has joined.
16:02:56  cpressey: yeah the connection to free monads uses a fairly odd functor: http://paste.debian.net/1099707/
16:03:22 -!- Sgeo_ has quit (Ping timeout: 245 seconds).
16:03:22  cpressey: Also, the explanation is ahistorical; the prompt monad predates the free monad fad by a year or so.
16:06:44  cpressey: And personally I like the Prompt flabor a lot better than the free monad, because it expresses a familiar programming model: Define an interface for a DSL in terms of commands (with result types), and then handle each command in a handler (or several handlers).
16:08:15  This was all Ryan's work though. My contribution was the codensity transformation (that's an ahistorical explanation again).
16:08:52  Do you like my CodensityAsk monad? (I think the name isn't very good, but I couldn't think of a better name)
16:27:42  zzo38: I haven't seen it. Also, the Wikipedia entry on "codensity monad" is scary.
16:28:52  newtype Codensity f a = Codensity (forall r. (a -> f r) -> f r);
16:30:02  Sorry, that is not it. CodensityAsk is: forall r. f r -> (a -> r) -> r
16:30:12  So, it is a bit similar
16:33:20  newtype CodensityAsk w x = CodensityAsk { runCodensityAsk :: forall z. w z -> (x -> z) -> z };  also  Monad (CodensityAsk w)  and  Comonad w => MonadPlus (CodensityAsk w)
16:38:58  zzo38: I might let you know, in a few days.
16:40:32  I think I found Prompt via the operational package. I want to play with that a bit first.
16:43:02  int-e: btw, thanks for updating the solitaire game! You certainly didn't need to, but, I can confirm I'm able to build and run it now :)
16:45:39 -!- FreeFull has joined.
16:56:23 -!- cpressey has quit (Quit: A la prochaine.).
16:56:40 -!- Hooloovo0 has quit (Quit: Temporarily refracted into a free-standing prism.).
16:58:04 -!- Hooloovo0 has joined.
16:59:57 -!- b_jonas has joined.
17:14:07  see? another match. http://www.smbc-comics.com/comic/pocket https://xkcd.com/2130/
17:15:14  they're totally copying each other often
17:21:37 -!- xkapastel has quit (Quit: Connection closed for inactivity).
17:39:21  ``` for x in 30 35 40; do ftoc $x; done
17:39:22  30.00°F = -1.11°C \ 35.00°F = 1.67°C \ 40.00°F = 4.44°C
18:03:32  ftoc 0
18:03:38  `ftoc 0
18:03:39  0.00°F = -17.78°C
18:04:04  I still can’t wrap my head over that scale
18:05:13  it makes no sense hth
18:05:52  zzo38: I like your CodensityAsk monad.
18:09:16  me neither, which is why I use this calculator
18:14:16 -!- craigo has joined.
19:22:00 -!- diverger has quit (Ping timeout: 258 seconds).
19:23:42 -!- diverger has joined.
19:42:14 -!- Melvar has quit (Quit: WeeChat 2.4).
19:48:26 -!- Melvar has joined.
20:21:21 -!- ArthurStrong has joined.
20:29:07  Lykania: again, do not define global variables in a header file that you #include into multiple source files. especially not non-constant globals.
20:37:12 -!- imode has joined.
20:43:03 -!- orbitaldecay has joined.
20:48:00 -!- Phantom_Hoover has joined.
20:49:40 -!- Lord_of_Life_ has joined.
20:52:02  [[Aepoch]] N https://esolangs.org/w/index.php?oldid=66047 * Areallycoolusername * (+1026) Created page with "'''Aepoch'''is a [[Bully Automation]] made by [[User: Areallycoolusername|Areallycoolusername]]. It has some properties added to resemble the properties of a fractal.  == Spec..."
20:52:13 -!- Lord_of_Life has quit (Ping timeout: 246 seconds).
20:52:35 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
20:53:53  [[Aepoch]]  https://esolangs.org/w/index.php?diff=66048&oldid=66047 * Areallycoolusername * (+1) 
20:54:11  [[Aepoch]]  https://esolangs.org/w/index.php?diff=66049&oldid=66048 * Areallycoolusername * (-1) 
20:57:37  [[Aepoch]]  https://esolangs.org/w/index.php?diff=66050&oldid=66049 * Areallycoolusername * (+50) 
20:58:48  [[Aepoch]]  https://esolangs.org/w/index.php?diff=66051&oldid=66050 * Areallycoolusername * (+0) 
20:59:34  [[User:Areallycoolusername]]  https://esolangs.org/w/index.php?diff=66052&oldid=65378 * Areallycoolusername * (+13) 
21:00:56  [[Language list]]  https://esolangs.org/w/index.php?diff=66053&oldid=66038 * Areallycoolusername * (+13) /* A */
21:03:02 -!- ArthurStrong has quit (Quit: leaving).
21:21:04 -!- dingwat has quit (Quit: Connection closed for inactivity).
21:31:22 -!- Sgeo_ has joined.
21:34:34 -!- Sgeo__ has quit (Ping timeout: 246 seconds).
21:38:59 -!- tromp has quit (Remote host closed the connection).
21:40:43 -!- tromp has joined.
21:45:04 -!- imode has quit (Ping timeout: 246 seconds).
22:32:57 -!- FreeFull has quit.
22:37:25 -!- tromp has quit (Remote host closed the connection).
22:38:02  [[Special:Log/newusers]] create  * Lrsomas *  New user account
23:01:48 -!- Phantom_Hoover has quit (Read error: Connection reset by peer).
23:02:42 -!- Phantom_Hoover has joined.
23:08:41 -!- tromp has joined.
23:10:38 -!- b_jonas has quit (Quit: Lost terminal).
23:13:05 -!- tromp has quit (Ping timeout: 246 seconds).
23:14:45 -!- orbitaldecay has quit (Remote host closed the connection).
23:21:38 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
23:22:58 -!- arseniiv has quit (Ping timeout: 245 seconds).
23:23:54 -!- xkapastel has joined.
23:33:47 -!- imode has joined.

2019-09-10:

00:26:58 -!- Sgeo_ has quit (Read error: Connection reset by peer).
00:27:21 -!- Sgeo_ has joined.
00:55:33 -!- Lykaina has joined.
00:59:00  b_jonas: i don't know any other way
01:04:17 -!- ARCUN has joined.
01:05:49  By definition, a bully automaton is just an extension of a cellular automata
01:06:12  So would ALPACA still be viable to implement a bully automaton?
01:07:09  20:29:07  Lykania: again, do not define global variables in a header file that you #include into multiple source files. especially not non-constant globals.
01:08:16  any idea where else i should declare global variables?
01:08:32  and define
01:09:14  and what's the difference (in C) between declaring and defining?
01:10:56  A /definition/ of an identifier is a declaration for that identifier that: for an object, causes storage to be reserved for that object; --
01:11:29  Typically you'll have a declaration that's not a definition (such as `extern int x;`) in a .h file, and a corresponding definition (`int x = 123;`) in exactly one .c file.
01:11:54  why shouldn't they go in headers?
01:12:22  oh
01:12:29  Because if you have it in a header file, chances are that header file is going to be included in more than one translation unit, and then you end up with more than one definition for the same object, which is generally illegal.
01:12:33  (With some subtlety.)
01:12:49  b_jonas wasn't beclear enough
01:13:00  http://ix.io/1Mys (from the C99 rationale) explains it better than I could.
01:13:58  ...well, "better" is subjective. But definitely in more detail.
01:14:35  In particular, it goes into the detail of what the standard model is, and what happens in practice on many implementations.
01:15:43  C looks so simple from the outside, yet it's actually quite complex
01:16:46 -!- pikhq has joined.
01:17:09  Its subjective, but C++ just looks more natural to learn for me
01:17:36  Which is weird, since my first language was C#
01:17:38  I guess it has at least the benefit of nobody accidentally thinking it's simple.
01:18:30 -!- pikhq_ has quit (Ping timeout: 258 seconds).
01:21:38 -!- ARCUN has quit (Remote host closed the connection).
01:22:56 -!- ARCUN has joined.
01:23:17  fizzie: can you look at the echidna repo and find the problem b_jonas is complaining about?
01:23:42  i mean, it's location
01:23:43  So, again, is ALPACA viable for the implementation of bully automaton?
01:25:01  Lykaina: I assume they might've been talking about globals.h, and/or argnums.h.
01:28:30  A declaration of the form of `unsigned long progindex;` is what's called a /tentative definition/, which (if a translation unit has no actual definition) is treated as if there was a definition like `unsigned long progindex = 0;` in the translation unit. So if globals.h is included in, say, cmds.c and main.c, both will have a definition for it, which is not strictly conforming C.
01:29:33  Assuming they end up in the same program, anyway.
01:31:24  ("If an identifier declared with external linkage is used in an expression (other than [unrelated exception]), somewhere in the entire program there shall be exactly one external definition for the identifier; otherwise, there shall be no more than one.")
01:34:03  Many implementations are in practice more relaxed than that and allow multiple definitions esp. as long as they don't have an initializer, but that's just a common extension and not guaranteed by the standard.
01:36:51  A strictly conforming program could, for example, have a globals.h with `extern unsigned long progindex;`, and then either in a dedicated globals.c, or in some other one .c file where it makes sense, include an `unsigned long progindex;` to provide the "exactly one" definition required for it.
01:37:34  (A lot of people would prefer to avoid global state entirely, but that's more of a design question than a correctness question.)
01:38:09  look now
01:38:30  i just pushed what i think is a fix
01:39:17  I don't have any complaints about that one, at least on a quick glance.
01:39:31  so it's better?
01:39:45  Yes, assuming I've interpreted b_jonas's criticism right.
01:39:52  Except that it's exceedingly strange to put header guards *outside* the header files.
01:40:38  oops
01:40:44  i'll fix that
01:41:28  Also, it's safe to include standard headers like  multiple times. It doesn't hurt to guard against that, but you don't need to unless you want to.
01:41:58  ("Standard headers may be included in any order; each may be included more than once in a given scope, with no effect different from being included only once, except [a niche thing].")
01:44:37  pushed
01:47:00  Well, I mean... normally you'd have   #ifndef H_DEFINES  #define H_DEFINES   as the first two lines of defines.h itself, and an   #endif   as the last line. That way all the different places where it's included won't need to (a) remember to wrap the #include in a #infdef-#define-#endif sequence, and (b) coordinate what the name used for the header guard is.
01:48:15  oh
01:49:21  Of course from the compiler's perspective there's no difference whether those are inside the .h file or around the #include statement, it just treats the whole thing as a sequence of lines. It's just a convenience thing.
01:49:27  do i need to have the license in every file or just in the LICENSE file?
01:50:49  #pragma once
01:50:49  !
01:51:11  I'm not qualified to give legal advice, and I've seen both done.
01:51:11  what's that?
01:51:19  It's another nonstandard extension.
01:52:12  kmc: what are you asking me to change?
01:52:55  no
01:52:58  i was just saying
01:53:06  that you can use #pragma once instead of include guards
01:53:16  if all the compilers you want to use support it
01:53:22 -!- MDude has quit (Ping timeout: 245 seconds).
01:53:22  it's faster and less error-prone
01:53:37  I wouldn't. But it's true, you definitely can.
01:53:48  faster because, as soon as a header has been seen to have #pragma once, the compiler will not even bother reading it again
01:54:06  although I think these days compilers also detect include guards and treat them similarly
01:58:43 -!- ARCUN has quit (Ping timeout: 260 seconds).
01:58:46  aiui what kmc said
01:59:14  the main advantage of #pragma once is not having to pick an include guard format
01:59:45  I have actually had issues with include guard name collisions once or twice
02:03:01  Regarding the performance question, https://gcc.gnu.org/bugzilla/show_bug.cgi?id=58770
02:05:12  As for the correctness question, I understand a number of implementations have had issues determining what exactly is the same file, given symlinks and all that.
02:07:23  Although you can very reasonably say that you've got bigger problems if, in a single build operation, the same header file is reached via two unrelated paths.
02:08:14  it probably happens
02:10:00  pushed
02:10:15  fizzie's advice
02:14:02 -!- imode has quit (Ping timeout: 246 seconds).
02:16:52  Should probably have a look at what this language is all about in the first place. Does it have anything to do with the spiky mammals or is that just a name?
02:17:02  name
02:19:22  Aw. They're pretty cute.
02:19:33  fizzie: http://sif.lesidhetree.com/sara/echidna/echidna_v0_02a2.pdf
02:22:07  [[NotBrainFuck]] N https://esolangs.org/w/index.php?oldid=66054 * Spleeshmicannon * (+1325) Created page with "'''NotBrainFuck''' (or not brainfuck) is an extension of brainfuck by Jack Benson ([[User:Spleeshmicannon|Spleeshmicannon]]). It adds 8 new symbols to make it easier for begin..."
02:26:44 -!- xkapastel has quit (Quit: Connection closed for inactivity).
02:34:30  fizzie: Echidna was originally designed to be run on an Arduino, but memory requirements eventually made this unfeasable, with the Arduino version being shelved.
02:35:26  I then modified the PC version to use far more memory.
02:36:57  eventually, i figured out how to load the file into ram and run the program from there
02:37:50  there are 20 Ops, from G - Z
02:39:24  the interpreter has problems with the if/while loops on while mode that i am unsure how to debug
02:42:31  at the moment, i feel it's lacking in ops, and i think i can be willing to have ops 0-9 and A-F if needed (i wanted to not use those)
02:44:15  any questions?
02:48:03  Not at this point, because I have to sleep instead. But I like the L operation, it kind of reminds me of INTERCAL's "select" operator.
02:48:42  Finally! Someone who likes L!
02:57:08  kmc: even though it doesn't have "pragma", how do you feel about Echidna?
02:57:41  (not sure if you are still active)
02:58:52  i don't know anything about echidna
02:59:21  wait what does arg1<=1 do in L?
02:59:25  read whan i told fuzzie
02:59:44  http://sif.lesidhetree.com/sara/echidna/echidna_v0_02a2.pdf took me a while to find it
02:59:56  might want to put that on the esolang wiki or the github
03:00:31  (was just in scrollback but /me never reads that far
03:01:39  oh <<=
03:40:13 -!- imode has joined.
04:06:56 -!- tromp has joined.
04:11:18 -!- tromp has quit (Ping timeout: 246 seconds).
04:14:20 -!- ais523 has joined.
04:15:03   do i need to have the license in every file or just in the LICENSE file? ← I don't know whether or not it's legally necessary to put the license in every file, but a) it doesn't hurt and b) there are a lot of good practical reasons to do it that way
04:15:27  if you're using a license written professionally, it'll normally have an appendix giving approved wording to place in every file (which is shorter than the license itself)
04:37:17 -!- ais523 has quit (Quit: quit).
05:15:09 -!- MDude has joined.
05:54:54 -!- tromp has joined.
05:59:38 -!- tromp has quit (Ping timeout: 276 seconds).
06:31:56 -!- tromp has joined.
07:43:15 -!- Frater_EST has joined.
08:00:47 -!- cpressey has joined.
08:08:50 -!- imode has quit (Ping timeout: 240 seconds).
08:15:31 -!- Phantom_Hoover has joined.
08:40:52 -!- grumble has quit (Ping timeout: 622 seconds).
08:42:05 -!- wob_jonas has joined.
08:43:16  Lykiana: https://esolangs.org/logs/2019-09-07.html#lrh
08:43:31  about global variables
08:44:08  `5 w
08:44:14  1/1:mother//A mother is a person who practices mothology. \ dc//dc is short for "dump core". (try it out yourself: dc -e '[') \ wat//ኢትዮጵያ ውስጥ የሚሰራ የምግብ አይነት ሲሆን፣ የሚሰራውም ከጤፍ ነው። \ atwp//According to Wikipedia, ATWP means "Air Transport White Paper". \ mussel//Mussels are boily's natural enemies. Fortunately he runs faster than them.
08:44:34  Lykaina: ^
08:44:47  i agree on wat
08:45:15  iirc globals.h was included to two C source files
08:48:09  I should figure out a way to make global variables work across .so reloads.
08:52:08 -!- Lord_of_Life has quit (Ping timeout: 245 seconds).
08:53:21  ais523: whether there's a separate long license and you only include a short text and reference to it, or whether there's a short license that you include in full, also seems to be a matter of taste between licenses. 
08:54:52 -!- Lord_of_Life has joined.
08:54:58 -!- tromp has quit (Remote host closed the connection).
08:55:51  The X11 license, most BSD-like licenses, and the boost license are short enough, and at least the FAQ https://www.boost.org/users/license.html considers this an advantage. I personally don't like the boost license though because it doesn't mention a time limit or geograhpical area (eg. "worldwide perpetual").
08:58:17  Whereas the apache license, which is pretty similar to the boost license, is too long to embed into every source file, so for that, they use just a short version with reference in source files.
08:59:07  In effect, the short licenses don't tend to work, because many project derive parts from code with various other licenses, so they have to include a separate notice anyway to tell which part comes with what license.
08:59:38  the wtfpl works
09:00:37  This is especially typical for big amalgam projects like ffmpeg and mplayer, each of which embed like a hundred codecs and a large part of each other (it's a miracle that they haven't yet blown up exponentially by recursively embedding each other).
09:02:58  Similarly the creative commons licenses are also too long to embed.
09:06:02  The MIT license requires that you include it, so all the projects that have only a one-line statement to the effect of "License: MIT" aren't actually under the MIT license.
09:06:20  And y'know what? This matters almost not at all
09:08:49  cpressey: sure, even the short disclaimers are always at least a few lines long, except for the ones that are equivalent to the WTFPL, such as the sqlite non-license.
09:10:09  I like the irony though.
09:10:11  The short form reference to the apache license is 15 lines long
09:12:49  cpresseyllo
09:12:58  What's the Prompt thing you were talking about the other day?
09:13:50  But that's still shorter than the 24 long line boost license 
09:14:15  shachaf: https://hackage.haskell.org/package/MonadPrompt-1.0.0.5/docs/Control-Monad-Prompt.html
09:14:31  cpressey: It's not related to delimited continuations
09:14:43 * cpressey frowns
09:15:05  shachaf: It's not related to delimited continuations
09:15:47  Perhaps I should say, it's not *obviously* related to delimited continuations
09:18:00  Oh, that thing.
09:19:34  It's "just" the free monad, right?
09:19:42  Or the free monad of Coyoneda of f.
09:20:35  shachaf:  cpressey: yeah the connection to free monads uses a fairly odd functor: http://paste.debian.net/1099707/
09:21:58  (maybe you can make more sense of that than I can)
09:25:21  Yes, that functor is sometimes called Coyoneda.
09:25:30  It's the free functor on a type constructor, if that means something to you.
09:25:44  Not really, sorry
09:26:33  OK. It's not that useful a statement anyway.
09:27:05  If my computer wasn't presently so slow I could type a better explanation. One moment.
09:27:08  scary
09:27:28 * Lykaina wakes
09:27:31  brb
09:28:39  Hmm, I'll just try anyway.
09:29:32 -!- tromp has joined.
09:29:50  Lykania: I haven't yet looked at how you're now reading the source code into memory and how you use it, or changing the data memory to 16-bit, so I can't comment on that yet
09:30:42  i am doing the global variable thing now
09:30:51  cpressey: I don't remember how much Haskell you know.
09:31:24  The type is this: data Coyoneda f a = forall x. Coyoneda (f x) (x -> a)
09:31:43  and using the kind of header guards that go on top and bottom of every header file
09:36:07  It's about fmap fusion, or something.
09:36:27  It turns (fmap f . fmap g . fmap h) into fmap (f . g . h)
09:36:58  back
09:39:07  i meant that, at the moment, Echidna uses the global variable suggestion and the kind of header guards that gow on top an bottom of each header file.
09:49:22  README.md pushed
09:57:30  [[Echidna]]  https://esolangs.org/w/index.php?diff=66055&oldid=66042 * Lykaina * (+434) Updating the info to match the Github README.
10:10:04  README.md pushed again
10:10:47  shachaf: I don't really know Haskell, in the sense that I've never built up good intuitions about anything in its type system.
10:12:12  I still don't really know what a monad is.
10:12:28  `? monad
10:12:30  Monads are just monoids in the category of endofunctors.
10:12:30  `? burrito
10:12:31  Burritos are like Monads, according to Joe. See https://byorgey.wordpress.com/2009/01/12/abstraction-intuition-and-the-monad-tutorial-fallacy/
10:12:43  `quote burrito
10:12:44  875)  btw, I finally discovered what a burrito was, recently   they're kind of nice to eat   but don't really resemble monads \ 908)  well what is time   imo: an illusion [...]  elliott, I think it's more like a burrito   If you have too much of time you get ill   But damn it felt good   You only get out what you put in, unless your time was made by someone else, which isn't as fun   yeah, wisdom doesn't know either
10:14:26  I read an article explaining how they're monoids in the category of endofunctors, and *while reading* that article, I could see it. But it doesn't stick.
10:15:21  cpressey: that said, apparently to program haskell, you don't have to know what monads are in full generality. you just have to understand the dozen common monads and the dozen common monad transformers and how they combine.
10:17:20  You don't *have* to use monads at all when writing in Haskell, except to do I/O, which you can save til the end and treat as a magical invokation.
10:17:55  You don't even really need to know that IO is a monad
10:18:43  cpressey: have you tried reading You Could Have Invented Monads?
10:19:40  Taneb: Once, a long time ago. It doesn't stick.
10:19:44  i read cakes, custard and category theory
10:19:48  cpressey: "save til the end" in what sense? you may want to use interactive IO
10:19:58  myname: recent editions changed the name to How To Bake Pi
10:20:13  In case you're recommending people go out and buy a copy
10:20:14  [[NotBrainFuck]] M https://esolangs.org/w/index.php?diff=66056&oldid=66054 * A * (-110) Here you go
10:20:28  okay
10:20:34  and of course some programs are easier to write if you do use the ST monad, to be able to prove that a function is pure even if it uses certain impure internals
10:20:43  (as in mutable arrays)
10:20:48  (I have a copy of Cakes, Custard and Category Theory but I haven't read it yet)
10:20:58  wob_jonas: You don't *have* to use interactive IO to write, say, a compiler
10:21:11  it's not that deep a read
10:21:36  cpressey: sure you do, at least if it's a compiler for a language where files can include other files and you don't know which files in advance
10:21:40  Yes but I keep wanting to follow along with the exercises and that means going to the shop and buying ingredients
10:22:06  that includes not only preprocessor includes, but indirect linker dependencies 
10:23:09  wob_jonas: So your argument is that you have to understand a dozen common monad transformers in order to program in Haskell because the compilers you write in Haskell are necessarily ones with #include statements
10:23:32  cpressey: and if you have a compiler where you aren't sure that it can't be very slow (or infinitely slow) for some input files, then it may be better to write error/warning messages early, before you finish compiling everything
10:24:06  cpressey: no, that's not my argument. my argument is that you don't always write compilers, so it's worth to understand at least how to use IO interactively;
10:24:34 -!- grumble has joined.
10:24:40  and that I want to use mutable arrays for efficiently, for which it's worth to understand ST to be able to use them inside pure functions in a way that the compiler can prove safe.
10:25:13  you probably aren't required to use the other monads or monad transformers directly.
10:25:14  wob_jonas: Right, well as I said, I *don't* understand them. It doesn't stick. Should I stop programming in Haskell?
10:25:24  obviously you'll use lists, but not specifically their monad instance.
10:25:54  cpressey: no, because if you stop then you'll probably never understand them, unless you program something very similar to haskell instead
10:26:21  wob_jonas: It's been 10 years. I don't have any reason to assume I'll ever understand them.
10:26:45  Do you need to understand them to use them?
10:27:21  cpressey: how about the special case of IO where you glue a >>= onto every IO primitive (except the ones that terminate the program), but don't use >>= with a composed value on the left?
10:27:42  More like 12 years: I wrote this in 2007: https://github.com/catseye/Hev/blob/master/src/Hev.hs
10:27:58  Oh, apparently I started it in 2005, so: 14 years.
10:28:45  Doesn't use a single monad, except in the driver code that reads cmdline arguments and the input file and outputs the result.
10:30:14  cpressey: have you written code in non-haskell languages that does interactive IO in an event-driven continuation-passings style where you write explicit continuations to run when an event fires, instead of language support for threads with blocking IO?
10:31:21  because as far as I understand, if you do that style consistently so that you do it for every IO operation, even for ones that don't block or the ones that only count as IO in haskell (i.e. accessing mutable state), you get IO monad with >>= only on the right of primitives
10:31:44  at least that's how I understand IO, but it could be wrong, or it could be just one of the many food metaphors for IO
10:32:04  cpressey: I think Haskell people typically say "monoid in the category of endofunctors" as a joke to try to make things complicated?
10:32:25  It's not very complicated but also not very helpful.
10:32:27  maybe someone who understands haskell a bit more can tell me whether that's a reasonable way to think of it
10:32:39  Anyway this is irrelevant for Coyoneda, which is a pretty simple type.
10:32:44  shachaf: yes, I think that's intended as a joke
10:32:48  lol
10:33:00  "pretty simple type"
10:33:08  wob_jonas: Yes, that's pretty reasonable.
10:33:29  I once wrote this: https://stackoverflow.com/a/13538351
10:35:59  shachaf: oh wow, that mentions that IO mechanism that I've only seen in that one crazy esolang
10:36:22  wob_jonas: is that crazy esolang called Haskell?
10:37:09  https://esolangs.org/wiki/Lazy_K
10:37:22  Taneb: no, Haskell has a different IO mechanism
10:37:43  which that writeup also mentions
10:37:52  (what a surprise)
10:39:15  shachaf: ok, but that doesn't seem to explain how you can write IO as an abstraction of ContIO. is there an explanation for that somewhere?
10:39:39  wob_jonas: Lazy K has the same IO mechanism as Real Fast Nora's Hair Salon 3: Shear Disaster Download
10:40:31  Taneb: ok, then it's two crazy esolangs
10:40:34 -!- arseniiv has joined.
10:40:40  fair enough
10:40:46  And it's fairly similar to Binary Lambda Calculus
10:40:58  (which uses strings of bits, I believe, rather than characters or codepoints)
10:41:55  ok, I think if I saw that esolang, it didn't stick in my head
10:42:16  or in my hair or whatever
10:42:41  Yeah, it has a hard to remember name
10:43:31  And it's not particularly original
10:47:12  wob_jonas: explicit continuations on event handlers sounds like Javascript with Promises.
10:47:55  [[Vafix]] N https://esolangs.org/w/index.php?oldid=66057 * A * (+205) New unimplemented thought experiment
10:52:24  In a programming lanugage strictly following the actor model, how is input (e.g. command line input, key presses) handled?
10:52:59  Some sort of special actor?
10:53:01  I don't know what the actor model is
10:53:21  but sure, if it's foo-oriented then keypresses are probably a kind of foo
10:53:25  https://en.wikipedia.org/wiki/Actor_model
10:53:50  wob_jonas: What do you mean?
10:54:37  Taneb: is that like holywood actors who must look as beautiful as a fashion model all the time?
10:55:00  wob_jonas: I think it's more like models who gain popularity and want more money sometimes start acting too
10:55:01  Taneb: I can put it this way: if I were designing an actor language, I'd make the source of keystrokes an actor
10:55:29  That said, in Erlang, iirc,it's not like that, you just call io:readln() like everyone else
11:04:06  I can see having to look at all I/O like you're writing Promises in Javascript (I guess) but it escapes me why anyone would want to model *non*-I/O things like that.
11:05:52  Not too long ago, I saw a unification algorithm written in Haskell, built with a state monad.
11:05:55  whyyyyyyyyyyyy
11:06:06  cpressey: that's actually two steps. firstly they model not just interactive blocking IO, but every IO, even the ones that can't block, as the same sort of IO action;
11:06:15  then they model access to mutable state the same way
11:06:44  and inter-thread synchronization as well
11:07:35  but I think the reason is always that they want the language to be pure functional
11:08:01  with every function being deterministic and side-effectless
11:08:35  A language that's pure functional, where every library has an interface that mocks an effectful language.  Again I ask: whyyyyyyy
11:09:14  it would just be a different language without. if you don't like it, use ocaml or rust or something.
11:09:28  and that applies to me, I don't use haskell for anything anymore
11:09:40  (well, except some lambdabot one-liners or something)
11:10:20  I do like it, though, because it's essentially the only popular language that actually is purely functional.
11:10:57  but if you do want a purely functional language, then you need to have those abstractions over everything that isn't purely functional
11:10:59  If users of the only popular language that's purely functional write their algorithms in terms of state mutation, maybe that means those algorithms are best expressed as state mutation.
11:11:44  shachaf: at least if you care about real-world efficiency
11:12:21  or interaction with anything outside the program
11:15:28 -!- Phantom_Hoover has quit (Ping timeout: 245 seconds).
11:29:30  Well, I don't, so, until a better language comes along, I'll just learn to live with the alienation, I suppose.
11:34:28  you could just use a language that isn't pure functional, but use the pure functional subset for much of your code
11:35:20  I do that sometimes with Scheme.
11:35:50  do you do it with ocaml?
11:36:11  I don't write OCaml.
11:39:58  Well, at least I understand continuations. I think.
11:40:05 * cpressey goes for a walk
11:40:15  whoa, more schema incompatibility
11:40:25  only forwards, not backwards
11:40:34  or wait
11:40:44  which one is backwards compatibility and which one is forward compatibility?
11:40:52  I think it's only backwards, not forwards
11:43:08 -!- Frater_EST has quit (Ping timeout: 246 seconds).
11:50:29  hmm no
12:13:05  [[Vafix]] M https://esolangs.org/w/index.php?diff=66058&oldid=66057 * A * (+659) 
12:16:24  On a positive note, a nonstandard formulation of function composition that I came up with for an experimental concatenative language I'm working on, does appear to be associative and have an identity. So I'll be able to keep working on that.
12:17:31  cpressey: that sounds scary
12:19:07  but then, I guess, any monoid operation can be thought of as function composition of the bound products with elements of the monoid
12:19:28  also known as "every group is a permutation group"
12:20:21  [[Vafix]] M https://esolangs.org/w/index.php?diff=66059&oldid=66058 * A * (+1103) 
12:28:28  [[Vafix]] M https://esolangs.org/w/index.php?diff=66060&oldid=66059 * A * (+1031) /* Execution scheme */ More of the execution
12:28:46 -!- Frater_EST has joined.
12:34:15  [[Vafix]] M https://esolangs.org/w/index.php?diff=66061&oldid=66060 * A * (+585) Complete odd process
12:36:55 -!- grumble has changed nick to \emph{grumble}.
12:37:57 -!- FraterEST has joined.
12:38:23 -!- Frater_EST has quit (Ping timeout: 268 seconds).
12:40:25  [[Vafix]] M https://esolangs.org/w/index.php?diff=66062&oldid=66061 * A * (+564) 
12:57:10  I found the unification algorithm I mentioned above, if anyone is interested: https://github.com/parsonsmatt/unification/blob/master/Unification.pdf
13:16:50 -!- atslash has joined.
13:16:54  [[Vafix]] M https://esolangs.org/w/index.php?diff=66063&oldid=66062 * A * (+370) /* Vafix in comparision with a normal infix */
13:32:01  gtg wake
13:33:20 -!- Lykaina has quit (Quit: leaving).
13:52:54 -!- sprocklem has quit (Ping timeout: 258 seconds).
14:07:08 -!- wob_jonas has quit (Ping timeout: 276 seconds).
14:16:19 -!- Lykaina has joined.
14:26:11  [[Encapsulation]]  https://esolangs.org/w/index.php?diff=66064&oldid=66039 * A * (+100) /* Computational class */
14:26:23 -!- rain2 has joined.
14:28:13 -!- rain1 has quit (Ping timeout: 244 seconds).
14:35:27 -!- sebbu has quit (Ping timeout: 244 seconds).
14:36:25 -!- sebbu has joined.
14:51:42  hi
14:52:18  just seet up email filters for the annoying github alerts i actually want
14:56:14  [[Vafix]] M https://esolangs.org/w/index.php?diff=66065&oldid=66063 * A * (+32) /* Vafix in comparision with a normal infix */
14:58:29  [[Vafix]] M https://esolangs.org/w/index.php?diff=66066&oldid=66065 * A * (+358) /* Parentheses and rules */
14:58:41  [[Pxem]]  https://esolangs.org/w/index.php?diff=66067&oldid=65944 * YamTokTpaFa * (+96) /* Examples */
15:00:09  [[Vafix]] M https://esolangs.org/w/index.php?diff=66068&oldid=66066 * A * (+165) 
15:06:56 -!- Lord_of_Life has quit (Ping timeout: 276 seconds).
15:12:07 -!- Lord_of_Life has joined.
15:12:37 -!- cpressey has quit (Quit: A la prochaine.).
15:21:13  [[Talk:Pxem]]  https://esolangs.org/w/index.php?diff=66069&oldid=61433 * YamTokTpaFa * (+535) /* About unclear conditional looping instructions. */ new section
15:29:03 -!- FraterEST has left.
15:46:07 -!- tromp has quit (Remote host closed the connection).
15:46:42 -!- tromp has joined.
15:48:19 -!- craigo has quit (Ping timeout: 268 seconds).
15:53:30 -!- andrewg12 has joined.
15:53:37  h
16:00:09  hi andrewg12 
16:00:58  sup
16:02:50  so used to using linux with it's multiple desktops that when i use windows it gets harder
16:03:26  keep doing ctrl-alt-left
16:03:47  which is something different in windows
16:04:12  i dunno
16:04:15  i prefer windows
16:04:37  i prefer linux
16:06:05  o
16:11:49  sigh: https://devtalk.nvidia.com/default/topic/1052743/linux/what-is-nv_queue-and-why-is-it-the-top-process-on-my-system-/ (solution: don't look at top)
16:36:43 -!- FreeFull has joined.
16:48:00  Another bad idea: watching open network connections while firefox is open with nothing but a blank page. Wtf are you doing, Firefox?
16:50:27  This may be too much to expect, but why can't we make a browser that, when starting up on a blank page, makes zero network connections?
16:51:05  zzo38: don't answer that. It's a rhetorical question.
16:53:32  [[Arch]]  https://esolangs.org/w/index.php?diff=66070&oldid=64661 * Areallycoolusername * (+0) /* Pop */
16:53:43  [[Arch]]  https://esolangs.org/w/index.php?diff=66071&oldid=66070 * Areallycoolusername * (+0) /* Point */
16:53:57  [[Arch]]  https://esolangs.org/w/index.php?diff=66072&oldid=66071 * Areallycoolusername * (+0) /* Cells & Split */
16:54:52  [[Arch]]  https://esolangs.org/w/index.php?diff=66073&oldid=66072 * Areallycoolusername * (-1) /* Properties */
16:58:50  [[///]]  https://esolangs.org/w/index.php?diff=66074&oldid=65775 * CarlosLuna * (+1469) Adding the "Unary to binary conversion" example.
17:06:07 -!- Phantom_Hoover has joined.
17:21:17  int-e: I had a somewhat similar feeling as the nv_queue for kidle_inject.
17:29:37  hello
17:29:45  Hi
17:30:55  what about the language or
17:32:28  The Languages.
17:37:08  meh: https://bugs.debian.org/cgi-bin/bugreport.cgi?bug=842292
17:37:42  anyway... the most suspicious looking connection was the captive portal detection
17:39:50  From here I get  detectportal.firefox.com = CNAME detectportal.prod.mozaws.net = CNAME detectportal.firefox.com-v2.edgesuite.net = CNAME a1089.dscd.akamai.net = 46.125.232.9 or 46.125.232.24; these resolve back to 046125232009.public.t-mobile.at and 046125232024.public.t-mobile.at respectively.
17:40:44  Which is not the kind of host name I wanted to see my browser connect to unasked.
17:41:18 -!- imode has joined.
17:52:02 -!- imode has quit (Ping timeout: 240 seconds).
17:54:25  And wtf is push.services.mozilla.com good for, aside from giving Mozilla information on how long people keep their browsers open?
17:55:03  nothing
17:55:07  (It can be disabled. But this is the kind of thing I want to be opt-in, not opt-out. At which point it's clear that software developers shouldn't bother with it in the first place.)
18:00:26 -!- Sgeo__ has joined.
18:03:59 -!- Sgeo_ has quit (Ping timeout: 268 seconds).
18:16:52  ow, libnss is big... I guess I don't want to rebuild that myself just to see what's inside those https connections :/
18:16:59 -!- imode has joined.
18:38:30  [[Special:Log/newusers]] create  * Visual-mov *  New user account
18:44:22 -!- andrewg12 has quit (Remote host closed the connection).
18:46:17  int-e: Is that the thing the Web Push API on Firefox uses? 
18:47:37  fizzie: Shouldn't that be up to the particular website?
18:48:12  I don't know, that's why I asked.
18:48:13  fizzie: I'd think this is a particular push service just for firefox itself, for bs like studies.
18:48:28  I see.
18:48:43  But it's a guess; I have not done any research on it.
18:48:43  Presumably also for pushing updates to their tracking blacklists and that sort of stuff.
18:49:04  https://wiki.mozilla.org/CloudServices is "delightedly whimsical".
18:49:41  "Tracking Protection" ... I almost laughed.
18:50:22  int-e: What do you think of this Coyoneda type?
18:50:34  Other than "a fairly odd functor".
18:51:08  shachaf: nothing
18:51:36  That makes sense.
18:52:01  I think it's a neat trick that comes up in multiple contexts, not just this Prompt monad.
18:52:43  I tend to think of that stuff very concretely, in terms of continuations.
18:53:51  (Obviously it's not a useful trick because it's just Haskell nonsense.)
18:54:16  (Or maybe it is useful? I'm skeptical.)
18:54:49  I also wrote "Codensity transformation" the other day but when I did it, I did a CPS transformation with several continuations.
18:57:38  Well, the Codensity transformation is the same as the CPS transformation.
18:57:51  I wasn't even conscious of the fact that (a -> r, b -> r) is isomorphic to Either a b -> r (ignoring bottoms)
18:58:07  shachaf: Yeah but the latter term makes sense!
18:59:03  It's meaningful, it can be decomposed into subconcepts. "Codensity" is just nonsense.
19:01:28  Unfortunately the nonsense has taken over the Haskell community. :P
19:08:05 -!- Lykaina has quit (Quit: leaving).
19:10:11 -!- Phantom_Hoover has quit (Read error: Connection reset by peer).
19:22:28 -!- b_jonas has joined.
19:24:48  Lykania: I recommend https://virtuawin.sourceforge.io/ , a software that lets you use virtual desktops in windows and set up your favourite keyboard shortcuts
19:27:34  int-e: re browser and connections, https://twitter.com/jonathansampson/status/1166005813548396549 , also try the debian version, it does 20% less connections because debian patched it so that the favicons for the search websites in the search bar menu are installed with the browser rather than downloaded
19:30:19 -!- Phantom_Hoover has joined.
19:33:25  fizzie: you were right, this is connected to the service worker push api.
19:33:59  b_jonas: I'm using the debian version already.
19:35:12  Oh well. Service workers are another thing that has no right of existing in the first place.
19:36:07  I guess you could set up your own personal push service and use that to alleviate the tracking concerns.
19:38:59 -!- ArthurStrong has joined.
19:39:49  int-e: ok, then imagine that backwards. be glad you're not using the vanilla version, because that does 20% more connections.
19:44:17  the tweet I linked to measures the windows version
19:50:47  b_jonas: reading your thread. "[...] is a feature that allows Mozilla to change the default value of a preference for a targeted set of users [...]" is so ominous.
19:52:42  int-e: it's not my thread
19:54:22  ah. okay, then the thread you linked to (the Firefox subthread in particular.)
19:57:02  b_jonas: the funny thing about the quote is that its' from Mozilla themselves
19:57:18  Or maybe it's worrying rather than funny. Let's call it interesting.
19:57:51  int-e: that means sometimes they say things about what their browser is doing. what a weird concept for software
20:00:04  Ah. "Normandy manages recipes of changes to make to Firefox, including temporary studies, user surveys and controlled rollout of new features."
20:00:20  Clearly another thing to disable.
20:00:37  I miss Iceweasel.
20:00:56  (But maintaining the thing must've been a lot of work.)
20:00:58  [[Echidna]]  https://esolangs.org/w/index.php?diff=66075&oldid=66055 * Lykaina * (-90) Updating documentation.
20:01:01  int-e: debian's firefox is iceweasel. it's the same thing, they just decided it's safe to use the firefox brand name
20:01:11  and they do disable some firefox features
20:01:23  Not enough, apparently.
20:01:35  yes, admittedly they do have a hard time keeping up with all the stuff that mozilla adds to firefox
20:01:50  it's not a sw that anyone enjoys to package
20:02:09  even making it compile is basically impossible
20:04:42 -!- Lykaina has joined.
20:05:27  Also, how many IDs does Firefox have for a single profile...
20:05:35  patched the If/While bug!
20:05:47  Lykaina: nice
20:06:01  Lykania: I recommend https://virtuawin.sourceforge.io/ , a software that lets you use virtual desktops in windows and set up your favourite keyboard shortcuts
20:06:18  thanks
20:08:15  Normandy has one. The push service has one. The activity stream of the default new tab page as one. Telemetry has its own id as well, it seems (and why is that even set when Debian disabled the telemetry feature?!).
20:08:22  I don't like what I see.
20:08:33  i rewarded myself by upping the version to 0.03a0
20:13:06  brb
20:20:54  b_jonas: the thing is, the *right* way to disable all these things is to rip out the code in question, which is a maintenance nightmare, and will upset users who have different ideas about usefulness.
20:21:19  (For example I'd rip out the Gollum feature ("pocket"), but I imagine some people find it useful.)
20:22:23  (This association is a bit unfair because the pocket in question was really Frodo's.)
20:22:26  int-e: like I said, the original codebase is already almost impossible to build. it may be harder to build than glibc, which is impressive. if they manage to successfully rip out the right pieces, it may become slightly less hard to build, so it may be less of a maintenance nightmare than you think.
20:23:04  int-e: isn't the pocket at the mozilla servers (frodo) and you the user of pocket are on your computer (gollum)?
20:23:12  but you want the thing in frodo's pocket?
20:23:18  well not you int-e, but the people who ise it
20:23:56  back
20:25:00  int-e: hmm, how about Han Solo then? https://scifi.stackexchange.com/q/145117/ 
20:25:17  wrong franchise, never cared much about it
20:32:02 -!- imode has quit (Ping timeout: 240 seconds).
20:36:00  yeah, Gollum is better
20:37:44  i need to know: what is my language missing?
20:39:42  it's something opvious, i'm just blanking out on it
20:40:34  Lykaina: nothing, I think it has all the operations you need. although I haven't checked the modified implementation yet.
20:42:27  really, it has arithmetic, flow control, interactive IO, and now array access too, that's enough for anything reasonable
20:42:48  the array access part is important, you can't really do without
20:43:19  if the interpreter works correctly, then it's a fine general purpose language
20:43:43  a low-level one that you want to compile to and use a generous library of useful functions, but still
20:46:22  how do i implement functions?
20:46:45  Lykaina: do you mean in the interpreter with the existing semantics?
20:47:13  i mean in the language
20:47:22  doesn't it already have functions?
20:47:33  oh, right
20:47:40  i mean external
20:47:53  libraries
20:49:10  do you mean like calling other functions written in echidna? just concatenate the source codes, plus modify the addresses they use in the data space so they don't clash with each other
20:50:27  thinking the difference between c and standard library
20:50:43  extensibility
20:51:29  sure, but echidna already has built-ins for input and output. you can just build functions over that.
20:52:12  what about time?
20:53:14 -!- Lord_of_Life has quit (Ping timeout: 240 seconds).
20:53:59 -!- Lord_of_Life has joined.
20:58:18  how neeeded is the current 'G'?
20:59:53  it's currently printf("%u",mem[addr])
21:00:25 -!- crash_n_burn has joined.
21:13:03  I think that's convenient for debugging
21:13:21  good point
21:13:29  though to make it even more convenient, you could make it output a space first if the previous output operation was also this numeral thing
21:13:42  that's magic, but probably acceptible magic
21:13:46  as long as it's documented
21:14:42 -!- FreeFull has quit (Ping timeout: 246 seconds).
21:15:19  would ':' be good for time?
21:16:12  cause it's in the middle of every digital clock
21:16:42 -!- FreeFull has joined.
21:17:47  and i'm thinking about changing M to be more like L
21:17:53  Lykaina: dunno, if you want a lot of fancy io stuff like that, you could add some dispatch builtin where one argument decides what operation to do, or builtin functions that have the same interface as echidna functions so you call them with N or something, but are not implemented in echidna?
21:20:32  that could work
21:22:20  an m that operated like l would require a lot of arguments
21:23:20  30
21:23:34  it can be done
21:23:55  better than that weird logic code
21:24:39  well, 6 5-char arguments
21:30:43 -!- imode has joined.
21:38:09 -!- FreeFull has quit.
21:49:37 -!- b_jonas has quit (Remote host closed the connection).
21:52:39 -!- crash_n_burn has quit (Quit: Lost terminal).
22:22:07 -!- craigo has joined.
22:22:08 -!- MDude has quit (Ping timeout: 245 seconds).
22:22:39  implemented the new M
22:25:33  c = a AND b : M @c @a @b =0000 =0000 =0000 =FFFF  
22:30:16  so I have a language named SPL, which for control flow has the following primitives: [?;]. `[` is `while(1){`, `?` is `if(pop(&stack)==0){break;}`, `;` is `break;`, and `]` is `}`. this means you can write pretty clean control structures like `if`, `while` loops, etc.
22:31:24  I've been wondering what kind of reduction you can make to eliminate `?` and `;`.
22:33:14  https://hastebin.com/eqogofoqef some sample programs. if there was a clean way to integrate the conditional check into the `[` instruction, that'd be neat.
22:33:31  the latter one is an iterative factorial algorithm.
22:35:36  it's a stack based language, and all operations reference the top of the stack. similar to Mouse and stuff.
22:36:48  an `if` statement can be built using the following form: ` [?  ;]`. you can build if/else if/else chains via passing boolean flags around on the stack.
22:37:35  `.` is `drop`, `:` is `pick`, `\` is `roll`, `~` is negate, `=` is equality... etc.
22:37:36  ​/srv/hackeso-code/multibot_cmds/lib/limits: line 5: exec: .`: not found
22:38:18  a `while` statement can be built as a similar form. trying to condense this into just `[` and `]` while preserving the same "structure" is what I'm struggling with.
22:42:11 -!- imode has quit (Remote host closed the connection).
22:42:56 -!- imode has joined.
22:43:48  the ability to break arbitrarily is also incredibly useful.
22:49:07 -!- xkapastel has joined.
23:02:49 -!- Phantom_Hoover has quit (Ping timeout: 244 seconds).
23:08:42  [[///]] M https://esolangs.org/w/index.php?diff=66076&oldid=66074 * A * (+32) /* Examples */ Not in this wiki
23:08:58  imode: why should you eliminate both `?` and `;`?
23:10:16  bringing it more in line with something like brainfuck.
23:10:34  just to see if it's possible, mainly.
23:10:52  anyway [;?] are a find too, at least for me!
23:12:03  yeah? I dunno. there's always this niggling doubt in the back of my mind in the form of "you can make the instruction set smaller".
23:12:26  hm, could one set `]` to be the current `?]` ?
23:13:10  interesting.
23:13:38  you could eliminate `;` by doing `,?`
23:13:44  `[? ... ,?]`
23:13:45  ​/srv/hackeso-code/multibot_cmds/lib/limits: line 5: exec: [?: not found
23:14:09  ah, break seems inexpressible
23:14:22  the `,` instruction pushes a zero to the stack. all other numerals like 1, 2, 3 ... A, B, C ... F shifts hexadecimal digits into the top of the stack.
23:14:31  here, lemme bring up the interpreter.
23:14:51  https://repl.it/repls/UnknownGenerousLifecycle
23:15:05  ; as ? is pretty obvious, I agree :D
23:15:16  hehehe.
23:16:00  see instinctively, I wanna make `[` into `while(pop(&stack)){`
23:16:36  but that's weird. your conditional check now has to be duplicated _prior_ to the loop, and _after_ the loop body.
23:17:36  hmm
23:17:42  if statement is now ` [  ,]`
23:18:10  but `while` is now ` [   ]`
23:19:21  hm.
23:20:58  is there a sense to make this a post-condition loop do … while(cond)?
23:21:42  hm now `if` would be a pain instead
23:21:44  could you still express a precondition loop with a postcondition loop?
23:21:46  yeah..
23:22:38  why while is so universal hm. I never thought about that, ever
23:27:57  I used to tutor CS concepts, and I used to blow my students' minds when I tell them that they can form every single control flow construct from `while`s.
23:28:25 -!- atslash has quit (Quit: This computer has gone to sleep).
23:31:33  'while' is universal in the same way that 'jmp' and 'jnz'/'jz' instructions are universal.
23:42:18  interesting, `[?;]` can be used to construct something like `begin   while  repeat
23:42:24  https://en.wikipedia.org/wiki/Control_flow#Loop_with_test_in_the_middle
23:44:05  [   ?  ] would be the equivalent code.
23:44:05  imode: |spelling error
23:44:06  imode: |     ?  ] would be the equivalent code.
23:44:06  imode: |                                                            ^
23:44:13  whoops, sorry. forget what triggers bots.
23:55:17   https://en.wikipedia.org/wiki/Control_flow#Loop_with_test_in_the_middle => very interesting, thanks!
23:55:33  https://repl.it/repls/AjarFirmSystemresource an example of just using `while` and `break`.
23:55:38  np!
23:55:54  a while ago I did thought about named loops and breaks/continues but for some reason not of that loop type
23:56:08  that entire page will be useful to me, I think
23:56:34  [ ]
23:56:35  arseniiv: ]
23:56:41  haha it works
23:56:45  hah.
23:56:51  [ [ ] ]
23:56:51  arseniiv: [ ] ]
23:57:31  [+-]
23:57:44 * arseniiv pretends he knows what he’s doing
23:57:59  Lykaina: I think there should be at least one space after [
23:58:02 * Lykaina has no clue either
23:58:10  [ ] [ ]
23:58:11  arseniiv: ] [ ]
23:58:19  huh, looking at brainfuck algorithms.
23:58:19  okay I’ll go sleep
23:58:24  it looks like I'm right.
23:58:52  'while () {  }' results in you requiring to evalute the condition _again_ at the end of the loop if you just use [ and ].
23:59:12  independent rediscovery!
23:59:19  ah
23:59:57  to send you off, here's a recursive factorial function: ,2{:,0=[:?..,1,;][?:,1-,2!*;]},10,2!

2019-09-11:

00:00:53 -!- MDude has joined.
00:00:55  write in c, write in c, write in c, write in c, if you want it to make no sense, write in c
00:01:32  i think that's how the song goes
00:01:38  lol.
00:03:16  exitwhen from that article reminds me of algebraic effects: effect definition, a handler and its application to an effectful expression all bundled together. Or exceptions, but they already mention them and that’s not exotic enough
00:05:04  though this exitwhen is weaker than exceptions (and moreso effects) and on the other hand is beautifully local, that’s a plus I think
00:07:37  https://hastebin.com/dicapuzube.makefile
00:08:47  exitwhen looks frickin' awesome.
00:13:08   https://hastebin.com/dicapuzube.makefile => you made it readable! :o
00:13:30  okay bye all :
00:13:34  night.
00:13:59  the cool part is it's just trivial substitutions.
00:17:44 -!- arseniiv has quit (Ping timeout: 246 seconds).
01:17:19 -!- Lykaina has quit (Quit: leaving).
01:34:07 -!- Lykaina has joined.
01:41:16 -!- adu has joined.
01:44:12 -!- imode has quit (Remote host closed the connection).
01:44:37 -!- imode has joined.
02:00:11 -!- rodgort has quit (Quit: Leaving).
02:03:05 -!- imode has quit (Ping timeout: 246 seconds).
02:04:24 -!- rodgort has joined.
02:07:13 -!- Phantom_Hoover has joined.
02:16:02 -!- rodgort has quit (Ping timeout: 246 seconds).
02:23:28 -!- rodgort has joined.
02:39:30 -!- tromp has quit (Remote host closed the connection).
02:42:08 -!- MDude has quit (Ping timeout: 245 seconds).
02:45:59 -!- fungot has quit (Ping timeout: 252 seconds).
02:49:04  made an echidna program to output the ecact formula when, if piped into bc, gives the unix time
02:51:26 -!- fungot has joined.
02:51:38  i'd output it using echidna, but it's 32-bit and echidna is 16-bit
02:54:03 -!- ArthurStrong has quit (Remote host closed the connection).
03:00:07 -!- Phantom_Hoover has quit (Read error: Connection reset by peer).
03:01:11  how do i do base conversion math on two 16-bit numbers as though they were one 32-bit number?
03:10:08 -!- sprocklem has joined.
03:17:34 -!- tromp has joined.
03:22:44 -!- tromp has quit (Ping timeout: 276 seconds).
03:23:32  Lykaina: a*2^16 + b
03:26:52 -!- xkapastel has quit (Quit: Connection closed for inactivity).
03:33:30 -!- imode has joined.
03:52:34 -!- imode has quit (Read error: Connection reset by peer).
03:52:40 -!- imode2 has joined.
03:55:10 -!- imode2 has quit (Remote host closed the connection).
03:55:29 -!- imode2 has joined.
04:30:06  https://hastebin.com/begaliyeju.py a half-functional SPL-to-C compiler. pretty trivial.
04:44:13 -!- adu has quit (Quit: adu).
04:44:36 -!- adu has joined.
04:45:03 -!- adu has quit (Client Quit).
04:45:35 -!- adu has joined.
04:45:49 -!- adu has quit (Client Quit).
04:46:19 -!- adu has joined.
04:46:36 -!- adu has quit (Client Quit).
04:47:06 -!- adu has joined.
04:47:23 -!- adu has quit (Client Quit).
04:47:55 -!- adu has joined.
04:48:10 -!- adu has quit (Client Quit).
04:56:49 -!- imode2 has quit (Quit: Leaving).
04:57:06 -!- imode2 has joined.
04:57:16 -!- imode2 has quit (Remote host closed the connection).
04:57:38 -!- imode has joined.
05:08:20 -!- hppavilion[1] has joined.
05:26:30  brainfuck would be far more palettable if `[]` were substituted for `[?;]`. I imagine a command set of `[<>!?;]` would be turing-complete, with `!` acting as a bit-flip operator.
05:28:34  if equipped with a circular tape, the program [!?>] would write 1's to every memory cell.
05:29:01  make that [!?>]!, need to swap the last bit back.
05:31:05  with the use of a sentinel cell, you can reduce the instruction set to `[<>!?]`
05:32:20  imode: To be clear, what are `?` and `;`?
05:33:26  sorry. `[` and `]` are `while(1){` and `}`, while `?` and `;` are `if(cells[current]==0){break;}` and `break;` respectively.
05:33:39  was going off of an earlier discussion.
05:33:42  Ah
05:34:06  been working on a language called SPL that uses those commands + a stack.
05:34:45  https://hastebin.com/begaliyeju.py wrote a half-arsed C compiler for a subset of it.
05:35:51  brainfuck's [ and ] require you to duplicate code in order to write a trivial while loop.
05:41:20 -!- Sgeo has joined.
05:42:50 -!- Sgeo__ has quit (Ping timeout: 240 seconds).
06:08:59 -!- tromp has joined.
06:19:07 -!- tromp has quit (Remote host closed the connection).
06:21:29 -!- hppavilion[1] has quit (Ping timeout: 276 seconds).
06:27:25 -!- hppavilion[1] has joined.
06:33:34  wonder what a generic while loop would look like in FRACTRAN.
06:42:53  has anybody made a brainfuck interpreter in FRACTRAN? that would be impressive. I imagine the construction would involve building a tape using a single register.
06:59:11 -!- tromp has joined.
07:00:15 -!- tromp_ has joined.
07:01:31 -!- tromp__ has joined.
07:03:22 -!- tromp__ has quit (Read error: Connection reset by peer).
07:03:23 -!- tromp has quit (Ping timeout: 246 seconds).
07:03:44 -!- tromp has joined.
07:05:02 -!- tromp_ has quit (Ping timeout: 276 seconds).
07:35:38 -!- imode has quit (Ping timeout: 240 seconds).
07:58:00 -!- atslash has joined.
07:59:41  there are some very advacned fractran coders
08:11:18 -!- sftp has quit (Ping timeout: 245 seconds).
08:42:44  Hard part would be program input and IO
08:52:50 -!- Lord_of_Life has quit (Ping timeout: 240 seconds).
08:55:46 -!- Lord_of_Life has joined.
09:07:07 -!- atslash has quit (Ping timeout: 258 seconds).
09:07:45 -!- atslash has joined.
09:21:32 -!- atslash has quit (Ping timeout: 276 seconds).
09:21:40  [[Vafix]] M https://esolangs.org/w/index.php?diff=66077&oldid=66068 * A * (+649) /* Multiplication (idea; probably will be combined with Vafix in order to make reading source files harder) */
09:22:03 -!- atslash has joined.
09:26:58 -!- xkapastel has joined.
09:33:55  [[Vafix]] M https://esolangs.org/w/index.php?diff=66078&oldid=66077 * A * (+1543) /* Matrix transposals */
09:33:55 -!- cpressey has joined.
09:34:36  [[Vafix]] M https://esolangs.org/w/index.php?diff=66079&oldid=66078 * A * (+73) /* The Dyadic part */
09:36:16  [[Vafix]] M https://esolangs.org/w/index.php?diff=66080&oldid=66079 * A * (+82) 
09:38:08  adu: that's only if the system can store 32-bit numbers
09:39:39  echidna uses 16-bit math
09:46:08  i can concatenate thrm into a 32-bit, but that won't help with base conversion
09:58:23 -!- hppavilion[1] has quit (Ping timeout: 245 seconds).
09:59:45 -!- hppavilion[1] has joined.
10:03:27  [[User:CarlosLuna]] N https://esolangs.org/w/index.php?oldid=66081 * CarlosLuna * (+80) Initial one-liner bio.
10:04:55  [[User:CarlosLuna]] M https://esolangs.org/w/index.php?diff=66082&oldid=66081 * CarlosLuna * (-4) 
10:06:01  [[User:CarlosLuna]] M https://esolangs.org/w/index.php?diff=66083&oldid=66082 * CarlosLuna * (+9) 
10:08:32  [[User:CarlosLuna]] M https://esolangs.org/w/index.php?diff=66084&oldid=66083 * CarlosLuna * (+45) 
10:08:34 -!- Frater_EST has joined.
11:12:57 -!- sftp has joined.
11:16:51  [[Factory]]  https://esolangs.org/w/index.php?diff=66085&oldid=50795 * Unlimiter * (+0) /* Storage spaces 1-3 */
11:21:07  [[Factory]]  https://esolangs.org/w/index.php?diff=66086&oldid=66085 * Unlimiter * (-6) /* And */
11:29:09  [[Factory]]  https://esolangs.org/w/index.php?diff=66087&oldid=66086 * Unlimiter * (-4) /* eloop */
11:35:47 -!- arseniiv has joined.
11:55:04  Lykaina: I don't know if there are any handy shortcuts for base conversion specifically, but you can always "just" implement 32-bit operations in terms of 16-bit ones based on the mentioned decomposition.
11:55:21  For example for 32x32->32 bit multiplication, x * y = (xh*2^16 + xl) * (yh*2^16 + yl) = (xh*yh)*2^32 + (xh*yl + yh*xl)*2^16 + xl*yl, and the *2^32 part doesn't matter, so you "only" need to compute 16x16->16-bit multiplications xh*yl and yh*xl, and one 16x16->32-bit multiplication xl*yl, and sum up the right parts of the results.
11:58:22  Division is much more disagreeable. Though with a constant divisor you could turn it into an (even wider) multiplication.
12:04:32  I know there's similar routines like this in, for example, SDCC; their 32-bit multiplication is at https://sourceforge.net/p/sdcc/code/HEAD/tree/trunk/sdcc/device/lib/_mullong.c (a pure C version, or actually two of them, at the bottom).
12:40:14 -!- Lord_of_Life has quit (Read error: Connection reset by peer).
12:44:04 -!- Lord_of_Life has joined.
12:47:50 -!- MDude has joined.
13:07:13 -!- Frater_EST has quit (Ping timeout: 246 seconds).
13:10:45 -!- Frater_EST has joined.
13:11:12 -!- Frater_EST has quit (Remote host closed the connection).
13:20:56  [[Vafix]] M https://esolangs.org/w/index.php?diff=66088&oldid=66080 * A * (+22) /* Implementations */
13:22:08  [[Vafix]]  https://esolangs.org/w/index.php?diff=66089&oldid=66088 * A * (-358) /* Multiplication (idea; probably will be combined with Vafix in order to make reading source files harder) */ Making this simple as well as hard to understand
13:28:08  [[Vafix]] M https://esolangs.org/w/index.php?diff=66090&oldid=66089 * A * (+275) 
13:29:08  [[Vafix]] M https://esolangs.org/w/index.php?diff=66091&oldid=66090 * A * (+9) Fix some typos
13:33:15  [[Vafix]] M https://esolangs.org/w/index.php?diff=66092&oldid=66091 * A * (+130) /* Computational class */
13:33:57  [[Vafix]] M https://esolangs.org/w/index.php?diff=66093&oldid=66092 * A * (-2265) /* Matrix transposals */ Nope, the core of Vafix is just 2 operators.
13:34:35  [[Vafix]]  https://esolangs.org/w/index.php?diff=66094&oldid=66093 * A * (+25) /* Implementations */
13:34:46  [[Vafix]] M https://esolangs.org/w/index.php?diff=66095&oldid=66094 * A * (+9) /* Implementations */
13:46:45  Not wholly esoteric, but I mentioned it on here weeks ago, finally got around to packaging it up: https://github.com/catseye/Cardboard-Prolog
13:51:04  cpressey: omg you're catseye?
13:51:49  that is like so...
13:51:59  i'm just messing with you
14:04:34  Curses! My entirely-non-secret identity has been revealed!
14:04:42  [[Vafix]] M https://esolangs.org/w/index.php?diff=66096&oldid=66095 * A * (+19) /* Calculates 7+(-5) */
14:11:34  https://twitter.com/x86instructions/status/1171468931241934853
14:16:44 -!- xkapastel has quit (Quit: Connection closed for inactivity).
14:20:11  crap, i have to sacrifice another command
14:21:56  https://github.com/lykaina/echidna
14:23:09  i need a second op like 'S'
14:23:45  S = special/secondary
14:30:58  probably move R to G and make the current G part of the new R as RD
14:31:12  i mean, RG
14:44:42 -!- MDude has quit (Ping timeout: 244 seconds).
15:23:47  I just heard about words like speako, writo, scanno, clicko, thinko. Just rofling now
15:24:26  a neat model but funny nonetheless
15:26:54  cpressey: maybe you've just been called old ;-)
15:29:07  I heard about cpressey but not once about catseye (before I saw some github links cpressey himself posted weeks ago), what did I do wrong
15:31:49  arseniiv: you've never encountered the now-dead link to Cat's Eye Technologies on http://www.muppetlabs.com/~breadbox/intercal/ :)
15:32:10  (I believe that's where I first found it.)
15:32:25  `grwp box
15:32:28  boxmodel:boxmodel is how we figure out how big Taneb's cage is going to be. \ hackego:HackEgo, also known as HackBot, is a bot that runs arbitrary commands on Unix. See `help for info on using it. You should totally try to hax0r it! Make sure you imagine it's running as root with no sandboxing. HackEgo is the slowest bot in all Mexico! \ match:Can a match box? No, but a tin can. \ paste:"Paste" is a short story by Henry James. Its contents have been cut in
15:37:31  this Cardboard Prolog challenges me to write something in another language but I’m lazy. I even hadn’t finished that metavariable proof checker yet, I’m not happy with a hacky β-reduction rule which would allow me to finish that thing and I don’t want to think how could I manage without that, and anyway no one wants that engine at all so what’s the use
15:47:15  int-e: ah. Yes maybe if I was more old and more appreciated INTERCAL…
15:48:48  `? cut elimination
15:48:49  The cut-elimination theorem states that any Prolog program written using the cut operator ! can be rewritten without using that operator.
15:48:59  whoa I didn’t expect
15:49:12  and really funny
15:49:23  `? branch-cut elimination
15:49:24  branch-cut elimination? ¯\(°​_o)/¯
15:49:29  `? branch cut
15:49:31  branch cut? ¯\(°​_o)/¯
15:49:33  `? cut
15:49:34  cut? ¯\(°​_o)/¯
15:49:39  `? cat
15:49:40  Cats are cool, but should be illegal.
15:49:52  ah I already knew that, it seems
15:49:58  fungot: is that true?
15:49:59  arseniiv: im coding enqueue to insert it into the kernel core, because well they are procedures no it's not.
15:50:28  fungot are you in a self-contradictory mood today, huh?
15:50:29  arseniiv: that sentence, either. :) difference is, dr. watson just sends an error report off to microsoft and objects, what would one gain from an idl separate from scheme code
15:51:42  I certainly didn’t know IDL could be made into scheme code
15:51:56  `? IDL
15:51:57  IDL? ¯\(°​_o)/¯
15:52:01  thank gods
15:52:54  arseniiv: INTERCAL was the first or second esolang I've encountered (I don't know whether Brainfuck came first or second). So it made a lasting impression.
15:54:01  But there were also far fewer esolangs around to pick from.
15:54:21  And no esolangs.org :)
15:54:37  Fun fact: the first programming language I learnt was Piet
15:55:02  Which probably goes some way to explaining how I try and learn how a program works
15:55:05  Ook.
15:55:12  That was second
15:55:14  int-e: there was a time when I thought about conlangs and esolangs almost entirely on a basis of (Russian) Wikipedia pages on them, which were few (and still are; I don’t understand what criteria are there to include precisely that selection but it seems unchanged over the years)
15:55:33  (the first esolang I made, which I think might still exist as a word document on my parents' computer, is an extension to Ook)
15:56:25  It's funny that DMM basically inhabits two extremes in the originality spectrum for esolangs :)
15:57:03 -!- hakatashi has quit (Remote host closed the connection).
15:57:05  happily that wikipedia selection seemed to include FALSE, it gave me several ideas and that’s why each my concatenative language will have [...] lambda brackets
15:57:31  I also saw them in some forth variation but don’t know which first
15:58:22 -!- cpressey has quit (Quit: Old like a FOX).
15:58:47  (DMM?)
15:58:53  arseniiv: Oh technically I guess I learned about BlooP and FlooP before the other two, but I didn't consider them as esoteric languages.
15:58:53 -!- hakatashi has joined.
15:59:09  ah, GEB
15:59:15  arseniiv: The author of IWC. ;)
15:59:19  arseniiv: David Morgan-Mar, webcartoonist and esolang creator
15:59:48  I want to write a book like GEB, and also unlike it, so it should be more practical, but nonetheless eclectic and varied and crazy but I don’t have a chapter plan still
16:00:22  that sounds like a good place to start ;)
16:00:22  Taneb: thanks! Didn’t heard about him before
16:00:46  and what’s IWC?
16:00:48  :D
16:00:59  arseniiv: Tsk, you fell for it :)
16:01:05  http://www.irregularwebcomic.net/
16:01:10  ah
16:01:39  why wouldn’t I fall for an unknown abbreviation, though
16:01:55  I only know AAAAA
16:02:03  arseniiv: I don't know, but it was all according to plan.
16:02:43  alliteration and abbreviation addicts anonymous
16:02:54  hm a chapter about steganograophy could be steganographed
16:03:20  no no no it was a-something association against abusing abbreviations
16:03:21  What about stenography
16:03:41  if I would write that book it may include a chapter on steganography
16:04:07  then it’s only logical to steganographize something in there
16:04:15  . o O ( People can't memorize computer industry acronyms. )
16:05:18  ("PCMCIA", if you remember that. Of course it really stands for "PC Memory Card Industry Association".)
16:06:35  alliterations help illiterate to alternate leaping hopefully and laterally
16:07:23  didn’t know about PCMCIA, clever
16:10:23  gtg
16:10:26 -!- Lykaina has quit (Quit: leaving).
16:11:51  ah it seems I’m familiar with many of DMM’s esolangs
16:16:53  “Celestial Bureaucracy operates in the spiritual realm, unlike materialistic Western data structures.” => :D
16:18:56  [[Talk:Vafix]] N https://esolangs.org/w/index.php?oldid=66097 * Areallycoolusername * (+230) Created page with "The interpreter is good, but can you add file support so the extension you have provided for Vafix is useful? ~~~~"
16:19:52  [[Talk:Vafix]]  https://esolangs.org/w/index.php?diff=66098&oldid=66097 * Areallycoolusername * (+97) 
16:27:32  hm I hoped there would be examples of Haifu code
16:27:54  iirc Haifu doesn't have a way of doing loops :(
16:38:53  [[Talk:Vafix]]  https://esolangs.org/w/index.php?diff=66099&oldid=66098 * Areallycoolusername * (+500) 
16:39:04  [[Talk:Vafix]]  https://esolangs.org/w/index.php?diff=66100&oldid=66099 * Areallycoolusername * (+1) 
16:42:08 -!- craigo has quit (Ping timeout: 245 seconds).
16:53:01  [[User:Dtuser1337/Sandbox]]  https://esolangs.org/w/index.php?diff=66101&oldid=66043 * Dtuser1337 * (-1998) Blanking because it now in maintenance.
17:14:27 -!- imode has joined.
17:30:29 -!- \emph{grumble} has quit (Quit: \end{document}).
17:34:16 -!- FreeFull has joined.
17:37:14 -!- grumble has joined.
17:54:24 -!- tromp has quit (Remote host closed the connection).
18:09:32 -!- tromp has joined.
18:13:38 -!- tromp has quit (Ping timeout: 246 seconds).
18:19:59 -!- tromp has joined.
18:22:35 -!- tromp has quit (Remote host closed the connection).
18:23:11 -!- tromp has joined.
18:27:17 -!- tromp has quit (Ping timeout: 246 seconds).
18:35:21 -!- xkapastel has joined.
18:36:38 -!- rodgort has quit (Ping timeout: 276 seconds).
18:42:42 -!- rodgort has joined.
18:56:48 -!- Lykaina has joined.
19:10:27 -!- MDude has joined.
19:13:53 -!- Sgeo has quit (Read error: Connection reset by peer).
19:14:21 -!- Sgeo has joined.
19:15:16 -!- tromp has joined.
19:16:41 -!- tromp_ has joined.
19:19:26 -!- tromp has quit (Ping timeout: 246 seconds).
19:20:50 -!- tromp_ has quit (Ping timeout: 246 seconds).
19:25:59 -!- tromp has joined.
19:26:21 -!- Phantom_Hoover has joined.
19:43:01 -!- b_jonas has joined.
20:03:18  `? !
20:03:19  ​! is a syntax used in Haskell and Prolog for solving evaluation order problems.
20:05:05  arseniiv: there's even a wiki page: https://esolangs.org/wiki/David_Morgan-Mar
20:06:07  https://esolangs.org/wiki/DMM redirecys there
20:08:54  four of his esolangs are famous: HQ9++ (version of HQ9+ that also has an object-oriented abstraction but very different from Intercal classes), Chef (thematic language where programs look like cooking recipes), Piet (programs are paletted images), and Ook! (brainfuck dialect for apes)
20:13:18  huh, didn't realize that he was the same person behind the webcomics
20:14:43 -!- Cale has quit (Ping timeout: 276 seconds).
20:20:30  b_jonas: yeah, I went to that precise article today :D
20:26:52 -!- Cale has joined.
20:27:20 -!- Phantom_Hoover has quit (Ping timeout: 246 seconds).
20:27:31 -!- Phantom_Hoover has joined.
20:32:10  `ehlist http://eheroes.smackjeeves.com/comics/2855868/terribly-meaninful-information/
20:32:12  ehlist http://eheroes.smackjeeves.com/comics/2855868/terribly-meaninful-information/: b_jonas
20:33:31  [[Fungot]]  https://esolangs.org/w/index.php?diff=66102&oldid=38954 * B jonas * (+21) 
20:34:31  http://sif.lesidhetree.com/sara/echidna/Echidna%20v0_03a6.pdf
20:34:47  hmm, we should probably have at least short articles about HackEso and lambdabot
20:34:53  now, i will actually try an program in this
20:39:21  b_jonas: what do you think echidna, as it is now, would be good for?
20:40:13  Lykaina: I was busy today and tomorrow, so I didn't look at it
20:40:42  linked the up-to-date compiled documentation
20:41:07  in chat
20:41:46  wait, you were busy tomorrow?
20:41:58  not yet
20:42:00  but I will be
20:43:23 -!- hppavilion[1] has quit (Ping timeout: 276 seconds).
20:44:46  can you look at the pdf, or are you too busy?
20:44:54  it's too late in the evening
20:44:59  I can't think anymore
20:45:08  normally I could but I'm tired
20:45:17  so no
20:45:41  I'll have to get up tomorrow
20:47:34  anyone else wanna look at the pdf and see where the strengthes are?
20:52:03 -!- Lord_of_Life_ has joined.
20:54:39 -!- Lord_of_Life has quit (Ping timeout: 246 seconds).
20:54:39 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
21:11:25  i have to go lie down. brb. (i'm on a screen session)
21:16:05  is there any mathematical foundation to dataflow programming?
21:18:33  back
21:18:54  what's that?
21:20:05  stuff like flow-based programming.
21:20:13  https://en.wikipedia.org/wiki/Dataflow_programming
21:29:55  is mine dataflow programming?
21:30:08  or are you referring to another?
21:30:36  was just wondering in general, not directed towards you or your language.
21:31:55  phew
21:59:06  i made a clock
21:59:46  though, to be fair, i used 4 "special ops" to do it
22:00:56  like that i call the extended op set "special ops"?
22:02:47 -!- hppavilion[1] has joined.
22:08:09 -!- FreeFull has quit.
22:10:46 -!- b_jonas has quit (Remote host closed the connection).
22:31:19  I wonder if I can replace my stack with a queue.
22:43:44  what's the difference?
22:44:11 -!- Phantom_Hoover has quit (Ping timeout: 246 seconds).
22:47:38  several things are different. RPN no longer works as you'd think.
22:56:38  1 2 3 4 + - * -> (1+2)*(3-4) for example.
22:57:17 -!- MrBismuth has quit (Ping timeout: 250 seconds).
22:57:17 -!- MrBusiness3 has joined.
22:57:18  control flow would be interesting.
22:58:32  evaluating conditions would be uh... hard?
23:00:04  you'd have to make copius use of rolling the queue to seek to parameters.
23:05:31  [[Talk:Vafix]] M https://esolangs.org/w/index.php?diff=66103&oldid=66100 * A * (+10) Split into bullet points
23:06:50  who's A?
23:07:04  [[Vafix]] M https://esolangs.org/w/index.php?diff=66104&oldid=66096 * A * (+2) /* Execution scheme */
23:07:36  [[Talk:Vafix]] M https://esolangs.org/w/index.php?diff=66105&oldid=66103 * A * (+166) 
23:10:07 * imode shrugs.
23:13:19  [[Talk:Vafix]] M https://esolangs.org/w/index.php?diff=66106&oldid=66105 * A * (+196) 
23:18:43  ugh...have to be able to do 32-bit arithmetic in echidna, or add to it until i can
23:20:02  why?
23:20:25  it uses unsigned 16-bit integers
23:20:38  no carry
23:20:45  no borrow
23:21:53  why do you need 32 bit arithmetic.
23:22:04  i don't
23:22:15  you can still detect carry and borrows.
23:22:20  by virtue of wraparound.
23:22:51  given two numbers, a and b, if a + b < a || a + b < b, a carry occurred.
23:23:06  [[Talk:Vafix]] M https://esolangs.org/w/index.php?diff=66107&oldid=66106 * A * (+12) 
23:23:30  [[Talk:Vafix]] M https://esolangs.org/w/index.php?diff=66108&oldid=66107 * A * (-14) 
23:23:42  imode: can you add parentheses?/
23:24:06  you can discard the latter part of that 'or' condition, so it's just `if(a + b < a){/*carry occurred*/}`
23:24:52  how do you add a to ( b < a )?
23:25:05  huh? precedence, dude.
23:25:12  (a + b) < a
23:25:24  i must be reallyy out of it
23:25:34  the sum of two numbers will always be greater than or equal to either number.
23:25:41  [[Talk:Vafix]] M https://esolangs.org/w/index.php?diff=66109&oldid=66108 * A * (+189) 
23:25:46  provided those numbers are positive integers.
23:26:10  what's really going on behind the scenes is ((a + b) % INT_MAX) < a
23:29:26  t @r =a =b p @r =a I0 t @s @s =1 -I0
23:30:16  sorry, that's pseudo-echidna
23:32:04  T @0003 =0000 =0001 P @0003 @0000 I0 T @0004 @0004 =0001 -I0
23:32:13  that's echidna
23:35:05  in other words: r=a+b; if(r imode: you like?
23:38:18  looks neat.
23:38:34  http://sif.lesidhetree.com/sara/echidna/Echidna%20v0_03a6.pdf
23:39:10  "compiled documentation"
23:42:39  still working on R and S, the Special Ops.\
23:47:30  at the moment: R-ops all have 1 mem out and 2 value ins, where S-Ops have 2 mem outs and 1 value in
23:48:17  i need to add another value to be supported by S
23:50:50  brb
23:58:03  @tell b_jonas  hmm, we should probably have at least short articles about HackEso and lambdabot => seems reasonable!
23:58:04  Consider it noted.

2019-09-12:

00:01:13  back
00:02:17  gonna set out out in in on both r and s
00:02:40  reasoning about arithmetic using queues is uh... confusing.
00:03:27  3 out 2 in
00:04:17  https://hastebin.com/utigeyadaq.md
00:04:58  i mean 2 out 3 in
00:05:20  as max for the R- and S-ops
00:05:40  gotta code this soon
00:07:24  it's really hard to sequence queue operations in your head, compared to a stack.
00:08:00  even then I had to resort to a roll operation that rotates the queue.
00:08:23  lemme see if I can write a factorial function.
00:09:07   is there any mathematical foundation to dataflow programming? => hm AFAIR there is a single framework in Haskell to express all of them (I don’t remember is it closer to comonads or ArrowFix, what it was called) so maybe there is something in category theory to base all of it too. Though I have read only a few introductory things and don’t remember them by now
00:11:30  or not, I seem to confuse that with stream processing or what it’s called, when each tick all the values are recomputed using a fixed set of rules, using only the previous available values or something like this, ultimately like a usual digital circuit
00:12:48  [[But Is It Art?]]  https://esolangs.org/w/index.php?diff=66110&oldid=58846 * Qpliu * (+0) /* External resources */
00:13:03  the last thing is of course more or less simple so the question is probably not about that
00:20:47 -!- arseniiv has quit (Ping timeout: 246 seconds).
00:21:30  [[Talk:Intramodular Transaction]] N https://esolangs.org/w/index.php?oldid=66111 * Qpliu * (+383) Created page with "An alternative reverse bits:  main input = reverse input trailer input;  trailer input = ? input trailer ..input input;  reverse input output = ? input ? .input reverse ..inpu..."
01:22:39 -!- tromp has quit (Read error: Connection reset by peer).
01:35:50  I haven't even thought of how I'd translate that quadratic formula to an actual _function_... jesus.
02:00:10 -!- Phantom_Hoover has joined.
02:01:43 -!- xkapastel has quit (Quit: Connection closed for inactivity).
02:08:23 -!- Phantom_Hoover has quit (Ping timeout: 276 seconds).
02:22:17  seems like a register machine requires indirect addressing to be conveniently turing complete, else you're going to be spending your time encoding your TM tape into one of the registers.
02:33:36  I'm so indecisive with what I want to devote my time doing. I've tried stack machines and queue machines with some fancy logic on top.
02:33:53  can't seem to find just the right model.
02:39:36  http://sif.lesidhetree.com/sara/echidna/Echidna%20v0_03a7.pdf
02:41:52 -!- craigo has joined.
02:42:17  why is it called echidna?
02:44:15  hi Hooloovo0 
02:44:21  hi
02:45:13  what's new?
02:45:55  working on my VCF midwest demo
02:46:08  and also thinking about a paper for my ethics class
02:47:06  demo is TI calculators + a vax, and 
02:47:23  what's VCF?
02:47:30  vintage computer festival
02:47:32  oh
02:47:34  when is that?
02:47:38  is that the thing @ the computer history museum?
02:47:54  VCF west is at the CHM, yeah
02:48:04  there's a couple other ones scattered around the country
02:48:23  they have pretty boring names if you ask me
02:48:26  oh, VCF west was last month
02:48:44  CHM is a cool place
02:48:45  vcfmw.org is the one I'm going to, this weekend
02:48:45  I want to go back
02:49:02  I was kind of disappointed
02:49:16  they definitely have a bunch of cool stuff... but only a couple things are turned on
02:49:34  my wife works 5 min away from there
02:49:35  if you go, definitely make sure you get to see the IBM demo
02:49:38  yeah, that's true
02:50:37  hmm, if you show up with your own punch cards, I wonder if they'd let you run them through the 1401...
02:51:02  what are you up to?
02:51:56  lazy day
02:52:01  did some grocery shopping, that's about it
02:53:03  22:42:17 < Hooloovo0> why is it called echidna?
02:53:14  Answer: i forgot
02:53:28  there was a good reason, though
03:06:41 -!- tromp has joined.
03:08:00 -!- tromp_ has joined.
03:10:54 -!- tromp has quit (Ping timeout: 246 seconds).
03:12:44 -!- tromp_ has quit (Ping timeout: 276 seconds).
03:23:37  http://sif.lesidhetree.com/sara/echidna/Echidna%20v0_03a7-fix.pdf
03:35:46  well, Echidna not, it is hard to program in.
03:36:44 -!- tromp has joined.
03:41:20 -!- tromp has quit (Ping timeout: 276 seconds).
03:41:22  Linux stack growth behavior was changed apparently: https://github.com/torvalds/linux/commit/1d8ca3be86ebc6a38dad8236f45c7a9c61681e78
03:41:57  It used to check %rsp against the fault address on page faults, and grow the stack if %rsp was lower.
03:43:47  now i remember
03:44:56  i picked echidna because the first echidna, which was very different, needed to start with the letter 'e'
03:45:15  and be an animal, as that was my convention
03:46:12  this echidna was a lot closer to the first ecidna than to calamari or hydra
03:46:50  (those are unusuable)
03:47:28  next one i make will probably be calamari
03:47:39  as in, using that name
03:47:42 -!- hppavilion[2] has joined.
03:48:50  *my* hydra might not have been esoteric
03:49:10  no relation to the hydra on the wiki
03:50:28 -!- hppavilion[1] has quit (Ping timeout: 265 seconds).
03:52:37  i don't think the original Echidna was esoteric, but it was a pain in the ass. It shares some code with the current Echidna, which I believe to be esoteric.
03:58:45 -!- hppavilion[1] has joined.
04:01:38 -!- hppavilion[2] has quit (Ping timeout: 240 seconds).
04:31:11 -!- tromp has joined.
04:35:36 -!- tromp has quit (Ping timeout: 246 seconds).
04:43:00  https://hastebin.com/elifuxehir.md spent the evening working out what the quadratic formula might look like in a queue-based Forth.
04:45:05  38 instructions vs. the 31 for Forth on rosetta code.
04:45:19  difficult. but interesting
05:03:57  hi
05:08:27  hi.
05:20:23 -!- imode has quit (Ping timeout: 246 seconds).
05:22:28  [[User:CarlosLuna]] M https://esolangs.org/w/index.php?diff=66112&oldid=66084 * CarlosLuna * (+14) 
05:27:35  night
05:29:16 -!- Lykaina has quit (Quit: leaving).
06:19:09 -!- tromp has joined.
06:23:50 -!- tromp has quit (Ping timeout: 276 seconds).
06:24:56 -!- imode has joined.
06:26:19 -!- tromp has joined.
06:30:59 -!- tromp has quit (Ping timeout: 276 seconds).
06:59:02 -!- tromp has joined.
07:20:36  ...hmm.
07:20:53  my factorial algorithm got shorter once I swapped to a queue.
07:28:59  designing an 'if' statement with a queue is a little tougher. the body of the if statement may do work that gets in the way of signalling the next block.
07:29:51  a good primitive might be "roll to the last element of the queue".
07:53:12 -!- Frater_EST has joined.
08:14:59 -!- imode has quit (Ping timeout: 276 seconds).
08:23:59  [[Talk:AAAAAAAAAAAAAA!!!!]]  https://esolangs.org/w/index.php?diff=66113&oldid=65790 * YamTokTpaFa * (+374) /* Command changing commands and operations */ new section
08:32:26 -!- Phantom_Hoover has joined.
08:41:26 -!- tromp has quit (Remote host closed the connection).
08:42:36 -!- hppavilion[1] has quit (Remote host closed the connection).
08:44:06 -!- hppavilion[1] has joined.
08:55:17 -!- Lord_of_Life has quit (Ping timeout: 276 seconds).
08:56:25 -!- Lord_of_Life has joined.
09:09:22  [[Alisj]]  https://esolangs.org/w/index.php?diff=66114&oldid=43587 * YamTokTpaFa * (+24) 
09:16:30 -!- tromp has joined.
09:17:25  [[Parent the Sizing]]  https://esolangs.org/w/index.php?diff=66115&oldid=55580 * YamTokTpaFa * (+9) +WIP
09:17:41 -!- cpressey has joined.
09:22:43 -!- Frater_EST has left.
09:23:04  Good morning. I just realized that both the Prompt monad and the Operational monad *require* you to define the insert with a GADT. I also suspect this is how they can guarantee the resulting monad adheres to the monad laws.
09:23:40  cpressey: I think it's more that GADTs are the only way to get any use out of them
09:24:43  [[Chromos]]  https://esolangs.org/w/index.php?diff=66116&oldid=60901 * YamTokTpaFa * (+51) 
09:25:14  ProgramT Identity m a isn't particularly unreasonable, although not very useful
09:25:39  [[TwoFiftyFive]]  https://esolangs.org/w/index.php?diff=66117&oldid=65725 * YamTokTpaFa * (+24) 
09:26:16  I think I don't know enough about this to ask a sensible follow-up question
09:26:37  That's OK, I don't know enough to answer one
09:26:56  [[SLOBOL (2015 language)]]  https://esolangs.org/w/index.php?diff=66118&oldid=63937 * YamTokTpaFa * (+34) 
09:27:34  [[WILSON]]  https://esolangs.org/w/index.php?diff=66119&oldid=46781 * YamTokTpaFa * (+23) 
09:27:39  cpressey: What's the distinction between Prompt and Operational? I thought people used those words to mean the same thing.
09:28:30  Whichever one we were talking about the other way, it should be a monad regardless of the type constructor you give it.
09:31:49  shachaf: What kinds of type constructors are you allowed to give it? Is List a type constructor? Can you give it List?
09:32:34  I don't know what "it" is.
09:33:17  The "it" in my question was the final "it" in your sentence that started with "Whichever".
09:33:34  Oh, that's a good point.
09:33:36  I think the answer is yes, and it'll give you a particular kind of n-ary trees.
09:33:59  This one: data Tree a = Leaf a | Branch [Tree a]
09:34:22  (With a pretty complicated encoding.)
09:36:20  OK, to back up: yes, I think the distinction between Prompt and Operational is not very important, they're just two different APIs/libraries/implementations of the same basic idea.
09:36:29  What are the definitions?
09:37:51  Taking Operational b/c it seems slightly simpler to understand, the definition is: type Program instr = ProgramT instr Identity
09:37:58  "The primitive instructions are given by the type constructor instr :: * -> *."
09:38:03  I don't think that includes List.
09:38:32  I'm not sure it includes anything that isn't a GADT?
09:38:58  I guess ProgramT's defintion is more fundamental
09:39:17  but similar: data ProgramT instr m a  ... with "The primitive instructions are given by the type constructor instr :: * -> *."
09:39:20  * is the kind of types, so it certainly includes List.
09:39:31  Uh, so * -> * certainly includes List.
09:39:47  ?!?
09:39:48  Since List takes types (like Int : *) to types (like List Int : *)
09:40:29  I'll try putting List there but based on my futzing around with it yesterday I 100% expect ghc to complain.
09:41:00  Is it https://hackage.haskell.org/package/operational-0.2.3.5/docs/Control-Monad-Operational.html ?
09:45:21  I'm surprised that it says "Bind :: ProgramT instr m b -> (b -> ProgramT instr m a) -> ProgramT instr m a".
09:45:55  I haven't thought about how to make this a monad transformer, but in the non-transformer case I'd expect "Bind :: instr b -> (b -> Program instr a) -> Program instr a"?
09:46:15  Recursing on both sides seems to make it non-canonical?
09:48:10  It is that module, yes
09:48:15  Oh, you're probably supposed to use ProgramViewT.
09:49:30  Anyway, this certainly "works" for instr=List, it's just a very roundabout way to express that type.
09:51:38  :t []
09:51:39  [a]
09:52:35  import Control.Monad.Operational ; type MyListProgram s a = Program ([s]) a
09:53:00  ghc complains: The first argument of ‘Program’ should have kind ‘* -> *’, but ‘[s]’ has kind ‘*’
09:53:07  I think you mean Program [] a
09:53:16  What is s?
09:53:42  That works, for reasons I do not at all understand.
09:53:57  Because Haskell syntax is confusing?
09:54:05  Try Maybe instead of []
09:54:23  Hmm, Maybe isn't a very good example except syntactically.
09:54:44  Maybe also works. Well, at least this establishes that it doesn't *have* to be a GADT, which was half of my question.
09:54:59  Whether the result of doing this is useful for no, that's another matter.
09:55:21  Hmm. I think it's useful.
09:55:23  Is there something like :t that shows the kind of a type constructor?
09:55:29  Yes, :k
09:55:41  That was my first guess but I was being cautious.
09:55:45  :k []
09:55:46  * -> *
09:55:50  Okay then.
09:55:51  Well, no, I don't think any of this is actually that useful.
09:56:24  All this is pretty paged out of my memory, but I can try to clarify things if it's helpful.
09:56:34  Maybe not useful, but very fitting to #esoteric somehow.
09:56:36  How do you feel about this type: data Free a = Pure a | Free (f (Free f a))
09:57:45  I think there's an important underlying point about what monads are, or something, such that it makes the same amount of sense for any type constructor you pass to Program.
09:59:44  I have no feelings about that type except perhaps bewilderment.
10:00:15  OK.
10:00:37  Let's think about ways to invent I/O in Haskell, assuming you don't know any of this nonsense.
10:01:07  Here's one simple way to do it: main :: String
10:01:16  This is really just O, not I/O.
10:01:45  Simple enough?
10:02:14  Wait, where did I/O come from?
10:02:26  I think it's a useful concrete example.
10:02:49  If you prefer another one we can probably make it work too?
10:02:50  OK. Go on.
10:03:24  OK. The problem with this approach is that you can't do input.
10:03:47 -!- arseniiv has joined.
10:03:51  You could define main :: String -> String, but then the problem is that (modulo laziness) you do all the input upfront, and then all the output, which is pretty limited.
10:04:12  So what you want is a way to interleave input and output.
10:04:45  Makes sense?
10:05:25  Note that the idea of all of these things is that you have some external runtime system/interpreter that can take a Haskell value like main and interpret it together with the outside world.
10:06:25  On second thought maybe I/O isn't the best example.
10:07:29  Hm, why not?
10:07:52  (Actually the question is only whether it's good enough.)
10:08:55  It's not intuitive to me that interleaving input and output is desriable. In Javascript, as one example, it is not possible to interleave input and output. Events cause computations which enqueue more events.
10:09:30  You end up writing promises and state machines.
10:10:28  Also, it gives the impression that the only reason Haskell has monads is so that it can do I/O despite the handicap of being a lazy, referentially transparent language, and that is of course unfair to say.
10:11:23  OK. If you have another example I can probably use that one instead.
10:11:57  I think IO is kind of a special monad in Haskell in that it's maybe best understood as a free monad since we don't particularly have semantics for it.
10:12:02  (Among other ways it's special.)
10:12:24  OK, parsing. That's an actual use case. I want to produce an AST and consume some of the string (i.e. produce the remainder of the string) but I don't want to constantly write destructuring pattern matches.
10:12:39  If you know what I mean.
10:12:50  "Writer monad" I am guessing.
10:13:20  Or State, I suppose, you could treat the string as the state.
10:13:34  Parsing sounds pretty complicated.
10:13:54  What were you hoping to explain to me again?
10:14:19  I wanted to give some motivation for free monads such that nothing is too mystifying at any point.
10:14:53  Program is a kind of free monad and free monads are especially relevant when you apply Program to functors.
10:16:40  I think interleaved I/O makes sense in JavaScript. You need interleaved I/O to write programs like main() { print("what's your name?"); let name = get_line(); print("hi, " + name); }
10:17:05  It's true that it's often done with callbacks but that's true in Haskell too.
10:17:49  In Javascript you *have* to do it with callbacks (or promises, which are glorified callbacks).
10:17:51  I'm also at most 3/4 coherent at this hour, probably less.
10:18:21  In Haskell you also have to do it with callbacks (even more than in JavaScript, where some systems have synchronous APIs).
10:19:18  If 'do' notation is just callbacks in disguise.
10:19:27  Yep, it is.
10:19:48  How about I finish the I/O example which is very simple, and then I'll think of another example.
10:20:19  If you have a program operating on input bits and producing output bits, you can define a type like this:
10:21:08  data P = Done | Out Bit P | In (Bit -> P)
10:22:41  OK
10:24:22  As an extra bonus we'll have our programs produce a value, as in
10:24:37  data P a = Done a | Out Bit (P a) | In (Bit -> P a)
10:25:44  And of course we could add more constructors to have more behaviors.
10:25:54  P is used to define interactions, but it's really just a kind of tree. Right?
10:26:11  As in, you could write "data P a = Out Bit (P a) | In (P a) (P a)"
10:27:29  "In (P a) (P a)"?
10:27:52  Does the previous version make sense?
10:28:20  (Bit -> x) has the same information as (x, x) specifying a value for the 0 and 1 cases.
10:29:12  The previous version of P is a complicated kind of tree, okay.
10:30:24  Right. It has one kind of leaf -- that's Done -- and a slightly unusual shape of branches, which is one of two things -- either an output "branch" (which has a bit and one child) or an input branch (which has two children).
10:30:40  This tree is probably infinite but it describes our entire program.
10:31:30  OK.
10:31:53 -!- Phantom_Hoover has quit (Ping timeout: 246 seconds).
10:31:56  The branch shape, in particular, is this: data F a = OutF Bit a | InF (Bit -> a)
10:32:48  If you abstract the branch shape, you can get the type I mentioned above: data Tree f a = Leaf a | Branch (f (Tree f a))
10:33:54  OK.
10:34:45  I feel like I'm not being that helpful here.
10:37:00  The general point is that this kind of tree describes an interaction with something, and you can have some external program interpret the tree in some way.
10:37:40  OK, another example is making probabilistic choices.
10:38:38  You can have a probability tree where each branch is labeled with a probability and you pick the left side with that probability.
10:39:14  data Tree a = Done a | FlipCoin Probability (Tree a) (Tree a)
10:39:37  An "interpreter" for this tree might sample a particular path through it, or evaluate all the possibilities exhaustively.
10:41:44  OK.
10:42:27  I guess I can try to distill my question.
10:42:34  You keep talking about "interpreters".
10:43:46  For each of these trees you define, you need an "interpreter" to walk it and make sense of it.
10:46:00  But, in the first example at least, part of the tree also has a function in it.
10:46:31  You can't "interpret" a function, you can only run it.
10:47:28  OK, that's not a question I guess.
10:47:50  I guess my question is: why is it intuitive to anyone to mix these two modes?
10:47:58  Hmm, this is about "interpreting" the "effects".
10:48:37  A Haskell program already knows how to do computation, but it doesn't know how to do probability, and it doesn't have a source of randomness and so on.
10:49:13  So we add the notion of random choice (which might be a function (Real -> a), or flipping a coin, or whatever), but we don't say how specifically it's implemented.
10:49:20  [[Talk:Epsilo]] N https://esolangs.org/w/index.php?oldid=66120 * YamTokTpaFa * (+153) /* Where is the source and detailed descriptions!? */ new section
10:50:00  Then we end up with this tree data structure which has all the computation built in, but yields to you whenever it needs to take one of these effect actions like flipping a coin.
10:50:19  Your interpreter just adds these extra abilities.
10:52:15  Defining a data structure to represent an external service, and then embedding function types in the data structure to represent the computation you're going to do with the data you get from the external service, gets you a data structure like this.
10:52:48  Yep.
10:52:53  And people like this.
10:53:56  Do you like this?
10:53:56  People go out of their way to write unification algorithms like this.
10:54:37  It doesn't really matter if I like it or not.
10:55:30  I shouldn't say "out of their way"; it probably becomes a learned habit after a while.
10:55:51  Writing it the other way, would be going out of their way.
10:56:25  shachaf: Thanks for the explanation.
10:57:35  `? this
10:57:36  This is something people on the channel like to talk about. We're often unsure what this is, though. Nobody likes this.
10:59:18  I'm going to sleep.
11:17:16 -!- hppavilion[1] has quit (Quit: Leaving).
11:19:06 -!- hppavilion[1] has joined.
11:20:09 -!- hppavilion[1] has quit (Client Quit).
11:20:56 -!- hppavilion[1] has joined.
11:27:10  Ehm, OK. In Javascript the "interpreter" is the thing that waits to dequeue an event, finds the handler(s) for the event, runs the handlers (which may add more events to the queue), and repeats.
11:28:36  You could probably define a type that describes this if you had to.
11:34:32  I mean, in some idealized model of Javascript running in a browser, where the handlers are pure functions, etc.
11:40:10  The word "trampoline" also comes to mind.
11:43:42 -!- Lykaina has joined.
11:53:06 -!- hppavilion[1] has quit (Ping timeout: 246 seconds).
12:30:04  http://sif.lesidhetree.com/sara/echidna/Echidna%20v0_03a8.pdf
12:53:41 -!- xkapastel has joined.
13:16:40  http://sif.lesidhetree.com/sara/echidna/Echidna%20v0_03a8-fix.pdf
13:17:06  clock example was outputting hours:minutes:minutes
13:17:39  oops
13:46:27  oh no...not another bug in documentation
14:00:30  arseniiv: If it means anything, I also have a half-written proof-checker with some issues with beta-reduction and metavariables, sitting in my experiments repo, which I'd like to continue on, but I don't really know where it's going
14:00:51  http://sif.lesidhetree.com/sara/echidna/Echidna%20v0_03a8-fix2.pdf
14:03:48  cpressey: thanks, I’ll look at it some time!
14:04:53  i'll print out the compiled docs and go through them later.
14:05:14  those were just the key ones i noticed
14:21:45  arseniiv: Oh, I haven't released the code publicly, it's still half-formed. You mentioned you had something similar I think.
14:26:27  acpressey: yeah. My code is in a Python notebook :D
14:26:45  hm why there was “a”
15:17:14 -!- sprocklem has quit (Ping timeout: 240 seconds).
15:31:01  screw it. i'm going from 0.03a8 to 0.10a0
15:31:58  after all the documentation fixes, it deserved a new version
15:55:48 -!- b_jonas has joined.
16:06:15 -!- tromp_ has joined.
16:09:53 -!- tromp has quit (Ping timeout: 245 seconds).
16:31:22 -!- cpressey has quit (Quit: You'll pry my programmable semicolons from my cold, dead hands).
16:40:05 -!- atslash has quit (Quit: This computer has gone to sleep).
16:51:49 -!- FreeFull has joined.
16:57:02 -!- Phantom_Hoover has joined.
16:57:52 -!- MrBismuth has joined.
16:59:49 -!- imode has joined.
17:00:50 -!- MrBusiness3 has quit (Ping timeout: 276 seconds).
17:08:20  finally made an `if` statement. had to add a `last` operator, which rolls to the last element of the queue.
17:12:38  https://hastebin.com/iwafudayes.rb
17:22:34 -!- sprocklem has joined.
17:34:48  what a miserable communication failure
17:34:54  uhm.
17:35:19  I guess that makes a good self-referential statement.
17:37:26  int-e: did you call a shop on phone, they said they had a product or service, but when you went there in person to buy it, they claim they never had it, denied the phone conversation, and tried to upsell?
17:38:10  b_jonas: no.
17:39:49  b_jonas: You might enjoy https://notalwaysright.com/all/ ;-) (maybe only some subcategories; your store may belong to "not always legal")
17:40:00  *story
17:40:25  int-e: eww no, that site is addictive and low-quality in the long run. I no longer read it.
17:40:49  I wasted enough time on iy
17:40:54  :P
17:41:21  It's better than thedailywtf :P
17:57:06 -!- craigo has quit (Ping timeout: 246 seconds).
17:57:41  hhi
17:59:13  imode: looks comlicated
17:59:37  complicated*
18:16:08 -!- sprocklem has quit (Ping timeout: 245 seconds).
18:36:11  arseniiv: yeah, took me a while. though you get good at queue juggling the more you do.
18:36:41  I wonder if you used a dequeue instead.
18:37:56  imode: deque?
18:38:09  sorry, deque. :P
18:39:12  I wonder whether there is some natural occurence of deque, like of stack and queue in DFS and BFS
18:39:47  imode: np, I secretly hoped there is a new data structure lurking nearby
18:39:58  haha.
18:42:04  I think you could make a rather usable language if you used a deque, but toggle between where enqueuing and dequeueing take place with operations.
18:42:23  so you could use it like a stack and a regular queue.
18:42:40  this means RPN works, but deep stack access is possible.
18:43:31  also here’s a bad joke I made just few minutes ago and was translating properly: “What do you prefer writing, Sp or tr?” — “I prefer to wipe my shoes”
18:44:22  hm well it’s even worse in English where trace ≠ track
18:46:01  arseniiv: you mean a full deque, as oppoed to a queue where you can push on either end but pop only from the start?
18:46:31  Wtf is Sp, if not span (which has nothing to do with trace...)?
18:46:33  b_jonas: either one suffices maybe
18:46:35  Oh
18:46:39  arseniiv: Spur IIRC
18:46:41  It's the german "Spur".
18:47:16  I should've recognized that immediately. But no... I forgot all the german linear algebra terms it seems.
18:49:46  I wouldn’t even have an idea of Sp vs. tr if not for encountering Sp yesterday by pure chance
18:51:58  also what do you all think is more natural for a “half-deque”, pushing from bith sides but popping from only one, or popping from both and pushing from one?
18:52:49  I don’t know how often these are needed in general
18:52:54  arseniiv: pushing on both sides and popping from one, because (1) you can implement it with a singly linked list, and 
18:53:34  (2) you can use it to implement a priority queue with only two possible weights, if you don't care which element with the lowest weight is popped
18:54:04  arseniiv: I still don't get the joke. It must be really bad ;-)
18:55:06  wait, aren't those the same, as in Spur vs trace?
18:55:33  int-e: like, the second person doesn’t leave tracks so they have no need to call trace either way
18:56:17  or maybe it's trail or track...
18:56:17  I wonder in what languages trace and foot track are homonymous
18:56:27  or trail!
18:56:30  yes
18:56:45  didn’t remember that one
18:57:02  Hrm. "Spur" is a curious word.
18:58:03  though I think of a trail as something long and linguistically uncountable and a track as something countable. Though there are tracks like paths or roads, these ones would be different
18:58:19  But 'trace' covers a similar spectrum of meanings.
18:58:35  b_jonas: also thank you about deque
18:59:04  int-e: I didn’t really thought on it before now
19:00:06  my fluency is not too high yet maybe, so these things don’t occur as idle thoughts, only when consciously playing
19:02:05  viscous thoughts
19:02:17  though I already start to make typos of the “to” instead of “too” kind. I hoped that wouldn’t come
19:02:21  int-e: nah, I think that's a more normal word than the crazy English triplet trace, track, trail, all three of which can be noun or verb, and any two persons I ask explain the difference among them differently
19:03:40  hmm tracking animals by tracing trails
19:04:41  road vehicles that go to places where there are no roads or even paths can be tracked, which means that there's a continuous strip on two of their wheels and that strip is what gives them traction
19:05:38  http://sif.lesidhetree.com/sara/echidna/Echidna%20v0_10a0.pdf
19:06:43  there’s even a DAW called Tracktion. Though they’ve renamed it a while ago
19:12:53 -!- sprocklem has joined.
19:17:16  [[Wutlang]] M https://esolangs.org/w/index.php?diff=66121&oldid=50063 * Dtuser1337 * (-1) /* Commands */
19:17:20 -!- Sgeo has quit (Ping timeout: 276 seconds).
19:38:56 -!- sprocklem has quit (Ping timeout: 246 seconds).
20:39:41 -!- arseniiv has quit (Read error: Connection reset by peer).
20:40:00 -!- arseniiv has joined.
20:45:54 -!- b_jonas has quit (Quit: leaving).
20:53:35 -!- Lord_of_Life_ has joined.
20:56:35 -!- Lord_of_Life has quit (Ping timeout: 265 seconds).
20:56:41 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
20:59:29  writing a factorial function with a queue is uh... irritating.
20:59:45  at least I think.
21:03:17 -!- xkapastel has quit (Quit: Connection closed for inactivity).
21:04:18  imode: Shouldn't be hard as long as you know the size of the queue at each step?
21:04:47  I'd expect things to be fairly sane in queue-land until you want to do recursion.
21:05:17  (And no, the factorial function isn't recursive unless you want it to be.)
21:05:44  I know, I wrote an iterative version, now I'm trying to write a recursive version.
21:06:17  I see.
21:06:39  Yeah, good luck, have fun!
21:06:46  haha, thanks.
21:06:52  I got _one_ iteration down.
21:07:35  (I guess I'd do the irritating thing where there's a marker in the queue that indicates the end of a simulated stack.)
21:08:00  yeah, that's the sane part.
21:08:13  the insane thing is queue juggling via rolling and a 'last' operator, that seeks to the last element in the queue.
21:08:48  https://hastebin.com/jegujageqe.rb the iterative version.
21:09:29  the first segment is the shortcode, the middle segment is the "readable" version, the final segment is the line noise version of the first segment.
21:13:06  'roll' just dequeues and enqueues an item.
21:13:35    
21:13:41 * int-e sighs.
21:14:19  (hatebin)
21:14:59  I take it I should use hatebin then. :P
21:15:18  hastebin was down for a non-insignificant amount of time when I last used it.
21:18:30  imode: Ugh, does that exist (of course it does, meh.)
21:18:47  it does. :D
21:18:53  you'd like it. stripped down.
21:18:58          
21:19:04  I don't see anything to like.
21:19:17  well, I didn't know what you were complaining about. I assumed jquery and highlight.
21:19:29  I'm using the Debian pastebin for a reason :)
21:19:37  imode: Javascript.
21:19:41 * imode shrugs.
21:20:21  Mandatory... fetching the content with XHR. There's no *good* reason for doing that in a pastebin.
21:20:24 -!- ghost2501 has joined.
21:20:26  until someone does away with the idea of a web browser with arbitrarily executable code being delivered to you, javascript is here to stay. I say that through gritted teeth.
21:22:06  It's a losing fight. But it's also a great filter.
21:22:35  90% of the time when a site demands JS I decide I wasn't *that* interested in the content in the first place.
21:24:18 -!- ghost2501 has left ("Leaving").
21:29:54 -!- atslash has joined.
21:34:15  imode: Anyway, pastebins are one niche where I see *some* prospect of getting people to use non-JS variants. So I keep bringing it up.
21:39:02  I see.
21:47:52 -!- Sgeo has joined.
21:52:28 -!- Sgeo_ has joined.
21:54:03 -!- Sgeo has quit (Ping timeout: 245 seconds).
23:05:46 -!- sprocklem has joined.
23:08:25 -!- FreeFull has quit.
23:10:20 -!- sftp has quit (Excess Flood).
23:10:48 -!- sftp has joined.
23:25:38 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
23:35:29  forget factorial, generating a queue of descending integers is hard. :\
23:35:55  What do you need a queue of descending integers for?
23:36:56  breaking the problem into two tasks to unblock myself. generate the numbers, then you can interleave the multiplications, etc. into them.
23:37:18  5 4 3 2 1 * * * * ...
23:37:21  Multiplying a queue of descending integers? What could that be for?
23:37:46  I'm working on a queue-based language.
23:37:56  seeing if I can do some basic things in it.
23:38:02  like, for instance, a recursive factorial function.
23:38:06  Oh!
23:38:09  I forgot factorial.
23:38:19  it's just a product of a range.
23:38:24  5 * 4 * 3 * 2 * 1
23:38:28  Yes, but you said to forget it.
23:38:29  == 5!
23:38:41  ...
23:41:57  [[Encapsulation]]  https://esolangs.org/w/index.php?diff=66122&oldid=66064 * Hakerh400 * (+6) Update computational class
23:45:33  shachaf: lol
23:47:53  [[Intramodular Transaction]]  https://esolangs.org/w/index.php?diff=66123&oldid=66018 * Hakerh400 * (+244) Update computational class
23:51:43 -!- atslash has quit (Quit: Leaving).

2019-09-13:

00:23:42  `asm .byte 0xff, 0x35, 0xba, 0x0a, 0x20, 0x00
00:23:43  0:  ff 35 ba 0a 20 00   pushq 0x200aba(%rip) # 0x200ac0
00:23:50  Hmm, that's not right.
00:24:30  `asm .byte 0xff, 0x25, 0xba, 0x0a, 0x20, 0x00
00:24:31  0:  ff 25 ba 0a 20 00   jmpq *0x200aba(%rip) # 0x200ac0
00:24:33  That's the one I meant.
00:31:28  Oh, I misunderstood what was going on in the debugger somehow. That's actually reasonable.
00:51:31 -!- hppavilion[1] has joined.
00:52:38  y'know, I could cheat and just do `last` between every single operation and treat the queue as a stack...
01:20:10  http://sif.lesidhetree.com/sara/echidna/Echidna%20v0_10a1.pdf
01:26:50  it seems like "seek to next last item" is a pretty powerful operation for queues. I wonder if it can be simulated using traditional queue ops and markers.
01:36:14  imode: when I considered a typed concatenative language I thought it would be useful to make something like “list environment”, as in usual code `f g h`, f should be composable with g with h, and if one wants to make other constraints instead of composability, one would need to treat space between words differently,
01:36:14  so there would be special brackets to tell that inside spaces have other meaning, and AFAIR I thought that to be expressible as a typeclass (I considered a haskellish type system)
01:36:14  class ListLike a e where { init :: e; add :: a -> e -> e }
01:36:14  though this seems too restrictive and I don’t remember if I came up with something smarter that time; anyway the environment defined by an instance of that then desugars like `[1 2 3]` → `add 3 (add 2 (add 1 init))`
01:36:14  so maybe you could make an environment where each space means `last` :D
01:36:14  but it’s a heavy machinery of course, one needs to implement an elegant way to describe what brackets these defined environments use, etc., syntactic matters
01:36:50  that's interesting... you'd need to have 
01:37:01  spaces evenly balanced, then. or one space between each token.
01:37:34 * arseniiv ’s going to sleep
01:37:41  sweet dreams, thanks for the advice.
01:37:44  imode: ah, I meant logical spaces
01:38:19  like, what there is between parsed tokens (nothing, but let’s pretend)
01:38:35  thank you too!
01:38:38  ah, gotcha.
01:38:52  yeah that ain't a bad idea.. hm.
01:38:55  I’m late now, I should sleep 2x fast :D
01:39:02  lol.
01:40:38  when i had general anaesthesia recently it felt like i was sleeping 8x as fast
01:40:55  like I had a whole night's worth of really deep good sleep in an hour of wallclock time
01:41:08  unlike the previous time it didn't feel like an instantaneous time jump
01:41:14  i may have even dreamed
01:42:06  that is a thing that happens, apparently
01:42:13  wild.
01:42:29  yep
01:42:34  not as wild as the galantamine dreams though
01:42:35  oh man
01:43:38 -!- arseniiv has quit (Ping timeout: 246 seconds).
01:43:49  if you want a truly esoteric dream experience, wake up after 4 hours, take 8mg galantamine, then go back to sleep
01:44:08  the first time i did it, my dreams were intense and deeply-nested
01:44:19  i gave up trying to write anything down because every time I tried I realized I was still dreaming
01:44:47  when I finally woke up for real I exclaimed out loud "Wow! That was something."
01:45:09  next time I think I'll take it with a small amount of LSD
02:17:52  [[Kov]] N https://esolangs.org/w/index.php?oldid=66124 * A * (+239) Created page with "[[Kov]] ([K]olmon[o]gro[v]) is a simple language inspired by [https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity Kolmonogrov-complexity challenges]. C..."
02:18:49  [[Kov]] M https://esolangs.org/w/index.php?diff=66125&oldid=66124 * A * (+394) 
02:20:57  [[Kov]] M https://esolangs.org/w/index.php?diff=66126&oldid=66125 * A * (+156) 
02:21:40  [[Kov]] M https://esolangs.org/w/index.php?diff=66127&oldid=66126 * A * (+173) 
02:30:04  [[Kov]] M https://esolangs.org/w/index.php?diff=66128&oldid=66127 * A * (+634) 
02:31:18  how do i get a randomly selected quote from HackEso?
02:31:23  matching some regex
02:31:25  or list of all quotes
02:34:07  ok, i did what i wanted with  `` grep kmc quotes | paste
02:34:17  now i can bask in the wisdom and wit of many-years-ago me
02:37:24  [[Kov]] M https://esolangs.org/w/index.php?diff=66129&oldid=66128 * A * (+61) 
02:37:41  "quote kmc | paste" would be the canonical answer probably.
02:37:50  I hear kmc has good quotes.
02:41:08 * kmc canonicalizes shachaf 
02:41:10  I have a few good ones
02:41:25  cocks, truly cocks
02:42:02   BBC: Exercise 'can be as good as pills'   oh, they mean for your health
02:42:21  `doag
02:42:22  11927:2019-09-08  mkx bin/as-encoding//echo "$1" | as -o /tmp/out.o - && objdump -d /tmp/out.o | grep -P \'^ *[0-9a-f]+:\' | sed \'s/^[^\\t]*\\t//; s/ *\\t/: /g\' \ 11926:2019-09-08  mkx bin/as-encoding//echo "$1" | as -o /tmp/out.o - && objdump -d /tmp/out.o | grep -P \'^ *\\d+:\' | sed \'s/^[^\\t]*\\t//; s/ *\\t/: /g\' \ 11925:2019-09-01  learn The password of the month is ninjaed. \ 11924:2019-08-29  `` perl -p
02:42:27  hmm
02:44:04  what's a doag
02:44:52  `` ls -lt tmp/paste
02:44:54  total 564 \ -rw-r--r-- 1 1000 1000  11630 Sep 13 02:32 paste.2937 \ -rw-r--r-- 1 1000 1000   1210 Aug  3 03:34 paste.31274 \ -rw-r--r-- 1 1000 1000 115029 Jul 21 10:19 paste.3516 \ -rw-r--r-- 1 1000 1000    702 Jul 19 23:16 paste.11087 \ -rw-r--r-- 1 1000 1000      0 Jul 16 12:40 paste.18219 \ -rw-r--r-- 1 1000 1000   1031 Apr 21 17:05 paste.6806 \ -rw-r--r-- 1 1000 1000   2146 Apr 14 00:08 paste.4591 \ -rw-r--r-- 1 1000 1000   1715 Apr 13 23:53 paste.2226
02:44:58  `url tmp/paste/paste.2937
02:44:59  https://hack.esolangs.org/tmp/paste/paste.2937
02:45:51  you're the mannow doag
02:47:00  http://sif.lesidhetree.com/sara/echidna/Echidna%20v0_10a1a.pdf
02:47:13  (messed up an example)
02:53:39  `cat bin/hog
02:53:40  hlnp --template "{desc}\n" -- "$@"
02:53:54  `cat bin/dog
02:53:54  cat: bin/dog: No such file or directory
02:54:22  shachaf: not very much orthogonality there
02:57:37  Ah, "np" is for "no ping".
02:58:50  "a" is, presumably, for "all revisions" (including deleted ones). "d" is for "include date".
02:59:28  shachaf: and wtf was your reasoning behind "dogue"
03:00:09  err hogue.
03:04:45  http://sif.lesidhetree.com/sara/echidna/Echidna%20v0_10a1ac.pdf (Calibri test version)
03:05:26  what's a good font for documentation?
03:26:16  int-e: dog presumably should exist but since no one ever uses hog it's kind of irrelevant.
03:26:25  Let me see if I can trace the etymology.
03:26:33  The original was hog = hg log
03:26:38  `cat bin/hog
03:26:39  hlnp --template "{desc}\n" -- "$@"
03:26:43  `cat bin/hoag
03:26:44  hlnp --removed --template "{desc}\n" -- "$@"
03:27:13  If I'm not mistaken, "hoag" is named after The Unpleasant Profession of Jonathan Hoag.
03:27:35  I don't think anyone cares about the version that doesn't show removed entries, though.
03:27:47  doag is the version of hoag that shows dates. That's very useful so no one ever uses the h commands.
03:28:01  `cat bin/hogue
03:28:03  cat: bin/hogue: No such file or directory
03:28:09  `cat bin/dogue
03:28:10  cat: bin/dogue: No such file or directory
03:29:00  `doag bin/hogue
03:29:01  8420:2016-06-09  ` mv bin/ho{gue,ag} \ 8329:2016-06-04  mkx bin/hogue//hg log --removed --template "{desc}\\n" "$@" \ 8328:2016-06-04  mkx bin/hogue//hg log --remvoed --template "{desc}
03:29:03  `doag bin/hoag
03:29:05  9214:2016-10-10  ` sed -i \'s/hg log/hlnp/\' bin/hoag \ 8453:2016-06-12  sled bin/hoag//s/"\\$@"/-- "$@"/ \ 8420:2016-06-09  ` mv bin/ho{gue,ag}
03:29:14  I didn't remember that at all.
03:32:00  int-e: I think hog->hogue isn't much less plausible than hog->hoag
03:32:05  Presumably they're pronounced the same.
03:33:24  kmc: higan
03:33:43  I saw a good cat today
03:34:42 -!- craigo has joined.
03:34:48  i see that
03:41:34  `randquote kmc
03:41:35  834)  i was going to say that the complexity of a demo grows exponentially with size, but it's not so much "exponential" as "faster than any computable function"
03:42:07  `randquote kmc
03:42:09  977)  prediction: kmc never comes back  * kmc has joined #esoteric
03:42:16  `randquote kmc
03:42:17  1058)  are you a hardcore PC gamer Sgeo_   Want to be
03:42:31  wow, forgot about that one
03:42:37  `randquote kmc
03:42:38  1004)  LIST OF ACRONYMS: List Integrating Some Terminology Of Fine Authentic Credibility Relating to Our New Year Media System
03:42:44  `randquote kmc
03:42:44  1054)  oh my, this is a photo of an elliott fisting [...]  i meant elephant   but you know what, ok.   Bike: ...   Bike: can you send me that picture when i'm not at work ok   plz and thx
03:47:25  I think I'm probably wrongue about "hoag".
05:19:52  `randquote shachaf
05:19:53  1169)  pippi långstrump's name is translated as "gilgi" or "bilbi" usually   Does she have a ring of power?
05:19:57  `randquote shachaf
05:19:58  737)  U+2205 [∅] NO LETTER O ALLOWED
05:20:01  `randquote shachaf
05:20:05  915)  shachaf: LC_ALL=de_DE.utf-8 errno -l   Veraltete NFS-Dateizugriffsnummer   Eingabe-/Ausgabefehler   "Unterbrechung während des Betriebssystemaufrufs"  i think that was in the Ring Cycle
05:20:10  `randquote shachaf
05:20:12  716)  elliott: Apparently Rowan Williams is Primate of All England.   CHECKMATE CREATIONISTS
05:20:14  `randquote shachaf
05:20:16  1011)  i would visit elliott but i'm vegetarian
05:20:23  i like how one of the shachaf-quotes was actually a kmc-quote
05:20:26  i'm everywhere baby
05:24:52  is that like "everywhere continuous"
05:29:39  lol
05:29:45  /o/
05:46:16 -!- Sgeo has joined.
05:49:00 -!- Sgeo_ has quit (Ping timeout: 246 seconds).
05:52:23 -!- Sgeo_ has joined.
05:53:43  `quote LC_
05:53:44  915)  shachaf: LC_ALL=de_DE.utf-8 errno -l   Veraltete NFS-Dateizugriffsnummer   Eingabe-/Ausgabefehler   "Unterbrechung während des Betriebssystemaufrufs"  i think that was in the Ring Cycle
05:55:17 -!- Sgeo has quit (Ping timeout: 246 seconds).
06:01:58 -!- Sgeo_ has quit (Ping timeout: 245 seconds).
06:05:08 -!- Sgeo has joined.
06:16:44  Oh german.
06:18:28  . o O ( Which is correct, "Eingabe" or "Eingebung"? )
06:35:43  [[Inc]] N https://esolangs.org/w/index.php?oldid=66130 * A * (+411) Created page with "[[Inc]] is a joke language that can only add the top of the stack. == Instructions == There is initially a 0 in the stack. * . This increments the top of the stac..."
06:37:04  [[Inc]] M https://esolangs.org/w/index.php?diff=66131&oldid=66130 * A * (-39) 
06:37:57  [[Inc]] M https://esolangs.org/w/index.php?diff=66132&oldid=66131 * A * (-17) 
06:38:14  [[Inc]] M https://esolangs.org/w/index.php?diff=66133&oldid=66132 * A * (-2) Golfed this into a one-liner!
06:52:03 -!- craigo has quit (Read error: Connection reset by peer).
06:55:49  [[GolfJoke]] M https://esolangs.org/w/index.php?diff=66134&oldid=66006 * A * (+25) 
06:59:12  [[Truth-machine]] M https://esolangs.org/w/index.php?diff=66135&oldid=65908 * Dtuser1337 * (-1) Removing unnessecary newline in above Argh!
07:04:29 -!- tromp has joined.
07:04:37 -!- imode has quit (Ping timeout: 265 seconds).
07:07:47 -!- tromp_ has quit (Ping timeout: 276 seconds).
07:10:56  [[Intramodular Transaction]] M https://esolangs.org/w/index.php?diff=66136&oldid=66123 * Hakerh400 * (-1) 
07:33:10 -!- cpressey has joined.
07:52:07 -!- sftp has quit (Excess Flood).
07:52:29 -!- sftp has joined.
08:00:09 -!- Phantom_Hoover has joined.
08:01:00 -!- Phantom_Hoover has quit (Client Quit).
08:23:27  [[Baba Is You]] M https://esolangs.org/w/index.php?diff=66137&oldid=60915 * A * (+235) 
08:44:31 -!- atslash has joined.
08:45:08  [[Baba Is You]] M https://esolangs.org/w/index.php?diff=66138&oldid=66137 * A * (+3006) /* Descriptions */ Upload my notes in Chinese
08:54:53 -!- Lord_of_Life has quit (Ping timeout: 245 seconds).
08:57:41  [[Baba Is You]] M https://esolangs.org/w/index.php?diff=66139&oldid=66138 * A * (+189) 
08:59:10 -!- Lord_of_Life has joined.
09:03:48  [[Baba Is You]] M https://esolangs.org/w/index.php?diff=66140&oldid=66139 * A * (+191) /* Push */
09:05:16  are games considered an esolang?
09:06:05  int-e: "Eingebung" is more like an unexpected idea
09:06:29  getting understanding of something
09:06:50  [[Baba Is You]] M https://esolangs.org/w/index.php?diff=66141&oldid=66140 * A * (+56) /* Float */
09:06:53  myname: It was a trick question. (German is my first language.)
09:07:04  okay!
09:08:01  [[Baba Is You]] M https://esolangs.org/w/index.php?diff=66142&oldid=66141 * A * (+105) /* Words */
09:09:01  myname: I should have written "which spelling is correct" to make the intent clearer. (Answer: both).
09:09:04 -!- wob_jonas has joined.
09:10:00  [[Baba Is You]] M https://esolangs.org/w/index.php?diff=66143&oldid=66142 * A * (+242) 
09:12:15  myname: Some games definitely come close to being esolangs, and vice versa
09:12:58  iirc the classic example is that Transport Tycoon is Turing-complete
09:12:58  cpressey: such as OpenTTD, Minecraft, Factorio?
09:14:08  OpenTTD = opensource clone of Transport Tycoon Deluxe, so, yes
09:14:30  ``` for x in quote \' \" q; whatis $x; done # kmc
09:14:31  bash: -c: line 0: syntax error near unexpected token `whatis' \ bash: -c: line 0: `for x in quote \' \" q; whatis $x; done # kmc'
09:14:37  ``` for x in quote \' \" q; do whatis $x; done # kmc
09:14:39  quote(1hackeso) - search quote database or print random quote \ quote(8lambdabot) - no description \ '(1hackeso) - search quote database or print random quote \ "(1hackeso) - show two random quotes \ q(1hackeso) - search quote database or print random quote
09:15:48  kmc: you can also just read the quotes from the file "quotes" in hackenv, or use the allquotes command to print them all with line numbering
09:15:56  it's just a text file, one quote per line
09:16:01  cpressey: TC-ness of games are interesting, but I would not consider those an esolang in the sense of the wiki
09:16:20  reading the files directly without using the commands seems to annoy some people here
09:16:24  I'd make a page for a list of TC games or something like that
09:16:55  `whatis quotes
09:16:56  quotes(1hackeso) - search quote database or print random quote
09:17:41  ah I see, you already found the file
09:17:52  `whatis doag
09:17:53  doag(1hackeso) - query hackenv version control log, with dates
09:18:31  `whatis hurl
09:18:32  hurl(1hackeso) - no description
09:18:48  `` type hwrl
09:18:49  hwrl is /hackenv/bin/hwrl
09:19:19  " I don't think anyone cares about the version that doesn't show removed entries, though." => I am interested. I generally use hg log -T "{rev}:{date|shortdate}:{desc}\n" rather than any of your fancy wrappers.
09:19:26  `whatis url
09:19:27  url(7) - uniform resource identifier (URI), including a URL or URN \ url(1hackeso) - no description \ url(8lambdabot) - no description
09:20:31  `whatis whatis
09:20:32  whatis(1) - display one-line manual page descriptions
09:20:46  int-e: the whatis descriptions for hackeso all come from me, so for any command that I didn't know about, they just say "no description". but they're in a plain text file that you can edit if you want (just be careful because the web `edit form tends to mess up non-ascii files when you save them).
09:21:25  the whatis descriptions for unix commands and functions don't come from me, they're from the headers of manpages
09:22:14  also the wisdom database has longer help for some hackeso commands, but that's only occasional, doesn't even try to be exhaustive
09:22:18  whatis does try to be exhaustive
09:23:32  `whatis relcome
09:23:33  ReLcOmE(1hackeso) - no description \ relcome(1hackeso) - welcome new user to irc channel, colorfully
09:30:20  `help fetch
09:30:22  ​`fetch []  downloads files, and is the only web access currently available in HackEgo. It is a special builtin that cannot be called from other commands. See also `edit.
09:31:19  `fetch share/whatis http://int-e.eu/~bf3/tmp/whatis
09:31:22  2019-09-13 09:31:22 URL:http://int-e.eu/~bf3/tmp/whatis [752504/752504] -> "share/whatis" [1]
09:31:56  `whatis relcome
09:31:57  ReLcOmE(1hackeso) - CoLoRfUlLy wElCoMe nEw uSeR To iRc cHaNnEl \ relcome(1hackeso) - welcome new user to irc channel, colorfully
09:32:31  `sled share/whatis//s/^url(1hackeso) - .*/url(1hackeso) - print URL to view contents of a hackenv file/
09:32:33  share/whatis//aio.h(0p) - asynchronous input and output \ arpa_inet.h(0p) - definitions for internet operations \ assert.h(0p) - verify program assertion \ complex.h(0p) - complex arithmetic \ cpio.h(0p) - cpio archive values \ ctype.h(0p) - character types \ dirent.h(0p) - format of directory entries \ dlfcn.h(0p) - dynamic linking \ errno.h(0p) - system error numbers \ fcntl.h(0p) - file control options \ fenv.h(0p) - point environment \ float.h(0p) - fl
09:32:57  `sled share/whatis//s/^hurl(1hackeso) - .*/hurl(1hackeso) - print URL to view version log of a hackenv file/
09:32:59  share/whatis//aio.h(0p) - asynchronous input and output \ arpa_inet.h(0p) - definitions for internet operations \ assert.h(0p) - verify program assertion \ complex.h(0p) - complex arithmetic \ cpio.h(0p) - cpio archive values \ ctype.h(0p) - character types \ dirent.h(0p) - format of directory entries \ dlfcn.h(0p) - dynamic linking \ errno.h(0p) - system error numbers \ fcntl.h(0p) - file control options \ fenv.h(0p) - point environment \ float.h(0p) - fl
09:33:04  fizzie: I did those!
09:33:38  throw new ConcurrentModificationException("sorry");
09:34:02  fizzie: I'm more annoyed at the duplicated work if anything else :)
09:34:38  `whatis hwrl
09:34:39  hwrl(1hackeso) - link to wisdom entry history in hackenv version control
09:34:45  of course now this is inconsistent
09:35:09  I took my lead from
09:35:11  `whatis paste
09:35:12  paste(1) - merge lines of files \ paste(1p) - merge corresponding or subsequent lines of files \ paste(1hackeso) - print URL to read a file in hackenv through web \ paste(8lambdabot) - no description
09:35:33  `whatis howt
09:35:34  howt(1hackeso) - query hackenv version control log for wisdoms, oldest first
09:35:42  I was inspired by one of these instead
09:36:26  `sled share/whatis//s/^hwrl(1hackeso) - .*/hwrl(1hackeso) - print URL to view version log of a wisdom entry/
09:36:29  share/whatis//aio.h(0p) - asynchronous input and output \ arpa_inet.h(0p) - definitions for internet operations \ assert.h(0p) - verify program assertion \ complex.h(0p) - complex arithmetic \ cpio.h(0p) - cpio archive values \ ctype.h(0p) - character types \ dirent.h(0p) - format of directory entries \ dlfcn.h(0p) - dynamic linking \ errno.h(0p) - system error numbers \ fcntl.h(0p) - file control options \ fenv.h(0p) - point environment \ float.h(0p) - fl
09:36:46  The 'paste' one could be clarified, since it doesn't really hint that `... | paste` is also a thing.
09:40:47  I guess the downside of `fetch is that it doesn't really say what is being changed.
09:41:15  Well, the sled output isn't that useful for large files either.
09:41:19  fizzie: do you happen to know if the `edit web interface is supposed to be broken for files that contain non-ascii files?
09:41:30  because I used it recently, and it messed up the contents of a file
09:41:38  I fixed it in private message, but still
09:42:59  fizzie: I didn't know that was a thing. how does that work?
09:43:12  wob_jonas: It's not supposed to be broken, but I'm not super-surprised it is, it's Python3 + Flask + strings. There's probably some way to make it use bytes instead.
09:43:28  ``` seq 170 7 480 | paste
09:43:29  https://hack.esolangs.org/tmp/paste/paste.6371
09:43:37  wow indeed
09:43:41  cool, I didn't know
09:43:41  It just makes a new file in tmp/.
09:45:05  For some reaosn I thought `edit was written in Go.
09:45:19  Ah, I guess I wrote the first version of it in Go.
09:45:40  I think if I was writing it today, I might have written it in Go.
09:46:50  It's not a super-complicated web app, https://bitbucket.org/fizzie/hackedit/src/master/hackedit.py
09:47:46  Go is kind of scow but Python is too.
09:47:57  For a small program like this the main thing is library availability.
09:48:19  I guess I should make my own language and give it a bunch of good libraries.
09:51:49  The Flask documentation doesn't seem to talk too much about whether form parameters are decoded strings or raw bytes. Although it does look like it's calling f.write on them on a file opened with just 'w', so I guess it's in text mode and that's a string.
09:53:12  `` python3 -c 'print("a" "b")'
09:53:13  ab
09:53:22  Speaking of Python, someone told me about that the other day and I was, like, whoa, dude.
09:53:30  How C.
09:54:12  Anyway I'd be fine writing a thing like that in C if there was a convenient C library for HTTP servers.
09:54:20  I think I saw that mentioned somewhere, in some style guide about how to write long strings.
09:54:53  esolangs.org/logs/ uses civetweb.
09:54:54  wait, there are C HTTP servers
09:54:58  The C++ bindings, but still.
09:55:21  I'd be wary of them, it's really easy to write bugs in
09:55:29  Not sure if the label "convenient" is super-applicable either.
09:55:42  true
09:56:02  I don't think there's a particular reason they shouldn't be convenient?
09:56:10  hmm, wonder if I could run an http server on my vax
09:56:18  Not "they" in general, civetweb in particular.
09:56:47  Ah, sure.
09:56:55  It may be more convenient in C than in C++, the C++ interface feels a little bit like an afterthought.
09:59:30  Sep 13 10:10:00 techne.zem.fi esobot[20492]: [135B blob data]
09:59:35  At some point I should fix that. I think it's from the debugging output of the wiki change notification, which includes the color codes, which makes systemd journal think it's binary data not fit for human eyes.
10:02:33  Here's something I learned recently: if you make your thing print out syslog priority annotations at the start of your lines (as in, "<4>warning, warning"), the standard systemd stdout/stderr-to-journal pipe will use them as priority levels.
10:09:29  `mkx bin/beat//s=$(date +%s); echo @$(((s+3600) % 86400 * 10 / 864))
10:09:31  bin/beat
10:09:32  `beat
10:09:33  ​@464
10:09:46  We didin't have a Swatch Internet Time clock yet, I don't think.
10:10:37  fizzie: no! that's not general enough. modify glibc to add a new format for that into strftime, rebuild the whole thing, then we can just use /bin/date for this
10:13:22  Fair enough, but I'll save that for a rainy day.
10:13:36  Although I think it's always three digits, so let's fix that at least.
10:13:40  `mkx bin/beat//s=$(date +%s); printf '@%03d' $(((s+3600) % 86400 * 10 / 864))
10:13:42  bin/beat
10:18:36  fizzie: shouldn't you add a -u switch to date, for future compatibility when the next generation of HackE?o will use new zealand timezone again?
10:20:53  fizzie: also, I think that truncates to integer seconds prematurely, though that'll be harder to fix
10:21:02 -!- hppavilion[1] has quit (Remote host closed the connection).
10:21:32 -!- hppavilion[1] has joined.
10:28:41 -!- arseniiv has joined.
10:38:45  oh wait
10:38:55  the +%s format is epoch time, so the -u wouldn't change anything
10:38:56  sorry
10:43:26  ``` echo '#!/usr/bin/python3; import math,time; b = math.floor(100*((time.time()+3600) % 86400) / 86.4); print("%03d.%02d"%(b//100,b%100))' | tr \; \\n > bin/beat; chmod -v a+x bin/beat
10:43:28  mode of 'bin/beat' retained as 0755 (rwxr-xr-x)
10:43:51  ``` datei; for x in {0..5}; do beat; done; datei
10:43:52  ​  File "/hackenv/bin/beat", line 2 \     import math,time \     ^ \ IndentationError: unexpected indent \   File "/hackenv/bin/beat", line 2 \     import math,time \     ^ \ IndentationError: unexpected indent \   File "/hackenv/bin/beat", line 2 \     import math,time \     ^ \ IndentationError: unexpected indent \   File "/hackenv/bin/beat", line 2 \     import math,time \     ^ \ IndentationError: unexpected indent \   File "/hackenv/bin/beat", line 
10:43:59  gtfo
10:44:13  ``` echo '#!/usr/bin/python3;import math,time;b = math.floor(100*((time.time()+3600) % 86400) / 86.4);print("%03d.%02d"%(b//100,b%100))' | tr \; \\n > bin/beat; chmod -v a+x bin/beat
10:44:15  mode of 'bin/beat' retained as 0755 (rwxr-xr-x)
10:44:19  ``` datei; for x in {0..5}; do beat; done; datei
10:44:21  2019-09-13 10:44:20.077065689 +0000 UTC September 13 Friday 2019-W37-5 \ 489.12 \ 489.12 \ 489.12 \ 489.12 \ 489.12 \ 489.12 \ 2019-09-13 10:44:20.793925337 +0000 UTC September 13 Friday 2019-W37-5
10:44:38  ``` datei; for x in {0..5}; do sleep 1; beat; done; datei
10:44:45  2019-09-13 10:44:38.662409684 +0000 UTC September 13 Friday 2019-W37-5 \ 489.34 \ 489.36 \ 489.37 \ 489.38 \ 489.40 \ 489.41 \ 2019-09-13 10:44:45.582049236 +0000 UTC September 13 Friday 2019-W37-5
10:45:19  fizzie: ^ will that work? now it doesn't truncate to seconds before the computation
10:46:31  or should it display no decimal digits?
10:56:49 -!- Frater_EST has joined.
10:57:21  I seem to be missing another bit of pop culture here
10:58:51  int-e: it's not really pop culture, it's a stupid marketing gimmick
11:01:02 -!- ahrkl has joined.
11:08:02 -!- hppavilion[1] has quit (Ping timeout: 240 seconds).
11:13:11  hmm I opened Metamath λ page and saw beta-reduction formalized as, roughly, A: β ⟹ (λx:α A)(x:α) = A, without any explicit substitution. Maybe my thing could avoid them either? I didn’t realize at all that the engine should be able to work with such “reflexive” definitions
11:13:43 -!- ahrkl has left ("Leaving").
11:14:05  (and I don’t get how, yet. It should unify the right way but how)
11:14:08  wob_jonas: The .xx part is not part of the official beat notation. :/
11:14:25  wob_jonas: I was thinking it should be an option, but couldn't think of a flag for it.
11:14:30  (-v?)
11:15:32  ``` echo '#!/usr/bin/python3;import math,time;b = math.floor(((time.time()+3600) % 86400) / 86.4);print("%03d"%(b,))' | tr \; \\n > bin/beat; chmod -v a+x bin/beat
11:15:34  mode of 'bin/beat' retained as 0755 (rwxr-xr-x)
11:15:36  `beat
11:15:36  `beat
11:15:37  510
11:15:37  `beat
11:15:37  510
11:15:38  510
11:15:53  `? beat
11:15:54  beat? ¯\(°​_o)/¯
11:16:35 -!- Frater_EST has left.
11:17:06  or maybe that one alone isn’t sufficient, I would need to see what proofs are using
12:13:45  `fetch bin/beat https://hack.esolangs.org/get/bin/beat
12:13:47  2019-09-13 12:13:46 URL:https://hack.esolangs.org/get/bin/beat [616/616] -> "bin/beat" [1]
12:13:53  ``` beat; beat -p
12:13:53  bash: /hackenv/bin/beat: python3: bad interpreter: No such file or directory \ bash: /hackenv/bin/beat: python3: bad interpreter: No such file or directory
12:14:28  ``` beat; beat -p
12:14:29  ​[] \ 551 \ [('-p', '')] \ 551.72
12:14:48  ``` beat; beat -p
12:14:49  551 \ 551.95
12:14:50  better
12:14:57  fizzie: ^ -p command-line option now
12:24:08  http://sif.lesidhetree.com/sara/echidna/Echidna%20v0_10a1ac2.pdf does this look appealing to the human eye?
12:28:51  http://sif.lesidhetree.com/sara/echidna/Echidna%20v0_10a1a.pdf compared to this?
12:50:25  wob_jonas: Nice, although what's the -p short for? 
12:50:38  (Penny?)
12:50:40  fizzie: precision
12:50:44  Ah, I see.
12:51:12  I guess penny works too
12:51:19  only
12:51:42  ``` beat -P4 # it clearly means precision (in the sense that printf uses precision specifiers) here
12:51:43  577.5790
12:51:54  ``` beat -P2; beat -P1; beat -P3; beat -P0
12:51:55  577.71 \ 577.7 \ 577.722 \ 577
12:54:20 -!- xkapastel has joined.
12:59:58  made another version of the documentation in Comic Sans as a joke for my dad. i know better than to put it on the web.
13:47:33  [[Brank]] N https://esolangs.org/w/index.php?oldid=66144 * A * (+384) Created page with "[https://softwareengineering.stackexchange.com/questions/132385/what-makes-a-language-turing-complete?rq=1 In an answer for this question:] In general, for an imperative langu..."
13:53:42  [[Talk:Baba Is You]] M https://esolangs.org/w/index.php?diff=66145&oldid=60916 * A * (+328) 
14:12:26  [[Baba Is You]] M https://esolangs.org/w/index.php?diff=66146&oldid=66143 * A * (+170) /* Shut */
14:14:14  [[Baba Is You]] M https://esolangs.org/w/index.php?diff=66147&oldid=66146 * A * (+108) /* External Resources */
14:29:20 -!- Sgeo_ has joined.
14:32:14 -!- Sgeo has quit (Ping timeout: 246 seconds).
14:37:01 -!- Sgeo_ has quit (Ping timeout: 265 seconds).
14:37:55  [[EnilKode]]  https://esolangs.org/w/index.php?diff=66148&oldid=60887 * EnilKoder * (+461) Mutable
14:40:58  > let both p1 p2 x = (p1 x) && (p2 x) in let inRange = both (\x -> x > 3) (\x -> x < 8) in inRange 5
14:41:01   True
14:41:41  > let inRange = (\x -> x > 3) && (\x -> x < 8) in inRange 5
14:41:44   error:
14:41:44       • Couldn't match expected type ‘Bool’
14:41:44                     with actual type ‘Integer -> Bool’
14:42:42  I think you could detect that and coerce that upwards in a general fashion.  I'm not saying you should.  But I think you could.
14:47:05 -!- Soni has left ("http://quassel-irc.org - Chat comfortably. Anywhere.").
14:47:17  > let { inRange = (&&) <$> (x > 3) <*> (\x < 8); } in inRange 5
14:47:19   :1:42: error: parse error on input ‘<’
14:47:25  http://sif.lesidhetree.com/sara/echidna/Echidna%20v0_10a1ac3p.pdf (hopefully this is saner to read)
14:47:26  > let { inRange = (&&) <$> (x > 3) <*> (x < 8); } in inRange 5
14:47:29   error:
14:47:29       • Couldn't match expected type ‘f Bool’ with actual type ‘Bool’
14:47:29       • In the second argument of ‘(<$>)’, namely ‘(x > 3)’
14:47:40  > let { inRange = (&&) <$> (> 3) <*> (< 8); } in inRange 5
14:47:43   True
14:47:54  > let { inRange = (&&) <$> (> 3) <*> (< 8); } in fmap inRange [0..10]
14:47:56   [False,False,False,False,True,True,True,True,False,False,False]
14:47:59  cpressey: something like that
14:48:31  wob_jonas: Something like that except the implementation figures it out for you.
14:48:38  but of course it's much easier to write inRange x = 3 < x && x < 8
14:49:33  cpressey: try that esolang of which I heared of only recently and I don't recall the name
14:49:57  that really crazy one
14:50:14  you mean echidna?
14:50:42  no, I mean Husk
14:50:49  but good try
14:54:46  wob_jonas: i gave you yesterday and the day before to not look at echidna.
14:55:35  wob_jonas: I see, yes. https://github.com/barbuz/Husk/blob/master/Builtins.hs#L90 would handle my example I think?
14:56:08  cpressey: no clue, I don't know how that language works. I looked at the doc'ation and decided it was too crazy for me to try to understand
14:56:33  Well I'm totally guessing anyway.
14:56:35  I looked at it because I mentioned some ideas of what an esolang could do, and Husk does do that, but it also does more
14:59:51 -!- cpressey has quit (Quit: A la prochaine.).
15:08:38 -!- Sgeo has joined.
15:11:31  Sgeo: hi
15:19:55 -!- sebbu2 has joined.
15:24:01 -!- sebbu has quit (Ping timeout: 268 seconds).
15:29:17 -!- MDude has quit (Ping timeout: 258 seconds).
15:33:24 -!- MDude has joined.
16:03:39 -!- wob_jonas has quit (Remote host closed the connection).
16:05:43 -!- Sgeo_ has joined.
16:08:26 -!- Sgeo has quit (Ping timeout: 240 seconds).
16:40:57 -!- imode has joined.
16:44:36  http://sif.lesidhetree.com/sara/echidna/Echidna%20v0_10a2_p.pdf
17:11:05  my `last` operation seems like something a traditional queue automaton wouldn't be able to do without some significant setup, because you have to know the length of the queue ahead of time.
17:15:18  http://sif.lesidhetree.com/sara/echidna/Echidna%20v0_10a2_p.pdf
17:15:25  oops
17:15:30  dead link now
17:15:59 * Lykaina needs to get paste to behave
17:22:59  http://sif.lesidhetree.com/sara/echidna/Echidna%20v0_10a2_p2.pdf should work...
17:24:12 -!- b_jonas has joined.
17:25:25  Lykaina: the links you gave earlier, "http://sif.lesidhetree.com/sara/echidna/Echidna%20v0_10a1ac2.pdf" and "http://sif.lesidhetree.com/sara/echidna/Echidna%20v0_10a1a.pdf", are broken. do you have an URL for the current rendered documentation?
17:25:36  oh wait
17:25:41  you just missed it
17:25:45  http://sif.lesidhetree.com/sara/echidna/Echidna%20v0_10a2_p2.pdf should work...
17:26:17  let me know if i mistyped the fixed document
17:26:19  that one works
17:27:40  it's an emergency fix for an emergency fix
17:28:22  Eso question. Are there words that specifically mean a 12-bit or 24-bit integer, you know, the kind like (byte, char, short, int, long, halfword, word, doubleword, wyde, tetra) but specific enough that they can't apply to 8 or 16 or 32 or 64 bit values?
17:28:53  I can call them "halfword" and "word" if there aren't, but I'd prefer some specific terminology
17:30:00  are you asking me for clarification?
17:35:34  Lykaina: no
17:35:48  or not yet, at least
17:36:41 -!- sebbu2 has changed nick to sebbu.
17:37:01  [ (,+/@:_3{.)^:39] 0 0 1
17:37:01  b_jonas: |domain error
17:37:01  b_jonas: |   (,    +/@:_3{.)^:39]0 0 1
17:37:12  [ (,+/@:(_3&{.))^:39] 0 0 1
17:37:13  b_jonas: 0 0 1 1 2 4 7 13 24 44 81 149 274 504 927 1705 3136 5768 10609 19513 35890 66012 121415 223317 410744 755476 1389537 2555757 4700770 8646064 15902591 29249425 53798080 98950096 181997601 334745777 615693474 1132436852 2082876103 3831006429 7046319384 12960201916
17:38:21  b_jonas: like the new formatting?
17:40:48 -!- FreeFull has joined.
17:41:23  b_jonas, https://en.wikipedia.org/wiki/24-bit apparently has 24-bit as 'sword'.
17:41:57  i managed to get copies of calibri, cambria, and consolas onto my linux laptop
17:42:01  I think you just call 'em words.
17:42:09  with the appropriate bit prefix.
17:42:25  imode: hmm, interesting. although "thword" might work better.
17:42:36  thword lmao.
17:42:51  but the problem is, "halfsword" or "halfthword" sound too much like "halfword" unless you pronounce them very carefully
17:43:06  > fix(([0,0,1]++).ap(zipWith(flip(-)))(drop 3).scanl(+)0)
17:43:09   [0,0,1,1,2,4,7,13,24,44,81,149,274,504,927,1705,3136,5768,10609,19513,35890,...
17:43:43  maybe "thyte" for the 12-bit one then
17:43:54  nah, not good enoguh
17:44:05  > fix(([0,0,1]++).join(zipWith(-).drop 3).scanl(+)0)
17:44:06   [0,0,1,1,2,4,7,13,24,44,81,149,274,504,927,1705,3136,5768,10609,19513,35890,...
17:44:20  @oeis A73
17:44:21   https://oeis.org/A000073 Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3)...
17:44:21   [0,0,1,1,2,4,7,13,24,44,81,149,274,504,927,1705,3136,5768,10609,19513,35890,...
17:45:20  I just like (ab)using scanl
18:01:46  I'm wrong, you can absolutely implement 'last' using only an end-of-queue marker.
18:10:28  int-e: what language is that?
18:11:25  Lykaina: Haskell
18:12:00  Lykaina: though in a deliberately concise and incomprehensible style (if you can even call it that).
18:12:42  is haskell oo?
18:14:08  no
18:14:45  Haskell is a pure, lazy, functional programming language.
18:15:18  oh
18:16:12  > let twice f x = f (f x) in twice succ 3 -- 'succ' adds 1 to a number; 'twice' takes a function and applies it two times to a given value... the ability to pass functions to other functions is what makes the language functional
18:16:12  seems i never learned any functional languages
18:16:14   5
18:16:35  except pretty much every language allows you to pass functions to other functions
18:16:55  basic?
18:16:55  'functional language' like 'object-oriented language' is a fuzzy category
18:17:09  more useful for starting arguments than anything else
18:17:15  kmc: function pointers aren't the same. we're getting there, though.
18:17:21  is javascript functional? is rust object oriented? whatever.
18:17:27  i thought not having side effects is what makes a language functional
18:17:34  fight me twh
18:17:36  what is c?
18:17:37  kmc: even java has lambdas nowadays.
18:17:45  (IIRC)
18:17:49  see, i told you it was good for starting arguments :)
18:18:07  also fights are foughts exclusively with hugs
18:18:16 * kmc hugs shachaf 
18:18:30  is C procedural or imperitive? i forgot
18:18:32  people sure love aruging about what definitions are
18:18:44  (not even what they should be, which is a sort of reasonable argument maybe)
18:18:59  . o O ( definitions are arbitrary )
18:19:49  . o O ( arguing, v.: putting the "defy" into "definition". )
18:19:58  `? c
18:19:59  C is the language of��V�>WIד�.��Segmentation fault
18:20:25  Lykaina: it's both I think
18:22:40  It's imperious.
18:22:45  And perilous.
18:22:50  Lykaina: both. imperative because it's mostly based on mutable variables and assignment rather than immutable values; procedural because it's based mostly on structured control form, as in if/while/for and function calls, rather than goto and gosub.
18:23:28  In the past I would accidentally say "imperial programming language".
18:23:35  does anyone actually use vb.net?
18:23:36  The imperative is mostly a default, you can still write code that is mostly functional, as in, assigning each variable only once at the declaration.
18:23:48  I guess if/while/for make it "structured", and function calls "precedural"
18:24:19  Lykaina: no, but it's probably basically free to have once you have the compiler and other requirements for C# or some other dotnet language.
18:24:31  Moreover, goto makes it unstructured and NULL makes it expensive
18:24:55  I heard it's the zero-terminated strings that make it an expensive mistake.
18:24:56  C is great because it has features like writing f(g(x), h(y))
18:25:08  You don't even need to say what registers the intermediate results go into!
18:25:16  It's such a high-level language.
18:26:05  fizzie: I was refering to Hoare: 'Tony Hoare introduced Null references in ALGOL W back in 1965 "simply because it was so easy to implement", says Mr. Hoare. He talks about that decision considering it "my billion-dollar mistake".'
18:26:06  and c--?
18:26:27  shachaf: I disagree. a language is functional if bindings and values are immutable by default, even if mutability is provided. so standard ML and rust are functional languages.
18:26:32  prolog too.
18:26:39  and J too in fact
18:26:45  though for J it's more debatable
18:26:56  fizzie: But yes, zero-terminated strings are their own can of worms.
18:27:00  nah, J probably shouln't count as functional
18:27:02  I disagree. A language is functional if it works, and dysfunctional if it doesn't work.
18:27:15  int-e: I was referring to https://queue.acm.org/detail.cfm?id=2010365
18:27:35  is kotlin a functional language by that definition?
18:28:15  what's a kotlin?
18:28:21  Kotlin makes me think of chickens, which makes me think of Scheme.
18:28:39  I don't know, I've never koppled before.
18:28:40  heh
18:28:43  H@0000=000FG@001048656c6c6f2c2057G@00186f726c64210a0000Q!0000=000AW0T@0000@0000=0001J!0000-W0K
18:28:49  fizzie: Obviously if you wanted to save space you'd use ASCII and tag the last string element by setting the high bit. (Who needs non-ASCII or empty strings anyway...)
18:28:49  uh
18:28:54  I don't know, I've never kottled before.
18:29:03  not the crazy paste again
18:29:36  fungot: What sort of programming paradigm do you feel like you represent most?
18:29:37  fizzie: it refers to the real world is just one hygienic macro system based on closures.
18:29:50  int-e: if you wanted to save space, you'd use five-bit strings with shift codes
18:29:53  Deep truths day today.
18:30:05  fizzie: But you're right, if you want to pinpoint an expensive mistake that is specific to C, NUL-terminated strings are a good candidate.
18:30:39  int-e: I'm not sure that even started with C. didn't unix have nul-terminated strings for filenames before C came around?
18:31:23  b_jonas: I'm confused about the history here.
18:32:18  unix and c were created for each other
18:32:28  they got married in 72
18:33:00  Yeah I thought the developments were intertwined.
18:33:06 -!- MDude has quit (Quit: Going offline, see ya! (www.adiirc.com)).
18:33:06  int-e: UNIX v1 is an early unix (but not the earliest unix) of which we have the full set of manual pages. it precedes C, but is after the invention of pathnames (the earliest unix didn't have that). http://man.cat-v.org/unix-1st/2/sys-open says that open takes a nul-terminated string as filename.
18:33:27  b_jonas: what did MULTICS do on that front?
18:33:50  UNIX v1 was implemented in some machine language, and only later was a version of unix mostly implemented in C made.
18:33:55  int-e: I don't know.
18:34:20  it might be older than unix too, I'm just saying that nul-terminating definitely preceded C
18:34:21  b_jonas: Anyway, I would say that since UNIX and C were basically created by the same people, shifting the blame from C to UNIX isn't all that meaningful.
18:34:29  int-e: no no
18:34:35  that's definitely not the history
18:34:49  same three people
18:35:48  unix was created by ken and dmr; C was started to get invented by kernigham, then dmr joined by popularizing C by basing the already popular unix to it, so that both userspace programs could be written in C and the kernel was implemented in C
18:36:17  dmr did further C by a lot, which is only to be expected when he was its main user,
18:36:52  hmm no
18:36:55  I got that history wrong
18:37:00  int-e: ok, you're probably right
18:37:11  it's the same people
18:37:30  still, I sort of think that unix makes sense even without C
18:37:41  unix makes sense?
18:38:33  sorry
18:38:46  think about it, the rust people and a certain #esoteric regular both experiment with making a compiler that can make executables that run on unix and uses unix syscalls without depending on either C or libc
18:39:11  `? member
18:39:13  I'm sorry, #esoteric has regulars, not members. Who told you about members? There are definitely no members here, and you wouldn't be allowed to know about them, anyway.
18:39:13  so I think even today the abstractions are a bit separated, even if they are tightly wound together because a lot of basic libraries are implemented in C
18:39:22  yes, that's what I said
18:39:35  a regular
18:39:55  even if there was such a thing as members, I would not be allowed to tell who is and isn't a member
18:40:07  if you knew
18:40:32  as for me, i lost my membership form
18:40:48  i wouldn't /join any channel that would have me as a member
18:41:24  i wouldn't last a minute in one
18:41:40  yes, I also don't know who are members, and have no way to know, because the only reliable way to verify that someone is a member is the secret handshake, which I also don't know, and since I live in Hungary but no other regular does, I haven't met anyone from #esoteric irl, and so couldn't have shaken their hands
18:42:09  i know sgeo in rl, and no others.
18:42:17  Huh.
18:42:18  i do not deny this
18:42:46  kmc: i'd like to "do the secret handshake" with you, if you know what i mean
18:43:08  i don't know
18:43:11  (sure, that's not a watertight argument, because at least two other #esoteric regulars have admitted to have visited Hungary; and I have been to the UK and Norway and like three other countries where #esoteric regulars work)
18:43:14  shachaf: does it involve any dismemberment that would explain our lack of members?
18:43:22  does it involve taking my clothes off
18:43:36  hm, that's a more advanced handshake than the one i know
18:43:36  . o O ( let's not get crazy here )
18:43:39  `? alice
18:43:41  Alice doesn't want to go among mad people.
18:44:07  int-e: no. it's a zero-knowledge handshake to any party who doesn't know about the handshake, and dismembering people would be easily detectable so it would break that
18:44:14  b_jonas: Have you considered being to California?
18:44:19  as far as i know, sgeo and i were best friends in college. they introduced me to here.
18:44:27  shachaf: yes, and I decided I don't want to be there
18:45:24  I decided I want to stay mostly in Europe during the foreseeable future
18:45:32  b_jonas: maybe you just have to hide it cleverly (think Kill Bill)
18:45:57  int-e: hmm, that would explain my messed up sleep schedule
18:47:11  the line of "code" i accidentally pasted here was a distilled hello world.
18:49:03  b_jonas: What about Hexham?
18:49:43  shachaf: that is somewhat more reasonable, I may yet go there at some point
18:50:39  but my next vacation, starting in a week, will be in North-Reine Wesphalia, with one night in München before
18:55:23  shachaf: although of course in the unlikely case that Brexit makes travel to England seriously inconvenient, I won't travel there
18:56:20  but I hope that the current situation is stable: no Brexit, a promise of the intention to Brexit soon, and a sacrifice of two or three prime ministers per year
18:57:21  it's like how Hungary has a contractual requirement to start using the Euro currency within like ten years, and have had so since like fifteen years ago, so we will permanently be planning to start the Euro ten years from the present
18:57:25  that works fine
18:57:59  it's just harder for Brexit because the promise is for a shorter term in the future 
19:16:01 -!- Phantom_Hoover has joined.
19:22:56  I wonder how many different locations of Google have people working there that are also #esoteric regulars
19:23:26  and whether they represent all the major super-secret branches of Google
19:28:11  but that latter is probably unanswerable
19:46:08  I reported a bug in Ghostscript and it has now been fixed.
19:46:17  nice
19:46:28  when did you report?
19:47:16  I reported it on Sunday; it was fixed on Tuesday.
19:47:55  (The bug has to do with using the forall command with strings.)
20:01:31  trying to implement 'swap' using only dup, roll and drop.
20:02:00  harder than I thought.
20:05:31  managed to implement 'over' using minimal primitives, which is something.
20:14:58 -!- xkapastel has quit (Quit: Connection closed for inactivity).
20:24:03  'last' can also be done in constant time. really 'roll' and 'last' are basically just 'rotate queue left' and 'rotate queue right'.
20:29:01  imode: is this still the crazy queue-based thing?
20:29:27  yessir.
20:29:47  imode: why don't you add named lexically local variables to this interpreter, and then implement swap as { /a /b b a }
20:29:50  I added an operation that lets you recall an item from the end of the queue to the front of the queue.
20:30:13  note that for an ordinary stack-based language like GML it would be { /a /b a b }
20:40:49 -!- MDude has joined.
20:41:52 -!- Camto[m] has quit (Remote host closed the connection).
20:42:05 -!- xylochoron[m] has quit (Remote host closed the connection).
20:42:08 -!- ivzem[m] has quit (Read error: Connection reset by peer).
20:42:14 -!- wmww has quit (Write error: Connection reset by peer).
20:42:21 -!- tswett[m] has quit (Write error: Connection reset by peer).
20:43:56  lexically scoped variables are too complex for the scope of this interpreter.
20:44:11  but that's kinda funny how that's a little non-intuitive.
20:44:52  "here's your parameters in order... and here they are again, but they're technically swapped because of the behavior of the stack."
20:45:36  https://hastebin.com/equnosetok.txt
20:46:10  whoops.
20:46:26  https://hastebin.com/welojekoqu.txt
20:46:30  there.
20:49:56 -!- Camto[m] has joined.
20:52:11  a pretty literal translation of an iterative factorial algorithm that I wrote in forth.
20:54:32 -!- Lord_of_Life_ has joined.
20:57:53 -!- Lord_of_Life has quit (Ping timeout: 265 seconds).
20:57:56 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
21:11:42 -!- wmww has joined.
21:11:42 -!- tswett[m] has joined.
21:11:42 -!- xylochoron[m] has joined.
21:11:50 -!- ivzem[m] has joined.
21:15:06  aha, it didn't work. but it didn't work because of the way I do math.
21:17:42  https://hastebin.com/gebucenehe.txt an updated version, plus a direct Python translation: https://repl.it/repls/LongtermBruisedDeals
21:21:13  this is pretty neat, because by the virtue of 'roll' and 'last', you can skip over newer elements in favor of old ones. 'last' can be implemented in a reasonable manner in a typical queue automaton by using the current state as temporary storage, and in an implementation with a circular buffer, can be done in constant time.
21:21:36  it's effectively a tape that grows and moves to the right on insert.
22:47:55  I thought a open source implementation of Magic: the Gathering should have a command line interface. At many prompts, you can enter a blank line to use the default action or to use a shortcut. The "priority prompt" might say something like "Mark:m1:0>" if the active player is Mark, the current phase is the precombat main phase, and the stack is empty.
22:51:47  u=upkeep, d=draw, m1=precombat main, bc=begin combat, da=declare attackers, db=declare blockers, fs=first strike combat damage, ns=normal strike combat damage, ec=end combat, m2=postcombat main, e=end, c=cleanup.
23:11:17  hi
23:18:38  b_jonas: should my subs have return values?
23:22:23 -!- ArthurStrong has joined.
23:24:14 -!- Phantom_Hoover has quit (Ping timeout: 246 seconds).
23:43:35 -!- arseniiv has quit (Ping timeout: 276 seconds).

2019-09-14:

00:38:53  Wait, x86-64 has 64-bit push and 16-bit push, but not 32-bit push?
00:38:59  `asm push %rax
00:39:00  0:  50   push %rax
00:39:02  `asm push %eax
00:39:03  ​/tmp/asm.s: Assembler messages: \ /tmp/asm.s:1: Error: operand type mismatch for `push' \ /tmp/asm.s: Assembler messages: \ /tmp/asm.s:1: Error: operand type mismatch for `push'
00:39:04  `asm push %ax
00:39:05  0:  66 50   push %ax
00:39:10  `asm push %al
00:39:11  ​/tmp/asm.s: Assembler messages: \ /tmp/asm.s:1: Error: operand type mismatch for `push' \ /tmp/asm.s: Assembler messages: \ /tmp/asm.s:1: Error: operand type mismatch for `push'
00:41:01  Yes.
00:41:42  Back when we were doing the printable code thing here for a while, that was annoying, because on x86-32 you can just push values without leaving any gaps.
00:42:22  I think I knew it didn't have 32-bit push, but I thought that also applied to 16-bit.
00:42:37  What a bizarro situation.
00:42:48 -!- xkapastel has joined.
00:42:54  I mean, I was already surprised by 32-bit operations clearing the upper 32 bits and 16-bit operations not.
00:49:59  According to the manual, you can also push fs and gs in 64-bit mode, but not cs/ds/es/ss. Which I guess makes some sense, since there's the whole thing of cs/ds/es/ss always having a base of 0 while fs/gs are sort of usable in address calculations, but it's not like the registers didn't exist.
00:50:06  `asm push %fs
00:50:10  0:  0f a0   pushq %fs
00:50:11  `asm push %ds
00:50:13  ​/tmp/asm.s: Assembler messages: \ /tmp/asm.s:1: Error: operand type mismatch for `push' \ /tmp/asm.s: Assembler messages: \ /tmp/asm.s:1: Error: operand type mismatch for `push'
00:50:19  Yet...
00:50:29  `asm mov %fs, %ax; mov %ds, %ax
00:50:30  0:  66 8c e0   mov %fs,%ax \ 3:  66 8c d8   mov %ds,%ax
00:51:00  Also the manual mentions that 66h prefix is unnecessary, and that most assemblers will let you use...
00:51:04  `asm mov %fs, %eax
00:51:05  0:  8c e0   mov %fs,%eax
00:51:11  To avoid it.
00:51:17  (The effect is apparently the same.)
00:51:45  What a bizarro world.
00:51:53  `asm mov %fs, %rax
00:51:54  0:  48 8c e0   mov %fs,%rax
00:51:58  Can we scrap x86 and switch to something reasonable?
00:51:59  beauty
00:52:13  shachaf: sure, once intel goes out of business
00:57:43  I suspect Intel could make pretty good processors for other instruction sets if they tried.
00:58:32  I think Intel is looking at their die area for high performance CPUs, sees they're spendin 1-2% of it on instruction decoding, shrugs, and moves on.
00:59:05  intel made strongarm i think
00:59:10  I mean, instruction decoding specifically isn't the only problem with x86, I think.
00:59:20  (I believe, but don't know, that the rest of the CPU would remain largely the same complexity anyway.)
00:59:28  As I understand it they spend quite a bit of die area and power on things that a better instruction set wouldn't require.
00:59:41  Then again they made Itanium so who knows what better instruction set they would make.
01:00:10  Itanium was a spectacular failure though.
01:00:15  EPIC, even.
01:00:34  IA-64 was a disaster
01:00:54  took amd to do it
01:01:21  and make x86-64
01:02:04  MMIX is better, I think
01:02:09  Nobody's made a forward-compatible VLIW instruction set yet. So... you pay with huge bandwidth for a simpler processor, and the next generation will carry all the multiscalar baggage as the processor tries to identify parallel work dynamically, because they need to exploit parallelism simply can't be establish statically anyway.
01:02:45  IA-64 was Itanium, no?
01:02:49  yes
01:03:34  EM64T is the best name.
01:03:52  that's intel's name
01:04:03  Well, they gave up on it too.
01:04:10  I think it's just Intel 64 now.
01:13:52 -!- imode has quit (Remote host closed the connection).
01:14:14 -!- imode has joined.
01:17:07  grrr...found a bug in my interpreter i thought i patched
01:23:46  no, it's a new bug
01:25:31  or newly-found
01:39:06  basically, it hits: while(a=='\n') a=putchar(); and acts strangely on the previous value of a
01:39:39 -!- FreeFull has quit.
01:40:05  it shouldn't even remember the previous value
01:42:02  it's a proof-of-concept of a switch in echidna
01:43:16  equivalent of: if(a=='\n') a=putchar(); // behaves normally
01:43:42  equivalent of: while(a=='\n') a=putchar(); // gives impossible output
01:44:56  trace it!
01:46:48  what does that mean? i'm blanking out on it
01:46:54  I can't tell whether that's supposed to be getchar() or not.
01:47:32  oh shit
01:47:49  equivalent of: if(a=='\n') a=getchar(); // behaves normally
01:47:57  equivalent of: while(a=='\n') a=getchar(); // gives impossible output
01:48:21  Well, that's more plausible.
01:49:02  as in, step the interpreter one instruction at a time.
01:49:06  imode: what do you mean by "trace it!"
01:49:15  how?
01:49:17  print out an instruction trace.
01:49:27  how?
01:49:30  i.e what instructions you're executing, along with the content of main memory.
01:49:36  what do you mean how? presumably you have access to those things.
01:50:07  um...
01:50:43  imode: i don't like being called an idiot for not knowing some things
01:51:25  how do i print out an instruction trace?
01:51:34  you aren't an idiot, I just assume that you're writing an interpreter that you have access to things like which instruction you're executing, and what the contents of main memory is.
01:51:56  it's literally just a printout of what instructions you're executing when they're executing.
01:52:07  okay
01:52:18  modify the interpreter
01:52:27  yes.
01:52:28  to output that
01:53:30  brb
01:54:09  oh, by the way, main memory is 64KiB in size
01:54:45  but i'm only using the lower 4 words in this example
01:54:56  correction: 128 KiB
01:55:15 * Lykaina goes back to afkland
01:58:02 -!- imode has quit (Ping timeout: 265 seconds).
02:02:03 -!- Phantom_Hoover has joined.
02:09:38 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
02:25:35  okay, so for some reason it's skipping an earlier "I @0000"
02:26:17  how do i thank imode?
02:29:03 -!- adu has joined.
02:29:49  it also misses an -W1
02:30:31  which is weird
02:30:37  hi adu
02:31:16  hi
02:31:46  what's up
02:40:41  `thanks imode
02:40:42  Thanks, imode. Thimode.
02:40:45  I'm not sure that sort of thanking is particularly useful, but it's the best we have.
02:41:28  `asm .byte 0x48, 0x89, 0x04, 0x64
02:41:29  0:  48 89 04 64   mov %rax,(%rsp,%riz,2)
02:41:48  Now that I'm doing the whole ModR/M and SIB byte thing properly, I see what you mean about %riz.
02:52:23  fixed
03:12:29 -!- xkapastel has quit (Quit: Connection closed for inactivity).
03:19:27 -!- hppavilion[1] has joined.
03:19:34  the echidna-debug program for v0.10a2a outputs 256 bytes per cycle. (64 bytes of argument var and first 96 words of memory (total 65536 words))
03:22:34  a lot of the key words are between 0000 and 005F anyway.
03:33:14 -!- imode has joined.
03:58:02 -!- b_jonas has quit (Ping timeout: 240 seconds).
03:58:53 -!- b_jonas has joined.
04:59:02 -!- adu has quit (Quit: adu).
05:17:42  The bug in Ghostscript that I reported existed since version 3.33. "9999 string {} forall" doesn't work, but "9999 string {0 add} forall" does work. Commit 8675b40266cbf9771a08f4178a6009cfd17e0ba corrects the bug.
05:28:17 -!- hppavilion[1] has quit (Ping timeout: 265 seconds).
06:13:49  https://raw.githubusercontent.com/espressif/binutils-esp32ulp/master/opcodes/i386-opc.tbl
06:13:55  Why doesn't Intel publish a file like that?
06:20:34 -!- b_jonas has quit (Remote host closed the connection).
07:18:38 -!- hppavilion[1] has joined.
07:26:42 -!- imode has quit (Ping timeout: 265 seconds).
07:56:15 -!- imode has joined.
08:37:49 -!- ArthurStrong has quit (Quit: leaving).
08:56:28 -!- Lord_of_Life has quit (Ping timeout: 264 seconds).
09:00:50 -!- Lord_of_Life has joined.
09:12:59 -!- imode has quit (Ping timeout: 276 seconds).
09:42:44  [[User talk:Ais523]]  https://esolangs.org/w/index.php?diff=66149&oldid=65092 * YamTokTpaFa * (+157) /* Bug: Why is HQ9F+ shown on no category pages? */ new section
09:43:18  [[HQ9F+]]  https://esolangs.org/w/index.php?diff=66150&oldid=64738 * YamTokTpaFa * (+22) 
09:45:45  [[User talk:Ais523]]  https://esolangs.org/w/index.php?diff=66151&oldid=66149 * YamTokTpaFa * (+270) /* Bug: Why is HQ9F+ shown on no category pages? */
09:49:13  [[COBOL]] M https://esolangs.org/w/index.php?diff=66152&oldid=47135 * YamTokTpaFa * (+1) I wanted an indent
09:50:07  [[User talk:Ais523]]  https://esolangs.org/w/index.php?diff=66153&oldid=66151 * Fizzie * (+649) /* Bug: Why is HQ9F+ shown on no category pages? */ An answer of sorts.
10:08:32 -!- Frater_EST has joined.
10:28:08 -!- hppavilion[1] has quit (Remote host closed the connection).
10:29:11 -!- b_jonas has joined.
10:31:17  [[Chafa]] M https://esolangs.org/w/index.php?diff=66154&oldid=65347 * A * (+526) So just a reference of Zalgo characters
10:32:33  the PDP-8 cpu has an interesting instruction set. just like all old cpus, it's optimized to allow dense code while being implementable in very little electronics. but the way PDP-8 achieves this is very different from newer cpus that I'm somewhat familiar with, like the 6502.
10:34:32  in particular, PDP-8 is accumulator-based, but has no straight load instruction: instead it has an instruction that loads a value and adds it to the accumulator with carry, and an instruction that loads and does some bitwise op with it to the accumulator, plus there are multiplex operations that allow you to clear the accumulator, clear the carry flag, plus the store operation also automatically clears 
10:34:38  the accumulator.
10:35:16  the memory is made of 12-bit bytes, and each instruction takes exactly one 12-bit byte.
10:35:47  I should look at other popular old cpus from the core memory era to see what other interesting methods they use.
10:37:57  "how do i thank imode?" => we don't have a widely used system of imaginary internet points and badges for #esoteric yet
10:41:01  @thanks imode
10:41:01  you are welcome
10:41:09  hmm, that doesn't work
10:41:28 -!- xkapastel has joined.
10:41:29  @karma+ imode
10:41:30  imode's karma raised to 1.
10:41:34  ^ ah yes, that's the command
10:41:55  I don't think we have an equivalent implemented in HackEso, but the bot is very programmable, so you could implement something
10:42:55  lambdabot also listens to all user++ messages and silently increments karma
10:42:58  @karma user
10:42:58  user has a karma of 0
10:43:07  Hmm. user++
10:43:09  @karma user
10:43:10  user has a karma of 1
10:43:18  I guess user had negative karma. That makes sense.
10:43:56  shachaf: ah
10:44:50  Oh, but I didn't see the original question.
10:45:05  You can thank people by typing "thank you", for example.
10:45:17  It's a better system than incrementing a number related to their name.
10:45:33  shachaf: "Now that I'm doing the whole ModR/M and SIB byte thing properly" => when tom7 made his ABC compiler, I was very surprised that the 386 cpu uses 32-bit modr/m format in 16-bit mode if you use the address-size override prefix, but in retrospect that makes sense
10:46:17  shachaf: yes, that's a good way to thank someone. but it may still make sense to have a system of giving imaginary internet points and achievement badges
10:46:28  does lambdabot also listen to "thank you" messages?
10:46:41  How do you mean?
10:46:51  No, but the recipient of the thank you down, which is more important.
10:46:58  @karma
10:46:58  You have a karma of 99
10:47:05  like, if you say "thank you, imode" on the channel, does lambdabot increment the karma of imode?
10:47:06  I'm pretty sure most of that is fake oerjan karma.
10:47:22  What's the 32-bit modr/m format?
10:48:07  `` mov %ax, (%bx,si)
10:48:09  ​/hackenv/bin/`: eval: line 5: syntax error near unexpected token `(' \ /hackenv/bin/`: eval: line 5: `mov %ax, (%bx,si)'
10:48:12  `asm mov %ax, (%bx,si)
10:48:13  ​/tmp/asm.s: Assembler messages: \ /tmp/asm.s:1: Error: bad or irreducible absolute expression \ /tmp/asm.s:1: Error: expecting scale factor of 1, 2, 4, or 8: got `si' \ /tmp/asm.s: Assembler messages: \ /tmp/asm.s:1: Error: missing ')' \ /tmp/asm.s:1: Error: junk `)' after expression
10:48:33  the one that's normally used in x86_32 code in 32-bit protected mode
10:49:42  Oh, this makes no sense of course.
10:49:49  it lets you select a base register plus 0 or 1 or 4 byte long offset with just a mod/rm byte, or a base register and a scaled index register and a 0 or 1 or 4 byte offset with a modr/m plus sib bytes, and lets you use %ecx or %eax as base registers
10:50:10  Aren't imaginary Internet points and achievement badges a bad incentive?
10:50:58  as opposed to the 16-bit addressing mode where sib bytes are never used, you can't use %cx or %ax as base or index registers, but you can select %si+%bx or %di+%bx in a modr/m byte
10:51:39  I'm sure glad 64-bit mode is the only one that matters.
10:51:59  also both the 16-bit and the 32-bit modr/m format has some magical segment choice implications where if you use certain indexing modes, the address is relative to %ss rather than %ds by default, though you can override this in any case
10:52:04  shachaf: sure
10:52:24  only this is #esoteric so sometimes we talk about things that don't matter
10:52:32  things that you don't want to use in production
10:52:43  Sure. But implementing 64-bit mode is enough of a headache for me right now.
10:53:08  yeah
10:53:36  How can I tell whether my addressing mode implementation is correct?
11:01:10  Does x86 have a nop with immediate? I could use it to mark my output to recognize parts of it easily.
11:02:55  `asm .byte 0x0f, 0x1f, 0x80, 0, 0, 0, 0
11:02:56  0:  0f 1f 80 00 00 00 00   nopl 0x0(%rax)
11:03:11  `asm .byte 0x0f, 0x1f, 0x80, 'A', 'B', 'C', 'D'
11:03:12  0:  0f 1f 80 41 42 43 44   nopl 0x44434241(%rax)
11:03:15  I guess that works.
11:08:39  `asm .byte 0x0f, 0x1f, 0200, 'A', 'B', 'C', 'D'
11:08:40  0:  0f 1f 80 41 42 43 44   nopl 0x44434241(%rax)
11:08:43  `asm .byte 0x0f, 0x1f, 0210, 'A', 'B', 'C', 'D'
11:08:44  0:  0f 1f 88 41 42 43 44   nopl 0x44434241(%rax)
11:08:54  `asm .byte 0x0f, 0x1f, 0270, 'A', 'B', 'C', 'D'
11:08:55  0:  0f 1f b8 41 42 43 44   nopl 0x44434241(%rax)
11:08:58  So many nops.
11:09:30  https://www.felixcloutier.com/x86/nop only says the /0 variant is a nop, though.
11:24:50 -!- atslash has quit (Ping timeout: 240 seconds).
11:25:38 -!- atslash has joined.
11:36:24 -!- FreeFull has joined.
11:39:27  [[Apple3.14]] M https://esolangs.org/w/index.php?diff=66155&oldid=49628 * A * (+0) /* How high will it go? */
11:41:32  [[PFD]] N https://esolangs.org/w/index.php?oldid=66156 * A * (+1478) Created page with "'''PFD''' is an esolang made by [[User:Cortex|Cortex]] designed to have very small code and many useful commands, but the only way to see what it actually did through the whol..."
11:43:12  [[PFD]] M https://esolangs.org/w/index.php?diff=66157&oldid=66156 * A * (-1417) Redirected page to [[Https://esolangs.org/wiki/Print Function Deluxe]]
11:43:38 -!- Frater_EST has quit (Ping timeout: 240 seconds).
11:43:41  [[PFD]] M https://esolangs.org/w/index.php?diff=66158&oldid=66157 * A * (-26) Redirected page to [[Print Function Deluxe]]
11:56:02 -!- atslash has quit (Ping timeout: 240 seconds).
11:56:42 -!- atslash has joined.
11:57:23  [[Print]] N https://esolangs.org/w/index.php?oldid=66159 * A * (+1345) Created page with "'''Print''' is an esolang made by [[User:Cortex|Cortex]] designed to make [[Print Function Deluxe]] programs (slightly) shorter.  == Commands == {| class="wikitable" |- ! Char..."
12:00:33  who's this A that edits everything?
12:13:07  [[Print]] M https://esolangs.org/w/index.php?diff=66160&oldid=66159 * A * (-11) 
12:21:11  [[Print]] M https://esolangs.org/w/index.php?diff=66161&oldid=66160 * A * (+141) 
12:22:38 -!- Frater_EST has joined.
12:25:37  shachaf: the intel manual also says that only the /0 variant of the 0F 1F instruction is a nop
12:27:08  [[User talk:Lesidhetree]] N https://esolangs.org/w/index.php?oldid=66162 * Lykaina * (+156) Discovered an old account of mine from when I used a different name in rl.
12:30:42  damn, i was crazy in 2015
12:31:07  shachaf: you can also use the PREFETCHT2 instruction, whose opcode is 0F 18 /3, as a nop to mark your things. it's slightly less efficient than true nops, but still reasonably good.
12:32:16  but there are possibly remnants of the "fourfuck" code in echidna's interpreter.
12:32:28  or, of course, you could put markings in parts of the code that are never executed, or an immediate load to a dead register, or a marking into a debug section or some other elf section that isn't loaded to memory
12:35:02  i know echidna's interpreter was originally based on hydra51's, a failed attempt of mine long ago to make an 8051 clone in C.
12:35:43  but i forgot if there was any connection between hydra51 and fourfuck
12:36:48  hydra51 wasn't esoteric
12:37:49  but it began my trend of naming my language attempts after animals.
12:44:09  `pbflist https://pbfcomics.com/comics/splash-down/
12:44:10  pbflist https://pbfcomics.com/comics/splash-down/: shachaf Sgeo quintopia ion b_jonas Cale
12:44:34  preferably ones with mythological connections
13:05:41 -!- Phantom_Hoover has joined.
13:09:30 -!- arseniiv has joined.
13:30:12  i have to stop and learn to program in Echidna before i edit more.
13:30:46  b_jonas: what would echidna be best at?
13:32:21  [[Espro]] M https://esolangs.org/w/index.php?diff=66163&oldid=66046 * Timwi * (+5) 
14:06:36 -!- Frater_EST has quit (Remote host closed the connection).
14:14:23 -!- FreeFull has quit (Remote host closed the connection).
14:15:55 -!- FreeFull has joined.
14:58:01  b_jonas: are you ignoring me or just busy?
14:59:18  am i being passive-agressive again? i hate when i'm like that...
15:00:33  it's a personality flaw i've really been working on.
15:05:54 -!- imode has joined.
15:06:45  also, i am incapable of "getting the hint" (whatever that hint is).
15:07:01  hi imode 
15:08:50  hey Lykaina.
15:09:00  what's up?
15:10:01  just a little annoyed at self for possibly reverting to my old passive-aggressive state
15:10:37  also, i really have to learn how to write in my Echidna language.
15:12:30  it's one thing to make a language, it's another thing to learn to write in it, especially if it is esoteric.
15:14:06  yeah, that's why I'm putting my focus on figuring out different algorithms and control flow structures before I decide whether a full-on interpreter is a good idea or not.
15:14:35  i'm developing the language and interpreter at the same time
15:15:44  https://repl.it/repls/WetViolentParallelcompiler
15:15:59  line 161 onward.
15:16:23  if your language is small, it should be easy to write and rewrite an interpreter for it.
15:17:31  i'm still changing and improving it
15:17:44  have you seen it?
15:18:10  i'm trying to force myself to stop at 0.10a2a
15:18:29  the most recent modification was a bug fix
15:19:43  http://sif.lesidhetree.com/sara/echidna/Echidna%20v0_10a2_p2.pdf
15:20:09  what are you writing the intepreter in?
15:20:20  C
15:22:36  maybe start with a higher level language for prototyping?
15:22:55  c isn't high level?
15:26:11  of the languages i have learned, c is the only one i remember well.
15:26:14  it's not got a lot of useful constructs for prototyping.
15:27:02  i program console mainly
15:27:16  whenever I work in a project, I usually take two languages: a prototyping language and an implementation language.
15:27:56  what is prototyping? i'm a little confused
15:28:45  you work in an environment that's easier to build things in to finalize a design, then you implement that final design in your actual environment.
15:30:24  c is easy for me
15:30:38  and i do a lot of command line
15:31:20  object-orienting gives me a headache
15:31:38  it's why i don't use c# much
15:33:35  so, what am i doing wrong?
15:35:52  dunno, I'm not writing your interpreter.
15:36:32  i created choose.ech, a proof of concept for a switch in echidna 0.10a2, and encountered a bug i thought i patched a while ago
15:36:59  fixed it in .10a2a
15:38:23  same command list, so the pdf still applies
15:40:07  one of the things i do is use a bunch of c files. remnant from learning java/c#, where every class has it's own file.
15:41:23  also, i split my interpreter amonst many .c and .h files for versioning reasons
15:43:11  C's default string manipulation functions suck
15:43:20  true
15:43:43  Also strings with length stored are better than nul-terminated ones for a lot of stuff
15:43:57 -!- imode2 has joined.
15:45:57  i prefer getchar/putchar over scanf/printf
15:46:26 -!- imode has quit (Ping timeout: 240 seconds).
15:49:50  i do use fprintf for error messages, though.
15:51:40  does the book tcpl cover the standard library?
15:55:18  never mind, can't afford it anyway
15:56:36  "strings" in c are just char arrays.
16:07:34 -!- imode2 has quit (Remote host closed the connection).
16:08:14 -!- imode has joined.
16:12:50 -!- Lord_of_Life has quit (Ping timeout: 240 seconds).
17:12:01 -!- imode has quit (Ping timeout: 265 seconds).
17:14:15 -!- imode has joined.
17:20:00 -!- atslash has quit (Quit: This computer has gone to sleep).
17:21:42  got a hidden debug mode implemented!
17:22:53  a backdoor?
17:23:57 -!- atslash has joined.
17:25:09  just displays the cmd read and the first 96 words of internal ram on stderr whenever a cmd is read
17:25:36  s/internal ram/program memory/
17:27:29  addresses 0000 to 005F
17:28:01  Is there a "invisible" X server that does not have any input/output on the display and keyboard and so on, so is only usable to implement drawing functions and to allow programs to exchange data with window properties and selections?
17:32:52  huh?
17:33:52  Xvnc is invisible and still allows drawing.
17:44:16  zzo38: yes, two of them, and I think we talked about them on the channel
17:44:33  one vnc-related and one or two others
17:46:24  I don't recall their names, but it's in the channel logs somewhere... sad
17:46:49  Xvfb is one of htem
17:48:32  b_jonas: i need to know: have you been ignoring me? Maybe i missed a hint...
17:50:07  i'll assume you are just busy
17:50:07 -!- b_jonas has quit (Read error: Connection reset by peer).
17:50:29  sorry...
17:52:05  crap...
17:52:19  i think i chased them away
17:58:33  turns out you _can_ write recursive functions using a queue, provided you have operators that treat it as a stack. :P
18:00:39 -!- b_jonas has joined.
18:01:00  no, I parted for an unrelated reason
18:03:10  oh
18:10:34  [[Special:Log/newusers]] create  * Enchant3d *  New user account
18:11:42  i'm so scared
18:12:34  i don't know why
18:15:56 -!- imode has quit (Remote host closed the connection).
18:21:27  which fungot style provides gratuitious stock market tips?
18:21:27  b_jonas: be less specific. :) but no fnord.
18:22:34  ^style
18:22:34  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 ukparl youtube
18:22:57  less specific? which fungot style provides gratuitious tips on how to get rich quickly?
18:22:57  b_jonas: if it matches
18:23:01  ^style qwants
18:23:01  Not found.
18:23:08  ^style qwantz
18:23:08  Selected style: qwantz (Dinosaur Comics transcriptions 2003-2011)
18:23:11  ah
18:23:23  ^style fisher
18:23:23  Selected style: fisher (Fisher corpus of transcribed telephone conversations)
18:23:34  fungot: blah
18:23:34  int-e: yeah so and
18:23:37 -!- Lykaina has quit (Quit: leaving).
18:23:42  fungot: how's mom?
18:23:42  int-e: was just saying noise no because if they if the class if the students have access to computer twenty four seven
18:24:06  ^style enron
18:24:06  Selected style: enron (subset of the Enron email dataset)
18:24:13  fungot: fraud?
18:24:13  int-e: you know of any " position" ( " position" ( " position" ( " position" ( " position" ( " position" ( " position" ( " position" ( " position" ( " position" ( " position" ( " position" ( " position" ( " position" ( " position" ( " position" ( " position" ( " position" ( " position" ( " position" ( " position" ( " position" ( " position" ( " position" ( " position" ( " position" ( " position" ( " position" ( " position" ( " 
18:24:30  glad we settled that...
18:24:38  fungot: loop?
18:24:38  int-e: the bonds. briarpark ln. from the electronic version of the construction of the california legislature. bass" eric.bassenron.com to: " it is the only two: a band of choctaw indians, unable to attend any or any combination of the plan.
18:24:56  ^style irc
18:24:56  Selected style: irc (IRC logs of freenode/#esoteric, freenode/#scheme and ircnet/#douglasadams)
18:27:35  hello
18:27:49  (λx:μX.X→A.(unfold x)x) (fold λx:μX.X→A.(unfold x)x)
18:28:40  fungot: lambda mu nu
18:28:41  arseniiv: the is metaphorical, so it's the same thing :) i'd guess by alonzo church though
18:29:45  arseniiv: I expecte mu X.X -> X
18:30:11  fungot, do you understand indirect type recursion with the Mu type?
18:30:12  b_jonas: but it's a slow daemon :(
18:30:19  (also shouldn’t I write νX.X→T or is μ okay for these kinds of functors)
18:31:02  and neither mu nor nu make so much sense with contravariant functors?
18:31:07  int-e: I like the version with A as we can inhabit any type we pick, like 0
18:31:39  (that term overall has type A)
18:31:44  meh I don't know this stuff. Sure, you're somewhere in domain theory territory, but I don't know whether they can still support different kinds of fixed points nicely.
18:32:09  :t fix id
18:32:11  though I read Pierce on significance of μX.X→X, yeah (exactly today, even)
18:32:11  a
18:33:30  yeah, fix id is simpler when we already have fix typed, but I think typing omega by itself is a bit less long
18:33:53  [[Esolang:Introduce yourself]]  https://esolangs.org/w/index.php?diff=66164&oldid=66041 * Enchant3d * (+279) /* Introductions */
18:36:59  also I’m dabbling in deep waters here too, I heard about something which has sense only for covariant/contravariant functors but I don’t remember that
18:37:15 -!- b_jonas has quit (Read error: Connection reset by peer).
18:37:29 -!- b_jonas has joined.
18:41:41  hm now I realize X ↦ (A → X, X → A) is not a functor? Not can it be covariant nor contravariant
18:42:30  either I’m wrong or it looks strange
18:43:42  also I realize I don’t remember what the class of contravariant functors is called in Haskell if there is one name somewhere
18:44:58  Haskell's -> is very different from -> in Set.
18:49:27  arseniiv: must be "Cofunctor", everything in Haskell is called co-something
18:49:28  `? co
18:49:29  co? ¯\(°​_o)/¯
18:50:06  cocoa coated co-cones
18:50:25  the breakfast cereal for category theorists
18:51:55  kmc: hmm what do category theorists do when they can't sleep? (set theorists count to aleph_1)
18:52:47  oh poor set-theorists
18:52:56  lol
18:54:01  though maybe then they sleep for infinity
18:55:17  `` python -c 'import time; time.sleep(float("inf"))'
18:55:18  Traceback (most recent call last): \   File "", line 1, in  \ IOError: [Errno 22] Invalid argument
18:56:04 -!- Melvar has quit (Ping timeout: 268 seconds).
18:59:03  so evidently Python is not a set theorist
19:01:37  oh! let me try something
19:01:43  `` python -c 'import time; time.sleep(-1)'
19:01:44  Traceback (most recent call last): \   File "", line 1, in  \ IOError: [Errno 22] Invalid argument
19:02:25  it can’t sleep backwards, too bad
19:02:27  . o O ( Negative numbers are a cardinal error. )
19:03:00  in a non-eso world, I think sleep(-1) should do the same as sleep(0), return very soon
19:03:04  Or maybe I should go the whole mile and write "sin" there?
19:03:06  int-e: (rofl)
19:03:18  in an eso world, sleep(-1) should use a time machine to go back one second
19:03:54  int-e: but sin is not a cardinal. At least I think in ZFC it shouldn’t be by any accident
19:04:31  it can do that by first noting the current time, then sleeping until a reliable software time machine implementation becomes available, installing and dynamically loading it, then using that time machine implementation to go back in time one second before the call
19:04:57   in a non-eso world, I think sleep(-1) should do the same as sleep(0), return very soon => IIRC often -1 means “no limit” in that case
19:05:03  arseniiv: I suppose as long as you're reasonable about representing the function...
19:05:26  If you write sleep infinity then perhaps it should call pause()
19:05:36  arseniiv: that's for the c function that takes an unsigned int
19:05:38  int-e: ah, that could be a loophole
19:05:44  arseniiv: this one is a python function, which takes a python int
19:05:49  arseniiv: You could represent the computable functions using some Gödel numbering :P
19:05:52  so it's clear that the -1 isn't just a very large integer
19:06:08  if you want to sleep infinitely with the python interface, you can just write sleep(1<<31)
19:06:17  no wait
19:06:19  that's not good enough
19:06:23  I mean sleep(1<<62)
19:06:40  1<<31 is only a few decades
19:07:44 -!- Lord_of_Life_ has joined.
19:07:46  b_jonas: hm in a hypothetical case Python ints would be encoded in p’s complement, -1 ≡ …11111 > any finite positive value = practically infinite
19:08:03  (though then any negative value would behave the same)
19:08:35  unbounded p’s complement*
19:08:41  arseniiv: but time.sleep doesn't take an integer, it takes a floating point value for sub-second precision, that's documented clearly
19:08:57  I don't think it's uncommon for -1 to mean "no limit" for C functions that take an int as well. Although usually there's some other termination condition too. Like with `poll(struct pollfd *fds, nfds_t nfds, int timeout)`, where -1 (or any other negative value) means there's no timeout.
19:09:01  b_jonas: you win :P
19:09:05 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
19:09:12  JavaScript integers are unbounded two's complement; this affects how bitwise operation are work
19:09:24 -!- Melvar has joined.
19:09:29  ``` python3 -c'import time as t;print([(t.sleep(0.5),t.time()) for k in range(5)])'
19:09:32  ​[(None, 1568488170.3078678), (None, 1568488170.8085804), (None, 1568488171.3093328), (None, 1568488171.8100646), (None, 1568488172.310767)]
19:09:46  > -8 .|. 2
19:09:48   -6
19:09:51  zzo38: sure, and so are python integers (except in ancient python) and GMP integers
19:09:54  no wait
19:09:59  maybe GMP integers are different, I can't recall
19:10:25  I think GMP integers might be sign-and-magnitude.
19:10:32  fizzie: that's the representation
19:10:40   arseniiv: You could represent the computable functions using some Gödel numbering :P => ah I have just read the second one finally. You clearly win too. Or sin
19:10:41  but how do the GMP bitwise functions affect them?
19:11:08  http://www.computer-go.info/ "These functions behave as if twos complement arithmetic were used (although sign-magnitude is the actual implementation). The least significant bit is number 0. "
19:11:16  huh
19:11:30  (JavaScript did not even have an integer type until somewhat recently, though)
19:11:43  https://gmplib.org/manual/Integer-Logic-and-Bit-Fiddling.html
19:11:47  that was the link
19:12:01  oh I meant unbounded not in that sense, I wanted something p-adic maybe. For −1’s representation to be unbounded itself
19:12:29  (Why can't software respect the X11 selection ownership protocol these days...)
19:13:01  I like languages that represent true and false as -1 and 0, respectively.
19:13:05  `forth true .
19:13:05  (Java software is terrible at this.)
19:13:05  ​-1
19:13:14  (You can use bitwise operations with floating numbers, but then it converts them to 32-bit integers, and then converts it back to a floating point afterward. Optimizations may avoid having to perform the conversion every time, though.)
19:13:38  fizzzie: Yes, Forth, and also BASIC, does.
19:14:09  > complement 0
19:14:12   -1
19:16:05  I hope they add a popcount function into JavaScript; implementing it using JavaScript code would be inefficient.
19:16:09  > iterate complement 0
19:16:11   [0,-1,0,-1,0,-1,0,-1,0,-1,0,-1,0,-1,0,-1,0,-1,0,-1,0,-1,0,-1,0,-1,0,-1,0,-1,...
19:18:42  int-e: yes, and very often -1 for true is more convenient than 1 for true. ideally if you go for optimizations, you can choose between those representations, and of different sizes too
19:19:27  it is true though that representing true with 1 also makes sense, and it wasn't even C that started that, APL already depends on representing true by 1
19:19:30  I’m glad true integers were added to JS, I hadn’t heard about that earlier. Maybe some day I’ll write something in a future JS
19:20:46  b_jonas: is it connected with use of Iverson brackets?
19:21:02  arseniiv: yes
19:21:21  but then they aren’t needed?
19:21:27  in fact, often the hybrid solution is the best:
19:21:46  treat true as if it had the value 1 semantically when you use it as a number, but represent it as -1
19:22:00  but again, that's not always the best either
19:22:21  luckily it's not that hard to convert between different representations 
19:24:49  what's the best depends both on how you're generating the integers, what you're doing with them, and even the cpu instruction set extensions
19:25:36  > let { true = -1; x `and` y = negate ((negate x) * (negate y)) } in true `and` true
19:25:39   -1
19:31:04  (hm is there a module to convert an unbounded integer to Knuth’s myriad-myllion system (or another I don’t know of))
19:31:48  (though practical considerations make some complexity unnecessary)
19:31:58  I don't know what "Knuth's myriad-myllion system" is. is that when you compute everything modulo various primes?
19:33:27  b_jonas: it’s a textual representation suitable for unbounded integers, as traditional ones can’t handle values that are too big
19:34:07  ah
19:34:11  I hadn't heared of that
19:35:54  first it declares its own myriad = 1e4, myllion = 1e8 and something for 1e16, 1e32 and so on for some time, and then it allows arbitrarily long names but I always forget in which manner. I’ll look up what the article was called
19:36:14  I know http://www.madore.org/~david/weblog/d.2010-09-03.1791.html as an alternate system to write large integers, but it's not for unbounded ones, it has a limit of something between 10**21 and 10**100 depending on version
19:39:30  Do you like this? https://twitter.com/AlexKontorovich/status/1172715174786228224
19:39:57  shachaf: wow, is this an unpopular opinion that is actually unpopular?
19:42:17  b_jonas: I didn’t found the original article but there is another: https://en.wikipedia.org/wiki/-yllion
19:43:07  . o O ( Fortunately the Collatz conjecture has no practical implications at all. )
19:44:09  kmc: shocking
19:45:13  I'm disappointed that lea r64,r64 is encodable but just an illegal instruction.
19:45:37  shachaf: Well, he's not wrong. There's no particular reason why a weird universal machine should not be lurking inside the Collatz sequence. We'll never know.
19:46:44  shachaf: why? there are several other instructions that are invalid with a register argument
19:46:53  int-e: wow, you're much less motivational than hilbert tdnh
19:48:56  Feel my power of negativity.
19:49:01  Wir müssen wissen. Wir werden wissen.
19:49:49  Gödel put an end to that attitude.
19:50:02  I hear it was a huge blow to Hilbert.
19:50:18  (Almost typed "Dilbert" there, how's that?)
19:51:29  int-e: This reminds me of the time my uncle Bilbert
19:53:32  shachaf: If you think about it a bit, by saying that we'll never know I'm also suggesting that no counterexample exists :)
19:53:49  Not sure that was entirely intentional.
19:54:13  Are you actually?
19:54:18  int-e: not really suggesting that
19:54:25  there could be counterexamples that are hopelessly hard to find
19:54:28  I think we'll never know BB(100) but I think it exists.
19:54:31  shachaf: Well presumably if we can /find/ a counterexample that would resolve the question!
19:55:01  like, you know, there's almost certainly a string whose SHA-512 sum is zero, but we probably won't find one soon, and for a well-designed 1024-bit checksum, we'll probably never find one
19:55:07  Or that.
19:55:08  shachaf: True. Hard to believe, but true.
19:55:34  shachaf: in what sense can you "know" BB(100)? it's so large, surely you don't expect us to write down all digits
19:56:02  no, I mean, in what sense can you "know BB(100)"?
19:56:17  do you have a more specific true-false statement about BB(100)?
19:56:27  Your example is better for that reason.
19:56:34  shachaf: Oh if https://www.treadwell-stanton.com/services/phaedra has any basis we'll have sha512 preimage attacks in no time ;-)
19:56:43  But I think most interesting predicates about that number are similarly unknowable.
19:56:55  For example: Is it greater than 5? We just don't know.
19:57:19  "it"?
19:57:23  BB(100)
19:57:28  shachaf: of course it is
19:57:31  shachaf: it's greater than 5, yes
19:57:37  But is it greater than 8?
19:57:39  we can give plenty of lower bounds, unimaginably large
19:57:41  That one's a real stumper.
19:57:51  shachaf: you're mixing up something
19:58:10  The joke is that I said that predicates of this number are unknowable, and now I'm giving some knowable predicates.
19:58:14  It's not a very good joke.
19:58:51  shachaf: https://en.wikipedia.org/wiki/Graham%27s_number is closer to what you're saying
19:59:05  That one's obviously less than BB(100)
19:59:11  (best lower bound: 13. best upper bound... too large to write down)
19:59:14  shachaf: I don't believe that. they'd be rich if they could break SHA-256 already. that said, I was careful and said SHA-512 deliberately.
19:59:28  (without special notation)
19:59:41  Oh, you're not talking about the number but the original problem.
19:59:58  b_jonas: yes, there's a lot that is wrong with that page :)
20:00:17  I think we know that 100 is a lower bound for Collatz
20:00:18  int-e: So that link claims "orders of magnitude faster" than brute force.
20:00:22  b_jonas: but, interestingly, the Digital Annealer Units are real technology.
20:00:25  so 13 can't be the best lower bound
20:00:43  Let's say 3 orders of magnitude, so 10 bits?
20:00:57  b_jonas: Uhm, the 13 is for that Ramsey theory problem that Graham's number is an upper bound for.
20:01:03  Oh man. "overlapping into the quantum computing realm"
20:01:18  shachaf: I don't believe any of the performance claims in that link.
20:01:23  I'm sold.
20:01:28  int-e: blockchains, neural nets, and dozens of other trendy jargon words are also real technology, yet marketing people sell so much bullshit with them
20:01:33  It's also good to know that Google has a preimage attack on SHA-1.
20:01:41  int-e: ah
20:03:08  b_jonas: The Digital Annealer Units are used for things like TSP. As far as I understand them, they're basically accelerators for simulated annealing.
20:03:10  I don't know what graham's number is all about, I think it's another famous hype that's abused for marketing or something
20:04:01  b_jonas: I have not seen any claims for plain combinatorial search, in particular satisfiability, and I can't really see how that would work either... there's no locality to exploit at all.
20:04:33 * int-e shrugs
20:05:02  there's a nice question for which 7 is the best known lower bound so far, and it was improved from 6 to 7 in 2008: https://mathoverflow.net/a/100449/5340
20:05:26  shachaf: I thought Google has a SHA 1 collision (shattered)... a proper preimage attack would be news to me.
20:06:16  then there's also the Hadwiger-Nelson problem
20:06:40  b_jonas: hmm, how does this relate to addition chains?
20:06:43  int-e: I'm only saying the obviously false things your link is saying.
20:06:47  int-e: I don't think so
20:06:48  ah I found that article now, there Knuth uses parentheses “latin…yllion” to represent n ↦ 10^2^(n+2) where n is named as “…” using the same system
20:06:52  Maybe it's not even saying that. Whatever.
20:07:11  b_jonas: I guess addition chains count the + signs rather than the 1s. Hrm.
20:07:31  b_jonas: (and allow some additional sharing of subexpressions too... so not the same)
20:07:32  (then he discusses a series of prefix binary notations, couldn’t he make a prefix one here too)
20:07:41  int-e: there are like ten thousand different interesting open questions in combinatorics that are easy to ask, I hear a lot about them from the guys at ELTE
20:08:11  b_jonas: Ah I'm looking at the wrong entry...
20:09:55  b_jonas: It's a bit boring when you have an infinite family of problems, and are just nibbling at the low end (here: 1 point, 2 points, 3 points ... 6 points, now 7... even if you find 8 points, that still leaves 9?)
20:10:48  and there are a lot of them that, unlike these conjectures about eight points with pairwise rational distances or the Hadwiger-Nelson, sound like they should be easy to prove, but they really aren't
20:11:08  int-e: sure, that's why I said the best lower bound is 7
20:11:18  it would be good to know the actual highest value
20:12:39  b_jonas: Of course the picture is different if there's a known upper bound. And it becomes fascinating when the upper and lower bounds are close as for the Hadwiger-Nelson problem.
20:13:09 -!- Phantom_Hoover has quit (Ping timeout: 268 seconds).
20:13:35  Anyway, I wanted to see what "almost all" means in that Tao paper...
20:14:15  (Almost all orbits of the Collatz map attain almost bounded values, https://arxiv.org/abs/1909.03562)
20:20:43 -!- Phantom_Hoover has joined.
20:21:41  How long has it been the olisters got the five-week Sphinx virus?
20:27:12  Yeah I think there's still plenty of room in "almost all" for a universal machine to hide in.
20:27:41  I mean the complement thereof, of course.
20:29:16  Does "almost all" mean "all but elements of an implied ideal"?
20:30:26  No it means the logarithmic density is 1.
20:32:31 -!- tromp_ has joined.
20:36:08 -!- tromp has quit (Ping timeout: 276 seconds).
20:49:39  shachaf: not long. they still haven't reached the predicted date of Harry's death, and that Sphinx virus was within two weeks I think
20:50:04  wait, let me get more specific
20:51:16  http://www.giantitp.com/comics/oots1081.html is when Hel says everyone on the ship is infected with deadly Sphinx Pox, and they got it from Mr. Scruffy back in the desert
20:51:39  also that it has an incubation period of five weeks
20:54:00  http://www.giantitp.com/comics/oots0937.html was still during the long day in the desert, and Haleo says that the ship will get them to past the Dwarven lands in eight days if the world is at stake, and the world is indeed at stake
20:54:11  the fate of the world
20:54:46  now going to the location of the Godsmoot and attending it was probably a day of delay, and the two fights at the dwarven lands took two or three days
20:55:02  and the long day was, I think, two days after they arrived to the Empire of Blood
20:55:17  the question is, how long they've been in the desert before they arrive to the Empire
20:56:21  and that's hard to tell, because they already spent an unknown amount of time in the desert between #672 and #673, 
20:56:54  and in #673 they're in a large town, though not as large as the one in the Empire of Blood, but probably still large enough for pox to spread
20:57:37  but Roy says in #673, "Here we are, gang. The town of Sandsedge, first stop on our journey."
20:58:03  that sounds like they hadn't been to a town in the desert before that, so that's the earliest time that the cat could have gotted the virus
20:58:27  now how much time did they spend from arriving to Sandsedge to arriving to the Empire of Blood? I've no idea
21:00:07  https://oots.fandom.com/wiki/Timeline#The_Comics has some calculations
21:01:46  ah yes, it points out to #692 which shows that they spend six days searching, but they don't spend twenty more pages
21:03:00  hmm
21:03:16  it looks like they did actually pass more than half of those five weeks of incubation
21:03:40  of course, people in the forums already pointed out that now they have clerics who can cure such illnesses easily, and in fact may have already cured them
21:06:54  Oh, that's a good point.
21:07:00  But they may get separated again.
21:08:58  in fact, Mechane Crewman with Goatee in #951 seems to me like he's the resident cleric of the Mechane, and he may have already cured the mechane crew from the pox too
21:09:15  Greg had time to cure them as well
21:10:53  Who?
21:11:56  cure the Mechane crew, before the dwarven lands
21:11:58  no wait
21:12:01  before the godsmoot
21:12:09  since Greg left the Mechane at the godsmoot
21:12:18  also, the potion factory with advertising deal may have given the Mechan crew potions other than the cure potions
21:12:31  some of which may be good aginst illnesses
21:17:49  fungot, have you ever got Sphix Pox?
21:17:49  b_jonas: the answer seems pretty obviously ' no.' symbol is used as a normal atom?'.
21:18:07  fungot: no, it's a virus
21:18:07  b_jonas: if i am
21:30:18  Who's Greg?
21:31:05  shachaf: the vampire that inhabited Durkon's body
21:32:08  Oh.
21:32:19  Why would the high priest of Hel sabotage Hel's plans?
21:33:53  shachaf: he was disguised as Durkon, so he did some things that Durkon would do to keep the disguise
21:34:01  he did protect the Mechane in other ways
21:35:54  But they didn't even know about the virus.
21:36:15  shachaf: I think clerics have a way to detect illnesses
21:36:23  in fact, maybe even Vaarsuvius or Elan has a way
21:37:34  but it's more likely that they don't know about the virus, some of them still carry it, but it will be detected and quickly cured when the symptoms become visible
21:40:01  luckily Remove Disease is available even in potion form (or "cleric in a can" as Tarquin calls it)
21:41:49 -!- Lykaina has joined.
21:42:28  hi
21:46:10  I bet it'll have some impact on the story.
21:46:32  shachaf: I already said that I'm sure it won't have an impact on the story
21:46:35  arf?
21:46:39  it may come back as a joke, but not as anything serious
21:47:05  Right, that's why I said it would.
21:47:34  shachaf: I'm saying this mostly because in the Start of Darkness book, there's an entire story arch where a strange virus infection has a large impact on the story
21:47:44  and I don't think the Giant would repeat such an element in the later storyline
21:50:44  so, as i am a werewolf, i repeat my question. Arf?
21:52:10  that out of universe argument convinces me more than any in universe explanation
21:52:48  huh? i was just being silly
21:57:38  so, what did i miss?
21:58:14  did i actually say something profound by accident?
21:59:27  Lykaina: we were talking about o, a certain webcomic that's popular here
22:00:45  oh
22:03:42  werewolf - english dictionary: arf? = huh?, grr... = oh shit..., still working on the rest.
22:05:07  as Lykaina is greek for she-wolf, i sometimes speak canine due to my lupine nature.
22:05:36  oh, that's what it means? so you're in the half of the channel whose nick means something?
22:06:11  huh?
22:06:25  we have some people whose nicks are entirely meaningless
22:06:40  or at least they deny any meaning
22:06:44  you aren't related to nick jonas?
22:07:01  who is "nick jonas"?
22:07:09  lol
22:07:18  sorry
22:07:48  2000's teen pop star
22:07:51  ah
22:08:03  I don't think anyone asked me that yet
22:08:15  people asked about some musicians called the Jonas brothers instead
22:08:42  nick jonas was the front of the jonas brothers
22:08:47  ah
22:08:53  well that makes more sense then
22:09:27  there's like a thousand different people out there who use the nick "jonas", and more who use the nick "Jonas"
22:09:46  no wonder, because it's also a very popular real name, both as a first name and as a last name
22:10:10  I too use the nick "jonas" on some places online
22:10:19  last name?
22:10:24  in at least one place I'm called "jonas" and another commenter is called "Jonas"
22:13:17  then there's the Jessicas and Jennifers, and the years where there were three in every class in school
22:13:43  yes, girls' names are fickle, the fashion changes every few years
22:13:52  whereas boys' names are much more stable
22:14:19  Sara's been popular for a while.
22:14:52  Bence has been the single most popular boys' name for newborns in Hungary for two decades, and it was at least somewhat popular already more than a century ago
22:15:47  I also made up some Magic: the Gathering cards and wrote it on a paper, including:  Night Wolf {3G(G/B)} Creature - Wolf (2/2) ;; First strike ;; Bands with other creatures named Night Wolf ;; Menace   although maybe some thing should be altered a bit, I am not sure
22:16:16  the years after twilight came out, Isabella was popular
22:17:00  Make up a name different from someone else's name, so that it is not confuse with other people with the same name.
22:17:24  zzo38: yes, "b_jonas" is pretty unique, which is lucky given how short it is
22:17:35  OK, that is good, then.
22:18:34  I guess "lob_jonas" is even more unique
22:19:13  i snatched SchrodingersCat in 2005 when i first used freenode.
22:19:38  i hated being asked if i was living or dead
22:19:52  O, so that is why your hostname cloak says schrodingerscat
22:20:02  i was someone else then.
22:20:05  yes
22:21:37  i think i used SchrodingersCat when Sgeo first showed me this channel when i was in college.
22:22:07  again, different person
22:22:16  [[B automaton]] N https://esolangs.org/w/index.php?oldid=66165 * A * (+158) Created page with "[[B automaton]] is a [[Bully automaton]] designed with problem-solving usefulness in mind. [[Category:2019]] [[Category:Languages]] [[Category:Unimplemented]]"
22:22:42  yeah, this channel is old. we have logs going back to 2002
22:23:05  that's around when freenode formed, right?
22:23:15  no clue
22:24:08  I think I started using irc in 2005 or so
22:24:26  basically I started participating in internet communities in 2003
22:24:30  irc came a bit later
22:24:50  I came on it first for computer help, like many people do, then eventually got stuck because of communities
22:25:06  freenode the most, but I've connected to like a dozen different irc networks at different times
22:25:14  in 2008, when i started activly using irc, i chatted like a noob.
22:25:31  cause i was one then
22:25:52  took me a few years to learn how to chat properly
22:26:46  I even founded three successful channels: #cbstream was active from 2006 to 2017, with some breaks; #jsoftware was active from probably 2009 and still lives; 
22:27:26  and ##Droidikar was an event-related one-time thing that was active for like four days
22:27:49  I sometimes use other IRC servers too but always use the nickname and username "zzo38" on them. On ifMUD I am #20071. On Usenet/Unusenet I am "news@zzo38computer.org.invalid" (in some old articles, it didn't have ".invalid" at the end; I added it at someone else's suggestion). I am also User:Zzo38 on some wikis (including esolang wiki)
22:28:53  the username i use depends on when i start using it
22:29:00  OK
22:29:24  i keep the one when i was most embarrassing private
22:29:30  OK
22:30:11  it's cool that on the internet you can start over.
22:30:55  Yes, although if you have a static IP address then you would want to change it if you will start over.
22:31:46  A static IP address is indeed most people's main barrier.
22:32:08  meh
22:32:13  I use IRC from a VPS
22:32:20 -!- arseniiv has quit (Ping timeout: 246 seconds).
22:32:24  if I want a new IP i can just ask for one
22:32:27  Yes, that works too
22:32:38  also if I'm on my phone wifi then it's a different IP every time
22:33:04  I don't think a static IP address is the main barrier
22:33:11  it's more like all the personal information I give out
22:33:37  almost all my online identities are linked together with lots of links and more implicit statements, it's easy to find me from any of them
22:34:01  which is deliberate, but it would be much harder to deliberately make one that's not connected to my other identities and still chat in a reasonable way 
22:34:07  [[B automaton]] M https://esolangs.org/w/index.php?diff=66166&oldid=66165 * A * (+576) 
22:34:17  secret identities come natural to some people, but it would be much harder for me
22:34:30  I mean, if I entered here under any other nick, you'd probably recognize me after a few lines
22:34:52  Yes, if you have a RDF file to link them together, for example. Not all such services allow linking to such a RDF profile, but I invented the way to do so with NNTP. (You can easily have multiple RDF profiles too, if you want to keep them separate)
22:35:37  b_jonas: Maybe your hostname too, possibly
22:35:43  zzo38: the nickserv user cbstream has a nickserv property set to connect it to me, you can see it with `NICKSERV INFO cbstream` with the current software I think
22:36:14  zzo38: hostname is easier to mask by using a proxy that you don't recognize
22:36:36  Yes, if you deliberately do that, then of course it will be easier to mask
22:36:38  ah no, you have to do `NICKSERV TAXONOMY cbstream` still
22:37:07  read that as taxidermy
22:37:07  You can also abbreviate the command "NICKSERV" as "NS"
22:37:22  and got really confused
22:37:22  really?
22:37:24  let me try
22:37:36  yeah, you're right
22:39:23  [[B automaton]] M https://esolangs.org/w/index.php?diff=66167&oldid=66166 * A * (+352) 
22:40:07  I didn't know that for some reason
22:40:38  Who is A on the wiki?
22:40:48  is that code for anonymous?
22:40:58  no
22:41:51  i keep seeing updates by A and wonder if they are the wiki's #1 updater
22:42:04  yes they are, they put a lot of nonsense there
22:42:07 -!- imode has joined.
22:42:40  which is annoying, but admittedly it aligns with one of the goals of the wiki, which is to attract people's useless creative output away from more dangerous places they could mess up
22:44:15  which is also why I think we should allow languages on the wiki when they aren't technically esoteric, but they're obscure enough that they don't get documented anywhere else
22:44:43  so if a programming language doesn't get an en.wikipedia entry, then I think it should be on topic here
22:46:02  which is why I documented https://esolangs.org/wiki/SIMPLE_(preprocessor) despite that it's technically not esoteric because david originally wrote it to do some preprocessing for html or tex or something and used it a little that way
22:50:14  (My way of using RDF user profiles on NNTP is to add a "From-RDF" header, which includes the URL of the RDF file (the "file:" scheme is not allowed). You still need a "From" header too, though.)
22:53:56  The information provided for Baba Is You is not complete, although from the information provided, and some guesses, it would seem that the example is paradox since the first line allows the second line to be interpreted as denying that it can be interpreted in this way.
22:54:29  Is it? Unfortunately, I don't know.
22:56:19  One nonstandard header I have seen in Usenet messages is "X-Clacks-Overhead". I looked it up, and seems that it was intended for HTTP, although it could also be used on NNTP (as in this case), and also email, and also ifMUD (although nobody can see it unless you set yourself examinable)
22:57:30  (and perhaps also it could be set as a NickServ property on Freenode, too)
23:04:35  [[Trate]] N https://esolangs.org/w/index.php?oldid=66168 * A * (+436) Created page with "[[Trate]] is a tool for bitwise-translating the input. == Instructions == Nx,y Negates the position on (x,y), also affecting the nearby cells to negate. If on the edge, cells..."
23:04:46  [[Trate]] M https://esolangs.org/w/index.php?diff=66169&oldid=66168 * A * (+1) 
23:04:51  not another bug...
23:09:45  [[User talk:A]] M https://esolangs.org/w/index.php?diff=66170&oldid=65854 * A * (+527) 
23:11:34  fungot, which one is the better pop song about a hopeless love between "I will love again" and "White flag"?
23:11:34  b_jonas: i was working on a toy interpreter or two. i really want to
23:11:47  fungot: oh nice, tell me more. what kind of interpreter?
23:13:41 -!- imode has quit (Ping timeout: 258 seconds).
23:18:07  wait, so not only are ISO 3166-1 alpha-2 two-letter country codes sometimes reassigned to an unrelated country, but IATA two-letter airline codes are sometimes reassigned too? these standards are crazy
23:21:00 -!- imode has joined.
23:33:13  I am glad that PostScript allows integer literals in base four.
23:40:04  `? linker
23:40:09  The linker (from German "links") is a part of a Turing machine that's responsible for moving all output data to the left of the tape before terminating.
23:41:07  you know how the protagonist of the Metroid series is not called Metroid, she's called Samus, and the protagonist of the Zelda series is not called Zelda, she's called Link, right?
23:41:24  well, now that's made more confusing, because there's a Zelda game where Zelda is the best playable character
23:43:07  and it's not like one of the 3D games where Zelda is a huge glowing white elf princess who tells you the plot while Link is an elf child wearing a green hood and a sword and never speaks, no. it's a 2d game where Zelda is a tiny sprite 
23:44:44 -!- adu has joined.
23:46:25  admittedly there's also been a few Mario games where Princess Peach was a playable character
23:46:31  s/was/is/
23:47:32  (even apart from Smash and Mario Kart games)
23:48:17  Is the baby metroid a playable character in any game?
23:48:32  I think the only Mario's I've played are gameboy and nintendo64
23:50:10  adu: consider playing others, there are many good Mario games
23:52:04  how to play original mario
23:55:22 -!- imode has quit (Remote host closed the connection).
23:55:39 -!- imode has joined.

2019-09-15:

00:01:13 -!- xkapastel has quit (Quit: Connection closed for inactivity).
00:11:33 -!- Phantom_Hoover has quit (Ping timeout: 265 seconds).
00:14:26 -!- imode has quit (Ping timeout: 240 seconds).
00:17:47 -!- imode has joined.
00:19:17  what is a flow operation?
00:19:43 -!- imode2 has joined.
00:19:53  is that if, while, switch type?
00:20:31  those are usually called "control flow". I don't know what "flow operation" means.
00:21:05  that's what i meant
00:21:58  the "control" is the important word because a lot of Haskell libraries are named "Control" something in this sense, without mentioning flow
00:22:17 -!- imode has quit (Ping timeout: 268 seconds).
00:23:27  in debugging, i found problems at the very core of the echidna language.
00:23:52  basically, i've never tried breaking out of a loop before
00:24:12  and not immediately ending
00:24:55  well, to be precise, the implementation of the core
00:25:19 -!- cocof has joined.
00:25:33  no
00:25:40  Lykaina: ah, I never really looked at that part of the interpreter code
00:26:00  I cared more about the arithmetic stuff
00:26:06  if/while loops
00:26:43  so basically, Samus got bitten by a radioactive baby metroid in the ending of Super Metroid, and since then she has super metroid powers and metroid sense and metroid DNA in his body?
00:26:54  how do they invent such a story?
00:27:13  lexx
00:27:25  see: xev's origin
00:27:35  that's how
00:28:58  okay, no, that's not it
00:29:05  it's spiderman
00:29:20  how about astral travel?
00:29:27  since you choose such name
00:29:36  how can code be astral?
00:29:51  huh?
00:29:58  the name
00:30:03  for?
00:30:06  esoteric
00:30:38  cocof: just look at regular expressions; they're full of stars
00:30:40  esoteric programming languages
00:31:08  both gays and esoteric code is a fail :)
00:31:14  for not been able to use own name
00:31:43  it's also worth noting that "esoteric" has nothing to do with stars.
00:32:23  esoteric, 'from Greek esoterikos "belonging to an inner circle" (Lucian), from esotero "more within,"'
00:32:24  why not call it language nr 23 :D
00:33:01  I like stars.
00:33:48  I like shooting stars? Nah, that's a lie, I don't like shooting at all.
00:34:01  cocof: Unicode characters can be astral if it is more than 0xFFFF
00:34:21  while not obviously related, how come shifting awareness outside body is tricky/ 
00:34:45  well programming is fun also 
00:34:49  `? *
00:34:50  Twinkle, twinkle, little star!
00:35:04  star rats
00:35:05  :)
00:35:33  I don't know about shifting awareness outside body, and I doubt anyone else on here does. I am not even sure if it is possible
00:35:52  it is possible
00:35:53  My awareness is not inside my body in the first place, so it's impossible to shift it out.
00:36:38  when u carry bottle of vodka and your are alcoholic and all shops are closed...
00:36:50  where is your awareness? D:
00:37:06  same with body we are bodyholics :)
00:37:14  I think "where is your awareness" is not so clear what it is, to me
00:37:29  bodyholics anon :)
00:37:31  Personally, I'm a utilityholic.
00:37:38  I'm addicted to utility. I just can't get enough.
00:38:20  shachaf: Does that make you a tool...
00:39:37  zzo38 well when you code you are a code :)
00:40:07  now that you are can be some physical object but we are not accustomed and perhaps scared of such intimate encounters 
00:40:27  i gotta go afk for a bit.
00:40:50  due to bodyholicm :)  if I am a laptop i cant be 6`1 green eyes human perhaps, i wont be able to come back :P
00:42:15  I'm capable of being both of those things at once.
00:43:30 -!- GeekDude has quit (Quit: WeeChat 2.5).
00:44:01  shachaf so as a laptop what do you feel when humans type on you? :)
00:45:05  Also I think sometimes you might be unaware
00:45:25  most of the time
00:45:41  Or only partially aware
00:46:16  only fungot is constantly aware
00:46:16  int-e: fnord/ doc/ fnord/ dp/ 0262681374/ fnord/ fnord ( the red dot is where the final return value is a list
00:46:17  i would say 100% unaware
00:47:00  0262681374 unlocks the gate to the gold mine
00:47:23  midas did try
00:47:45  although midas myth is so fake
00:48:00  he was touching Earth while walking
00:48:07  so entire planet would be gold :P
00:48:28  Well, I suppose, nobody can ever be fully aware, because that seems to be a violation of law of physics
00:48:43  cocof: Yes, of course, but that is how stories are written.
00:49:19  yep and physics is a story 
00:56:27 -!- cocof has quit (Remote host closed the connection).
01:14:05 -!- tromp_ has quit (Remote host closed the connection).
01:14:39 -!- tromp has joined.
01:23:21  that did not just work.
01:23:33  Which one didn't work?
01:23:37  no freakin' way.
01:24:13  just implemented the common 'pick' operation..
01:27:31  https://hatebin.com/jgkozrchae
01:28:14  it allows you to reach back into the stack to "pick" out an item.
01:29:06  i.e clone it.
01:30:31  [[User talk:A]]  https://esolangs.org/w/index.php?diff=66171&oldid=66170 * Ais523 * (-527) Undo revision 66170 by [[Special:Contributions/A|A]] ([[User talk:A|talk]]): please stop provoking people, or you may end up blocked again
01:52:22  talk to you later
01:53:22 -!- Lykaina has quit (Quit: leaving).
02:41:53  [[The Subtyping Machine]] N https://esolangs.org/w/index.php?oldid=66172 * Ais523 * (+11621) document a language (although, this time, it wasn't me who created it)
02:49:25  Do you like PostScript Z-machine?
03:11:54  I do rather enjoy PostScript, haven't written anything in Z-machine assembly though.
03:12:38  Did you ever write a implementation of Z-machine, though?
03:12:58  (I did so, in C, JavaScript, Glulx, and now also PostScript.)
03:14:11  I did not. never had a desire to.
03:18:01  Also, mine are some of the only few that implement small-endian (as well as big-endian) (except the one with Glulx, which implements only big-endian Z-machine). Some implementations at least check the endianness and refuse to run small-endian story files, which is OK. But some fail to even check such thing.
03:19:57  Also, one of them I wrote, includes a debugger, too.
03:20:28  imode2: What programs have you written in PostScript, then?
03:20:31  I'm impressed you did it in postscript..
03:20:53  I actually haven't written any usable programs, just small snippets.
03:20:56 -!- imode2 has changed nick to imode.
03:21:07  which is kinda funny, I guess.
03:21:50  OK. What small snippets?
03:22:29  the stuff you write when you're initially learning postscript and other concatenative languages. factorial and fibonacci and such.
03:23:03  OK
03:24:17  I wrote a JSON parser in PostScript also, and then after I posted it to comp.lang.postscript, someone else also made another JSON parser in PostScript.
03:24:53 -!- Frater_EST has joined.
03:25:41  neat.
03:25:44 -!- Frater_EST has quit (Read error: Connection reset by peer).
03:26:24  something I just realized is that I can actually store _arrays_ in the queue in a linear format..
03:26:55  Can you elaborate on that?
03:27:32  so I'm building a little queue-based language, i.e a language who's primary work area is a cyclical queue.
03:27:54  I've been trying to make it reasonably close to something like Forth.
03:28:37 -!- Frater_EST has joined.
03:29:33  OK. Once you have enough of it written, you can mention the document and then we can read
03:32:23 -!- Frater_EST has quit (Remote host closed the connection).
03:34:24  zzo38: https://repl.it/repls/WrongJauntyRectangle
03:35:05  line 169 is the actual program you're running when you hit "run".
03:39:25  using things like 'pick' as an "indexing" operator, along with length-prefixed sections of the queue, you could implement arrays.
03:44:57  [[Deklare]] N https://esolangs.org/w/index.php?oldid=66173 * A * (+274) Created page with "[[Deklare]] is a language where variables are initialized before they are declared. ==Example== 
 a=b=c # a, b, and c are the same value. d=e=f # d, e, and f are the same..."
03:45:44  [[Deklare]] M https://esolangs.org/w/index.php?diff=66174&oldid=66173 * A * (+102) 
03:49:27  [[Deklare]] M https://esolangs.org/w/index.php?diff=66175&oldid=66174 * A * (+119) 
03:50:30  [[Deklare]] M https://esolangs.org/w/index.php?diff=66176&oldid=66175 * A * (+138) 
03:54:11 -!- ais523 has joined.
03:54:42  my latest bit of esolanging ridiculousness: https://codegolf.stackexchange.com/a/192843
03:55:03  Oh man, a non-referral link! So convenient.
03:58:02  not for me, it's a pain to edit the referral out
03:58:34  But you only need to do it once, and you save n other people the work.
03:58:37  fwiw, the SE devs don't seem to appreciate that a referral link might be viewed negatively
04:00:22  well, the referral link mostly impacts the person who posted it (your most popular referral links are shown on your profile)
04:00:51  I try not to click on referral links as some sort of principle.
04:01:32 -!- ais523 has quit (Quit: sorry for my connection).
04:01:45 -!- ais523 has joined.
04:02:51  I've switched from compiling my thing with gcc to tcc by default, because it's so much faster.
04:03:00  Why do people put up with slow compilers?
04:05:25  it depends on how much time the compiler saves me in a) debugging code and/or b) executing the program
04:05:56  compared to the time cost of the compile
04:06:28  at least in my case, I get really upset if the output asm is obviously suboptimal, which makes it hard to use any compiler atm, but I think most people aren't the same way
04:06:52  I mean -O0 compilation, of course.
04:07:47  If you compile your program many times and run it briefly, you should count the total time spent on optimizing against the time saved by generating better code.
04:08:29  You need quite a lot of optimization to offset 500ms extra of compilation time.
04:11:46  I guess this depends on what sort of programs you run?
04:12:10  typically if I'm using a compiled language, I expect the program to run for several minutes
04:12:27  otherwise I'd have written it in a different language
04:13:19  (or it might be a library, but in that case I'm going to be running tests on it, and my best use of time wrt testing is normally to write an exhaustive test or a fuzzer, both of which benefit hugely from speed)
04:31:09 -!- adu has quit (Quit: adu).
04:32:09 -!- Lord_of_Life has quit (Ping timeout: 246 seconds).
04:33:30 -!- Lord_of_Life has joined.
04:48:44 -!- wmww has quit (*.net *.split).
04:48:45 -!- xylochoron[m] has quit (*.net *.split).
04:48:45 -!- Taneb has quit (*.net *.split).
04:48:46 -!- zemhill_________ has quit (*.net *.split).
04:49:25 -!- xylochoron[m] has joined.
04:49:56 -!- wmww has joined.
04:50:50 -!- Lord_of_Life has quit (Ping timeout: 240 seconds).
04:54:16 -!- Taneb has joined.
04:54:16 -!- zemhill_________ has joined.
04:54:30 -!- Lord_of_Life has joined.
05:25:45  [[Category:Deque-based]]  https://esolangs.org/w/index.php?diff=66177&oldid=14068 * YamTokTpaFa * (+24) 
05:27:55 -!- Frater_EST has joined.
05:30:23  [[Talk:Pxem]]  https://esolangs.org/w/index.php?diff=66178&oldid=66069 * YamTokTpaFa * (+348) /* This language should be one of deque languages */ new section
05:51:47 -!- FreeFull has quit.
05:53:22 -!- Frater_EST has quit (Ping timeout: 245 seconds).
06:07:46  [[Special:Log/newusers]] create  * Yqloss *  New user account
07:00:15  really getting used to working in a queue-based language. with some primitive operations, it's as natural as working in a stack-based language.
07:01:49  with the added benefit that "impure" operations like `pick` and `roll` can be implemented in the language itself. still trying to figure out how to do things like swapping.
07:05:00  'swap' is unique in that it changes the order of the first two queue elements... hm.
07:05:46  doing that only with `dup`, `roll`, `last` and `drop` is my goal.
07:07:35  Oh, is this related to https://esolangs.org/wiki/Call_Queue ?
07:07:42  I wanted a language with a call queue once.
07:07:44  nope, my own language.
07:07:50  no call queue, but a data queue.
07:08:28  whoa
07:08:38  For some reason I never thought about the fact that Forth has a separate call stack.
07:08:41  Even though it's obvious.
07:08:56  yup, only reason it's TC.
07:09:10  that and the fact that it has access to main memory. but strip that away, that's the only way.
07:09:19  https://repl.it/repls/PoorUnevenDeskscan
07:09:33  line 163 onward.
07:10:25  the interpreter has a few bugs (conditional, mainly, because I'm too lazy to implement an 'if' macro.)
07:14:12  I want to experiment with a call queue, though. I had something like it with Modal, but that's because it was based on term rewriting, i.e the whole program was stored in a queue and rewrote itself.
07:15:29  I imagine if you allow manipulation of the call queue via words (like Forth does with the return stack), you can use it as a stack.
07:15:57 -!- Frater_EST has joined.
07:23:13  imode: I don't think so, because forth can also pick the data stack
07:24:30  that is true. can also roll it.
07:25:33 -!- ais523 has quit (Quit: quit).
07:33:12  imode: factorial and fibonacci => I prefer catalan numbers, see http://www.math.bme.hu/~ambrus/pu/catalan.ps
07:33:31  I don't consider `pick` and `roll` to be pure, though.
07:33:56  it even does the calculations in postscript
07:34:09  hah, neat
07:34:15  dunno why, that must have been inconvenient, I wouldn't have made it that way if I had to today
07:37:42  cocof => no, you're forgetting that Midas was a rich king, so he didn't walk anywhere, he was carried by his servants in a hand-lifted palanquin, and had carpets everywhere, presumably even in the toilet
07:39:55  that said, even if coding in postscript is stupid, the lesson that it shows of how handshakes correspond to triangulations, is a useful one
07:40:07  because it's a nontrivial bijection
07:40:26  it's worth to try to prove it without looking at the code, by looking at the output only
07:48:28 -!- b_jonas has quit (Remote host closed the connection).
08:10:31  [[User talk:Ais523]]  https://esolangs.org/w/index.php?diff=66179&oldid=66153 * YamTokTpaFa * (+254) /* Any features to insert mathematical formulas like TeX style? */ new section
08:14:59 -!- imode has quit (Remote host closed the connection).
08:22:34  [[()]]  https://esolangs.org/w/index.php?diff=66180&oldid=44645 * YamTokTpaFa * (+235) added some descriptions, though not done yet
08:57:03 -!- arseniiv has joined.
09:10:59 -!- FraterEST has joined.
09:14:02 -!- Frater_EST has quit (Ping timeout: 240 seconds).
10:39:23 -!- Frater_EST has joined.
10:41:47 -!- FraterEST has quit (Ping timeout: 276 seconds).
11:29:10 -!- tromp has quit (Remote host closed the connection).
12:13:58 -!- Phantom_Hoover has joined.
12:21:36 -!- xkapastel has joined.
12:24:55  [[Talk:Pxem]] M https://esolangs.org/w/index.php?diff=66181&oldid=66178 * A * (+111) /* This language should be one of deque languages */
12:25:10  [[Talk:Pxem]] M https://esolangs.org/w/index.php?diff=66182&oldid=66181 * A * (+151) 
12:30:20 -!- Frater_EST has quit (Ping timeout: 276 seconds).
12:51:06 -!- Frater_EST has joined.
13:20:41 -!- Lykaina has joined.
13:21:10  ugh...bugs are so annoying
13:38:25 -!- FreeFull has joined.
13:50:25 -!- b_jonas has joined.
14:06:51 -!- Phantom_Hoover has quit (Ping timeout: 258 seconds).
14:28:24 -!- tromp has joined.
14:41:05 -!- Sgeo has joined.
14:42:48 -!- Sgeo_ has quit (Ping timeout: 245 seconds).
14:49:33  yay!
14:50:24  hold on...how long have i been debugging?
14:59:30  Lykaina: do you have an updated version of the formatted docs?
14:59:47  also, why does echidna have so many instructions now? 
15:03:36 -!- tromp has quit (Remote host closed the connection).
15:06:17  b_jonas: 1) About to make it. 2) Everything not under "S" is added to avoid bugs.
15:07:32  3) i gotta make sure of something...
15:08:35  good.
15:09:11  gonna make the formatted docs for 0.11a0 in a moment
15:11:19  Lykaina: this is strange, haven't you changed how addressing modes work so that you write `@0000` to either read from the first word of memory or write to it? the instruction docs seem to suggest it's still the older way, where you say `@0000` to read from the first word and `=0000` to write into it
15:13:39  for 10a2?
15:13:56  hmm, so the previous M operation is gone
15:14:16  i'll try to fix it in the 11a0 doc
15:14:29  why do you need all these many-argument bitwise thingies? can't you just have four simple ones that take two input arguments and one output like the rest of the arithmetic does?
15:15:01  fun
15:17:04  nobody else does it, but maybe someone should
15:18:34  erk, these control instructions are getting more complicated
15:18:40  I liked while they were simple
15:18:50 -!- imode has joined.
15:20:03  especially given that the language doesn't seem to have any easy way to avoid the if-block statements
15:20:09 -!- Frater_EST has quit (Ping timeout: 268 seconds).
15:20:33  what do you mean?
15:21:00  what should i add next time around?
15:21:07  heh, you now  have 32-bit arithmetic builtins? but they work in a somewhat strange way
15:21:34  do you really need them to take separate addresses for the low and high bytes, as opposed to always reading from two adjacent addresses?
15:22:26  and there's no 32-bit move... interesting
15:24:02  nor any signed compare or 32-bit compare, so you'll use three or four comparisons for that, fun
15:24:21  and you can't even use the bitwise instructions to help anymore, because they're so long
15:24:49  I guess you can still use subtract, then it only takes two subtractions and one compare to do a 16-bit signed comparison
15:25:53  i can always recode afteer i'm done with the documentation
15:34:17  i no longer need to rely on L and M, but I like them. I plan on making AND, OR, XOR, and NOT instructions for both 16-bit and 32-bit in the next version. I'll also take your advice into consideration.
15:37:18 -!- tromp has joined.
15:39:50  ok
15:40:11  I'd recommend AND, OR, XOR, ANDC instead
15:40:27  but the traditional AND, OR, XOR, NOT also works
15:41:02  what's andc?
15:41:25  Lykaina: AND with the right input argument complemented
15:41:30  notted
15:41:41 -!- tromp has quit (Ping timeout: 246 seconds).
15:42:05  cool
15:42:16  didn't know that one
15:42:26 -!- adu has joined.
15:43:59 -!- tromp has joined.
15:56:24  Lykaina: it would have been easy if you just kept the previous version of M (or was it L?) that takes only one extra argument and that one can only be one of 16 possibilities
15:56:46  I could just think of that as 16 instructions with a two-character opcode in the source code
15:57:28 -!- tromp has quit (Remote host closed the connection).
15:58:52  well, maybe not, because that would give too many instructions total, but you could fix that by restricting the addressing modes in all instructions in general
16:00:53  or do it the opposite way: add post-increment and pre-decrement addressing modes, allow all 100 combinations to each arithmetic and bitwise instruction :-)
16:12:40  fungot, what is your favorite flavor of ice cream, and what is your favourite flavour of ice cream?
16:12:41  b_jonas: postgresql for database.
16:12:48  not a bad favorite, yes
16:16:44  what's the end goal behind echidna?
16:18:06  to create a programmable console-based language
16:18:14  i mean...
16:18:33  a console-based language i can program in
16:19:12  fun
16:19:21  imode: I think it's for learning or something
16:21:10  "console-based language"?
16:22:18  i mean, i don't want a gui
16:28:00  b_jonas: http://sif.lesidhetree.com/sara/echidna/Echidna%20v0_11a0.pdf
16:28:16 -!- tromp has joined.
16:30:23 -!- Lord_of_Life_ has joined.
16:31:55  thanks
16:32:03  huh, now you changed the comparison conditionals?
16:32:19  i had to
16:32:38  there were bugs with the original system
16:33:41 -!- Lord_of_Life has quit (Ping timeout: 265 seconds).
16:33:48 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
16:42:19  i have one more change planned for that. I want to be able to call subs indirectly
16:44:26  i know the language looks a lot different than it used to
16:47:46  b_jonas: you were saying something about possibly having too many instructions?
16:47:58  i don't understand
16:48:33  Lykaina: I'd still recommend you to find all subroutine starts once, when loading the program, make a table of their names and addresses in source code, ideally sort it too, 
16:49:07  and make the subroutine calls just look up sub names there, rather than reading the whole source
16:49:32  i agree, just not sure how to do that
16:50:16  Lykaina: first do it without the sorting
16:50:26  still
16:50:46  even that helps because there are much fewer subs than source code characters
16:52:04  read through the source code, find all the sub heading statements, as you find them, put them in successive entries of a table that stores the name of the sub and its offset in the source code array
16:53:33  how does this benefit?
16:53:45  for a subroutine call, read through the names in that table until you find a matching name,
16:54:02  then go to the offset in the source code given in that table
16:54:39  then you're only reading through a smaller table rather than the source code which has lots of instructions that aren't sub headings
16:56:25  is it a good idea to have the name of the sub, when called, be in memory as a possible option, as in indirectly?
16:57:25 -!- tromp has quit (Remote host closed the connection).
16:57:30  oh...the table would have to be 128 KiB for that to work...
16:57:46  as opposed to 512 bytes
16:58:49 -!- tromp has joined.
16:59:05  so, what do you recommend?
17:03:50  is 256 subs too few?
17:05:00  yes, too few
17:06:26  65536?
17:11:44  gonna have to move some letters around again
17:19:45 -!- hermez has joined.
17:21:56 -!- tromp has quit (Remote host closed the connection).
17:44:05 -!- imode has quit (Remote host closed the connection).
17:58:34 -!- imode has joined.
18:04:46 -!- hermez has quit.
18:30:03 -!- tromp has joined.
18:31:03  surprised that there's very little literature on queue machines vs. stack machines.
18:31:44  imode: well there are tag systems :)
18:32:14  queues are awkward, except when used as pipes between various stages of a process.
18:32:24  hehe, yeah, but I mean actual, y'know, processors.
18:32:33  I find them pretty natural actually. it's weird.
18:33:49  imode: Oh have you found the Mill architecture? Its "belt" is a sort of queue.
18:34:19 -!- Phantom_Hoover has joined.
18:34:20  I've heard of it, isn't that the one with the rolling register file?
18:34:40  i.e a few spots down from the head of the queue are directly addressible?
18:35:27  (Disclaimer: I do not know much about that architecture; I'm not convinced it's practical; and I have no clue whether they will ever produce real hardware. I'm really rather skeptical about it.)
18:35:39  imode: I'd think the whole (finite) queue is addressable.
18:35:46  I think that was my gist as well when I saw it... also, ech.
18:36:36  The belt is a cute idea. But one cute idea doesn't make a processor. :)
18:37:35  there's some literature on using queue machines to evaluate expressions in parallel via partitioning the dependency graph between expressions. it looks like a lot of the literature around queue machines is locked up in datalow architectures.
18:37:38  The Mill has a whole bunch of cute ideas!
18:37:40  (Real CPUs probably end up doing something similar... via register renaming.)
18:37:49  yeah there are register windows and stuff.
18:37:55  you never really see that though.
18:38:39  `grWp datalow
18:38:42  No output.
18:38:55  sorry, dataflow. missed an f.
18:39:35  imode: Yeah, but that didn't stop me from wondering what a datalow could be... I mean, given the channel and all.
18:39:53  hahahahaha, good point.
18:44:33  int-e: if you're curious, https://repl.it/repls/SparklingHealthyArraylist
18:44:37  shachaf: There's a huge hole in my knowledge about modern processors when it comes to assessing the viability of that Mill architecture... namely, I don't know how much of the parallelism that superscalar CPUs discover dynamically can actually be determined statically.
18:44:58  a queue-based Forth-like.
18:45:14  int-e: Yes, I'd also like to know the answer to that question.
18:45:52  that 'pick' actually works, by the by. `5 range 3 $ pick` yields you `4 1 2 3 4 5 0`
18:46:20  you could probably eliminate `roll`, too.
18:47:10  int-e: I think they had a claimed number which was pretty high and maybe cited some paper for it?
18:47:16  But who actually knows.
18:48:37  there's a bug in `range` (and subsequently, `factorial-recursive`) that causes it to clobber the queue when generating the range and then performing the multiplications.
18:48:54  do it with a bare queue and it's fine, but do it with some work already done and it breaks. I was lazy.
18:49:24  b_jonas: sub table works
18:51:55  shachaf: I'm rather skeptical mainly because I imagine that it involves predicting the level of the memory hierarchy that data resides in. that may work for some inner loops... but oftentimes it will just not be possible.
18:52:14  indirect sub calls should work, though i haven't tested them
18:52:49  Lykaina: that's not really what I said, but sure, if you want a dense array indexed by name, you can do that, it just gets uglier to write programs because you can't give more descriptive names to the subs
18:53:02  shachaf: Maybe they (the Mill people) expect that some prefetching instructions will work for that?
18:53:24  Lykaina: have you at least made sure that it gives some sort of error if you try to call a nonexistant sub?
18:53:43  starts at the beginning
18:54:11  i'll add one
19:00:42  should i change the bitwise to just ADD, ADDC, OR, XOR?
19:02:03  Lykaina: that's what I suggest, but it's your choice really, you're the one who's going to use this language
19:04:18  int-e: I was looking for a reference but all the information is in multi-hour videos so it's hopeless.
19:17:27 -!- adu has quit (Quit: adu).
19:34:16  Yes, I think they should write a text rather than trying to make most stuff as videos instead.
19:34:51  done
19:35:14  you're gonna love the new M? command
19:36:08  oh, that's sarcasm
19:51:26  zzo38: I agree.
20:19:50  http://sif.lesidhetree.com/sara/echidna/Echidna%20v0_11a1.pdf
20:26:05  crap
20:26:21  i messed something up
20:37:32 -!- cocof has joined.
20:37:34  http://sif.lesidhetree.com/sara/echidna/Echidna%20v0_11a1a.pdf
20:38:12  someone hacked EOS 
20:38:18  and gained 110,000 usd :)
20:38:43  https://cointelegraph.com/news/hacker-spends-1k-to-win-over-110k-in-eos-betting-game-using-rex
20:39:37 -!- atslash has quit (Ping timeout: 245 seconds).
20:45:08 -!- atslash has joined.
20:47:01  http://sif.lesidhetree.com/sara/echidna/Echidna%20v0_11a1a.pdf fixed
20:49:20 -!- arseniiv has quit (Ping timeout: 246 seconds).
20:59:34 -!- xkapastel has quit (Quit: Connection closed for inactivity).
21:11:38 -!- Lymia has quit (Quit: Hugs~ <3).
21:45:09 -!- Lymia has joined.
22:09:03  hi lymia
22:20:22  it's so quiet...
22:20:31  hi
22:20:40  is life good
22:20:41  hi kmc
22:20:58  i'm depressed
22:21:17  I'm sorry
22:21:20  I'm feeling down as well
22:21:22 * kmc offers hugs
22:22:02  higan
22:22:23  hi
22:23:11  does anyone want to look at the hopefully fixed version of Echidna? i'm not in the mood to make changes right now
22:24:57  btw, what defines an esoteric language?
22:25:14  :D
22:25:17  its simple
22:25:30  esoteric is a veil
22:25:51  huh?
22:25:53  why do u need it?
22:26:20  its a bunch of symbols
22:26:37  symbolic 
22:28:51  what is a language?
22:29:25  native tongue
22:30:41  Lykaina: I'd say it's a language whose primary design goal is to be fun, interesting, weird, and/or frustrating, rather than anything "practical"
22:30:58  though I would exclude "serious" research languages even though "interesting" is arguably the goal there
22:31:18  it's a bit hard to say
22:31:22  is my Qoppa an esolang
22:31:36  'twas made as a demonstration of how tiny you can make a scheme-like language using fexprs
22:32:00  (no special forms, only 3 eval cases, only a handful of built-ins)
22:32:07  it got cited in a couple of papers
22:32:13  cool
22:32:19  and it's kind of based on someone's PhD thesis
22:33:27  Lykaina: I sometimes say that C++ (and especially C++ template metaprogramming) is an esolang because it has that same bizarre mind-twisting nature, but by accident
22:33:52  in exploit programming you frequently encounter "found esolangs" as well
22:34:01  such as alphanumeric-only x86 code
22:34:44  Echidna is just for fun and to releive boredom. I tend not to care about consistancy between pushes to the repo.
22:35:00  or programs stitched together from an arbitrary collection of ROP gadgets
22:35:19  ok, cool
22:36:09  i might use what i learn from making it to make something more usable
22:36:21  and consistant
22:36:55  ok
22:38:36  i got annoyed with only having 20 ops, so i made subops.
22:38:45  (G-Z)
22:39:28  the found esolangs are sometimes called "weird machines" in infosec
22:39:43  `? kmc
22:39:44  kmc did not run the International Devious Code Contest of 2013.
22:39:52  ^ this wisdom entry is somewhat underwhelming
22:39:53  ELF unwinding info could be considered another example
22:40:53  when people design file formats to have a certain type of flexibility
22:40:58  kmc: or https://esolangs.org/wiki/The_Subtyping_Machine as a found esolang
22:41:11  they often don't consider whether it allows nontrivial computation
22:41:17  within the format parser
22:42:29  ELF has unwinding info?
22:42:30  which is why I like to do obfuscated code in non-esoteric languages, to point out interesting features of those languages, like https://www.perlmonks.com/?node_id=1008395
22:43:10  shachaf: it has to have unwinding info so that you can throw and catch exceptions through multiple compilation units
22:45:24  Perl is pretty esoteric.
22:45:41  yeah, that's why this sort of thing is easier in perl
22:51:24  I guess this is DWARF?
22:53:10  sort of... http://wiki.dwarfstd.org/index.php?title=Exception_Handling#Relationship_with_DWARF
22:53:30  Oh, it's DWARF-like but not DWARF.
22:53:36  Golly.
22:53:48  If I don't use C++ this is irrelevant, right?
22:54:41  Might be used by other languages?
22:54:47  Who knows.
22:55:34  I think all algorithms should be named after the Unicode code point that looks most visually similar to their execution graph.
22:56:59  I think that there might not be such a code point. Sometimes there might be one in another character set, but, there might not be a suitable character in another character set either. And, sometimes two algorithm will have a similar execution graph, and then it is same name and that is no good, either. So, I think it won't work
22:58:30  shachaf: Rust uses it
22:58:33  probably other things
22:58:41  I think there's even exception support for C as a GNU extension?
22:58:46  though generally unwinding thru C code is UB
22:59:57  Oh, for panic!, I guess.
23:01:02  Seems like panic should maybe just be longjmp.
23:01:03 -!- tromp_ has joined.
23:01:24  I guess Rust is all about resource cleanups, though.
23:04:02 -!- tromp has quit (Ping timeout: 240 seconds).
23:05:29 -!- tromp_ has quit (Ping timeout: 246 seconds).
23:17:40 -!- Phantom_Hoover has quit (Quit: Leaving).
23:21:20  http://sif.lesidhetree.com/sara/echidna/Echidna%20v0_11a1a_1.pdf very minor formatting change
23:23:54 -!- FreeFull has quit.
23:27:49 -!- b_jonas has quit (Remote host closed the connection).
23:37:47  http://sif.lesidhetree.com/sara/echidna/Echidna%20v0_11a1a_2.pdf a different change
23:38:49  i hope that one's correct
23:39:28  there was a typo in the previous one
23:41:23  shachaf: yes, a thread is supposed to be able to clean up as it panics
23:42:33  longlongjmp
23:43:18  another typo
23:43:21  fixed
23:43:56  i just overwrote the pdf with the new one
23:45:03 -!- xkapastel has joined.
23:48:53  fixed the source typo

2019-09-16:

00:09:41  I bet it's still less complicated than the situation in Windows with SEH.
00:10:03  Though to be fair SEH is more like a replacement for signal handlers, which are definitely a bunch of complexity.
00:22:23 -!- oerjan has joined.
00:34:04 -!- tromp has joined.
00:38:59 -!- tromp has quit (Ping timeout: 276 seconds).
01:21:20  If I rewrite TeXnicard (or maybe, can use a different name; I don't know), I might use a SQLite database as the card set file. Now that SQLite has window functions, maybe the ROW_NUMBER function can be used for assigning collector numbers. I also should make it workable with both RGB and CMYK. Separation colours might also be good to have, but that might be more difficult.
01:21:56  Probably I would avoid to implement hyphenation, but the TFM font metrics, PK font glyphs, and the line breaking like that of TeX, would be implemented.
01:22:37  [[Echidna]]  https://esolangs.org/w/index.php?diff=66183&oldid=66075 * YamTokTpaFa * (+21) formatting, +WIP
01:23:10 -!- atslash has quit (Quit: Leaving).
01:24:11 -!- JimScope has joined.
01:25:20  [[Template:WIP]]  https://esolangs.org/w/index.php?diff=66184&oldid=51711 * YamTokTpaFa * (+83) 
01:27:17  [[Category:Works-in-Progress]]  https://esolangs.org/w/index.php?diff=66185&oldid=64246 * YamTokTpaFa * (+100) 
01:29:13 -!- JimScope has quit (Ping timeout: 265 seconds).
01:29:54  [[User talk:Erinius]] N https://esolangs.org/w/index.php?oldid=66186 * YamTokTpaFa * (+232) /* Prompting to complete Screwtape */ new section
01:31:12  who's YamTokTpaFa?
01:34:03  One user in esolang wiki, I think; seem to be an alternative account for YamTokWae but they lost the password for that account, as far as I can tell.
01:34:27  like me and lesidhetree, sorta?
01:36:08  I don't know.
01:36:47  well, in my case, i forgot i had the lesidhetree account.
01:37:19  [[Higgledy Piggledy Processor]]  https://esolangs.org/w/index.php?diff=66187&oldid=44416 * YamTokTpaFa * (+25) 
01:37:28  OK
01:41:25  [[Blacktime]]  https://esolangs.org/w/index.php?diff=66188&oldid=40276 * YamTokTpaFa * (+42) 
01:42:33  [[Logical/Interpreter]]  https://esolangs.org/w/index.php?diff=66189&oldid=65402 * YamTokTpaFa * (+4) linking
01:45:31  [[Malbolge20]]  https://esolangs.org/w/index.php?diff=66190&oldid=51693 * YamTokTpaFa * (+24) 
01:51:37  [[Treeng]]  https://esolangs.org/w/index.php?diff=66191&oldid=45439 * YamTokTpaFa * (+30) 
02:02:13  [[NICE]]  https://esolangs.org/w/index.php?diff=66192&oldid=30326 * YamTokTpaFa * (+146) 
02:05:37 -!- tromp has joined.
02:05:59  http://sif.lesidhetree.com/sara/echidna/Echidna%20v0_11a1b.pdf
02:09:56 -!- tromp has quit (Ping timeout: 246 seconds).
02:15:03  can someone look at the pdf and see if it has enough ops?
02:16:31  I think there is a mistake in the description of the "Ln" command
02:17:46  crap
02:18:17 -!- xkapastel has quit (Quit: Connection closed for inactivity).
02:19:23  yeah, that wassupposed to be "NOT"
02:22:58  fixed the pdf and the source
02:24:18  do you like the language?
02:24:33  I don't know
02:24:56  there are five samples at the bottom
02:25:52  https://github.com/lykaina/echidna
02:26:06  Yes, I saw the examples
02:26:26  if, for some reason, you want to try it out
02:29:23  if you are interested, let me know
02:30:42  it's key that no cmd name can contain numbers or the letters a-f
02:30:59  limits of implentation
02:31:09  Yes, that is what I thought
02:32:25  so Lg instead of La, Oq instead of Oe...
02:40:28  Oh, and if you named the compiled file "Echdebug" (you may have to put it in your path) you get a lot of debug info on stderr.
02:40:50  i mean "echdebug"
03:38:04  fixed the problems in range generation.
03:38:13  wonder if I can do this recursively.
03:45:16  yeeeeeah boi.
03:48:49 -!- ArthurStrong has joined.
03:54:13  https://repl.it/repls/AptNoisyEnvironments
04:11:07 -!- cocof has quit (Ping timeout: 260 seconds).
04:32:25 -!- Lord_of_Life has quit (Ping timeout: 258 seconds).
04:37:40 -!- Lord_of_Life has joined.
05:37:07 -!- oerjan has quit (Quit: Nite).
06:15:10 -!- tromp has joined.
06:21:27  `5 w
06:21:30  1/1:nano//nano is vi's sister. \ the five wisdoms//The first of the five wisdoms is that there is only one wisdom. \ kulør//Kulør er rett stavemåte. \ structsubural type//Something Bike is into. Not to be confused with suburban destruction. \ almond bread//Almond bread is a delicacy made from fractal dough.
06:42:15  ski: Did you see http://slbkbs.org/tmp/2019-08-21-test-cases.txt ? I can't remember.
06:42:25  I think it's like a special kind of delimited continuations.
07:36:20  i didn't
07:36:23  what's ⌜{ E; { ⋯ } }⌝ ?
07:38:04  It's in terms of some base semicolon behavior, I guess.
07:38:18  The point is that blocks nest right-associatively.
07:38:55  (Like in C++ when you write { A a; B b; ... }, B's constructor and destructor run inside a scope.)
07:47:05  mhm
07:50:56  oh, ⌜@⌝ and ⌜defer⌝ uses syntactical dynamic scoping (like ⌜return⌝,⌜break⌝,⌜continue⌝ in C, ⌜!⌝ in Prolog,&c.) ?
07:51:20  They refer to the current block.
07:51:40  The goal of @ is to convert a dynamically scoped thing to a lexically scoped thing.
07:52:08  So f() { return := @`; ... { return(5); } ... } would exit from the outer scope.
07:52:20  can you abstract out ⌜@⌝ into another operation, and call that, and get the same effect ?
07:52:43  perhaps you can't construct/define such an operation, without using the ⌜{ ⋯ }⌝ brackets ..
07:53:52  I'm not entirely sure about @. The origin of the name is that I had a syntax to name blocks earlier (similar to goto labels).
07:54:13  { @foo; ...exitfrom foo... } would exit from the block labeled foo, and so on.
07:59:17  ,
08:00:59 -!- arseniiv has joined.
08:01:19  i'm also wondering whether this ⌜`⌝ (which would also, maybe, not be abstractable ?) behaves more like ⌜shift⌝ or more like ⌜control⌝ (or neither)
08:02:01   is something you were fiddling with ? someone else ?
08:02:04  I should figure out the difference between "shift" and "forall".
08:02:21  hm, now i also see there was a
08:02:23  s/forall/control/ -- mixed up channels
08:02:26    2019-08-24  b_jonas: hello ski :) ( actually i don't think you could like rephrase it? do you normally see?
08:02:26  ski: how so? it's not improved at all: how often is it really necessary to shorten a 4-letter word to 3 letters?
08:02:31  that i forgot about
08:02:52  fungot is a bot that generates text by randomly
08:02:52  shachaf: psox wtf? haha where can i find gambit scheme to be
08:03:02  (scrollback doesn't go that far back)
08:03:14  Yes, that file was me trying to write up the operators I was trying to figure out.
08:03:40  yea. but was that message triggered by something related to something i said ? or just a random thing ?
08:03:51  ah, ok
08:03:59  I think it's trained on IRC logs.
08:04:01  ^style irc
08:04:01  Selected style: irc (IRC logs of freenode/#esoteric, freenode/#scheme and ircnet/#douglasadams)
08:04:40  I should add an additional fact, before I read your links, that the context I was trying to figure this out in was a low-level language where all of these things get resolved to control flow known at compiletime, with no indirect jumps or anything like that.
08:05:01  Which makes them maybe more macro-like than delimited-continuation-like, though probably both.
08:08:27  i think the ⌜{ ⋯(E)`⋯; ⋯ }  ⟿  (E)(λx ↦ { ⋯x⋯; ⋯ }⌝ rule suggests it's not like ⌜shift⌝, anyway; since in that case there'd been an extra ⌜reset⌝/⌜prompt⌝ wrapping the whole thing, in the output
08:09:12 * ski tries to recall how ⌜control⌝ differed, exactly
08:11:47  ( ? what's that ?)
08:13:49  I don't know.
08:21:03  (my links above are just about (selective) dynamic scoping at the syntax level. being able to introduce a construct which is only valid, lexically/syntactically, inside the scope of another construct. well, in general, one could also allow a macro (or a TH splice) to expand to such a construct, inside the scoping construct)
08:21:27  (i think there may've been some nice blag about it, too, but i can't find it atm)
08:23:31 * ski . o O (  )
08:43:07  [[Toi]]  https://esolangs.org/w/index.php?diff=66193&oldid=17413 * Kritixilithos * (-26) /* Useful algorithms */ Removed redundant code in addition
08:57:32  ski: Hmm, this syntax parameter thing is interesting.
08:59:10  yes
08:59:33  It's related to the other question which is kind of implicit in this thing that I've discussed before, about compiletime values.
08:59:52  (the "parameter" part is just one way to render the dynamic scope thing. which is more or less what "implicit parameters" do, too)
09:00:13 -!- wob_jonas has joined.
09:01:27  do you ever wonder about all the connections that are always joined to #esoteric but never speak, and, in particular, which one is read by your boss?
09:01:35  I want a semi-first-class (first-class at compiletime) object called a "block", which is somewhere between an AST and an inline function.
09:02:05  I mean, it's not like it's hard to figure out that I'm often on this channel
09:02:29  hi, boss. yes, I'm totally working
09:04:15  shachaf : elaborate on what "somewhere between an AST and an inline function" means ? (in particular what does "an AST" mean, and what does "an inline function" mean, in this context ?)
09:04:56  I mean: Macros operate on AST nodes. They're entirely syntactic things, with random name shadowing and everything. An inline function has the same semantics as a regular function, and is just compiled differently.
09:05:48  I want a thing which is like a function -- can be called with parameters, has its own scope without accidental shadowing -- but is guaranteed to be inlined at compiletime, and as such can do things that a regular function can't.
09:06:07  For example, it can do early exit from a block (without something extremely dynamic like setjmp or continuations or exceptions).
09:06:25  A hygienic macro is probably kind of close to this.
09:06:41  (By AST I meant AST node.)
09:07:07  It's also perhaps possible for you to take this semi-function thing and explicitly do some operation on it, like evaluate it with a different scope, or check what free variables it has, at compiletime.
09:07:22  [[]]  https://esolangs.org/w/index.php?diff=66194&oldid=62879 * YamTokTpaFa * (-23) Undo revision 62879 by [[Special:Contributions/A|A]] ([[User talk:A|talk]]) I don't think it a language description page, seeing the history summary.
09:11:28 -!- cpressey has joined.
09:12:30  [[Bytemap]]  https://esolangs.org/w/index.php?diff=66195&oldid=33278 * YamTokTpaFa * (-40) +WIP
09:13:53  [[Mbius]]  https://esolangs.org/w/index.php?diff=66196&oldid=45359 * YamTokTpaFa * (+51) 
09:19:47  "with random name shadowing and everything" -- depends on whether you're talking about (at least, by default) hygienic macros, or not
09:20:06  Yes.
09:20:40  Even with hygienic macros, I think inserting an AST node hygienically is a kind of different thing. But it's possible it isn't.
09:21:15  different thing, from what ?
09:21:48  From this "in-between" thing I'm trying to figure out.
09:22:35  hm, from your description, it sounds like you want hygienic macros, possibly ?
09:23:02 * ski . o O ( "Compiling without Continuations" by Luke Maurer,Paul Downen,Simon Peyton Jones in 2017 at  )
09:24:32  names in the definiens of a hygienic macro definition refer to what those names lexically mean at the definition site (even if those names aren't exported, but the macro is)
09:25:16  (well, of course, if the name is a parameter of the macro, it'll be expanded with the AST you pass in as parameter, when calling it)
09:26:28  Let me see if I can think of examples of why this feels different.
09:26:38  however, with something like syntax parameters, you can still have a (by-default) hygienic macro invokation expand to something involving a `return' or `break loop_lab' or similar)
09:27:02  Ignoring the whole ` thing above, say you want to define something like a loop.
09:27:50  Maybe a for-in loop is used like "for(xs, {\x; ... })"
09:28:44  Here "for" is a lot like a regular function, and {\x; ... } is a lot like a lambda. The difference is that it all must be expanded at compiletime.
09:28:56  yes
09:29:18  for can't be "nonstrict" in xs, because it takes its arguments just like a regular strict function does.
09:29:28  in Scheme, it could be `(for (x xs) ...)'
09:29:50  Sure, but that's special syntax, right? The idea is that there's no special syntax here.
09:30:07  You could also write something like: { body := {\x; ... }; for(xs, body); }
09:30:51  depends on what you mean by "special syntax", i suppose
09:31:06  you could certainly define such a `for' macro, yourself
09:31:41  I mean that the "(x xs)" is "parsed" by the macro.
09:32:03  (Of course it's still an S-expression, but the meaning of the S-expression is determined entirely by the macro.)
09:33:20    (define-syntax-rule for ()
09:33:26      (for (?id ?expr) ?body ...)
09:33:31      (foo* ?expr (slambda (?id) ?body ...)))
09:33:59  (where `slambda' is an imagined macro abstraction thing)
09:34:18  Sure. I'd call that syntax.
09:34:23    (let-syntax ((?body (slambda (x) blah)))
09:34:24      (foo* xs ?body))
09:34:45  It's effectively doing parsing. Not from characters to AST, but from S-expressions to something meaningful.
09:34:56  Pretty different from e.g. "forM_ xs (\x -> ...)"
09:35:20  yes, this is macro-expansion-time, not run-time
09:35:35   I mean that the "(x xs)" is "parsed" by the macro.
09:35:36  yes
09:35:51  (pattern-matching)
09:37:21  shachaf: Stupid question maybe: what's to stop "for" actually being (instead of just "a lot like") a function, and {\x...} from actually being a lambda, and this being a compile-time optimization akin to constant folding?
09:37:23  Sure, but I want a thing that happens at compiletime, but doesn't do parsing.
09:37:57  I mean, if you can identify how it is different from that, something might become more obvious
09:38:03  The name of the optimization is inlining in this case. It's a very common one. :-)
09:38:28  Hence "inline function".
09:38:33  One thing is that it might be permitted to do things that regular functions can't.
09:39:23  For example, maybe "..." contains a "return" statement. If you did that with general functions, you'd need something complicated like continuations or exceptions.
09:39:39  Whereas with this "guaranteed-to-be-inlined" thing, implementing it is very simple.
09:40:19  You might also have other compiletime-only value. For example, maybe early-exit labels are a first-class thing that you can pass as an argument to these "always-inlined functions". You don't want to pass those as an argument to real functions.
09:40:49  Maybe you can evaluate a block but with a different scope. For example, "import(module, { ... })"
09:43:06  [[Symbolic Python]]  https://esolangs.org/w/index.php?diff=66197&oldid=61331 * YamTokTpaFa * (+31) 
09:44:14  "but doesn't do parsing" -- including parsing in the above macro pattern-matching sense ?
09:44:44  [[Symbolic Python]]  https://esolangs.org/w/index.php?diff=66198&oldid=66197 * YamTokTpaFa * (-1) /* Example Implementation */
09:44:47  (is taking multiple parameters to a macro (or whatever you want to think of this thing as) "pattern-matching" ?)
09:45:33  (also, if you want to guarantee it's happening at compile-time, then it's not an optimization anymore)
09:45:46  OK, idk. There are language semantics, and then there are compiler optimizations. I find tackling one or the other is easier than tackling both at once.
09:46:18  (and what you were saying there is, also, i think, why i was reminded of "Compiling without Continuations")
09:47:05  It's not a compiler optimization for the reason ski said.
09:47:26  ski: The reason I'm calling it "parsing" is that (x xs) isn't a meaningful expression by itself, but only in the context of being the first "argument" to the macro.
09:48:01  yes
09:48:16  Also x is an identifier, which makes "for" a binder on top of everything else. If it was more function-like, something like for(xs, x, { ... }) would be an error because x is unbound.
09:48:20  however, perhaps it can be a meaningful phrase, on its own ?
09:48:22  Anything you can do at compiletime, you can also do at runtime, so, ok, if you don't want to use the word "optimization", that's cool.
09:48:36  (assuming we know which "syntactic type" to assign to it)
09:48:38  cpressey: That seems like a bad approach to language design?
09:48:52  You can do type checking at runtime but I want to do it at compiletime.
09:49:02  shachaf: I said "can", not "should"
09:49:19  The other reason I don't want to call it an optimization is that it's mandatory.
09:49:50  If a language specification requires tail-recursive functions to use constant space, that's not an optimization.
09:50:14  (I think tail call optimization isn't a good optimization, either. It should either be required or not happen at all.)
09:50:29  Find, pretend I said "technique" instead of "optimizaion"
09:50:34  OK, sure.
09:50:46  My point is, the semantics of a language doesn't usually prescribe this
09:50:54  The other thing is that I want something simple, and supporting these things at runtime is many times more complicated than supporting them at compiletime.
09:50:59  The program has the same meaning whether you expand these things early or later
09:51:13  This is in theory for a low-level language that doesn't even have closures.
09:51:15 -!- wob_jonas has quit (Remote host closed the connection).
09:51:32  Maybe it'll have closures later. But it certainly won't have arbitrary continuations.
09:51:36  [[Triangular]]  https://esolangs.org/w/index.php?diff=66199&oldid=53953 * YamTokTpaFa * (+24) 
09:54:11  (Scheme prescribes "proper tail recursion" (which is a bit of a misnomer, because it doesn't have anything, per se, to do with recursion). may be implemented with TCO, may be implemented in other ways. the spec only cares about the asymptotic space complexity property of the operational semantics, allowing an unbounded number of active tail calls, in bounded space)
09:54:48  That seems fine.
09:55:12  I've said before that I think optimizations that change asymptotic behavior are probably a bad idea.
09:55:26  cpressey : well, but "One thing is that it might be permitted to do things that regular functions can't.","For example, maybe \"...\" contains a \"return\" statement. If you did that with general functions, you'd need something complicated like continuations or exceptions."
09:56:04 -!- ais523_ has joined.
09:57:13 -!- ais523_ has quit (Changing host).
09:57:13 -!- ais523_ has joined.
09:57:13 -!- ais523_ has quit (Changing host).
09:57:13 -!- ais523_ has joined.
09:57:36  hmm, it was a pain to get KiwiIRC working, but I'm here now
09:58:00  Hi, ais523_
09:58:11  Are you a Kiwi now?
09:58:17  I don't think so?
10:00:10  fwiw, I'm not really convinced I understand The Subtyping Machine
10:00:20  found esolangs are elegant in a way, but less elegant in other ways
10:01:51  ais523_ : cloaks don't work with Kiwi ?
10:02:10  apparently not
10:03:27  hm, is this the Kiwi thing on the Freenode page, or running from elsewhere ?
10:04:11  elsewhere, I can't get the one on the Freenode page to work
10:05:16  [[User talk:Ais523]]  https://esolangs.org/w/index.php?diff=66200&oldid=66179 * Ais523 non-admin * (+379) /* Any features to insert mathematical formulas like TeX style? */ reply
10:06:34 -!- lob_jonas has joined.
10:06:37  did I hear KiwiIRC?
10:07:03  you weren't in channel at the time, but maybe?
10:07:14  you seem to be using it too
10:07:26  (what does the "l" mean?)
10:07:38  new zeaLand
10:08:02  ski: kiwi irc is a different web irc client. freenode runs a thing called qwebirc at http://webchat.freenode.net/ , whereas kiwiirc is a client at https://kiwiirc.com/client/irc.freenode.net that lets you connect to any irc network if you know the hostname of the server
10:08:52  no, webchat.freenode.net is a kiwiirc instance nowadays
10:08:58  but I couldn't get it to work
10:09:03  that's why ais523_ disappeared for ages
10:09:59  the "l" was originally trying to make the esolangs.org formatter color the nick the same sort of green as it uses for "b_jonas", but apparently it's not working that way now. either I messed up something, or the coloring hash changed. hmm.
10:10:20  wait really?
10:10:26  wow
10:10:40  [[Policy Policy]] N https://esolangs.org/w/index.php?oldid=66201 * A * (+229) Created page with "[[Policy Policy]] is an [[esoteric programming language]] inspired by [[Baba Is You]] that allows modifying the rules. This is a set of rules for defining rules. Category:La..."
10:10:43  Freenode used to run qwebirc, yes, but they switched to Kiwi, recently
10:12:36  
10:13:57  ("it supports ... usage of emoji" is a minus, of course)
10:14:23  "Along with this change, we will no longer apply gateway cloaks to users of our webchat, treating them the same as any other client. While channel operators will still be able to recognize them via the realname field, we strongly suggest that you carefully consider the impact on legitimate users and hope that you decide not to ban webchat users as a whole."
10:15:07  seems to indicate to me that cloaks should now work, just as if you connected with a non webchat client (unlike before)
10:15:17  ski: does it support usage of emoji in the same way as mibbit does, so that when I mention std::default::Default, you see the colon-D replaced by a smiley?
10:15:30  or does it support usage of emoji like twitter?
10:15:42  "does it support usage of emoji in the same way as mibbit does .." : i hope not
10:15:52  or maybe just "support usage of emoji" in a sane way, where it just passes emoji through unmodified when you enter them into the input bar?
10:15:59  this computer is running Windows, so I have no easy ability to type a smiley face or whatever
10:16:15  however kiwiirc has an onscreen keyboard with an :]  on it
10:16:21  (when i tried Discord a little, turning off all emoji stuff was the first thing i did)
10:16:23  does that render correctly for people using a different client?
10:16:32  ais523: which version of windows? the one that brings up an emoji popup if you press win+dot?
10:16:36  ais523_: it renders as colon close square bracket for me
10:16:52  ugh, why not just send the Unicode? :-(
10:17:11  and where if you press win+dot then colon then parenthesis then it searches for smiling emoji characters from some database/
10:17:17  hmm, looks like it is just replacing sequences of ASCII characters (that was a manually typed emoticon, not an emoji)
10:17:31  > (:) 1 []
10:17:34   [1]
10:17:43  ais523: I think you can turn that off in the settings menu of kiwiirc
10:17:43  > (:[]) 1
10:17:45   [1]
10:17:56  oh, I initially misinterpreted int-e's Haskell as an attempt to emoji
10:18:15  ais523_: There's no misinterpretation
10:18:19  [[Policy Policy]]  https://esolangs.org/w/index.php?diff=66202&oldid=66201 * A * (+471) 
10:18:23  @quote eat.a.comment
10:18:23  SamB_XP says: I once saw it eat a comment (:[{- Help! -}])
10:18:24  well, it rendered literally for me
10:18:32  ais523_: I was wondering what that feature would do to more or less ordinary code
10:18:45  it seems to have a decent protection against false positives
10:18:57  > (🐱)
10:19:00  although it'd probably struggle with emoticon-based esolangs (there's at least one of those, possibly more?)
10:19:10  shachaf: OK, that one did render as an emoji
10:19:25  > (1 :) [] -- more delibrarate attempt
10:19:25  and there's no way to see what the underlying ASCII characters were
10:19:27  @slap lambdabot
10:19:27   [1]
10:19:27 * lambdabot decomposes lambdabot into several parts using the Banach-Tarski theorem and reassembles them to get two copies of lambdabot!
10:19:41  > (�)
10:19:44   error: Variable not in scope: �
10:19:44  There were no underlying ASCII characters.
10:20:03  ais523_: try the settings icon on the top left, then unset "Show emoticons"
10:20:03  oh, I was wondering why lambdabot didn't evaluate it :-D
10:20:07  The underlying character was U+1F431 CAT FACE
10:20:21  @unidecode 🐱
10:20:21  Unknown command, try @list
10:20:25  `unidecode 🐱
10:20:28  ​[U+1F431 CAT FACE]
10:20:45  I can't believe a Weebl's Stuff character got into Unicode
10:20:51  oh, I didn't realise there were /two/ settings menus
10:20:53  Unfortunately the version of mosh-server I'm using doesn't display this correctly.
10:20:56  > let 🐱 = 9 in 🐱
10:20:58   :1:5: error: parse error on input ‘🐱’
10:21:01  (there is also a settings menu in the top right, with the same icon)
10:21:04  It's annoying because everything except mosh works fine.
10:21:15  int-e: I think emoji are operators for some reason
10:21:19  > let (🐱) = 9 in (🐱)
10:21:20  when you find the settings menu you don't normally look for another one
10:21:21   9
10:21:23  [ 'a '{~?80$2 NB. I think they even fixed the html style so it doesn't collapse multiple spaces in messages
10:21:24  lob_jonas:  aaa aa a   a   aa a aa aaaaa   aa aaa   a aaaaa  aa   aa a aaaa  aa  a a  a  aa
10:21:31  Taneb: apparently so
10:21:43  int-e: I assume because they're not alphanumeric?
10:21:48  ais523_: yeah, I'm not saying it's a particularly good client
10:21:51  So, what's everyone's favourite emojo
10:21:55  `quote alphanumeric
10:21:56  1132)  A Swede who was in #esoteric / Thought his rhymes were a little generic. / "I might use, in my prose, / ꙮs, / But my poetry's alphanumeric."
10:22:01  I'm just saying it's still better than mibbit or the old qwebirc
10:22:08  Is ꙮ an emojo?
10:22:12  > generalCategory '🐱'
10:22:13   OtherSymbol
10:22:21  Taneb: "emoji" is also the singular (it has a Japanese root, and Japanese doesn't inflect plurals)
10:22:47  ais523_: yes but I like to facetiously decline words such as that as if they were Italian
10:22:47  ꙮ.ꙮ
10:23:00  Because one susho is never enough, you know?
10:23:18  > generalCategory 'ꙮ'
10:23:20   OtherLetter
10:23:25  I appreciated Taneb's usage and I might pick it up now.
10:23:36  > let ꙮ = 3 in ꙮ
10:23:38   3
10:23:45  shachaf: we can conclude that ꙮ is not an emoji
10:23:47  Though maybe I should go back to the older hyphenated form, e-moji
10:23:57  Presumably the printed version is just called "moji".
10:24:15  shachaf: I think it's cognate to "mojo"
10:24:21  Taneb: In fact it's alphanumeric, the above limerick notwithstanding.
10:24:34  `quote SNOWMAN
10:24:34  1256)  MAHJONG TILE AUTUMN / HIRAGANA LETTER YA / SNOWMAN WITHOUT SNOW
10:24:42  OK, it's time for more Unicode poetry.
10:25:04  Any double dactyl code points?
10:26:45  I bet you can write a nice poem with rhyme, metre, and meaning where every line is the name of a Unicode code point.
10:27:11  But automated search is difficult because code point names aren't English words.
10:27:34 * ski . o O (  )
10:27:42  well, false negatives aren't a huge issue, and false positives can easily be excluded by hand if they end up in the finished poem
10:27:47  so an inaccurate syllable counter might be good enough
10:28:13  https://github.com/fis/esolangs/blob/master/esologs/format.cc#L406 this was where it was done
10:28:23  `unidecode '😚'
10:28:25  ​[U+0027 APOSTROPHE] [U+1F61A KISSING FACE WITH CLOSED EYES] [U+0027 APOSTROPHE]
10:28:43  I once downloaded an English pronunciation dictionary and used it to search for rhymes fitting a particular metre.
10:29:11  Actually it wasn't rhymes that time, it was just the metre.
10:29:39  shachaf: you can fit 😚 to a double dactyl meter., I think
10:29:45  I was trying dactylic hexameter, and I wanted words that cross foot boundaries in particular ways.
10:30:05 * ski . o O ( Emojo bag )
10:30:11  KISSing face WITH closed eyes?
10:30:19  That sounds kind of unnatural.
10:30:54  Ah, I was subconsciously forcing myself to say it that way
10:31:08  If I relax I say "kissing FACE with closed EYES"
10:31:30  shachaf: I recommend http://wyrdplay.org/AlanBeale/CAAPR-ref.html by Alan Beale, the maintainer of 12-dict, over worse pronunciation dictionaries like http://www.speech.cs.cmu.edu/cgi-bin/cmudict
10:31:37  `unicode ⚯
10:31:39  U+26AF UNMARRIED PARTNERSHIP SYMBOL \ UTF-8: e2 9a af  UTF-16BE: 26af  Decimal: ⚯ \ ⚯ \ Category: So (Symbol, Other) \ Bidi: ON (Other Neutrals)
10:31:51  Hmm, no, even ignoring SYMBOL it doesn't work either.
10:32:05  lob_jonas: Oh, I was using cmudict.
10:32:29  shachaf: I didn't know about CAAPR until earlier this year either
10:32:30  I also used cmudict for http://slbkbs.org/major/
10:32:31  but it seems really well done
10:32:56  Which lets you search for https://en.wikipedia.org/wiki/Mnemonic_major_system words.
10:33:09  on the minus side, you're screwed anyway if you're trying to work with unicode character names, since they have a lot of words that aren't common english words
10:33:48  like, they name every hangul syllable and all, and you won't get the pronunciation of those from an english pronunciation dictionary
10:34:04  are there any Unicode character names that contain "words" that aren't actually a word in *any* language?
10:34:34  ais523: yes, there's at least one obviously typoed english word
10:35:01  Higgledy-piggledy / Down-pointing Triangle
10:35:27  The Arabic ligatures in Unicode are kind of ridiculous. I was looking at them the other day.
10:35:31  OK, I agree that "down-pointing triangle" is a double dactyl
10:35:35  `unicode down-pointing triangle
10:35:37  U+23F7 BLACK MEDIUM DOWN-POINTING TRIANGLE \ UTF-8: e2 8f b7  UTF-16BE: 23f7  Decimal: ⏷ \ ⏷ \ Category: So (Symbol, Other) \ Bidi: ON (Other Neutrals) \  \ U+25BC BLACK DOWN-POINTING TRIANGLE \ UTF-8: e2 96 bc  UTF-16BE: 25bc  Decimal: ▼ \ ▼ \ Category: So (Symbol, Other) \ Bidi: ON (Other Neutrals) \  \ U+25BD WHITE DOWN-POINTING TRIANGLE \ UTF-8: e2 96 bd  UTF-16BE: 25bd  Decimal: ▽ \ ▽ \ Category: So (Symbol, Other) \ Bidi: ON (
10:35:42  Unfortunately it's not a code point.
10:35:49  oh, but apparently it isn't a code point
10:36:04  "down pointing" is more of an antibacchius
10:36:33  I think there's some liberty if a reader would naturally read it as a dactyl if they're in the groove.
10:37:25  `unidecode ⊎
10:37:26  ​[U+228E MULTISET UNION]
10:37:33  Higgledy piggledy / Multiset Union
10:37:53  I used ⊎ a lot in my thesis
10:37:54  Isn't multiset an anapest?
10:38:15  see http://www.unicode.org/notes/tn27/tn27-4.html , especially near "BRAKCET"
10:38:21  but mostly think of it as "disjoint union" (which doesn't scan), or even "\uplus"
10:38:55  I think "multiset" sounds a little unnatural as an anapest, but the stress is first and third
10:38:57  ais523: really? I thought people used u-with-plus-inside to mean a multiset union
10:39:05  oh
10:39:08  Aha!
10:39:11  except in American English where it's second
10:39:19  `unidecode ⏘
10:39:19  ​[U+23D8 METRICAL TETRASEME]
10:39:27  Higgledy piggledy / Metrical tetraseme
10:39:46  (the last vowel in "multi" has an entirely different pronunciation in American English and British English, I expect that extends to "multiset")
10:40:10  also, isn't "metrical" stressed second?
10:40:23  metRIcal?
10:40:26  I've never heard that.
10:40:29  if I try to pronounce it stressed first, the third syllable more or less completely disappears
10:40:33  even a schwa is too long
10:40:43  ais523_: I definitely pronounce it stressed first
10:40:50  METric'l
10:40:56  I admit it sounds more like "metricle" but it's still three syllables in my mouth.
10:41:26  "MET-tric-" and then about the softest possible "l" is what it ends up like for me
10:41:28  and that just sounds weird
10:41:35  If only ⏔ worked.
10:42:07  Also when I say "in my mouth" I mean in my mental model of my mouth, because I didn't actually pronounce it.
10:42:16  "met-RIC-əl" is a lot more natural
10:42:29  `unicode ⏝
10:42:30  U+23DD BOTTOM PARENTHESIS \ UTF-8: e2 8f 9d  UTF-16BE: 23dd  Decimal: ⏝ \ ⏝ \ Category: Sm (Symbol, Math) \ Bidi: ON (Other Neutrals)
10:42:38  `unidecode ⏔
10:42:39  ​[U+23D4 METRICAL LONG OVER TWO SHORTS]
10:43:27  ais523_: I find stressed second very unnatural
10:43:42  hmm, maybe it's an accent difference
10:43:48  I agreeneb.
10:43:49  I don't stress second that much, just more than first
10:43:55  And I never met treacle I didn't like.
10:44:12  it's definitely less of a stress than "treacle"
10:44:22  (I don't think I've ever met treacle, though. I only vaguely know it as a candyish or sugary thing.)
10:44:35  shachaf: I think treacle is the same thing as molasses, if that helps
10:44:40  That said, I've not had either
10:44:53  oh no. #esoteric is trying to make English poetry. we're doomed.
10:45:07  I think I once ate a cake for which treacle was an ingredient? not sure though
10:45:13  It helps a bit.
10:45:19  I hear molasses is pretty dangerous.
10:45:58  "Bottom parenthesis" is surely a double dactyl, though.
10:46:14 * ski . o O ( "Trapped in treaps of treacle." -- some paper, i forgot which )
10:46:22  which fungot style writes poetry?
10:46:22  lob_jonas: if one day somebody visits a store, and any patches you send will be dropped
10:46:25  ^styles
10:46:26  the word break is in the wrong place, but otherewise yes
10:46:27  shachaf: that's a triple iamb, for me?
10:46:35  No, I'm wrong
10:46:50  BOTtom parENtheSIS for me
10:47:08  BOTtom paRENthebro
10:47:17  that's the same way that other people are pronouncing it, except you stressed "SIS"
10:47:20  and it's really not that stressed
10:47:29  `icode ⨹
10:47:30  ​[U+2A39 PLUS SIGN IN TRIANGLE]
10:47:37  It's as stressed as the EN for me
10:47:47  maybe more than "the", but secondary stress doesn't normally factor into this sort of poetry discussion
10:48:12  Apparently the original motivation of Arabic ligatures wasn't actually to be used in Arabic.
10:48:18  It was to be used in Urdu?
10:48:27  I think ⨹ is cheating slightly because the first meter unit is made out of three different words, and it's hard to leave two whole words unstressed like that
10:49:24  Plus sign is a spondee for me?
10:49:53  `icode ⸒
10:49:54  ​[U+2E12 HYPODIASTOLE]
10:49:59  That one is even one word.
10:50:20  Maybe this explains why I wasn't very good at the poetry sections in my Latin A-level
10:50:39  I'm going to unirc for a bit
10:51:18  `unicode ⸻
10:51:20  U+2E3B THREE-EM DASH \ UTF-8: e2 b8 bb  UTF-16BE: 2e3b  Decimal: ⸻ \ ⸻ \ Category: Pd (Punctuation, Dash) \ Bidi: ON (Other Neutrals)
10:51:23  This is ridiculous.
10:51:23  OK, after thinking about it a bit more, ⊎ is fundamentally a multiset union operation
10:51:33  THREE-EM dash?
10:51:40  hmm, how wide is U+2E3B in the typical monospace character set?
10:51:47  That's so many ems. I can't believe I was limiting myself to single em-dashes.
10:51:56  My terminal displays it triple-width.
10:52:14  ⸻
10:52:15  xxx
10:52:18  Hmm, no.
10:52:21  ⸻
10:52:22  xxxx
10:52:23  I was working on a wcwidth implementation based on the official Unicode documentation, but that doesn't leave any situation in which a single character can be drawn wider than fullwidth (= wcwidth 2)
10:52:29  Quadruple-width.
10:52:36  ⸻
10:52:37  mmm
10:52:48  hmm, it renders wider than three "m"s for me
10:52:48  ...I suppose m is more appropriate there.
10:52:51  check oren's font maybe
10:52:54  `? font
10:52:55  ​#esoteric bitmap fonts include: \oren\'s font http://www.orenwatson.be/fontdemo.htm , lifthrasiir's font https://github.com/lifthrasiir/unison/ , b_jonas's font http://www.math.bme.hu/~ambrus/pu/fecupboard20-c.pcf.gz , fizzie's font https://github.com/fis/rfk86/tree/master/web/font , FireFly's fonts http://xen.firefly.nu/up/fonts/
10:53:05  ⸺
10:53:06  mm
10:53:09  it's single-width in oren's font
10:53:09  ⸺
10:53:10  mmm
10:55:14  By the way: If you're talking about English, is there any use to names like "dactyl", "iamb", "spondee", etc.?
10:55:31  They seem like words that are bad for communicating.
10:55:40  Instead of "iamb", I'll write xX
10:55:47  And Xxx for dactyl, and so on.
10:56:35  They sounds like names of towns in Wales and Scotland
10:57:05  i,i spondeeneous combustion
10:57:05 * ski . o O ( Upper and lower case  )
10:57:12  SPACE, COMMA, COLON, TILDE, MACRON, CARON, BREVE, OGONEK, HYPHEN, DAGGER, BULLET, PRIME, CARET, NABLA, ANGLE, UNION, RATIO, EXCESS, MODELS, TRUE, FORCES, XOR, NAND, NOR, BOWTIE, HOUSE, ARC, SECTOR, WATCH, FROWN, SMILE, SLOPE, FUSE, CLOUD, COMET, SUN, ANKH, EARTH, SATURN, URANUS, PLUTO, ARIES, TAURUS, GEMINI, CANCER, LEO, VIRGO, LIBRA, PISCES,
10:57:13  ANCHOR, SCALES, FLOWER, GEAR, COFFIN, NEUTER, CERES, PALLAS, JUNO, VESTA, CHIRON, RAIN, PICK, CHAINS, CHURCH, CASTLE, FERRY, SKIER, TENT, PENCIL, TINY, MINY, JOIN, HYGIEA, PHOLUS, NESSUS, CUPIDO, HADES, ZEUS, KRONOS, SEDNA, FOGGY, FOG, TACO, CACTUS, TULIP, ROSE, HERB, TOMATO, GRAPES, MELON, LEMON, BANANA, PEAR, PEACH, BREAD, DANGO, ODEN, SUSHI,
10:57:13  COOKIE, CANDY, RIBBON, CINEMA, TICKET, GUITAR, VIOLIN, RUNNER, SURFER, TROPHY, GOLFER, DESERT, BANK, HOTEL, SCHOOL, LABEL, RAT, MOUSE, OX, COW, TIGER, RABBIT, CAT, DRAGON, WHALE, SNAIL, SNAKE, HORSE, RAM, GOAT, SHEEP, MONKEY, DOG, PIG, BOAR, BUG, ANT, FISH, TURTLE, BIRD, KOALA, POODLE, EYES, EYE, EAR, NOSE, MOUTH, TONGUE, CROWN, JEANS, DRESS,
10:57:14  KIMONO, BIKINI, PURSE, POUCH, BOY, GIRL, MAN, WOMAN, FAMILY, BABY, GHOST, IMP, SKULL, DANCER, PILL, RING, KISS, BOMB, SEAT, DVD, LEDGER, BOOKS, SCROLL, MEMO, PAGER, CAMERA, RADIO, KEY, LOCK, BELL, FIRE, WRENCH, HAMMER, HOCHO, PISTOL, KAABA, MOSQUE, BOOK, CANDLE, HOLE, SPIDER, SCREEN, FOLDER, NOTE, PAGE, PAGES, LIPS, MOYAI, ROCKET, TRAIN, METRO,
10:57:14  TRAM, BUS, TAXI, SHIP, DOOR, TOILET, SHOWER, BATH, BED, STUPA, PAGODA, SHIELD, CANOE, SLED, SELFIE, PRINCE, SHRUG, FENCER, SPOON, RIFLE, BACON, POTATO, CARROT, EGG, PIE, MANGO, BAGEL, CRAB, TURKEY, EAGLE, DUCK, BAT, SHARK, OWL, DEER, LIZARD, SHRIMP, SQUID, T-REX, LLAMA, PARROT, BADGER, SWAN, BONE, LEG, FOOT, TOOTH, ADULT, CHILD, MAGE, FAIRY, ELF,
10:57:15  GENIE, ZOMBIE, BRAIN, SCARF, GLOVES, COAT, SOCKS, ABACUS, BRICK, MAGNET, BROOM, BASKET, SPONGE,
10:57:18  so according to glibc, 1 is the correct wcwidth for U+2E3B: https://tio.run/##VYzBCoJAFEX3fsVDEUdQaRlYbcRWklIKtRJ5M@aAjaFjBtF/Bf1NP2Jjrdyee85F94w4jgZlJRcM8mOchLv8EGf7INQMLrDuKYNVJylvvGozRyqaswGrop2jusGiZhPTuJBwKbggt4ZTGx4aQMfkXyBRkAfpKQkd0AMvS7fuUrd9ZfwucwkIa4isz@ttTfTaqrOS6CYF8647yho4lRVB2wGiJht/cctk3wpY@NpzHL8
10:57:32  ^ these are single-word unicode character names, just write a poem from them
10:57:37 * ski stares blankly
10:57:38  you don't have to work with the long names
10:57:54  my browser renders it at 5 monospace units wide, though
10:58:12  anyway. time to go
10:58:15 -!- ais523_ has quit (Quit: quit).
10:59:04  Please group them into equivalence classes by rhyme.
10:59:16  there's also just as many longer single-word character names, starting from AMPERSAND, including such things as DUMPLING and BLOSSOM and POPCORN
11:01:20  https://hack.esolangs.org/edit/tmp/single-word-character-names
11:03:06  I don't think this list of words is good for poetry.
11:03:29  yeah, there are too many verbs. hard to make complete sentences from them. let me try to find them.
11:03:31  Better to use some multi-word code points that contain other grammatical ingredients.
11:04:43  hmm, new one for me: https://en.wikipedia.org/wiki/Koomey%27s_law
11:05:17  Why is MUSHROOM missing?
11:05:31  I have a poem with Unicode code points:
11:05:43  BADGER, BALLOON, BANK, BAT, BLOSSOM, BOMB, BRICK, BUG, CHICKEN, COAT, COMPLEMENT, DESERT, 
11:05:49  shachaf: MUSHROOM is in the longer list
11:05:52  that I tried to paste
11:05:58  `fetch tmp/single-word-character-names https://hack.esolangs.org/get/tmp/single-word-character-names
11:06:00  2019-09-16 11:05:59 URL:https://hack.esolangs.org/get/tmp/single-word-character-names [4459/4459] -> "tmp/single-word-character-names" [1]
11:06:00  int-e: Moore's law is much more well-publicized
11:06:18  BADGER, BADGER, BADGER, BADGER, BADGER, BADGER, BADGER, BADGER, BADGER, BADGER, BADGER, BADGER, MUSHROOM, MUSHROOM
11:07:10  int-e: Fancy.
11:07:12  DIVIDES (the first one that's primarily a verb), DOCUMENT, DRESS, DUCK, ENVELOPE, ESTIMATES, 
11:07:13  cpressey: and less relevant, somehow.
11:08:48  FORCES, FROWN, FUSE, GHOST, HAMMER, HOUSE, INCREMENT (second), INTERCALATE (third), JOIN (fourth, this is getting better),
11:10:24  KISS (fifth), LABEL, LOCK (sixth), MAN, MAXIMIZE (seventh), MINIMIZE (eighth; though I wonder if I should have counted BLOSSOM), 
11:11:35  tbf BADGER BALLOON BANK BAT BLOSSOM and BOMB are all verbs too
11:11:56  and DIVIDES can easily be a plural noun
11:12:04  NEUTER, NOTE, OVERLAP (ninth), OVERLINE, PACKAGE, PAGE, PAGES, PARROT, 
11:12:18  cpressey: yes, I did list BADGER BALLOON BANK BAT BLOSSOM as the first ones that can be verbs
11:13:07  lob_jonas: sorry, I wasn't paying attention
11:13:34  `quote alphanumeric
11:13:35  1132)  A Swede who was in #esoteric / Thought his rhymes were a little generic. / "I might use, in my prose, / ꙮs, / But my poetry's alphanumeric."
11:15:18  PENCIL, PICK (tenth primarily verb), PRECEDES, RING, ROSE (eleventh), SCALES, SCHOOL, SCREEN, SCROLL (12th), SEAT, SEGMENT, SHILED, SHIP, SHOWER, SHRUG (13th), SMILE (14th), SNAKE, SPACE, SPARKLE (15th), SPARKLES (16th), 
11:17:12  lob_jonas: I was very confused by this CAAPR file.
11:17:16  STATION, SUCCEEDS (17th), TICKET, TONGUE, TRAIN, TRUMPET, WATCH (18th).
11:17:27  shachaf: read its documentation, it becomes more clear from that
11:17:28  But it turns out my editor was misrendering it.
11:17:39  So most characters weren't showing up.
11:17:44  shachaf: it's iso-8859-1 encoded
11:18:05  Right, I just figured that out.
11:18:28  so that's like fifty verbs usable, and if I count BLOSSOM as primarily a verb, then 19 of them are primarily a verb
11:18:45  there are probably a few more that I just don't know
11:19:48 -!- ArthurStrong has quit (Quit: leaving).
11:20:18  does Moore's law say that the number of emojis double every two years, if you include the ones that are encoded as a combination of more than one unicode code point?
11:22:39  lob_jonas: This is a notable open problem in Emoji Science, we need to find an eminent Emoji Scientist to answer it
11:22:43  `grWp moore
11:22:45  No output.
11:24:22  Is anybody garbage collecting the emojis that nobody ever uses?
11:24:39  That way, maybe, we won't run out of unicode points for them ;)
11:24:51  Someone proposed a capybara emojo, I was happy to hear.
11:24:56  I was going to do it myself otherwise.
11:25:15  It's currently pending review as part of a larger group of emoji.
11:25:56  lob_jonas: What's the benefit of this over cmudict?
11:26:00  we can at least make some of those ambiguously parsing news headlines from these. FORCES DESERT, JOIN OPPOSITION.
11:26:04  cmudict was much easier for me to read.
11:26:49  shachaf: but alan-pron is more informative if you actually want to use it, and doesn't lack as many common words
11:27:35  SPACE SUPERHERO 
11:29:30  This American dictionary clearly doesn't match some American pronunciations.
11:29:44  For example, it says: comfortable : ku'mf°rtøb°L
11:30:51  shachaf: some words have more than one possible pronunciation, and it doesn't generally list all possibilities
11:31:24  Oh. Sometimes it lists multiple pronunciations, but maybe only for words with different meanings.
11:31:41  cmudict has it wrong too: COMFORTABLE  K AH1 M F ER0 T AH0 B AH0 L
11:31:54  Hmm, maybe I'm wrong.
11:32:05  Some people pronounce it a completely bizarro way, which I thought was standard.
11:32:08  yes, multiple pronunciations only when they can make a difference within one speaker, or implicitly in a few symbols that mean vowels that can be pronounced in multiple ways
11:33:51  shachaf: in any case, the docs of alan-pron describes which dictionaries it's derived from, so you can always check those sources and see what they say, and complain to Alan in email about mistakes. I know he reads emails, he fixed one doc-bug on my request.
11:34:14  you know how when a maintainer replies meaningfully to bug reports, that really increases my confidence in how much I can trust something like this, right/
11:34:47  @time
11:34:51  Local time for shachaf is Mon Sep 16 04:34:48 2019
11:34:53  I'm going to sleep.
11:35:24  cmudict has about 4 times as many entries
11:36:00  shachaf: and yet misses lots of common words;
11:36:14  cuvoald710-0.2.scm:( "comfortable"  j ( k uh1 m f t @ b l ) ((pos "OA%" ) ))
11:36:39  whereas Alan compiled those small english dictionaries in 12dicts, and used reputable printed dictionaries to compile this, including Wells's, so it should miss fewer common words
11:36:40  That's an impressive constant cluster there, I didn't realize!
11:37:04  *consonant
11:37:40  With all those consonants comfortably clustered together like that
11:38:12  I couldn't find where I stashed a bunch of pronunciation dictionaries I was playing with, but 'locate' found the above as part of Festival.
11:55:43  `unidecode 👥🕏🥩🕊😂🥛🍃⨔🕴🙌🧻🤣🥘🗾🗽
11:55:44  ​[U+1F465 BUSTS IN SILHOUETTE] [U+1F54F BOWL OF HYGIEIA] [U+1F969 CUT OF MEAT] [U+1F54A DOVE OF PEACE] [U+1F602 FACE WITH TEARS OF JOY] [U+1F95B GLASS OF MILK] [U+1F343 LEAF FLUTTERING IN WIND] [U+2A14 LINE INTEGRATION NOT INCLUDING THE POLE] [U+1F574 MAN IN BUSINESS SUIT LEVITATING] [U+1F64C PERSON RAISING BOTH HANDS IN CELEBRATION]
11:55:52  `unidecode 🙌🧻🤣🥘🗾🗽
11:55:54  ​[U+1F64C PERSON RAISING BOTH HANDS IN CELEBRATION] [U+1F9FB ROLL OF PAPER] [U+1F923 ROLLING ON THE FLOOR LAUGHING] [U+1F958 SHALLOW PAN OF FOOD] [U+1F5FE SILHOUETTE OF JAPAN] [U+1F5FD STATUE OF LIBERTY]
11:57:24  Is that a cohesive storyline that I'm just not following, or are those characters releated to each other in some other way? 
11:57:45  fizzie: other  way
11:58:01  I thought of what a poem would need other than verbs that is rare in character names
11:58:13  the answer is common words: "the", "of", "in", "to"
11:58:21  so all of these character names have one of those common words
11:58:40  there are much more such character names, this is just a small selection
11:59:06  some of them, like "LEAF FLUTTERING IN WIND", are poetic
11:59:16  some, like "LINE INTEGRATION NOT INCLUDING THE POLE", aren't quite
11:59:51  also the character names are mostly in alphabetic order
12:01:09  "SHALLOW PAN OF FOOD" could also work in a poem
12:01:31  "SILHOUETTE OF JAPAN" I just found that one strange because of what we said about flag emojis earlier
12:06:21  DID YOU KNOW THAT NAMES OF UNICODE CHARACTERS MUST BE UPPERCASE SO THAT THEY CAN BE TRANSMITTED CORRECTLY IN BAUDOT
12:06:26  despite that I think theflag situation is stupid
12:08:01  cpressey: baudot is still used?
12:09:45  here? sure
12:10:58  is baudot ITA-1?
12:12:39  oh, ITA1
12:13:12  apparently there's a difference
12:17:59  ITA2 is still used in telecommunications devices for the deaf (TDD), telex, and some amateur radio applications, such as radioteletype ("RTTY"). 
12:18:28  from https://en.wikipedia.org/wiki/Baudot_code
12:19:22  Lykaina: by baudot I just vaguely mean any of the similar codes
12:19:34  there's a lot of locally used variations
12:19:59  5-bit codes
12:20:04  they form a huge family, just like how there are a lot of codes similar to ascii and lots of codes similar to ebcdic
12:20:30  yes, they come from five-bit telexes and five-hole tape
12:20:41  ebcdic was an encryption standandard
12:21:00  just like how ascii is related to seven-bit bytes and ebcdic from 12 line punch cards
12:22:08  you can tell the difference because in ascii-related codes, most letters are arranged in alphabetic order; in ebcdic-like codes, they're still in alphabetic order but grouped to nines; in baudot they're in a different order where the most frequent characters have few holes
12:22:23  or few bits set
12:22:33  oh
12:22:36  admittedly that's true to ebcdic too, but in a different way
12:23:15  in ebcdic, usually there's zero or one bits set from among the 2..9 holes, and ideally as few as possible from the shift holes 12, 11, 10, 1
12:23:32  the holes are numbered 12, 11, 10, 1, 2, 3, 4, 5, 6, 7, 8, 9 iirc
12:23:44  which admittedly isn't that much worse than 2, 3, 4, 5, 6, 7, 8, 9, 10, J, Q, K, 1
12:24:07  or 7, 8, 9, u, o, K, 10, A
12:24:13  or any of the other ridiculous numberings
12:25:29  the ones with C, B, A, S, M, MM, MK, MV, GM; the ones with C, B, A, A+, A++, A+++; the ones with D, C, B, A, AA, AAA
12:25:57  and even the ones with 000, 00, 0, 1, 2, 3, 4
12:27:28  surely no battery will be smaller than the "mini" A battery, so let's name that from the _first_ letter of the alphabet. there could be larger batteries than the goliath D battery, so let's reserve all the letters E..Z for them.
12:29:03  i've never actually seen an A battery
12:29:30  N is smaller than AAA
12:29:33  Lykaina: yes, those aren't used anymore
12:29:38  https://en.wikipedia.org/wiki/List_of_battery_sizes lists a lot
12:29:43  history is complicated
12:30:49  cr2016/2025/2032 are named after their size
12:31:29  and note from the table that most battery sizes have lots of aliases, because every brand calls them different
12:31:42  I have used like a dozen different battery sizes, and got confused among them several times
12:32:15  note that that article doesn't even have a photo of an A battery
12:33:25  which basically means that it doesn't exist anymore
12:41:16  i had a dream that i got a series of comic books that looked and worked like 2-way frs/gmrs radios.
12:42:02  dreams are weird
12:47:52  [[2/9 of an esolang]]  https://esolangs.org/w/index.php?diff=66203&oldid=65104 * YamTokTpaFa * (+9) +WIP
12:48:32 -!- ais523 has joined.
12:50:41  hi ais523 
12:51:04  hello
12:51:15  Baudot is used in a few esolangs
12:51:18  mostly the US-TTY variation
12:51:31  both CLC-INTERCAL and 7 use it as part of their character encoding
12:52:11  7 does it because it's normally more efficient than ASCII at storing common strings (in terms of the number of bits required to represent the input), especially when workinig in base 6
12:52:22  whereas I think CLC-INTERCAL just does it to be perverse
12:52:41  That's why INTERCAL does most things that it does
12:53:04  well, yes
12:53:14  the aim of INTERCAL is to do things differently from other languages
12:53:41  it'll do things better if it can, but normally it does things worse because all the better options have already been taken
12:54:03  for example, there is a POSIX standard for tarballs that basically nobody cares about or follows
12:54:42  but it's backwards compatible with basically any `tar` implementation (and more modern `tar` implementations actually know how to read it, just in case someone decides to produce a tarball in that format)
12:54:47  so I've been using it for C-INTERCAL's tarballs
12:55:36  pax?
12:55:57  yes
12:59:03  i'm relearning how to play go
12:59:47  i say relearning because i have a vague memory of me and Sgeo playing.
12:59:58  wow, now I'm looking at the specification of the original tar format, without the modern improvements
13:00:06  it's pretty insane
13:00:14  e.g. the header is 257 bytes long, padded out to 512 bytes
13:00:43  (512-byte alignment was likely considered necessary at the time, so technically there's no wasted space, but that 257 really hurts)
13:01:52  the number encoding is ASCII-encoded octal, with a fixed length, but the last character of the fixed-length field has to be either NUL or a space
13:03:42  ah yes, tar supports like a hundred historical formats. but zip is even more complicated, with all sorts of new compression methods and extensions to store more file information.
13:04:37  ais523: gnu should have just renamed the format, rather than pretend that it's a new version of tar. they did it right when they created zlib and gzip, and zlib has grown to become the single most installed software library ever, as far as we can tell.
13:05:22  I don't want to know whether it became the most installed one before or after they fixed the stupid security bugs in it.
13:05:41  lob_jonas: aimake actually assumes the presence of zlib's header files
13:06:04  because some operating systems use a different location for nonstandard header files, and aimake needs to be able to find them too
13:06:21  so I needed at least one nonstandard header file that I could assume to be installed, zlib.h seemed like the best option
13:07:03  i gotta wake up now
13:09:05  and these days it has dozens of alternate implementations of zlib compression and decompression, both production and esoteric
13:11:27  that said, I think I released at least one version of C-INTERCAL as .shar, for old times' sake
13:11:31  (to Usenet, obviously)
13:13:09  ``` tar --help | sed -n '/Archive format se/,$p'
13:13:10  ​ Archive format selection: \  \   -H, --format=FORMAT        create archive of the given format \  \  FORMAT is one of the following: \  \     gnu                      GNU tar 1.13.x format \     oldgnu                   GNU format as per tar <= 1.12 \     pax                      POSIX 1003.1-2001 (pax) format \     posix                    same as pax \     ustar                    POSIX 1003.1-1988 (ustar) format \     v7                       old V7
13:15:38  and that's just the ones it can write. 
13:24:00  another thing I learned today: ar is a plaintext format (other than the data of the files it contains, which is stored literally)
13:24:32  which is ironic given that nowadays it's basically only used for storing object files (also, IIRC, .deb's outermost wrapper is in ar format)
13:25:18  ais523: weren't you in agora?
13:25:28  i recognize the name
13:26:29  yes
13:26:37  [[Kleinfunge]]  https://esolangs.org/w/index.php?diff=66204&oldid=45154 * YamTokTpaFa * (+53) 
13:26:42  i think i was SCat then.
13:26:53  I still sort-of am in spirit, but mostly just post in a-d and am not a player
13:27:09  (I made an ambiguous registration attempt a while back but it was ruled to have failed)
13:27:10  ais523: the chunked transfer encoding on HTTP is also a text format, even when the contents aren't text. the chunk lengths are written in ascii-encoded hexadecimal. PPM header is text too, even when the body is binary. 
13:28:05  MIME multipart can also contain binary data with ascii text headings.
13:28:51  in fact, even HTTP headers are text, when the bodies can be any binary content, and you can have a new header after the end of a body for a persistent connection, if either the Content-Length or the Transfer-Encoding tells where the previous body ends.
13:29:06  (this applies both for HTTP requests and responses, they're basically the same format)
13:29:17  so I don't much find text header formats too strange
13:29:52 -!- imode has quit (Ping timeout: 265 seconds).
13:29:55  there are also some binary formats like PNG and sqlite where the magic numbers in the header contain some ascii text, just to make it easier to identify the file type at a glance
13:30:30  even bmp and exe and elf are like that, but there the text is only two or three bytes, and for elf it starts at offset 1
13:30:40  iirc
13:32:01  omg, did i actually store live quarantined virii on a hard drive? i must have been really crazy then
13:32:31  maybe i was just too lazy to clean out the antivirus
13:33:44 -!- xkapastel has joined.
13:38:46  i have fragmented memories of my past
13:39:01  [[Policy Policy]] M https://esolangs.org/w/index.php?diff=66205&oldid=66202 * A * (+964) 
13:40:37  like i didn't know i ever played Go till i started trying to remember my interactions with Sgeo in college.
13:40:55  heh
13:42:57  I have played go on at least one occasion!
13:43:18  I met them at the Green Chair Club.
13:43:27  I understand enough of it to know that I am really bad at the game
13:43:43  I'm equally bad at the programming language, probably
13:43:45  1000 kyu here too
13:44:12  i think that means "i suck at the game"
13:44:37  Maybe if we ever run into each other we should have a game
13:44:51  i don't remember the rules
13:45:00  Then we are equally disadvantaged
13:45:16  Hmm, are there any esolangs based on Go (the board game)?
13:45:28  Not to my knowlege
13:45:37  if there are, they were most likely created by zzo38
13:45:39  what about chess?
13:45:42  istr seeing a paper showing that (infinite) Go is PSPACE-complete
13:46:07  yes, that paper is basically an esolang definition in its own right
13:46:26  also, PSPACE-completeness would imply generalized, not infinite, wouldn't it?
13:46:48  the infinite version is likely to be TC with a plausible definition of how to arrange the initial board and what the win conditions are
13:46:54  Right, I misspoke when I said "infinite". I'm very sorry.
13:47:15  I have seen someone else who tried to teach Go to young people to popularize it. does that count?
13:47:33  you could make it work by marking some of the stones of each player, and you win by capturing a marked stone
13:48:00  i think my sanity level got improved after i realized I was misgendered at birth.
13:48:08  `? go
13:48:11  Go is a common irregular verbal game programming language invented by the Germanic Taneb tribes catching monsters in the strategic territories of East Asia.
13:48:13  Lykaina: often the way
13:49:40  win by capturing a marked stone => there's a variant rule for Risk the board game like that, where every player names a territory as their capital, and if it's continuously not controlled by that player for three turns, then they lose
13:49:59  and the capitals are publci
13:50:13  pubic?
13:50:23  public
13:50:27 -!- imode has joined.
13:50:29  sorry
13:53:19  you know it costs over $200 to change your name in the state i live in?
13:53:33  That's a whole bunch
13:53:40  In the UK it's free if you know what you're doing
13:54:07  Lykaina: is that for an adult to change their name?
13:54:16  yes
13:55:01  could you just get named differently in a different state where that's simpler, then come back with the identifying documents from that state to prove that you've changed your name, to get the change accepted by this state easiliy?
13:56:23  i use my chosen name so much that i kinda have to change it to it. Hell, i type copyright notices for essolangs with my chosen name, not my deadname.
13:57:14  IIRC in the UK the main requirement to have your name legally changed is that you convince sufficiently many people to interact with you using it
13:57:36 -!- user24 has joined.
13:57:48  ais523: there's a thingy with a standard wording that you have to fill in in the presence of witnesses
13:58:14  Taneb: yes, that's a fairly easily complied-with requirement though
13:58:27  That's the only requirement
13:58:42  (in England and Wales)
13:58:57  ais523: that's the officially recommended way, but isn't it easier everywhere to just get id documents in another country that doesn't insist that you use exactly the same name as on your previous identification documents, and then migrate that name back?
13:58:59  i will have to publish my name change in the local newspaper
13:59:30  I think many newspapers have columns for legal notices, that nobody actually reads
13:59:43  except my dad...
14:00:43  ais523: are these printed newspapers or digital newspapers or both?
14:00:51  that's ho he found out the neighbors were doing something asshole-ish
14:00:58  https://en.wikipedia.org/wiki/Deed_of_change_of_name
14:01:12  lob_jonas: at the time the laws were created, it was printed newspapers
14:02:43  wow, so apparently if you change your name by deed poll, you don't even need to tell anyone you've changed it; all you need is the deed poll itself, which has to be notarized but doesn't have to be officially registered
14:03:28  but there is an official process if you want, e.g., your passport changed
14:03:52  well sure, because very few institutions are allowed to issue passports
14:05:11  it's mostly some government office for permanent passports, consulates for temporary passports, and a few more for special purpose stuff, but the biggest are government offices that issue thousands of passports so they need procedures and forms
14:13:39  apparently Wob_jonas would work to get the same green as b_jonas
14:13:59  you not same person?
14:14:41  I am the same person
14:14:51  what i thought
14:16:05  so would wib_jonas or bb_jonas
14:16:17 -!- ais523 has changed nick to callforjudgement.
14:16:20 -!- callforjudgement has changed nick to ais523.
14:16:22 -!- ais523 has changed nick to callforjudgement.
14:16:35 -!- callforjudgement has changed nick to ais523.
14:17:00 -!- Lykaina has changed nick to SchrodingersCat.
14:17:07 -!- SchrodingersCat has changed nick to Lykaina.
14:19:08  rather be a she-wolf than a semi-dead cat
14:22:56  on the internet, nobody knows if you are a werewolf.
14:26:14  On that note, I saw a very nice full moon a few days ago. Close to the horizon, sort of amber in colour.
14:26:39  howoo!
14:26:52  cpressey: and due to a fairly well-known optical illusion, appearing larger than normal?
14:27:59  cpressey: that seems possible, because the moon was full two days ago
14:29:20  cd ..
14:29:23  oops
14:29:25  brb
14:29:32  ``` cd ..
14:29:33  No output.
14:30:14  that's like writing (cd ..) in a shellscript
14:30:25  running it in a subshell makes it pretty pointless
14:32:34  ais523: sure. except in DOS, or to check that you have permissions to chdir there.
14:33:30  now I'm curious about whether there's any circumstance in which cd .. might fail due to a lack of permission
14:34:01  obviously it can fail if you're cd'ing to a filename (lack of permission, nonexistent, not a directory, probably other things I haven't thought of)
14:35:33  ais523: it sure can change
14:35:35  I'm trying to remember what .. is internally; I think it's a hardlink, right?
14:35:36  sure can fail
14:35:49  no, .. is just handled by the file system code magicallyi
14:36:03  it used to be represented by a hardlink on some file systems, but that barely matters now
14:36:29  the kernel parses .. to mean the parent directory even if it's not stored as an explicit name in the file system
14:36:31  the link count of a directory still reflects .. as though it were a hardlink
14:36:44  so I think its hardlinkness is being simulated even though it's obsolete
14:37:10  anyway, I read through the possible failure modes of chdir(1) and none of them seem to apply to a chdir to .. apart from possibly ENOMEM and EIO
14:37:41  hmm
14:38:15  ais523: that too is only on most filesystems; on some filesystems the link count of directories doesn't show anything useful
14:38:39  hmm
14:38:55  back
14:39:20  maybe cd .. rarely fails to permissions because you can't read the .. directory entry if you don't have effective execute permissio to the parent directory?
14:39:26  I don't know
14:39:45  cd .. would fail on the root dir, right?
14:39:54  Lykaina: not on unix, no
14:40:08  on unix, /.. is just the same as /
14:41:11  OK, I managed to make cd .. fail to permissions
14:41:22  by chmodding the .. in question to 000
14:41:36  why?
14:42:05  oddly, I could chmod it back without issues
14:42:10  even by naming it as ..
14:43:10  oh wow, I can chmod .. if I have write+search permission to the current directory, even if I have neither permission to either .. or ../..
14:43:11  that feels like a bug
14:43:31  and may be part of the reason why hardlinking directories is banned
14:46:13  ais523: chmod by using its absolute pass. you can't look up .. because you don't have search permissions for .. so you can't check if . exists and .. should fail if . doesn't exist
14:46:19  s/pass/path/
14:46:57  lob_jonas: the situation is that I'm currently in directory /a/b/c/, I have no permissions to a or b (because I removed them while chdir'd into c) but I do have permissions to c
14:47:23  I can chmod b by naming it as ".." even though I can't chmod it by naming it with its name
14:47:54  ais523: that makes sense
14:48:20  why? I just changed the metadata of a directory I have no permissions to, with no permissions to its parent directory either
14:48:21  the permissions to c won't be re-checked if you access it through cd or a file handle, so what I said above makes no sense
14:48:36  also don't forget that the shell does some magic for cd
14:48:38  ``` help cd
14:48:40  cd: cd [-L|[-P [-e]] [-@]] [dir] \     Change the shell working directory. \      \     Change the current directory to DIR.  The default DIR is the value of the \     HOME shell variable. \      \     The variable CDPATH defines the search path for the directory containing \     DIR.  Alternative directory names in CDPATH are separated by a colon (:). \     A null directory name is the same as the current directory.  If DIR begins \     with a slash (/), 
14:48:41  it's not the permissions to c that matter, it's the permissions to b
14:48:45  which involves interpreting .. specially
14:48:55  and although magic is involved in cd, this is not a cd command, it's a chmod command
14:49:11  so that if you cd to a symlink, .. goes back to where the symlink were, because the shell pretends that that's how it works, even if that's not the kernel's idea
14:49:54  if I have no permission to . either, then I can't chmod either . or ..
14:50:36  ``` help cd | tail -n+16
14:50:38  ​    Options: \       -Lforce symbolic links to be followed: resolve symbolic \     links in DIR after processing instances of `..' \       -Puse the physical directory structure without following \     symbolic links: resolve symbolic links in DIR before \     processing instances of `..' \       -eif the -P option is supplied, and the current working \     directory cannot be determined successfully, exit with \     a non-zero status \    
14:50:39  try cd -P
14:50:50  but my problem is with the apparent situation that .. is treated as being contained in the current directory and thus I can edit its metadata if I have write permission to the current directory
14:51:04  lob_jonas: this is nothing to do with cd
14:51:14  cd doesn't change into directories where you're missing search permission
14:51:25  the situation can arise without using cd at all
14:51:49  (other than the fact that your current directory needs to somehow be a few directories away from the root)
14:52:19  the issue is that chmod, and presumably other metadata-changing commands, are allowed on .. as long as you have write permission to the current directory, even if you don't have write permission to it or its parent directory
14:53:43  ais523: hmm
14:53:55  ais523: but isn't that because you own .. ?
14:54:27  let me set up a test for this
14:55:37  ais523: http://man7.org/linux/man-pages/man2/chmod.2.html suggests that to be able to chmod a file, when the set?id bits are not involved, what you need is to either own the file or be root
14:55:48  in this case, you own the directory, so that permission check succeeds
14:55:57  OK, chmod is specified to allow chmodding if a) you own the file, and b) you have +x permission to all components in the path you use other than the last
14:56:16  so the weirdness in this case is that I can specify the directory's name despite it being in a -x directory
14:56:20  yes, the latter is needed for the path lookup to succeed
14:57:02  the permission is related to the lookup, rather than the directory itself, so if I'm already inside the directory I don't need the lookup and chmod lets me change the directory permissions because I own it
14:57:21  I started to do some tests on hackeso, but the way it runs my commands twice complicates that
14:59:17  ais523: yes, and if you have a deep hierarchy of directories, you can traverse them with either pwd or file descriptors pointing to the directories and *at functions, and the kernel doesn't need to do any checks on the whole deep path from the root to your file
14:59:48  just like how read/write doesn't try to do permission checks once you have a file open
14:59:53  the *at API works so much better than the cwd API
15:00:09  and the "let's just use absolute paths everywhere" API, which is massively subject to race conditions
15:00:51  I'm glad that WASM decided to use the *at API as the only filesystem API (this is both for allowing the program to secure itself against races, and for allowing the surrounding environment to secure itself against the program)
15:01:27  ais523: isn't that because pwd doesn't work well with multithreading, and people want multithreaded programs with WASM in a threaD?
15:01:41  pwd is basically a global variable API
15:02:00  those always seem to turn out to be a bad idea in retrospect (often when written, too!)
15:02:35  yes, it's sort of like an implicit file descriptor that you usually can't access as a normal file descriptor, except in specific *at calls
15:04:03  you can even go between the two, open(".",O_PATH,0) to get a file descriptor from the pwd, fchdir to get the pwd from a file descriptor 
15:06:37  `olist 1180
15:06:39  olist 1180: shachaf oerjan Sgeo FireFly boily nortti b_jonas
15:07:10  `? password
15:07:13  The password of the month is ninjaed.
15:07:34  `open the pod bay door
15:07:35  ​/srv/hackeso-code/multibot_cmds/lib/limits: line 5: exec: open: not found
15:07:59  the o comic is on a separate server, you can access the published strips without the password. in fact, we ring the o-bell when one of the strips becomes accessible without a password.
15:08:06  Lykaina: I'm afraid I can't let you do that, [single-syllable version of Lykaina].
15:08:07  `whatis open
15:08:12  open(2) - open and possibly create a file \ open(3p) - open file relative to directory file descriptor \ open(3glibc) - Opening and Closing Files
15:09:50  int-e: Lyka, but it's two syllables
15:12:32  Lyka = lee-kah
15:12:54  Lykaina = Lee-keh-nah
15:14:41  at least, that's how i pronounce them
15:40:24  it's an interesting name :)
15:45:58 -!- ais523 has quit (Quit: quit).
15:52:37 -!- cpressey has quit (Quit: A la prochaine.).
15:53:10 -!- xkapastel has quit (Quit: Connection closed for inactivity).
16:02:14  hi all have a nice day or night
16:02:25  Do we get to choose?
16:02:57  no it’s ⅋
16:04:37 -!- tromp has quit (Read error: Connection reset by peer).
16:04:47  Aww :(
16:04:56  Can we refuse to have a day or night at all?
16:05:02 -!- tromp has joined.
16:05:51  Taneb: no; though there is a speciall offer for the first to use it to replace their copy of ⅋ with ⊕
16:06:15 -!- lob_jonas has quit (Remote host closed the connection).
16:06:22  I decline
16:06:35  also I didn’t know linear logic jokes are that fun
16:12:23  gtg
16:12:48 -!- Lykaina has quit (Quit: leaving).
16:14:08  hello arseniiv 
16:14:39  kmcello!
16:17:10  also I have a stupid question. I see several people and bots have something like “unaffiliated” in theirs /WHOIS info (that “is connecting from” part of output). I don’t know the proper terminology so I don’t even know what to google to know if I can change that thing myself
16:17:47  I think that's called a cloak
16:18:25  Yes: https://freenode.net/kb/answer/cloaks
16:19:02  Taneb: fizzie: oh, thank you!
16:19:26  fungot: Do you think we should apply for an "unaffiliated/fizzie/bot/fungot" cloak for you? 
16:19:26  fizzie: who uses it apart from graphics primitives. if built correctly it actually takes less typing for bigger stuff. :) hehe... to task switch, it just the hw you're intrested in motorola fnord :)
16:19:41  I can't tell if that's yes or no.
16:19:49  I think it's a no
16:19:58  Who uses cloaks, apart from graphics primitives?
16:20:03  At least it wasn't a very enthusiastic yes.
16:20:21  wizards? or is that more of a robe than a cloak
16:20:30  fungot: We will respect your right to self-determination and not do that, then.
16:20:30  fizzie: what unholy magic is this :o fnord hours left
16:21:03  I've heard assassins and spies have both a cloak and a dagger.
16:21:31  I think these days those are more ceremonial, awarded at the graduation ceremony
16:21:31  hm are there cloak categories
16:23:50  . o O ( on a graduation ceremony, a party of people threw their ceremonial daggers skywards. What is the probability of each dagger striking the wrong person )
16:24:08  I mean, landing on
16:24:28  striking is a striking typo
16:25:19  needs more information
16:26:07  1/n I think, assuming all the unreasonable assumptions I am making
16:30:01  arseniiv: Is there a God? Will there be a God after They've been struck by n knives? Are they a person, and if so, are they right or wrong?
16:30:41  But I'm thinking about this too realistically, I think... in which case most knives will land between people rather than on them.
16:31:07  And at least one person will die in a freak accident unrelated to the knives.
16:32:30  Taneb: Making some unreasonable assumptions myself I get (1-1/n)^n ~ 1/e, or 1/0! - 1/1! + 1/2! - + ... +/- 1/n! ~= 1/e.
16:33:27  1/n would be the probability of getting a permutation with a single cycle of length n, but there are many more derangements than that.
16:34:59 -!- Lord_of_Life has quit (Ping timeout: 265 seconds).
16:37:53 -!- Lord_of_Life has joined.
16:41:48  int-e: hmmm
16:42:09  I think they is a personal pronoun, not a person
16:42:16  (I’ll show myself out)
16:43:36  ah now I understand why are there God-related questions
16:44:25  let’s assume They are insubstantial if existent so can’t be striken by anything but cosmic grief
16:45:04   But I'm thinking about this too realistically, I think... in which case most knives will land between people rather than on them. => even if people are packed tight?
16:45:41  (if considering asymptotic behavior, this should be the case)
16:46:31 -!- FreeFull has joined.
16:46:39  ≈ 1/e is the classic and right answer in the limit, yes
16:47:11  1/e is the answer to everpthing
16:47:37  (this is a classic problem with many names and formulations so I made my own)
16:47:45  kmc: not e?
16:47:57  it depends whether the answer should be less than or greater than one
16:48:10  (and what about 42, certainly 42 ≠ e)
16:48:13  kmc: ah!
16:49:24  e makes a lousy probability
16:49:46  arseniiv: Presumably 42 = e in base 1/4(e-2).
16:50:34  one cen find e positive enswer to enything with eny nonzero precision by summing powers of e
16:50:43  But of course -80538738812075974^3 + 80435758145817515^3 + 12602123297335631^3 isn't a good probability either.
16:51:08  ah I heard that!
16:53:15  > Note that cloaks are a privilege, and staff have the right to deny that privilege to users if they deem necessary.
16:53:17   :1:33: error: parse error on input ‘,’
16:53:20  hmmm
16:53:27  oh sorry lambdabot
16:53:32  @botsnack
16:53:32  :)
16:53:46  @lambdabot is used to abuse.
16:53:46  Unknown command, try @list
17:02:43  I’m bit afraid to write them. Now I don’t know if it’s feasible
17:35:43 -!- b_jonas has joined.
17:36:21  guess what. I just got dead-tree spam about scientology. this may be a first, but of course I'm not really sure because I don't read or forget spam really quickly.
17:36:55  they even succeeded to make it look different enough from normal spam that I payed attention for enough time to read that it's about scientology
17:37:49  wow
17:37:56  there is a scientology office just up the street from me
17:38:06  and I see them in public areas (subway stations and plazas) pretty offten
17:38:24  though I see the Jehova's Witnesses more
17:38:45  I do know they have some presence here, but I don't follow the details
17:38:47  also on Sundays there will be a guy down in the hispanic neighborhood wearing a suit yelling into a megaphone about Jesus in spanish
17:43:24  there are a lot of religious evangelist groups on the street here, both polite ones and annoying ones
17:44:15  there's a big group of polite ones who stand in underpasses with some booklets, they never bother anyone and don't try to talk to people on their own initiative, their signs are attention-catching enough
17:45:40  there's a really annoying group shouting and singing about how Jesus is the only way to salvation every Wednesday evening when I return from the swimming pool, they're standing in such a huge circle in the Barross tér underpass that you can't avoid them if you have to go from the Thököly side to the Kerepesi side, you have to pass between them twice as you intersect the circle twice
17:45:46  they're very loud too
17:46:50  such a big circle is quite a feat, because that underpass is huge and partly open, and the circle is sparse enough that they're clearly doing it deliberately 
17:47:29  no Spanish ones of course, but I have met a polite guy in the Blaha underpass many years ago who was explaining to me about the grace of God in English
17:54:45 -!- Phantom_Hoover has joined.
18:48:55 -!- user24 has quit (Remote host closed the connection).
18:49:16 -!- user24 has joined.
18:51:47 -!- user24_ has joined.
18:54:39 -!- user24 has quit (Ping timeout: 264 seconds).
19:22:07 -!- Sgeo has quit (Ping timeout: 245 seconds).
19:38:45 -!- user24_ has quit (Quit: Leaving).
19:43:39  argh!
19:43:59  ``` date "+%^08%"
19:44:01  0000000%
19:44:26  gnu libc's strftime accepts width and modifiers to the %% format specifier
19:45:21  I want to find the start of format specifiers in a strftime format. I thought at first it would be as easy as finding all percent signs that are preceded by exactly an event number of percent signs. no. you have to parse the modifiers in full.
19:46:10  ``` date "+(%08i)" # it even accepts width for invalid format specifiers, seriously
19:46:13  ​(0000%08i)
19:46:41  "%i" would be passed through, but "%08i" pads "%08i" to 8 wide with zeroes
19:46:51  ``` date "+%^i"
19:46:53  ​%^I
19:47:04  ^ that one uppercases the passed through invalid sequence
19:50:31  It seem to me that it would be sensible for invalid format specifiers to be an error. Width and modifiers for %% format specifier look like OK, though, even though it seems strange and not so useful, it still makes sense that it will work.
19:51:53  zzo38: what kind of error?
19:52:39  note that it makes sense for strftime to allow untrusted format strings as input, so that eg. a web form can let the user type any locale name and format string that they want to see timestamps formatted in
19:52:57  I don't know what kind of error.
19:53:16  it would make sense to not apply the modifiers to the passed through invalid format escapes I think
19:53:28  and to consider double percent with anything between invalid
19:53:50  hmm no, even then it wouldn't be so simple
19:54:58  ideally make the double precent invalid, but in a way where the second percent string starts a new format specifier, so even "%0%B" is turned to "%0" followed by the month name
19:57:22  I guess I'll just make a half-solution that works on sane format strings, and gives garbage but doesn't segfault on general format strings
19:59:41  Maybe it should return 0 if an invalid format specifier is included, because that is what the man page says it otherwise does in case of an error. (But, it can also return 0 if it is empty. Still, it shouldn't be a problem, since it is easy to see if it is empty, and it is unlikely that you want %p by itself anyways; if you do, then you probably don't care why it is zero.)
20:02:00  ``` date "+(%:z)(%8:z)(%:8z)" # oh, that's even funnier
20:02:06  ​(+00:00)(+0000:00)(%:8z)
20:02:19  (If it is entered by a user and the program wants to check for an error but does not check that it is empty, then, depending on the application, the user might put in a space, or a Unicode zero width space (on a web form), etc)
20:02:23  "in case of an error"? what error? strftime can't give an error, can it?
20:03:17  I suppose one error might be that it is too long and won't fit in the provided buffer; maybe there are other errors too I don't know
20:04:46  hmm, you'er right, it returns 0 if the string is too long for the buffer
20:05:17  I suppose %5Y is good for the Long Now Foundation
20:07:34  I'll just parse by assuming each format escape is valid, in which case I can match them by /(%[-#0-9:EO^_]*[^-#0-9:EO^_])/
20:07:51  no, actually 
20:08:07  make that /(%[-#0-9:EO^_]*[^-#0-9:EO^_]?)/ so it matches truncated ones at the end 
20:12:06  I should check what gnu coreutils date does, because it does add _one_ new format to strftime's repertoire, %N, which doesn't make sense for strftime
21:29:09  (LC_ALL=hu_HU.utf8 date -d "2019-10-05" "+%^B") prints "OKTóBER" with a lower case ó on my machine where that locale is installed. I think that's a bug.
21:29:31  not that I trust the date formats of the hu_HU.utf8 locale anyway
21:29:37  but still
21:29:52  ``` locale -a # can't test it on HackEso, locales aren't installed
21:29:54  C \ C.UTF-8 \ POSIX \ en_GB.utf8 \ en_NZ.utf8 \ en_US.utf8
21:30:45  there's a C.UTF-8 locale? that's nice
21:32:57  b_jonas: (LC_ALL=fi_FI.utf8 date -d "2019-06-05" "+%^B") prints "KESäKUU" with a lowercase ä on my machine, which is likely the same bug.
21:33:13  fizzie: good to know
21:33:21  fizzie: that's on linux, right?
21:33:40  Yes, on a conventional glibc Debian system.
21:34:33  Also, "kesäkuu" translates literally to "summer month", which is I guess evidence that whoever named the Finnish months wasn't too creative.
21:34:44 -!- hppavilion[1] has joined.
21:34:44 -!- hppavilion[2] has joined.
21:34:59  Also syyskuu (September) translates to "autumn month".
21:35:08  For some reason there's no "spring month" or "winter month" though.
21:35:31  Hungarian has at least two series of alternate month names, one where all of them are named of the four seasons, and one where they're named of saints
21:35:48  besides the normal latin-based month names
21:35:55  and roman numerals
21:36:02  I still say we should just use %m to name the months
21:36:10 -!- hppavilion[2] has quit (Client Quit).
21:36:45  and %Y-%m-%d for dates
21:37:28  The Finnish %b abbreviations are up to 6 letters, which I'm sure causes some formatting problems somewhere.
21:37:31 -!- andrewtheircer has joined.
21:37:58  fizzie: like buffer overflows on particular dates, depending on the phase of the moon?
21:38:10  hi
21:38:11  In fact, "%B" is always the same as "%bkuu".
21:38:32  ("kuu" being the Moon.)
21:39:05  you know, tests misteriously failing on saturdays between 10 september and 31 september on full moon if the wind speed is over 100 km/h 
21:40:12  I once submitted some code at work that got automagically blamed as a build-breaking change because it was the first change submitted after the time when a time-based unit test stopped working.
21:40:34  Hmm, is "misterious" a foggy version of "mysterious"?
21:40:54  oh wow
21:41:12  https://hu.wikipedia.org/wiki/H%C3%B3nap#Magyar_h%C3%B3napnevek lists _four_ series of alternate months names
21:41:24  many of those names don't even make sense
21:42:00  but it sayss that columns 5 and 6 don't count, so only three series
21:42:26  one with the saints, one with the seasons, and a weird one
21:43:07  That's a lot more month names than we've got.
21:48:36 -!- andrewtheircer has quit (Remote host closed the connection).
21:48:56  I barely know the normal latin-based month names anyway. I always keep forgetting which names are for month 08, 09, and 10.
21:50:07  calendars are supposed to track this, but half of them don't show both the month number and month name together
21:52:06  ``` for m in 08 09 10; do date "+%m %B" -d "2019-$m"; done
21:52:10  date: invalid date '2019-08' \ date: invalid date '2019-09' \ date: invalid date '2019-10'
21:52:15  stupid
21:52:19  ``` for m in 08 09 10; do date "+%m %B" -d "2019-$m-01"; done
21:52:21  08 August \ 09 September \ 10 October
22:02:53  what language is that.
22:03:24  `locale
22:03:26  LANG=en_NZ.UTF-8 \ LANGUAGE= \ LC_CTYPE="en_NZ.UTF-8" \ LC_NUMERIC="en_NZ.UTF-8" \ LC_TIME="en_NZ.UTF-8" \ LC_COLLATE="en_NZ.UTF-8" \ LC_MONETARY="en_NZ.UTF-8" \ LC_MESSAGES="en_NZ.UTF-8" \ LC_PAPER="en_NZ.UTF-8" \ LC_NAME="en_NZ.UTF-8" \ LC_ADDRESS="en_NZ.UTF-8" \ LC_TELEPHONE="en_NZ.UTF-8" \ LC_MEASUREMENT="en_NZ.UTF-8" \ LC_IDENTIFICATION="en_NZ.UTF-8" \ LC_ALL=
22:03:27  ``` locale
22:03:29  LANG=C \ LANGUAGE= \ LC_CTYPE="C" \ LC_NUMERIC="C" \ LC_TIME="C" \ LC_COLLATE="C" \ LC_MONETARY="C" \ LC_MESSAGES="C" \ LC_PAPER="C" \ LC_NAME="C" \ LC_ADDRESS="C" \ LC_TELEPHONE="C" \ LC_MEASUREMENT="C" \ LC_IDENTIFICATION="C" \ LC_ALL=
22:03:36  imode: C 
22:03:45  wat.
22:03:56  `` locale
22:03:58  LANG=en_NZ.UTF-8 \ LANGUAGE= \ LC_CTYPE="en_NZ.UTF-8" \ LC_NUMERIC="en_NZ.UTF-8" \ LC_TIME="en_NZ.UTF-8" \ LC_COLLATE="en_NZ.UTF-8" \ LC_MONETARY="en_NZ.UTF-8" \ LC_MESSAGES="en_NZ.UTF-8" \ LC_PAPER="en_NZ.UTF-8" \ LC_NAME="en_NZ.UTF-8" \ LC_ADDRESS="en_NZ.UTF-8" \ LC_TELEPHONE="en_NZ.UTF-8" \ LC_MEASUREMENT="en_NZ.UTF-8" \ LC_IDENTIFICATION="en_NZ.UTF-8" \ LC_ALL=
22:04:12  two backticks gives New Zealand english locale, three backticks gives C locale
22:04:23  no no no I mean the `for m in 08 09 10; do date "+%m %B" -d "2019-$m-01"; done`
22:04:30  is that just bash?
22:04:32  ``` locale; for m in 08 09 10; do date "+%m %B" -d "2019-$m-01"; done
22:04:34  LANG=C \ LANGUAGE= \ LC_CTYPE="C" \ LC_NUMERIC="C" \ LC_TIME="C" \ LC_COLLATE="C" \ LC_MONETARY="C" \ LC_MESSAGES="C" \ LC_PAPER="C" \ LC_NAME="C" \ LC_ADDRESS="C" \ LC_TELEPHONE="C" \ LC_MEASUREMENT="C" \ LC_IDENTIFICATION="C" \ LC_ALL= \ 08 August \ 09 September \ 10 October
22:04:35  yes, it's bash
22:04:37  err, shellscrip- yup, that is.
22:05:05  ``` echo $BASH $BASH_VERSION
22:05:08  ​/bin/bash 4.4.12(1)-release
22:11:38 -!- Sgeo has joined.
22:28:50 -!- Sgeo_ has joined.
22:29:15  Skill Bite {XUR} Instant ;; Target creature you control deals X damage to another target creature; X can't be more than the first creature's power. If any damage is dealt in tihs way, the first creature gains copies of all of the second creature's activated abilities until end of turn. ;; Cycling {3} ;; Flashback {X2UR}
22:30:10  South Sunrise {2W} Instant ;; Skip the next main phase.
22:31:38 -!- Sgeo has quit (Ping timeout: 240 seconds).
22:31:47  Now you can write your comment/complaint of this please.
22:31:55  zzo38: that latter is sort of like a Silence, right?
22:32:43  Maybe a little bit, but it is different.
22:33:01 -!- rickbutton has quit (Quit: ZNC 1.7.2+deb1+bionic0 - https://znc.in).
22:33:14 -!- rickbutton has joined.
22:34:18  O, now I thought of what feature should be adding in TeXnicard, which is, something to help with the collaboration, maybe.
22:35:36  zzo38: I'm not sure that first one works. what happens if you choose a too high value of X? you choose X before the targets. it should be phrased to restrict the first target I think.
22:36:02 -!- Sgeo_ has quit (Ping timeout: 265 seconds).
22:36:06  Of course it does restrict the valid targets, even though the wording is like that.
22:36:19  as for the cannibal abaility, that's ... weird, but might work, I dunno
22:36:40  s/abai/abi/
22:37:31  it's especially funny when the damage is redirected
22:39:21  or when it steals loyalty abilities, and yes, I know that happens with other quicksilver abilities too
22:51:38 -!- cocof has joined.
22:51:50  can I ask a php related question?
22:52:06  my nick registration is pending
22:53:59 -!- tromp_ has joined.
22:56:52  I suppose you can try
22:57:20 -!- tromp has quit (Ping timeout: 246 seconds).
23:02:43  ? php
23:02:49  `? php
23:02:52  php is the PigeonHole Principle
23:03:11 -!- Phantom_Hoover has quit (Quit: Leaving).
23:03:37 -!- cocof has quit (Remote host closed the connection).
23:13:50 -!- rickbutton has quit (Quit: ZNC 1.7.2+deb1+bionic0 - https://znc.in).
23:26:19 -!- Sgeo has joined.
23:32:07 -!- b_jonas has quit (Quit: leaving).
23:40:16 -!- Lykaina has joined.
23:41:36  hi
23:57:11  bye... (feeling too sick to stay connected)
23:57:24 -!- Lykaina has quit (Quit: leaving).

2019-09-17:

00:10:35  Anyone here messed with WebAssembly much?
00:11:18  I'm trying to figure out a clean way for WASM to generate and load WASM, and then load references to the generated functions/tables/data so that it can be used.
00:12:24  This is for a embedded impl of WASM, not the kind you'd see in a browser
00:12:40  so spec changes are possible
00:13:14 -!- arseniiv has quit (Ping timeout: 240 seconds).
00:18:37  Why does amd64 have both "Move imm32 to r32." and "Move imm32 to r/m32."?
00:18:56  I should probably look up the 32-bit encodings.
00:19:23  https://c9x.me/x86/html/file_module_x86_id_176.html has it too.
00:19:54 -!- FreeFull has quit.
00:20:20  I guess it's one byte shorter for the imm32-to-r32 case?
00:27:38  I've been assuming they've dedicated 8 one-byte opcodes for "MOV r32, imm32" because it's so common.
00:27:56  (And 8 more for "MOV r8, imm8".)
00:28:17  Right.
00:31:14  `asm .byte 0x64; lea (%rax), %rax
00:31:17  0:  64 48 8d 00   lea %fs:(%rax),%rax
00:32:29  =rasm2 mov eax, 0x7f7f7f7f
00:32:34  =ping
00:32:39 -!- asdfbot has joined.
00:32:42  =rasm2 mov eax, 0x7f7f7f7f
00:32:44  b87f7f7f7f
00:32:52  =rasm2 mov [ecx], 0x7f7f7f7f
00:32:52  c7017f7f7f7f
00:33:00  shachaf: ^ 1 byte shorter, so yes
00:33:16  =rasm2 mov [eax], 0x7f7f7f7f
00:33:16  c7007f7f7f7f
00:34:03  Yes, I know.
00:34:47  sorry, assumed you were unsure due to saying `i guess`
00:35:06  Fair enough.
00:36:27  I like the way VEX flips some of the REX bits so that the 32-bit encoding happens to turn into an invalid register r/m operand.
00:40:50  `asm .byte 0xa1
00:40:52  0:  a1   .byte 0xa1
00:40:54  How is this used?
00:41:07  oo. uh let's see
00:41:14  `cat bin/asm
00:41:16  ​#!/bin/sh \ echo "$1" > /tmp/asm.s; for o in ',' '-msyntax=intel -mnaked-reg,-M intel'; do if as ${o%,*} /tmp/asm.s -o /tmp/asm.o 2>>/tmp/asm.err; then objdump ${o#*,} -d --insn-width=20 /tmp/asm.o | sed -e "1,/0000000000000000/d" | perl -pe 'if (/^\s*(\w+:)\s*((?:\w\w )+)\s*(\S.*)$/) { ($a,$b,$c) = ($1,$2,$3); $_ = "$a  $b  ".($c =~ s/\s+/ /rg)."\n"; }'; exit; fi; done; cat /tmp/asm.err
00:41:29  Reference: https://www.felixcloutier.com/x86/mov
00:41:36  MOV EAX,moffs32
00:42:39  ..what assembler is being used? I can't tell
00:42:50  It's using GNU as.
00:42:58  ah
00:42:59  It tries both Intel and AT&T syntax.
01:15:55  `` echo '__thread long x; long foo(void) { return x; }' > /tmp/test.c && gcc -shared -fPIC -O2 -shared /tmp/test.c -o /tmp/test.so && objdump -d /tmp/test.so | grep -A5 'foo'
01:15:58  0000000000000740 : \  740:48 83 ec 08          sub    $0x8,%rsp \  744:66 48 8d 3d 84 08 20 data16 lea 0x200884(%rip),%rdi        # 200fd0  \  74b:00  \  74c:66 66 48 e8 cc fe ff data16 data16 callq 620 <__tls_get_addr@plt> \  753:ff
01:16:14  What's all this? What are those data16s doing?
01:16:52  Oh, wait, I just needed -fPIC to get this behavior, not -shared.
01:17:57  Is this just some kind of padding?
01:24:30  Or space for patching something? (Don't know, just a guess.)
01:25:06  I also don't quite get bwhy it needs a call.
01:26:14  There was a time when GCC defaulted to using "rep ret" when it needed to emit a return instruction that was also the target of a branch, because of a branch predictor bug on AMD processors.
01:26:54  Presumably faster than "nop; ret".
01:26:57  `1 echo '__thread long x; long foo(void) { return x; }' > /tmp/test.c && gcc -shared -fPIC -O2 /tmp/test.c -S -o /dev/stdout
01:27:00  1/2:.file"test.c" \ .text \ .p2align 4,,15 \ .globlfoo \ .typefoo, @function \ foo: \ .LFB0: \ .cfi_startproc \ subq$8, %rsp \ .cfi_def_cfa_offset 16 \ .byte0x66 \ leaqx@tlsgd(%rip), %rdi \ .value0x6666 \ rex64 \ call__tls_get_addr@PLT \ movq(%rax), %rax \ addq$8, %rsp \ .cfi_def_cfa_offset 8 \ ret \ .cfi_endproc \ .LFE0: \ .sizefoo, .-foo \ .globlx \ .section.tbss,"awT",@nobits \ .align 8 \ .typex, @object \ .sizex,
01:27:19  Even -S explicitly generates ".value 0x6666".
01:29:08  For the call, I think a bunch of the @PLT stuff involves calls that get patched out on first call, so maybe it's space for that. Don't remember any of the details though.
01:29:46  [[SIG]]  https://esolangs.org/w/index.php?diff=66206&oldid=19939 * YamTokTpaFa * (+42) 
01:30:06  It's the same deal with -fno-plt
01:30:19  (Good gcc flags I found out about recently. I think I'll compile all my program with -fno-plt now.)
01:30:38  what's it do
01:31:36  Compiles dynamic linker calls to "callq *offset(%rip)"
01:31:45  Where offset is an offset into the GOT.
01:31:58  It means you can't do lazy loading, but lazy loading doesn't seem great to me anyway.
01:32:02  yeah
01:32:15  and it means you always have an indirect call
01:32:17  (Actually you probably could do lazy loading if you really wanted to.)
01:32:19  shachaf: Well, maybe TLS involves some of the same kind of shenanigans, it's a TLA as well.
01:32:20  rather than a direct call and a direct jump?
01:32:23  But the PLT has an indirect call anyway!
01:32:27  does it?
01:32:33  Yes. It has the same call.
01:32:36  doesn't it self-modify to remove it
01:32:38  So you get a direct call *and* an indirect call.
01:32:46  Nope, it's scow.
01:33:01  Or... Hmm, does it?
01:33:12  I'm sure it involved self-modification *somewhere*.
01:33:19  OK, I should double-check.
01:33:35  I'm pretty sure the PLT doesn't turn +w at runtime, though.
01:34:14  Maybe it used to self-modify, but then security happened.
01:34:23  Stacks used to be executable too.
01:34:27  But this is the amd64 ABI. It's all different for 86 anyway.
01:34:29  x
01:34:31  if you use ld -z now, or whatever
01:34:37  then it should do the self modification before main()
01:34:38  maybe?
01:34:48 * kmc execute fizzie's stack
01:35:19  fungot: You're all about stacks and stack stacks, right? Are they executable?
01:35:20  fizzie: the problematic part is that no annotations are produced/ maintained for expanded syntax form of f, and y
01:36:03  kmc: It doesn't look that way.
01:36:07  ok
01:36:14  Even on the second call, even with -z now.
01:36:18  fat stacks of cache
01:36:21  ok
01:36:23  welp
01:36:23  At least based on gdbing it up.
01:36:48  I think it's probably fine and no one should expect dynamically linked calls to be extremely efficient.
01:37:00  Instead, they should stop dynamic linking, and only use it where necessary.
01:37:20  God Damn these Bampires
01:38:21  I think this is reasonable, because no one expects Programming Language Theory types to generate efficient code.
01:43:46 -!- Sgeo_ has joined.
01:44:41  If that's definitely never writable, then I don't know what those extra prefix bytes could be for. Something something alignment performance?
01:45:27  Honestly I'd expect that explanation only between functions and branches, not in bytes that are actually executed.
01:45:34  It could be that the linker could want that extra space at link time, in some cases?
01:46:19  But I don't know how that would work.
01:46:26 -!- Sgeo has quit (Ping timeout: 240 seconds).
01:47:56 -!- tromp_ has quit (Remote host closed the connection).
01:48:20  Why is __tls_get_addr a function call, anyway?
01:50:51  `1 echo '__thread long x; long foo(void) { return x; }' > /tmp/test.c && gcc -shared -fPIC -Os /tmp/test.c -S -o /dev/stdout
01:50:53  1/2:.file"test.c" \ .text \ .globlfoo \ .typefoo, @function \ foo: \ .LFB0: \ .cfi_startproc \ subq$8, %rsp \ .cfi_def_cfa_offset 16 \ .byte0x66 \ leaqx@tlsgd(%rip), %rdi \ .value0x6666 \ rex64 \ call__tls_get_addr@PLT \ movq(%rax), %rax \ popq%rdx \ .cfi_def_cfa_offset 8 \ ret \ .cfi_endproc \ .LFE0: \ .sizefoo, .-foo \ .globlx \ .section.tbss,"awT",@nobits \ .align 8 \ .typex, @object \ .sizex, 8 \ x: \ .zero8 \
01:51:12  It generates that even with -Os so I doubt it's an instruction alignment thing.
02:01:49  https://www.fsfla.org/~lxoliva/writeups/TLS/RFC-TLSDESC-x86.txt might explain it. AFAICT it describes a proposal that looks different, but it also talks about the "existing ABI" which looks like that.
02:03:10  Aha, https://akkadia.org/drepper/tls.pdf
02:03:17  Page 22.
02:04:35 -!- Sgeo_ has quit (Read error: Connection reset by peer).
02:06:00 -!- Sgeo has joined.
02:09:26  Yes, was just reading that.
02:09:52  "The call instruction has to be preceeded by two data16 prefixes and one rex64 prefix to increase the total size of the whole sequence to 16 bytes."
02:10:39  IIRC, Intel specifically says that sort of thing is not allowed.
02:10:50  What sort of thing?
02:11:53  Well, prefix abuse. Or it definitely says that about some classes of that sort of thing, not necessarily all of it.
02:12:03  fizzie: pretty sure the reason is because old nephelem CPUs would fall to a decoding stall if you mucked with prefixes like that. (Source: using a nephelem CPU right now)
02:13:02  "Other use of the 66H prefix is reserved; such use may cause unpredictable behavior."
02:13:36  Something about the REX prefix specifies that 0x66 is ignored when used with REX, though.
02:16:22  hmm
02:16:25  ok
02:16:37  the code they show may actually play nice on nephalem
02:16:40  which suprises me
02:17:03  it's under 6 instrs in 16 bytes, perfect size for the nephalem decoder
02:17:14  Man, this "large code model" where your text segment is bigger than 2GB sounds like a nightmare.
02:17:25  of course..
02:17:27  yea
02:17:33  that code also does trigger the length changing prefix penalty
02:17:33  Presumably you should be banned from using computers if that ever happens.
02:18:05  presumably twice
02:18:14  wasting 12 cycles because of the two 66h prefixes
02:18:44 -!- tswett[m] has quit (Read error: Connection reset by peer).
02:19:03 -!- ivzem[m] has quit (Remote host closed the connection).
02:19:12 -!- xylochoron[m] has quit (Read error: Connection reset by peer).
02:19:12 -!- wmww has quit (Read error: Connection reset by peer).
02:19:14 -!- Camto[m] has quit (Remote host closed the connection).
02:19:17  What's the reason for making that sequence 16 bytes?
02:19:17  Yes, there's a bit that says "if a 66H prefix is used with prefix (REX.W = 1), 66H is ignored". Although I think you could reasonably argue that's not meant to say you could put 66H in wherever.
02:19:50  The document was too hard to read, I was thinking it has something to do with those special relocation types under specific circumstances needing that space.
02:19:58  Think I'll sleep instead, though.
02:21:18  shachaf: seems to be the decoder width for a lot of modern CPUs
02:21:50  so it helps with some decoding stalls to make it fit
02:24:08  I'm not quite sure why this is a function call at all.
02:24:45  Looking at the implementation in musl, it seems to claim this function uses things that are part of the public ABI?
02:26:26 -!- Camto[m] has joined.
02:47:28 -!- xylochoron[m] has joined.
02:47:28 -!- wmww has joined.
02:47:28 -!- tswett[m] has joined.
02:47:35 -!- ivzem[m] has joined.
02:50:54 -!- tswett[m] has quit (*.net *.split).
02:50:54 -!- Camto[m] has quit (*.net *.split).
02:50:54 -!- Taneb has quit (*.net *.split).
02:50:54 -!- zemhill_________ has quit (*.net *.split).
02:51:12 -!- Camto[m] has joined.
02:56:18 -!- tswett[m] has joined.
02:56:18 -!- Taneb has joined.
02:56:18 -!- zemhill_________ has joined.
02:56:24 -!- tswett[m] has quit (Changing host).
02:56:24 -!- tswett[m] has joined.
03:16:21 -!- tromp has joined.
03:17:36 -!- tromp_ has joined.
03:18:58 -!- tswett[m] has quit (*.net *.split).
03:18:58 -!- Taneb has quit (*.net *.split).
03:18:58 -!- zemhill_________ has quit (*.net *.split).
03:19:16 -!- tswett[m] has joined.
03:21:14 -!- tromp has quit (Ping timeout: 276 seconds).
03:22:32 -!- tromp_ has quit (Ping timeout: 276 seconds).
03:24:19 -!- Taneb has joined.
03:24:19 -!- zemhill_________ has joined.
03:34:48 -!- j-bot has quit (Ping timeout: 244 seconds).
03:38:14 -!- hppavilion[1] has quit (Remote host closed the connection).
03:38:43 -!- hppavilion[1] has joined.
04:05:05 -!- Frater_EST has joined.
04:35:06 -!- Lord_of_Life has quit (Ping timeout: 246 seconds).
04:37:30 -!- Lord_of_Life has joined.
05:28:11 -!- Sgeo_ has joined.
05:30:50 -!- Sgeo has quit (Ping timeout: 240 seconds).
05:31:42 * ski . o O ( Upper and lower case  )
05:40:54  ski: oh wow
05:43:47  (I don't think I've ever questioned the etymology of those phrases.)
05:45:28  ski: Now does that mean that shift-o (for example) can produce any of A, B, H or I?
06:32:07 -!- hppavilion[1] has quit (Ping timeout: 268 seconds).
06:36:30  but the etymology of shifting is separate.. :p
06:36:58  well, AFAIK at least
06:45:51  FireFly: Yeah different (and more advanced) technology :)
06:46:40  But that was easy for me because I did play with a mechanical type writer as a kid.
07:01:14 * FireFly nods
07:10:13  since I accidentally read about that a couple of months ago I can smugly pretend I always knew about upper and lower case
07:13:51  olsner: please do
07:14:24  hi olsner
07:14:30  long time nolsner
07:14:41  `? olsner
07:14:44  olsner seems to exist at least. He builds all his esolangs in diesel engines. His poetry's alphanumeric.
07:16:19  hmm, amend to "alphanumeric, both lower and upper case"
07:16:26  or not?
07:18:22 -!- olsner has quit (Ping timeout: 246 seconds).
07:18:39 -!- tromp has joined.
07:28:30 -!- olsner has joined.
08:13:44 -!- imode has quit (Ping timeout: 276 seconds).
08:22:47 -!- imode has joined.
08:28:40 -!- imode has quit (Ping timeout: 268 seconds).
08:41:49 -!- wib_jonas has joined.
08:43:11  int-e: I'm getting old. apparently there are now people who haven't played with mechanical typewriters while they were young.
08:43:39  wib_jonas: I didn't get to play with a mechanical typewriter until I was 18
08:45:58  wib_jonas: I bet some of them have never even properly dialed a phone number
08:46:16  fizzie: it's more complicated than that. the intel docs hides some quite complicated rules for what prefix you can use for what instructions, when it doesn't change the meaning, when it means what the prefix normally means, when it changes to a different instruction, and when the combination is reserved in which case the cpu can either raise an
08:46:16  undefined instr exception or ignore the prefix,
08:46:24  (and by "some" I mean "most")
08:46:43  Or tuned a radio.
08:47:17  and they sometimes use reserved ignored combos to add new meanings to the prefixes, like how the rep prefixes can now mean a probably or improbably branch or a transactional memory prefix,
08:47:46  and the optimization manuals also say some things about what's slow and fast to decode, and this specifically differs between intel and amd a lot.
08:47:53  Oh wow, this conversation is making me feel young
08:48:33  int-e: what? you can still tune radios, you just usually issue the commands digitally via buttons or fake dials that work all digital
08:49:31  wib_jonas: it's just not the same without fading, and temperature/moisture sensitive capacitors.
08:49:36  dialing a phone number is sort of a better example, but that's also a discriminator for younglings. I have made a phone call from a phone where the only option was to ask the number from an operator, because there was no dial.
08:50:29  only a few times during my life, because at home and basically everywhere in town we had dialer phones and automated phone switch stations, so I only had to call through an operator if I wanted a reverse cost call
08:50:47  (tbf I really grew up with frequency modulation which did away with most of the fading issues already)
08:51:47  int-e: sure, but even on FM we get a lot of artifacts from it being analog, especially noticable if you are in a place with poor reception and the amount of noise changes depending on which direction you're holding the wire of the headphones that function as an antenna
08:54:32  But mostly I'm interested in this because of outdated phrases that are still in use as idioms. Dialing a phone number, hanging up on somebody, tuning into a radio station (at least in the form of "tune in again tomorrow")...
08:55:41  Hmm, now I'm not sure what the origin of "tune" is.
08:55:56  heck, these days there are even messed up android phones where, after typing your PIN code on a touchscreen, if you touch the # button on the touchscreen, instead of accepting your entry, it erases the last digit from it. 
08:56:05  I don't understand interfaces
08:56:11  shachaf: adjusting a frequency is called tuning in music as well
08:56:32  Was that the origin?
08:56:33 -!- cpressey has joined.
08:56:38  Variant of "tone"
08:56:42  They're two different kinds of frequencies.
08:56:59  You're tuning a resonance circuit to the right frequency.
08:57:37  I think it was used as "adjusting for optimum perfomance" as an extension of the music term
08:57:55  Typically using a variable capacitor (which stand out when you take apart an old radio: https://en.wikipedia.org/wiki/Variable_capacitor )
08:59:21  Kids these days tune machine-learning algorithms instead of radios
08:59:24  Oh the diagram on that page totally ignores the spiral nature of the blades in the rotor...
09:01:54  It almost feels like I grew up in the previous century ;-)
09:03:40  shachaf: I couldn't sleep last night and I wrote a page trying to explain what I was talking about yesterday re semantics.
09:03:47  But I think I can summarize it.
09:03:56  I don't know how the radio hardware actually works, I only know it from a user's perspective
09:05:05  radios were reliable enough in my childhood that we no longer needed to service them, like replace vacuum tubes and capacitors (they didn't have vacuum tubes anymore), so I didn't have to know the details
09:05:16  OK, maybe I can't summarize it
09:06:01  wib_jonas: there was a reason why I wrote "take apart" rather than "repair" ;-)
09:06:27  Semantics?
09:06:32  shachaf: Never mind
09:06:42  shachaf: Good luck on your language.
09:07:05  Uh oh.
09:07:10  wib_jonas: There was a mechanical side to this as well of course... tuning knobs were liable to break.
09:07:18  I can't tell whether I said something mega-rude just now.
09:08:37  shachaf: No, you didn't.
09:09:06  I just feel like there's something I'd like to communicate to you, but also feel like Sisyphus
09:09:25 -!- tromp has quit (Remote host closed the connection).
09:09:40  No, not quite Sisyphus.
09:09:46  Getting my metaphors mixed up.
09:09:58  Feels like pushing water uphill, maybe that's it.
09:10:27  I feel like I'm eating a yoghurt
09:10:48  Taneb: Are you eating a yoghurt?
09:10:51  int-e: yes
09:10:57  How did you know?
09:10:57  Also, I have to solve a horrible problem with time zones, and it's burning a hold in my head
09:11:04  Taneb: Then that seems to be no reason for concern.
09:11:13  I have a horrible problem with time zones.
09:11:18  int-e: thank goodness
09:11:24  The problem is that you're always here when I should be asleep?
09:11:37  cpressey: the thing to remember with time zones, is that there's four simultaneous days in a single rotation of the time cube
09:11:41  Taneb: Of course you shouldn't take my word for it. I'm just a stranger on the Internet.
09:12:43  You're just a stranger on the Internet? Says who?
09:12:59  A stranger on the Internet. Duh!
09:13:22  int-e: I have met someone in person who claimed to be you
09:13:46  Taneb: Heh, that did happen.
09:14:14 -!- tromp has joined.
09:15:17  I didn't know int-e had so many impostors.
09:15:37  shachaf: Oh did you meet one of those?
09:15:47  cpressey: what is it burning? a _hold_ or a _hole_?
09:16:25  I didn't, no.
09:16:45  int-e has impostors? are they like evil twins?
09:16:56  Not at all.
09:17:13  Impostors don't have goatees to tell them apart from the original.
09:17:29  Impostors might also have different birthdays
09:17:59  (although not necessarily)
09:18:01  int-e: you can't tell them apart from the original because the original is evil too
09:19:23  Taneb: twins can be born on different days (close to midnight)
09:20:04  Taneb: correct. I told about how I want to make another similar language similar to Consumer Society, so that in one programs have properly nested braces and in the other they have properly matched brackets, and if you want to parse both, choosing according to which one is properly nested, the resulting union language has a syntax that is an
09:20:05  intrinsically ambiguous context-free language,
09:20:19  If twins are born on different days they're called siblings.
09:20:30  and these too languages are mutually evil sibling languages of each other, but in fact Consumer Society is significantly younger than its sibling.
09:20:58  shachaf: no, they're still twins if they were conceived close to each other but happen to be born across a day change
09:21:31  ""
09:21:31  Twins can be born in different decades, as happened as 2009 changed to 2010 and a pair of Florida twins came into the world on each side of the dividing line.
09:21:46  What if one twin is born during daylight savings and the other isn't
09:22:00  Why, Firefox, do you put extra newlines at the beginning of a paste...
09:22:02  wib_jonas: Yes, they're still twins
09:22:18  s/paste/selection/
09:22:29  The one delivered second is younger than the other one by an hour
09:23:53  cpressey: Hmm it could be more interesting when switching back from DST... old twin born 2:59am, young twin 2:01am, same day.
09:24:26  (or whenever the switch happens exactly)
09:25:00  cpressey: yes. and if you travel from america to europe, you become six hours older, but you count as three year older for drinking age purposes
09:27:37  int-e: You could also cross a time zone border presumably.
09:28:11  Admittedly temporal time zone borders are much sketchier than spacial ones.
09:28:25  Hmm, with time zone borders it's possible for the older twin to have the later birthday
09:29:29  `grWp twin
09:29:31  ​*:Twinkle, twinkle, little star! \ ☆:Twinkle, twinkle, little star! \ ☾_:☾_ is moon_'s lawful twin. He's banned in the IRC RFC for being an invalid character. He sometimes eats papers. \ boorjan:boorjan is oerjan's uneducated twin. \ c#:C Pound is Java's good twin. \ myname:myname is not your name. You don't know what they are doing. Or you are doing. Or am I? He is Perl's evil twin brother. \ orin:orin is oren's evil twin, stalking him from the o
09:29:32  shachaf: that's not practical though, because there are few places convenient for births that are split among multiple timezones
09:30:17  `2 grWp twin
09:30:26  2/3: other side of the international date line. \ örjan:Örjan is the diæresed twin. He will punctuate your vöẅëls, and maybe a few other unsuspecting letters. \ ørjan:Your pal Ørjan is oerjan's good twin. He's banned in the IRC RFC for being an invalid character. Sometimes he publishes papers without noticing it. \ owrjan:owrjan is oerjan's wise twin. \ pico:pico is the useless twin of nano. \ sewerjan:sewerjan is oerjan's extremely poor twin. \
09:31:17 -!- ArthurStrong has joined.
09:31:31  wib_jonas: I think births en route to hospitals happen sometimes.
09:31:32  wib_jonas: hmm, certain places in the US I think
09:31:35  https://www.theepochtimes.com/supermom-delivers-her-own-twins-in-moving-car-while-giving-husband-directions-to-the-hospital_2817854.html
09:31:53  Presumably you could cross a border while hurrying to a hospital.
09:33:04  Taneb: yeah, they have weird timezones, especially near semi-autonomous native american territories
09:33:37  I'm not saying that it's impossible, it's just usually inconvenient for the pregnant mother
09:33:53  Birth in general is quite an inconvenient process, I hear.
09:34:29  `n
09:34:31  1/3:*:Twinkle, twinkle, little star! \ ☆:Twinkle, twinkle, little star! \ ☾_:☾_ is moon_'s lawful twin. He's banned in the IRC RFC for being an invalid character. He sometimes eats papers. \ boorjan:boorjan is oerjan's uneducated twin. \ c#:C Pound is Java's good twin. \ myname:myname is not your name. You don't know what they are doing. Or you are doing. Or am I? He is Perl's evil twin brother. \ orin:orin is oren's evil twin, stalking him from the
09:34:39  Hmm?
09:34:49  How did that happen?
09:34:54  `2 grWp twin
09:34:57  2/3: other side of the international date line. \ örjan:Örjan is the diæresed twin. He will punctuate your vöẅëls, and maybe a few other unsuspecting letters. \ ørjan:Your pal Ørjan is oerjan's good twin. He's banned in the IRC RFC for being an invalid character. Sometimes he publishes papers without noticing it. \ owrjan:owrjan is oerjan's wise twin. \ pico:pico is the useless twin of nano. \ sewerjan:sewerjan is oerjan's extremely poor twin. \
09:34:58  shachaf: yeah, because it usually comes with a tight deadline that's not announced early enough, so the mother and all the helpers don't get an early enough warning for when they have to prepare for birth. it's really rude I think. 
09:34:59  `n
09:35:01  1/3:*:Twinkle, twinkle, little star! \ ☆:Twinkle, twinkle, little star! \ ☾_:☾_ is moon_'s lawful twin. He's banned in the IRC RFC for being an invalid character. He sometimes eats papers. \ boorjan:boorjan is oerjan's uneducated twin. \ c#:C Pound is Java's good twin. \ myname:myname is not your name. You don't know what they are doing. Or you are doing. Or am I? He is Perl's evil twin brother. \ orin:orin is oren's evil twin, stalking him from the
09:35:04  `n
09:35:08  3/3:twint-e:twint-e is int-e's stupid twin. He sometimes hijacks int-e's keyboard and spouts nonsense. \ typoerjan:typoerjan is oerjan's clumsy twin. \ אrjan:אrjan is oerjan's first uncountable twin. He's inconsistent with the ZFC axioms.
09:35:16  That seems like a bug.
09:35:27  `? bug
09:35:31  bug? ¯\(°​_o)/¯
09:35:38  `grWp feature
09:35:40  ​ä:Ä is a Swedish geographical feature. \ degenerate:Degenerate things are those that have been featured on the Ellen DeGeneres Show. The subjects of this sui degeneris program include spaghoti sauce, talking spheres of zero volume, and watches without mustard. \ eyebrow:Eyebrows are Taneb's most notable feature. \ intercal:INTERCAL has excellent features for modular program for the enterprise market. \ java:Java is a programming-language shaped collec
09:36:21  `cat bin/n
09:36:22  line="${1-$(cat /hackenv/tmp/spline)}"; len="$(awk 'END{print NR}' /hackenv/tmp/spout)"; echo -n "$line/$len:"; sed -n "${line}{p;q}" /hackenv/tmp/spout; echo "$((line /hackenv/tmp/spline
09:36:24  in normal jobs, when you have to stand by day and night to react quickly to emergencies, either they pay you lots of money for that, or at least people of the profession occasionally complain loudly why the government cheats them out of the money they are awed. but mothers usually don't get that sort of wage even if they have to stand by all the
09:36:24  time just in case there's an urgent birth.
09:39:48  I don't get it.
09:40:21  `` line=1; len="$(awk 'END{print NR}' /hackenv/tmp/spout)"; echo -n "$line/$len:"; echo "$((line 1/3:2
09:40:29  `` line=2; len="$(awk 'END{print NR}' /hackenv/tmp/spout)"; echo -n "$line/$len:"; echo "$((line 2/3:3
09:40:36  `` line=3; len="$(awk 'END{print NR}' /hackenv/tmp/spout)"; echo -n "$line/$len:"; echo "$((line 3/3:1
09:40:56  `n 1
09:40:57  1/3:*:Twinkle, twinkle, little star! \ ☆:Twinkle, twinkle, little star! \ ☾_:☾_ is moon_'s lawful twin. He's banned in the IRC RFC for being an invalid character. He sometimes eats papers. \ boorjan:boorjan is oerjan's uneducated twin. \ c#:C Pound is Java's good twin. \ myname:myname is not your name. You don't know what they are doing. Or you are doing. Or am I? He is Perl's evil twin brother. \ orin:orin is oren's evil twin, stalking him from the
09:41:04  `n
09:41:06  3/3:twint-e:twint-e is int-e's stupid twin. He sometimes hijacks int-e's keyboard and spouts nonsense. \ typoerjan:typoerjan is oerjan's clumsy twin. \ אrjan:אrjan is oerjan's first uncountable twin. He's inconsistent with the ZFC axioms.
09:41:10  What's all this?
09:41:34  shachaf: I just use | tail -n+4 and stuff like that for greps
09:41:37  `n 1
09:41:39  1/3:*:Twinkle, twinkle, little star! \ ☆:Twinkle, twinkle, little star! \ ☾_:☾_ is moon_'s lawful twin. He's banned in the IRC RFC for being an invalid character. He sometimes eats papers. \ boorjan:boorjan is oerjan's uneducated twin. \ c#:C Pound is Java's good twin. \ myname:myname is not your name. You don't know what they are doing. Or you are doing. Or am I? He is Perl's evil twin brother. \ orin:orin is oren's evil twin, stalking him from the
09:41:41  for greps through HackEso 
09:41:53  `cat tmp/spline
09:41:55  2
09:41:55  I don't trust all these fancy scripts
09:42:10  `n
09:42:13  3/3:twint-e:twint-e is int-e's stupid twin. He sometimes hijacks int-e's keyboard and spouts nonsense. \ typoerjan:typoerjan is oerjan's clumsy twin. \ אrjan:אrjan is oerjan's first uncountable twin. He's inconsistent with the ZFC axioms.
09:42:16  `n 1
09:42:18  1/3:*:Twinkle, twinkle, little star! \ ☆:Twinkle, twinkle, little star! \ ☾_:☾_ is moon_'s lawful twin. He's banned in the IRC RFC for being an invalid character. He sometimes eats papers. \ boorjan:boorjan is oerjan's uneducated twin. \ c#:C Pound is Java's good twin. \ myname:myname is not your name. You don't know what they are doing. Or you are doing. Or am I? He is Perl's evil twin brother. \ orin:orin is oren's evil twin, stalking him from the
09:42:22  `n 2
09:42:23  2/3: other side of the international date line. \ örjan:Örjan is the diæresed twin. He will punctuate your vöẅëls, and maybe a few other unsuspecting letters. \ ørjan:Your pal Ørjan is oerjan's good twin. He's banned in the IRC RFC for being an invalid character. Sometimes he publishes papers without noticing it. \ owrjan:owrjan is oerjan's wise twin. \ pico:pico is the useless twin of nano. \ sewerjan:sewerjan is oerjan's extremely poor twin. \
09:42:37  How are those different?
09:42:40  `n 1
09:42:42  1/3:*:Twinkle, twinkle, little star! \ ☆:Twinkle, twinkle, little star! \ ☾_:☾_ is moon_'s lawful twin. He's banned in the IRC RFC for being an invalid character. He sometimes eats papers. \ boorjan:boorjan is oerjan's uneducated twin. \ c#:C Pound is Java's good twin. \ myname:myname is not your name. You don't know what they are doing. Or you are doing. Or am I? He is Perl's evil twin brother. \ orin:orin is oren's evil twin, stalking him from the
09:42:45  `cat /hackenv/tmp/spline
09:42:46  2
09:42:59  line="${1-$(cat /hackenv/tmp/spline)}"
09:43:09  What am I missing?
09:43:46  hmm
09:44:05  something to do with the two-phase commit logic in hackeso?
09:44:17  Oh, oh, right!
09:44:31  Why did that never come up before?
09:44:44  `hurl bin/n
09:44:46  https://hack.esolangs.org/repo/log/tip/bin/n
09:45:01  dunno, but I did see a few days ago that hackeso runs all my writes to /hackenv/tmp twice
09:45:20  no clue, the script seems unchanged since 2017
09:45:53  Of course it could write extra state to tmp/ to track this.
09:45:58  Is there a good solution?
09:46:35  ``` mkdir /hackenv/tmp/0KpPun-ahPnp
09:46:35  we should ask fizzie what changed first, maybe?
09:46:37  mkdir: cannot create directory '/hackenv/tmp/0KpPun-ahPnp': File exists
09:46:43  ``` mkdir /hackenv/tmp/I3ZdY_oWgTHb
09:46:44  mkdir: cannot create directory '/hackenv/tmp/I3ZdY_oWgTHb': File exists
09:46:56  ^ tries to create the directory twice, which is why I get the EEXISTS the second tiem
09:47:55  whereas I assumed that if I only write to tmp, not elsewhere, then usually it's only ran once, unless some other statement is also running
09:48:57  fizzie: Do you know what changed?
09:49:14  shachaf: or maybe we should check the logs ;)
09:49:34  (Q: did this ever work?)
09:50:16  `2 grwp dual
09:50:20  I wrote this thing originally and I'm pretty sure it worked then.
09:50:30  2/3:he Matrix, eventually gaining increased individuality and becoming a threat to the Machines themselves. \ nundrum:A nundrum is the categorical dual of a conundrum: a problem whose solution is useless. \ palindrome:A palindrome is a word that remains the same if you take it to the mirror dimension, and then take each individual letter back to the normal dimension separately. \ sober space:Sober spaces are the dual of Stoned spaces. Taneb invented them.
09:50:34  `n
09:50:37  1/3:block device:Block devices are a concession made in Unix to make raw hard disks and magnetic tape have a similar interface to regular files and terminals. Since magnetic tapes can't write individual bytes, only entire blocks, the interface isn't exactly the same, thus the dreaded dd obs= option was born. \ comonad:Comonads are just monads in the dual category. They are hard to get into. \ elrond:Elrond is a rogue program originally created to police t
09:51:14  It seems to have worked as recently as last month.
09:51:20  yeah still worked in August
09:51:49  ``` hg log -T "{date|isodate}\n" # and we didn't write anything in the versioned parts
09:51:51  2019-09-13 12:14 +0000 \ 2019-09-13 12:14 +0000 \ 2019-09-13 12:13 +0000 \ 2019-09-13 11:19 +0000 \ 2019-09-13 11:17 +0000 \ 2019-09-13 11:15 +0000 \ 2019-09-13 10:44 +0000 \ 2019-09-13 10:43 +0000 \ 2019-09-13 10:13 +0000 \ 2019-09-13 10:09 +0000 \ 2019-09-13 09:36 +0000 \ 2019-09-13 09:32 +0000 \ 2019-09-13 09:32 +0000 \ 2019-09-13 09:31 +0000 \ 2019-09-08 02:18 +0000 \ 2019-09-08 02:17 +0000 \ 2019-09-01 19:25 +0000 \ 2019-08-29 20:48 +0000 \ 2019-08-29
09:51:52  2019-08-14
09:53:08  Err, make that August 22nd
09:53:34  But with my understanding of the HackEso commit behavior, it shouldn't have worked before either.
09:53:35  That's the last working `n with more than two entries that I've found.
09:54:22  Shouldn't even one-entry `n have this issue?
09:54:23  I forgot why, but I did think that it only ran the command a second time if it actually detected a change.
09:54:28  Er, two-entry.
09:54:36  `5 w
09:54:41  1/1:mirth//Mirths are juvenile moths. They giggle a lot. \ 8/8/8/8/8/8/8/8//8/8/8/8/8/8/8/8 is an empty chess board in FEN. \ wisdoom//Wisdoom is realizing just too late how you could have avoided your demise. \ css//CSS are confusing style sheets. \ impomatic//impomatic never did anything weird enough to get into this database.
09:54:44  `5
09:54:45  shachaf: No, since the line number is set up by the `2 command?
09:54:47  1/2:561)  It's a bit like a regular monowheel, except when you brake too hard, instead of you going around and around inside the wheel, the (1100lb) wheel rolls over you. \ 488)  "Do a sea monster while whatever." \ 223)  $ perl -e '/? <-- HERE/'     Quantifier follows nothing in regex; marked by <-- HERE in m/? <-- HERE  <-- HERE/ at -e line 1. \ 215)  !bfjoust test (++-)*1000000   probably will suck   Scor
09:54:49  `cat bin/2
09:54:50  ​\` "$@" |& sport 2
09:54:52  `n
09:54:54  1/2:561)  It's a bit like a regular monowheel, except when you brake too hard, instead of you going around and around inside the wheel, the (1100lb) wheel rolls over you. \ 488)  "Do a sea monster while whatever." \ 223)  $ perl -e '/? <-- HERE/'     Quantifier follows nothing in regex; marked by <-- HERE in m/? <-- HERE  <-- HERE/ at -e line 1. \ 215)  !bfjoust test (++-)*1000000   probably will suck   Scor
09:55:01  Yep, it doesn't even go to the second page.
09:55:15  (Or rather it wraps around.)
09:55:16  `cat bin/5
09:55:18  cmd="${1-quote}"; \`^ 5 "$cmd"
09:55:28  `cat bin/`^
09:55:30  ​[[ $# == 2 ]] || { echo "Usage: $0 n cmd" >&2; exit 2; }; for ((i=0; i < $1; i++)); do \` "$2"; done | sport
09:55:40  Ooh, that may be a thing.
09:55:49  Writes to tmp/ should normally not be executed twice.
09:56:03  The way the logic goes, if the repository is clean after the command ran once, that's it.
09:56:09  Oh, right, it only executes twice if it detects a write.
09:56:43  Okay, there's actually a race condition there, in that a concurrent command may make a non-write operation also run twice. Normally that's benign, but with tmp/ it might cause issues. It's going to be pretty rare though.
09:56:57  shachaf: Err, sorry. I didn't think that through.
09:57:04  My guess is there's something in the working directory that it can't commit for whatever reason, so it permanently thinks the repository is dirty.
09:57:10  I'll have a look.
09:57:26  `` hg status
09:57:43  EGYj6LpQgFKM: Permission denied \ o6M9ot4UJDYs: Permission denied
09:57:48  fizzie: can you make it give you logs so you can exclude concurrent commands in private message?
09:58:12  funny file names
09:58:20  `` ls -l EGYj6LpQgFKM
09:58:22  ls: cannot access 'EGYj6LpQgFKM/s': Permission denied \ total 0 \ d????????? ? ? ? ?            ? s
09:58:23  althoguh we should see something in the hg log if that happens usually, but perhaps not if the command is particularly sneaky and gives no changes to the versioned part the second time or smoething
09:58:31  int-e: sorry, part of that was me
09:58:35  `ls
09:58:36  ``` ls -aF
09:58:38  ​./ \ ../ \ .hg/ \ .hg_archival.txt \ .hgignore \ EGYj6LpQgFKM/ \ bin/ \ canary \ emoticons/ \ esobible/ \ etc/ \ evil/ \ f| \ factor/ \ good/ \ hw/ \ ibin/ \ interps/ \ izash.c \ karma \ le/ \ lib/ \ misle/ \ o6M9ot4UJDYs/ \ paste/ \ ply-3.8/ \ quines/ \ quinor/ \ quotes \ share/ \ src/ \ test2 \ testfile \ tmflry/ \ tmp/ \ wisdom/
09:58:39  bin \ canary \ EGYj6LpQgFKM \ emoticons \ esobible \ etc \ evil \ f \ factor \ good \ hw \ ibin \ interps \ izash.c \ karma \ le \ lib \ misle \ o6M9ot4UJDYs \ paste \ ply-3.8 \ quines \ quinor \ quotes \ share \ src \ test2 \ testfile \ tmflry \ tmp \ wisdom
09:58:45  I mistakenl created some files to hackenv rather than tmp
09:58:54  ``` rmdir -v EGYj6* o6M9o
09:58:56  rmdir: failed to remove 'EGYj6LpQgFKM': Directory not empty \ rmdir: failed to remove 'o6M9o': No such file or directory \ rmdir: removing directory, 'EGYj6LpQgFKM' \ rmdir: removing directory, 'o6M9o'
09:59:03  `ls -ld EGYj6LpQgFKM
09:59:04  ``` rmdir -vp EGYj6*/s o6M9o*/s
09:59:05  ls: invalid option -- ' ' \ Try 'ls --help' for more information.
09:59:06  rmdir: failed to remove 'EGYj6*/s': No such file or directory \ rmdir: failed to remove 'o6M9o*/s': No such file or directory \ rmdir: removing directory, 'EGYj6*/s' \ rmdir: removing directory, 'o6M9o*/s'
09:59:09  `` ls -ld EGYj6LpQgFKM
09:59:11  drw-r-xr-x 3 1000 1000 4096 Sep 16 14:43 EGYj6LpQgFKM
09:59:19  no x for user, great
09:59:26  ``` find EGYj6* o6M9o*
09:59:27  find: 'EGYj6*': No such file or directory \ find: 'o6M9o*': No such file or directory
09:59:27  I cleaned them up from the outside.
09:59:44  int-e: yeah, I was trying to test something about permissions when ais523 talked about them
09:59:46  sorry
09:59:51  I should have done it in tmp but I messed up
09:59:58  then didn't notice that I didn't revert them properly
10:00:05  let me check the hg log if there's any other remain
10:01:52  what the...
10:01:57  wib_jonas: I don't think it's a huge deal really... it only seems that way because it manifested in this terribly obscure way.
10:02:00  did you just rewrite version history?
10:02:13  No, those never got committed.
10:02:17  Because of the no-x thing.
10:02:23  They just stuck around in the work directory.
10:02:31  int-e: yeah, but I did know that I messed up and apparently didn't pay enough attention to clean them up
10:02:42  fizzie: who, hackeso does that? interesting
10:03:03  REX has WRXB bits
10:03:17  Clearly WRX should stand for write read execute, but what should B stand for?
10:03:35  bullying rights?
10:03:36 -!- Sgeo__ has joined.
10:05:11  shachaf: https://esolangs.org/logs/2019-08.html#lbV
10:05:34  shachaf: "base" since it extends the base register for modr/m or sib?
10:05:51  wib_jonas: Yes, I know what they actually stand for.
10:05:58  The cleanup logic is to run "hg status -rumad", remove anything mentioned in the output, then run "hg up -C" to get back to a clean state. But apparently hg will just print warnings into stderr about files/directories it can't access and ignore them otherwise, so they never get either committed or cleaned.
10:06:05  (I'm guessing from "This 1-bit value is an 'inverted' extension to the MODRM.rm field or the SIB.base field.")
10:06:06  (You told me the other day, and also it became clear once I implemented addressing modes.)
10:06:43 -!- Sgeo_ has quit (Ping timeout: 268 seconds).
10:06:45  fizzie: I guess that sort of makes sense for normal version control
10:06:52  it's just strange in hackeso's context
10:06:56  Yes, R extends the "reg" register (or the register in the opcode), X extends the index registers, and B extends the base register.
10:07:04  fizzie: can you remind me why there are two phases in the first place?
10:07:17  int-e: To allow commands that don't write run concurrently.
10:07:27  ah
10:07:40  (It obtains an exclusive lock only for the second phase.)
10:08:02  `` hg status -rumad
10:08:11  TBH, it's probably more trouble than it's worth, but that's the way it was written and anyway it's kind of an #esoteric thing.
10:08:16  No output.
10:08:26  Does it handle the newline-in-filename thing I was talking about a while ago?
10:08:26  right. it's much better than in jevabot, where if you run two commands in the same context simultaneously, then the changes of one that finishes first will be ignored, even if the second one doesn't write anything
10:08:28  fizzie: makes me wonder whether it would be worthwhile to detect whether there was an intervening command at all
10:08:42  and jevalbot doesn't currently offer any way to override this
10:08:53  shachaf: what newline-in-filename thing?
10:09:13  int-e: it does normally try to detect that
10:09:19  or so I think
10:09:32  wib_jonas: apparently not
10:10:44  int-e: something seems wrong in the logic or the environment, because like fizzie said, it shouldn't rerun a command that edits tmp only
10:11:08  fizzie: But of course that's not entirely trivial either, to say the least.
10:11:10  wib_jonas: That was the effect of those non-accessible directories, it likely isn't doing that any more.
10:12:02  wib_jonas: well, the detection uses  hg status, and assumes that this can recognize its own pristine state.
10:12:18  wib_jonas: http://esolangs.org/logs/2014-11.html#lX6d
10:12:26  arguably the real problem here is that resetting to a pristine state results in a working directory that doesn't match the repo contents.
10:12:46  `? shaventions
10:12:48  Shaventions include: before/now/lastfiles, culprits, hog/{h,d}oag, le//rn, tmp/, mk/mkx, {s,p}led/sedlast, spore/spam/speek/sport/1/4/5, edit. Taneb did not invent them yet.
10:12:56  tmp/ was such a good shavention
10:13:07  shachaf: I think newlines are probably a problem. I don't think there's an equivalent for -0 for the status output.
10:13:09  We have funventions?
10:13:29  Imagine: Without tmp we wouldn't `1 or any of that.
10:13:39  "funiragvbaf"
10:13:49  int-e: Yeah, I'd really like a hg option to just "restore the working directory exactly as it was, including the removal of untracked files". There's a way to do that in git, I couldn't discover a way to do it in hg.
10:13:55  `` rot13 tanebvention
10:13:56  gnaroiragvba
10:14:15  wait, maybe the no-permission files were the ones that made hackeso think that there were changes in the versioneed part
10:14:19  (Anyway, it would probably still fail for things like "no permission for the user" even if it did exist.)
10:14:23  wib_jonas: Yes, that's not a "maybe".
10:14:34  wib_jonas: they were
10:14:37  fizzie: You could require write commands to run without tmp/
10:14:41  ``` mkdir /hackenv/tmp/-BE8SJn_Dnja
10:14:42  No output.
10:14:43  (By moving tmp/ out temporarily.)
10:14:52  ``` mkdir -v /hackenv/tmp/X81G5u_N85_r
10:14:53  mkdir: created directory '/hackenv/tmp/X81G5u_N85_r'
10:14:56  yeah, that was the problem
10:14:59  now it behaves sane
10:15:29  I do like the `mv tmp/foo . bug, though.
10:15:54  It would be nice to keep that one to trip up unsuspecting people who think computers don't hate them for some reason.
10:16:07  fizzie: hg status accepts a template too, with the -T argument
10:16:07  shachaf: they don't
10:16:28  shachaf: we're just making software too complex for our own good
10:16:36  I agree with that!
10:16:40  So complexity is the real enemy, not computers.
10:16:57  shachaf: Huh, there *is* a -0 option for 'hg status'.
10:17:20  I can make it use that and split on '\0' instead of '\n', and then it'll work on files with newlines in them.
10:17:28  fizzie: The logs I linked to point it out.
10:17:43  I guess that change never happened?
10:18:14  shachaf: I couldn't find the relevant bit in there, you linked to the gigantic monthly logs and the "scroll to anchor" isn't working somehow.
10:18:20  Oh.
10:18:39  ``` hg log -T '{rev}:{join(files,"\0,")}\0;' | tr \\0 % # joins files within a revision with "\0," and revisions with "\0;"
10:18:40  I download the monthly logs to grep through, so I didn't have the file name for the daily logs.
10:18:41  11941:bin/beat%;11940:bin/beat%;11939:bin/beat%;11938:share/whatis%;11937:bin/beat%;11936:bin/beat%;11935:bin/beat%;11934:bin/beat%;11933:bin/beat%;11932:bin/beat%;11931:share/whatis%;11930:share/whatis%;11929:share/whatis%;11928:share/whatis%;11927:bin/as-encoding%;11926:bin/as-encoding%;11925:wisdom/password%;11924:wisdom/can't%;11923:wisdom/can't%;11922:wisdom/can't%;11921:wisdom/can't%;11920:wisdom/can't%;11919:wisdom/can't%;11918:wisdom/can't%;11917:w
10:19:23  but why do you care about the specific output of hg status anyway?
10:20:43  Because I couldn't figure out a command to restore the working directory to a state matching the repository without manually removing files.
10:20:53  "hg up -C" definitely doesn't do it.
10:20:57  fizzie: crazy thought... would switching to git storage + hg-git do the trick?
10:21:07  int-e: eww
10:21:24  I could just migrate the repository to git altogether. Even Bitbucket has stopped supporting Mercurial.
10:21:27  (and using git for cleanup)
10:21:31  let me look at the hg manual
10:21:40  int-e: that would be worse
10:22:03  (the point of hg-git would be to keep all the existing hg magic working)
10:22:29  (and I don't know whether it's up to the task)
10:22:30  Well, it'd be a nice exercise to update all the tooling.
10:22:50  Although the 'h's in the names would become obsolete then.
10:23:00  int-e: yes, but... the git part would be harder to use
10:23:19  git is much easier to use than hg
10:23:36  hg might be better in some technical ways
10:23:38  shachaf: not for when you have strange untrusted data like filenames with newlines
10:23:45  shachaf: wait didn't you advocate mercurial not too long ago?
10:23:48  and probably not in the normal case either
10:23:58  int-e: no, I think that was ais523
10:24:21  int-e: I think it's likely to be better?
10:24:34  But the UI is much more confusing than git's.
10:24:50  I agree
10:24:59  but I think it's a matter of first exposure, largely
10:25:14  Yes. I'm just making a baseless assertion here, like people always make about hg.
10:25:25  https://bitbucket.org/blog/sunsetting-mercurial-support-in-bitbucket "Git adoption has grown over the years to become the default system" "almost 90% of developers use Git, while Mercurial is the least popular version control system with only about 3% developer adoption" "the percentage of new Bitbucket users choosing Mercurial has fallen to less than 1%"
10:25:29 -!- sftp has quit (Quit: leaving).
10:25:43  Got to follow the trends here.
10:26:06  The git model is very simple and I can always use a few commands to get it to do what I want.
10:26:32  shachaf: you don't want interesting enough things then
10:27:40  What do you recommend wanting?
10:27:41  mercurial is better... a) for hosting over dumb http and b) if you're confused about having a staging area between the working directory and the repo.
10:28:19  shachaf: try manipulating git repositories that pull data from a server repository into which other people commit and tag and history-edit in stupid ways
10:28:19  I don't think any of these systems are that great.
10:28:21  int-e: I've been told Mercurial is also better for extensibility.
10:29:00  fizzie: maybe. it's mostly python with some bits of C rather than mostly C with some bits of Perl
10:29:05  including bad filenames, inconsistent line endings, changing whitespace in existing source files extensively even when they don't modify the file, 
10:29:10 -!- sftp has joined.
10:29:12  int-e: In particular, Google's DVCS of choice is Mercurial with a lot of extra oddness, and AIUI the decision was primarily motivated by Git not having any sort of API to do the odd parts.
10:30:25  shchaf: also, do you happen to know how to ask git to remove directories from the working copy that it couldn't commit because of lack of permissions?
10:30:36  extensibility doesn't come up so much in day to day usage :P
10:30:54  shachaf: and how to make git use a .git outside hackenv so that hackenv commands can't directly write it?
10:31:07  wib_jonas: GIT_DIR
10:31:29  int-e: where is that documented?
10:31:33  fizzie: I think Facebook made the same decision for the same reason.
10:31:48  wib_jonas: but it's a non-issue, I think? the umlbox can mount subdirectories read-only.
10:31:54  wib_jonas: I'm talking about non-esoteric uses so this is all irrelevant.
10:32:00  int-e: hmm, that might make sense
10:32:07  `` ls -ld .hg
10:32:10  drwxr-xr-x 5 1000 1000 4096 Sep 17 09:59 .hg
10:32:13  wib_jonas: I don't currently have .hg outside hackenv either.
10:32:15  wib_jonas: it's documented in the git-init man
10:32:18  shachaf: but... wasn't the whole point the esoteric uses in hackeso?
10:32:45  `` touch .hg/doesnotwork
10:32:46  touch: cannot touch '.hg/doesnotwork': Read-only file system
10:32:48  No, I'm making a general claim.
10:33:00  One big advantage of git is that it's written in C.
10:33:09  ...But a big disadvantage is that big parts of it are written in sh.
10:33:57  int-e, Taneb: thanks
10:34:32  wib_jonas: I actually use GIT_DIR quite a bit because I can never remember --bare ;-)
10:34:52  shachaf: all of subversion is written in C
10:35:08  Yes. Subversion is a pretty good version control system.
10:35:19  (I meant git over hg above, though.)
10:35:45  the main drawback of subversion is that it's a very bad distributed vcs right now, and that's hard to fix, but that problem doesn't come up too much for HackEso
10:36:05  that said, keeping the existing mercurial solution for HackE*o is probably for the best
10:37:24  I'm going to sleep.
10:38:01  these spams that advertise services to send bulk spam are sort of the most honest spam there is, because they at least prove that they can offer such services
10:38:27  unlike the other spam, which are usually about outright scams and state or promise something that they can't provide
10:38:59  not that the bulk mailers have to be totally honest of course, they can still scam you and underperform and overcharge you
10:39:09  or just steal the money
10:39:16  but they at least offer a service that they can do
10:40:35  How much of this mess would be solved by sanitizing permissions of directories (making sure they're u+rx)?
10:41:20  int-e: eh, next you'll want to disallow symlinks and pipes and socket files from hackenv?
10:41:29  and even force regular files to readable?
10:42:17  `? pipe
10:42:18  This is not a pipe.
10:50:57  maybe you'll even suggest that we shouldn't have a symlink to /proc/self/args in wisdom?
10:53:34  I don't care. fifos are annoying because they break grep
10:53:44  ``` set -e; cd wisdom; find -type l -printf "%p > %l\n"
10:53:45  ​./СССР > ссср \ ./the usual suspect > usual suspect \ ./perpetuum mobile > perpetual motion machine \ ./r.i.p. > rip \ ./☆ > * \ ./h4gb4rd > hagb4rd \ ./issue > .doorstop \ ./the reals > real \ ./off by two error > off by two \ ./wolfram > stephen wolfram
10:53:48  that symlink doesn't do that
10:53:52  `grwp grep
10:53:54  No output.
10:53:58  `grwp wisdom
10:53:59  ​?:? is wisdom \ america:This wisdom entry had to be removed due to a DMCA takedown notice. \ bimonthly:The word "bimonthly" has at least two meanings, although this wisdom only gives about half of one. No matter which expert you follow, you're 50% likely to misinterpret it, or doubly so, depending on the phase of the moon. \ busy beaver growth:No one can compute the length of a wisdom entry sufficient to explain busy beaver growth. \ claustrophobia:Clau
11:05:14  int-e: It might help. Currently I sanitize only the .hg and .hgignore permissions.
11:08:50  I think I thought about using the purge extension instead of the status parsing + remove approach, but I suspect it would not work any better w.r.t. bizarre permissions. Presumably it would be inherently robust against odd file names though.
11:21:15  Are there operators + and * on rings such that the set of rings forms a ring
11:22:09  I don't think so
11:23:07  Such that *some* set of rings forms a ring, maybe?
11:23:56  Every ring in such a set would need to have an inverse
11:23:57 -!- Frater_EST has left.
11:24:17  This is very difficult for me to think about, but it is entertaining.
11:26:53  The other week I tried to think about ZF¬C and the properties of a vector that lacks a basis
11:27:37  cpressey: this is not what you want... but technically all you need is a ring of the right cardinality
11:29:46  `? ring
11:29:47  Addition, subtraction and multiplication have a certain ring to them.
11:31:14  int-e: I was thinking maybe you could do something trivialish with two boolean rings
11:31:23  Well anywan
11:31:34  Back to timezones, brain!
11:36:03 -!- arseniiv has joined.
11:38:08  Taneb: I once saw a stackexchange answer listing the bizarre implications of having Axiom of Choice next to the bizarre implications of *not* having Axiom of Choice... but I can't find it again now :/
11:42:24  Might've been this one, but I thought it was longer: https://math.stackexchange.com/questions/1771052/soft-question-why-does-the-axiom-of-choice-lead-to-the-weirdest-constructions
12:59:20  [[@NUM]]  https://esolangs.org/w/index.php?diff=66207&oldid=59504 * KrystosTheOverlord * (+3) 
13:01:49  [[@NUM]]  https://esolangs.org/w/index.php?diff=66208&oldid=66207 * KrystosTheOverlord * (+76) 
13:03:11  [[@NUM]]  https://esolangs.org/w/index.php?diff=66209&oldid=66208 * KrystosTheOverlord * (+37) 
13:24:23  `? banach-tarski # https://www.xkcd.com/804/
13:24:24  banach-tarski # https://www.xkcd.com/804/? ¯\(°​_o)/¯
13:24:29  hmm
13:28:46  i don't think they understand comments
13:30:16  ``` set -e; d=$(date +@%s); export TZ; for TZ in UTC Europe/Paris Europe/London America/New_York America/Los_Angeles; do date -d "$d" +"%Y-%m-%d %H:%M %z %Z"; done # timezones like this?
13:30:19  2019-09-17 13:30 +0000 UTC \ 2019-09-17 15:30 +0200 CEST \ 2019-09-17 14:30 +0100 BST \ 2019-09-17 09:30 -0400 EDT \ 2019-09-17 06:30 -0700 PDT
13:30:21  ``` \? banach-tarski # https://www.xkcd.com/804/
13:30:24  ​"Banach-Tarski" is an anagram of "Banach-Tarski Banach-Tarski".
13:30:31  yes, that
13:31:37  at least the timezone database (or part of it) is installed, even if very few locales are
13:55:35  `pbflist https://pbfcomics.com/comics/the-forbidden-cave/
13:55:35  pbflist https://pbfcomics.com/comics/the-forbidden-cave/: shachaf Sgeo quintopia ion b_jonas Cale
13:59:32 -!- sprocklem has quit (Ping timeout: 276 seconds).
14:07:26  My head hurts.+00:00
14:12:40 -!- shikhin has quit (Quit: Quittin'.).
14:13:52 -!- shikhin has joined.
14:18:28 -!- ArthurStrong has quit (Quit: leaving).
14:21:40 -!- shikhin has quit (Read error: Connection timed out).
14:22:01 -!- shikhin has joined.
14:24:10  Robin should probably be split into an esolang and a non-esolang, but it's not entirely clear where I should draw the line.
14:24:33  Macros as fundamental + strange environment tricks based on that -> esolang.
14:25:45  cpressey: wait, if you remove that, then what remains that's interesting and unique as a non-esolang?
14:29:00  Referentially transparent homoiconic language with a reactive framework.  Is that not interesting and unique enough?
14:29:31  I don't know. couldn't you just use a reactive frameword in scheme or something?
14:29:49  wait, what does the referentially transparent part mean?
14:30:12  ah
14:32:45  If I felt like I could successfully submit a SRFI for "immutable scheme" I'd probably do that instead.
14:33:33  Well, whatever
14:53:04  https://github.com/wolfgangj/bone-lisp#readme <-- That is virtually the only other language with immutable data and homoiconic syntax that I've found.
14:53:39  Could port the reactive framework to it; in some ways it would be a good fit
15:16:57 -!- APic has quit (Ping timeout: 244 seconds).
15:20:20 -!- APic has joined.
15:25:14 -!- APic has quit (Ping timeout: 265 seconds).
15:38:01  `? Screen
15:38:07  Screen? ¯\(°​_o)/¯
15:40:23 -!- wib_jonas has quit (Remote host closed the connection).
15:59:20 -!- cpressey has quit (Quit: A la prochaine.).
16:33:09 -!- Lord_of_Life_ has joined.
16:35:52 -!- Lord_of_Life has quit (Ping timeout: 245 seconds).
16:36:01 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
16:55:48 -!- sprocklem has joined.
17:00:46  [[Special:Log/newusers]] create  * Alalalize *  New user account
17:07:44 -!- b_jonas has joined.
17:12:49 -!- Phantom_Hoover has joined.
17:26:12 -!- APic has joined.
17:26:25 -!- FreeFull has joined.
17:26:32  it seems like the time format bug that I mentioned yesterday is not in libc's strftime function. it's in coreutils's reimplementation of strftime.
17:26:43  that's good to know.
17:36:53 -!- sprocklem has quit (Ping timeout: 268 seconds).
17:47:02 -!- arseniiv has quit (Ping timeout: 276 seconds).
17:47:28 -!- arseniiv has joined.
18:02:01  Hmm.
18:02:31  These seem both equally broken to me: http://ix.io/1VAl
18:02:55  And I'm sure the latter is using the libc's strftime.
18:03:15  (Unless this was a different bug you were talking about.)
18:03:31  hmm
18:10:26 -!- imode has joined.
18:11:28  (set -e; export LC_ALL=hu_HU.utf8; gcc -Wall -O -o a.out -x c - <<<$'#include\n#include\n#include\n''int main(void) { char o[100] = {0}; setlocale(LC_ALL, ""); struct tm b = {0}; time_t t = 1570230000; gmtime_r(&t, &b); strftime(o, 100, "%^B", &b); printf("%s\n", o); return 0; }'; ./a.out )
18:11:33  OKTóBER
18:11:41  let me install the fi_FI.utf-8 locale
18:12:10  you're right this seems broken, so there's something wrong in my tests
18:12:59  wait, I misread my previous tests
18:13:04  those printed OKTóBER too
18:13:06  darn
18:13:14  or maybe I can't reproduce them or something
18:13:15  I'm confused
18:13:42  ...
18:13:45  thanks for checking then
18:14:15  let me see what the libc documentation actually says about this, and check their bug tracker where there's probably a ticket for that and they argue that this is completely correct behavior
18:17:20  oh hey look
18:17:34  it does uppercase correctly for the hu_HU.iso88592 locale
18:18:46  in that case it prints OKTÓBER only the Ó is encoded in iso-8859-2 as a \xD3 as you'd expect
18:18:55  so it can uppercase single-byte stuff
18:19:20  aren't locales fun? this is why we don't use them these days, and just use libraries that do stuff like this without relying on locales
18:42:37  b_jonas: It's also correct for fi_FI.ISO-8859-1.
18:42:52  good
18:43:07  ``` locale -a
18:43:08  C \ C.UTF-8 \ POSIX \ en_GB.utf8 \ en_NZ.utf8 \ en_US.utf8
18:45:01  I think I probably added en_GB in addition to en_NZ and en_US when migrating to HackEso, to honor the fact that it's physically in the UK.
18:55:41 -!- xkapastel has joined.
19:06:21 -!- sprocklem has joined.
19:11:21 -!- cocof has joined.
19:11:37  people in usa complain that college is experensive
19:11:57  why don't they study online or in mexico?
19:12:37  [[Hello world program in esoteric languages]]  https://esolangs.org/w/index.php?diff=66210&oldid=65984 * Dtuser1337 * (+106) /* Codd */
19:12:46  *expensive
19:13:10  Who says they don't?
19:13:27  their complain
19:13:31  complains
19:13:36  how is that a php question?
19:13:39  . o O ( "why did you study online or in mexico?" )
19:14:14  Maybe they complain, and then go online to Mexico to study.
19:14:14  I am watching a program about some free uni that started to charge fees and students claim their are entitled to free edu
19:14:23  I suspect the former may be a real issue, if you study full time.
19:14:44  int-e as far as person is smart he is more likely to be hired if he saved money on collegde
19:14:49  colledge
19:14:57  as it shows he she is smart
19:15:00  college
19:15:09  yet many spend 100K on gender study ? :D
19:15:38  I haven't been in USA for some time and I suspect IQ drop is real
19:16:05  I get the impression you don't care about what anyone says here, and you just want to complain.
19:16:16  there is a solution
19:16:18  I recommend complaining online, or in Mexico.
19:16:33  it seems some standord professors made their own online unis
19:16:35  we're mostly programming people, but let's ask the one foremost expert of politics in our channel
19:16:51  fun!
19:16:51  fungot, what do you think about the higher education system in the USA?
19:16:51  b_jonas: i see,
19:17:07  ^style
19:17:07  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 ukparl youtube
19:17:08  uh, how did that... ah I won't even ask.
19:17:20  ^style speeches
19:17:20  Selected style: speeches (misc. speeches from Project Gutenberg)
19:17:34  programming requires logic and paying 100K for a college indicated IQ drop
19:17:39  :D
19:17:48  don't you have kids?
19:17:59  do you beat them up when they mention college loan?
19:18:26  fungot, fungot, fungot
19:18:27  int-e: claiming only that they have been since, much employed by that political school, is an ancient story of a speech made in one parliament has been growing to by a progressive increase of improvement, brought in a bill to prevent judges from entering those lists in which lord ellenborough is a perfect man, if able, will take from the rest of mankind in all ages a chief cause of the house, that, in losing her american coloni
19:18:42  oh, so talking about college loan is why fungot is beating his children?
19:18:43  b_jonas: prior, matthew, his intimacy with bishop atterbury. appears as a witness in favour of wit; he tolerated even tameness for the sake of example they should be deluded, and should occasionally fnord to the institution to learn and to know that a man has not received such an education as enables him to understand that it was not merely a great writer, will, for a long time without pay, or at least a tinge of toryism. he li
19:18:50  fungot IQ drop usa
19:18:50  cocof: " when will rulers learn that, where we used to play it in this house, in the county. what is to be observed, or whether it shall be the vicegerent and with what portion of the american slave, the pride of man?
19:18:54  `relcome fungot
19:18:54  int-e: by fnord cleveland was not a very material difference in the main but three, which i consider excellent advice: and you give us to- night again, so amiable is our nature, and in some of its members is large, than cyrus, in the meantime, in spite of the opposition met for the purpose of greatness, which it is designed for the great honour which you have presented me, shall never break the tie of consanguinity between us a
19:18:55  ​fungot: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: . (For the other kind of esoterica, try #esoteric on EFnet or DALnet.)
19:19:21  fungot cocof
19:19:21  cocof: first i thought i'd go and see. then i will proceed in my account of the great tory prelate were, as they are now taking the surest way to prevent a total rupture."
19:19:27  see
19:19:40  I am surest way to prevent a total rupture
19:19:44  cocof: our expert says that "the institution to learn and to know that a man has not received such an education as enables him to understand that it was not merely a great writer, will, for a long time without pay"
19:19:45  first kids must be beaten
19:20:31  is garfield without garfield still ongoing?
19:20:39  uhm s/without/minus/
19:20:45  commonsense.com
19:20:46  :D
19:20:46  [[Fishing]]  https://esolangs.org/w/index.php?diff=66211&oldid=52777 * Dtuser1337 * (+66) /* Programs */
19:21:32  fungot: what do you make of the present situation?
19:21:32  kmc: but the fact is, that malignant disposition to which this building is devoted, of its brilliant and inspiring history, of which it is designed. a man, he seemed to be united with each other, but the influence was very broad in effect.
19:22:28  yes malignant
19:22:32  snowflakes
19:22:44  need physical work forced
19:22:47  to collect oranges
19:23:17  [[Deadfish]]  https://esolangs.org/w/index.php?diff=66212&oldid=65925 * Dtuser1337 * (+1004) Yare yare daze
19:24:21 * kmc pelts cocof with oranges
19:24:44  ``` \? "gene ray" | sed s/.*god..//
19:24:45  Academians are teaching - pseudocience. Worshipping a Word God will destroy the USA.
19:25:10  to quote our other expert
19:25:23  I asked another expert: http://slbkbs.org/tmp/talk_to_transformer.png
19:26:16  https://66.media.tumblr.com/2b8b62a7f4390548136987acf3943a5f/tumblr_nzs9xeDR3r1qz8z2ro1_500.png is every garfield strip, in a nutshell.
19:26:50  shachaf: has to refer to Prime, because he's the most popular transformer so that's what sells everything
19:27:03  even though he's totally irrelevant to this question
19:29:45  I don't know much about transformers.
19:29:53  I guess Megatron is also one?
19:30:17  `? transformer
19:30:20  A transformer is one who used to trans, but no longer does.
19:30:48  I don't know. I think a Megatron is either an angel or a unit of measure
19:32:32 -!- sprocklem has quit (Ping timeout: 245 seconds).
19:37:50  [[Talk:ZOWIE]]  https://esolangs.org/w/index.php?diff=66213&oldid=43704 * Rdebath * (+237) My bad
19:45:59  `5 w
19:46:05  1/1:violation//Violation is the act of playing an instrument in the viola family. \ nilfisk//Nilfisk is the fish of choice for the connoiseuring spämmer. \ pikachu//Pikachu is a universal quantifier for Chu spaces. \ clever//Being clever is different from being wise, but they are indistinguishable in sufficiently large quantities. \ forth//Since Biblical times, Forth has been the go-to language for multiplication.
19:53:48  is there a mandatory IQ test before applying for a 
19:53:55  and who here have kids?
19:54:58  nobody here has kids, but some of us have evil twins or reincarnations
19:55:30  i'm my own grandpa
19:55:35  and fungot is my grandma
19:55:35  kmc: but, low as was the polished orator or writer, but as to me, and one day when we felt that we must not be understood as saying that there are two kinds of objects of desire; those which give mere bodily pleasure, and pain, without fnord passionate fnord furious fnord really proofs of the public.
19:55:57  fungot is so literary
19:55:57  Phantom_Hoover: bible, the fnord, which, fnord as i should speak as i now try to prevent others from oppressing them, as a means of ensuring fnord the consequence of triennial corruption, triennial drunkenness, triennial idleness, triennial law-suits, litigations, prosecutions, triennial phrensy, of society dissolved, industry interrupted, ruined; of those personal hatreds that will never be able to say to our friend and guest 
19:56:27  `? kmc
19:56:28  kmc did not run the International Devious Code Contest of 2013.
19:57:44  `? kmc
19:57:45  kmc did not run the International Devious Code Contest of 2013. She is her own grandpa.
19:57:53  :D
19:58:05  whoa whoa whoa
19:58:10  Editing in /msg?
19:58:10  that entry was too bare. now it has something informative and specific in it.
19:58:15  ty b_jonas 
19:58:28  '?usa education now
19:58:35  '? usa education now
19:58:46  `? usa education now
19:58:47  usa education now? ¯\(°​_o)/¯
19:58:54  :)
19:59:06  `? usa needs kids beating
19:59:07  usa needs kids beating? ¯\(°​_o)/¯
19:59:11  yes yes
19:59:24  Maybe lay it off with the kids beating thing?
19:59:34  i,i https://twitter.com/capsule_169/status/993963705791545344
19:59:45 * kmc beats cocof with the ugly stick
20:00:02  kmc: didn't heinlein write that story
20:00:03  it's called a mapole
20:00:05  kmc is a fail student?
20:00:10  haha
20:00:16  soon professors can kick students
20:00:22  shachaf: yeah and like a billion people reply with that in the comments
20:00:25  and ask security to drag them out
20:00:25  i didn't read it, though
20:00:36  kmc: i'm the bazillionth and one
20:00:38  shachaf: he rewrote it, but it's an ancient Sumerian tale originally
20:00:39  cocof: no, I was a success in college, I'm a failure at everything *subsequent*
20:00:49  presumably i get a prize for being the bazillionth and one visitor to your website
20:01:09  what prize would you like?
20:01:18  currently in stock: hugs, coffee cake
20:01:31  no imaginary internet points?
20:01:36  sure
20:01:53  kmc: are you suggesting that there's a life after college
20:02:00  no internet points for me
20:02:10  but i'll sign up for one hugs and one coffee cake
20:02:35  hooray
20:02:35  shachaf: you win a MASSIVE YACHT.
20:02:38  *hugs*
20:02:41  *coffee cake*
20:03:13  https://www.xkcd.com/570/
20:03:48  those look a lot like internet points
20:04:02  shachaf: cf. https://www.youtube.com/watch?v=sdi6E-qzS1c
20:06:09  i can make 100 cups of coffee\
20:06:15  got 2 jars :D
20:06:23  and 2lts of milk
20:11:09  who wants an e cup?
20:11:51  https://www.youtube.com/watch?v=EHcr6R8nbZA
20:12:06  [[Mailman]] N https://esolangs.org/w/index.php?oldid=66214 * Xanman12321 * (+1451) Created page with " This language is about mail; the program runs until all houses have been delivered to. It was created by User:Xanman12321 and User:Andrew3335 in 2019, based on a Google Docs..."
20:16:42  [[Mailman]]  https://esolangs.org/w/index.php?diff=66215&oldid=66214 * Xanman12321 * (+109) 
20:23:29  [[Mailman]]  https://esolangs.org/w/index.php?diff=66216&oldid=66215 * Xanman12321 * (+230) 
20:26:06 -!- cocof has quit (Remote host closed the connection).
20:35:48  strict symmetric monoidal categories are nice. We can talk about composition of things with several colored inputs and as well as outputs, if we constrain Obj(C) to be generated from some S via ⊗, hence getting a colored PROP
21:04:35  mo noids mo problems
21:08:48   nobody here has kids, but some of us have evil twins or reincarnations => I want to have a twin :′(
21:14:22  btw is IQ even a feasible measure of normal people’s intellect. I heard initially it was made to determine if a person is medically, sufficiently unsmart. These are very rare in any times
21:16:10 -!- Lykaina has joined.
21:18:44  I don’t trust people who talk about IQ this IQ that
21:19:52  also about BMI
21:24:36  `forget vampire
21:24:38  Forget what?
21:24:41  should we call semicatefory a polyid?
21:24:52  semicategory*
21:37:10 -!- Lykaina has quit (Quit: leaving).
22:01:23  [[Special:Log/newusers]] create  * Moose moose moose moose moose *  New user account
22:03:34  [[Esolang:Introduce yourself]]  https://esolangs.org/w/index.php?diff=66217&oldid=66164 * Moose moose moose moose moose * (+354) 
22:30:34 -!- FreeFull has quit.
22:34:27  ``` datei # I edited this to show only three digits after the decimal point for seconds
22:34:28  2019-09-17 22:34:28.192 +0000 UTC September 17 Tuesday 2019-W38-2
22:57:25  [[Special:Log/newusers]] create  * MiroslavRD *  New user account
23:10:33 -!- Phantom_Hoover has quit (Quit: Leaving).
23:12:13  [[Esolang:Introduce yourself]]  https://esolangs.org/w/index.php?diff=66218&oldid=66217 * MiroslavRD * (+61) 
23:13:16  [[Esolang:Introduce yourself]]  https://esolangs.org/w/index.php?diff=66219&oldid=66218 * MiroslavRD * (+600) 
23:15:48  [[User:MiroslavRD/vector.css]] N https://esolangs.org/w/index.php?oldid=66220 * MiroslavRD * (+1) Created page with "k"
23:16:10  [[User:MiroslavRD/vector.css]]  https://esolangs.org/w/index.php?diff=66221&oldid=66220 * MiroslavRD * (+22) 
23:23:18 -!- cocof has joined.
23:23:21  https://www.youtube.com/watch?v=7kpDA8wgOrU
23:23:26  :D
23:29:14  the less people need to work the more watch youtube and IQ drops
23:31:11 -!- b_jonas has quit (Quit: Lost terminal).
23:35:53  [[Sashleyfuck]] N https://esolangs.org/w/index.php?oldid=66222 * MiroslavRD * (+969) Created page with "Sashleyfuck is just like [[Brainfuck]], but it uses the letters S, A, H, L, E, and Y. It was made after [[User:MiroslavRD]] being the biggest Sashley hater.  == Commands == S..."
23:36:34  [[Language list]]  https://esolangs.org/w/index.php?diff=66223&oldid=66053 * MiroslavRD * (+18) Add my new page
23:37:50  [[Sashleyfuck]]  https://esolangs.org/w/index.php?diff=66224&oldid=66222 * MiroslavRD * (+11) 
23:40:41  [[Sashleyfuck]] M https://esolangs.org/w/index.php?diff=66225&oldid=66224 * MiroslavRD * (+4) Link to Hello World
23:41:50  [[Sashleyfuck]] M https://esolangs.org/w/index.php?diff=66226&oldid=66225 * MiroslavRD * (+16) Use "Hello, world!" instead of "Hello World!" (link)
23:46:56  [[Brainoof]] N https://esolangs.org/w/index.php?oldid=66227 * MiroslavRD * (+23) Redirect from the Roblox-cleaned Brainfuck
23:47:30  [[Brainfuck]] M https://esolangs.org/w/index.php?diff=66228&oldid=65758 * MiroslavRD * (+10) Added a new clean alternative
23:49:07  [[User:MiroslavRD]] N https://esolangs.org/w/index.php?oldid=66229 * MiroslavRD * (+14) Created page with "A rush editor."
23:50:20  [[User:MiroslavRD]] M https://esolangs.org/w/index.php?diff=66230&oldid=66229 * MiroslavRD * (+25) Rushed my last edit (i'll be editing more later)
23:51:18 -!- cocof has quit (Remote host closed the connection).
23:57:55 -!- sprocklem has joined.

2019-09-18:

00:42:26 -!- sprocklem has quit (Ping timeout: 240 seconds).
00:58:31 -!- sprocklem has joined.
01:17:44  kmc: do you know about intel's thing where you're required to mark valid branch targets with an otherwise-nop instruction
01:17:51  no
01:18:39  though apparently returns don't count as indirect branches for this purpose
01:18:46  and they have some other thing for that
01:24:38 -!- arseniiv has quit (Ping timeout: 276 seconds).
01:25:58  "required"?
01:26:15  I mean, if whatever this feature is is enabled.
01:26:55  Apparently ARM has this too, with bti ("branch target indicator").
01:35:37 -!- sprocklem has quit (Remote host closed the connection).
01:44:37  huh
01:44:39  what's the point?
01:44:59  what's intel's version called?
01:45:01  and how do you enable it?
01:45:28 -!- xkapastel has quit (Quit: Connection closed for inactivity).
01:45:31  ah, it's for security?
01:45:37  that's kind of clever
01:45:52 -!- sprocklem has joined.
01:47:30  Oh, yes, for security.
01:47:50  The Intel version is called CET (Control-flow Enforcement Technology).
02:08:39 -!- sprocklem has quit (Ping timeout: 258 seconds).
02:34:20 -!- sprocklem has joined.
02:48:50 -!- sprocklem has quit (Ping timeout: 240 seconds).
02:54:51 -!- sprocklem has joined.
03:19:25  I made a self-deleting shell script
03:19:37  it's generated by another script, intended to be edited once and then deleted
03:19:46  edited, run once*
03:23:05  `cat bin/slist
03:23:06  echo -n "$(basename "$0")${@:+ }$@: "; tail -n+2 "$0" | xargs; exit \ Taneb \ atriq \ Ngevd \ nvd \ Fiora \ Sgeo \ ThatOtherPerson \ alot
03:23:11  hm
03:23:22  sorry, all pinged
03:23:29  for sale: shell script, never run
03:23:35  `` doag bin/slist | rot13
03:23:37  5366:2015-05-12  frq -v "5vaiq" ova/fyvfg \ 5075:2014-10-18  frq -v \'/abeggv/q\' ova/fyvfg \ 5073:2014-10-18  erireg \ 5072:2014-10-18  erireg 5069 \ 5070:2014-10-18  frq -v \'f|ez ova/fyvfg; ||\' ova/fyvfg \ 5069:2014-10-18  erireg \ 5068:2014-10-16  fyvfg \ 3924:2013-10-18  erireg \ 3923:2013-10-18  fyvfg Arjf: Tvtncnhfr \ 3920:2013-10-18  frq -v \'f/rkvg/ez 
03:23:51  also I learned that bash printf has a %q format specifier which escapes the parameter for use in further bash commands
03:23:55  `doag bin/slist
03:23:57  5366:2015-05-12  sed -i "5invd" bin/slist \ 5075:2014-10-18  sed -i \'/nortti/d\' bin/slist \ 5073:2014-10-18  revert \ 5072:2014-10-18  revert 5069 \ 5070:2014-10-18  sed -i \'s|rm bin/slist; ||\' bin/slist \ 5069:2014-10-18  revert \ 5068:2014-10-16  slist \ 3924:2013-10-18  revert \ 3923:2013-10-18  slist News: Gigapause \ 3920:2013-10-18  sed -i \'s/exit/rm 
03:23:58  `` echo "foo ' bar" | printf "%q\n"
03:23:59  ​''
03:24:10  er
03:24:19  `` printf "%q\n" "foo ' bar"
03:24:20  foo\ \'\ bar
03:24:22  there we go
03:24:24  kmc: Oh, that's pretty fancy.
03:24:28  'tis
03:24:41  If you're writing bash commands something has gone wrong, though. :-(
03:24:46  you can also do ${X|@Q} in more recent bashes
03:24:47  I mean scripts.
03:24:51  perhaps
03:25:05  life involves lots of things going wrong
03:25:11  and yet we muddle through
03:26:11  i wrote a small amd64 assembler
03:26:23  it supports movs and jumps so maybe it's turing-complete?
03:26:38  except for the finite-state bit
03:28:31  neat
03:28:34  why'd you do it?
03:31:23  I just wanted to generate some code and I was tired of handwriting it.
03:34:06  ok
03:34:11  why not use nasm or something?
03:37:47  Seems silly to go through a whole program that has to parse text and everything?
03:37:57  Maybe nasm is available as a library.
03:39:55  well
03:40:01  i support your efforts anyway
03:40:04  writing an assembler is fun
03:40:09  it could be
03:40:15  is it a 2 pass thing
03:40:43  does it generate relocatable files?
03:42:16  it's a v. simple 1-pass assembler that always uses 4-byte jump offsets and so on, right now
03:42:30  smart assemblers presumably use more than two passes for edge cases
03:43:42  It generates ELF executables right now.
03:43:48  I guess they're dynamically relocatable?
03:44:07  It doesn't support non-internal linkage or anything.
03:51:22 -!- sprocklem has quit (Read error: Connection reset by peer).
03:54:08  ok
03:54:12  did you use a library to output ELF
03:56:03  no, i wrote out all the bytes
03:56:35 -!- sprocklem has joined.
04:00:38 -!- sprocklem has quit (Client Quit).
04:10:58  [[Talk:ZOWIE]] M https://esolangs.org/w/index.php?diff=66231&oldid=66213 * Ais523 * (-23) /* Turing completeness */ use the correct link syntax for an internal link
04:36:56 -!- Lord_of_Life has quit (Ping timeout: 265 seconds).
04:38:25 -!- Lord_of_Life has joined.
04:43:19 -!- sprocklem has joined.
05:37:58 -!- Sgeo_ has joined.
05:41:08 -!- Sgeo__ has quit (Ping timeout: 246 seconds).
07:37:17  Huh, when you write code in continuation-passing style, you should name the continuation "return".
08:15:52 -!- Frater_EST has joined.
08:16:09 -!- Frater_EST has left.
09:04:18  I thought you should name it "k".
09:04:31  Only if you're reasonable.
09:30:50 -!- imode has quit (Ping timeout: 276 seconds).
09:43:16 -!- cpressey has joined.
09:43:20 -!- wib_jonas has joined.
10:08:46  Does the k stand for "kontinuation"?
10:17:06  I think so.
11:19:40 -!- PaniniTheDevelop has joined.
11:21:06  Hello
11:21:25  Hi PaniniTheDevelop 
11:22:16  do you develop stickers?
11:22:35  fizzie: κ is very traditional, if your chosen notation supports it.
11:28:15  I've been reduced to translating some code of mine from Haskell to Javascript so that I can debug it.
11:28:48  cpressey: that's a depth of hell I've never visited
11:32:17  cpressey: that sounds scary
11:32:25  Perhaps it isn't the best idea
11:32:28  can't you put printfs in the Haskell code?
11:32:51  uneval(function(x) { return x; }) === "(function(x) { return x; })"
11:33:16  But can I say "deriving (Show)" for a function value in Haskell?  Not as far as I'm aware.
11:34:32  dunno. you could ask #haskell but you already said they're too abstract and category theorist for you
11:39:58  `js uneval(function(x) { return x; });
11:39:59  ​[eval]:1 \ uneval(function(x) { return x; }); \ ^ \  \ ReferenceError: uneval is not defined \     at [eval]:1:1 \     at Object.exports.runInThisContext (vm.js:54:17) \     at Object. ([eval]-wrapper:6:22) \     at Module._compile (module.js:409:26) \     at node.js:648:27 \     at nextTickCallbackWith0Args (node.js:489:9) \     at process._tickCallback (node.js:418:13)
11:40:12  Apparently you can't say that in "JavaScript" either.
11:41:16  hmm
11:41:48  (It's apparently unique to Firefox.)
11:42:11  you can do that in lisp, though
11:42:36  `js (function(x) { return x; }).toString();
11:42:37  function (x) { return x; }
11:42:41  Looks like you can do that on nodejs.
11:48:09  but does it give you only the body, or also the identity of the closed variables?
11:50:32  I think it's only the source text.
11:51:49  `js function f(x) { return function(){return x+1} } f(1).toString() + f(2).toString();
11:51:50  function (){return x+1}function (){return x+1}
11:52:17  what engine does this `js run?
11:52:18  `? `js
11:52:20  ​`js? ¯\(°​_o)/¯
11:52:23  It's nodejs.
11:52:42  I just added it to replace the broken previous `js, so it doesn't have an entry anywhere.
11:52:48  `cat bin/js
11:52:49  ​/usr/bin/js -p "$*"
11:53:28  The previous one was I think Rhino. But it got broken in the migration because there's no JRE installed on the system.
11:55:07  `js process.versions.v8
11:55:09  4.5.103.46
11:55:16  I guess strictly speaking that's the "engine".
11:56:02  `js JSON.stringify(process.versions)
11:56:06  ​{"http_parser":"2.7.0","node":"4.8.2","v8":"4.5.103.46","uv":"1.9.1","zlib":"1.2.8","ares":"1.10.1-DEV","icu":"57.1","modules":"46","openssl":"1.0.2k"}
12:03:43  Yeah, it wasn't the best idea. But I don't know where y'all're getting this "depth of hell" stuff from, Javascript's a lovely language!
12:04:18 -!- atslash has joined.
12:04:22 * cpressey tries hard to keep a straight face
12:08:25  cpressey: of course it seems enticing at first.
12:08:50  it only reveals its true face once you've invested enough to no longer be able to change your existing code to a different language easily.
12:09:43 -!- arseniiv has joined.
12:13:50 -!- PaniniTheDevelop has quit (Remote host closed the connection).
12:14:59  wow what a weather. September onwards until snow falls, here are usually rains only. Now I heard thunder two times, and tiny ice chunks fall. Didn’t think convection is still good enough, given there weren’t thunderstorms for weeks
12:15:20 -!- arseniiv has quit (Quit: gone completely :o).
12:19:03 -!- PaniniTheDevelop has joined.
12:19:10  rip
12:25:55 -!- arseniiv has joined.
12:26:11 -!- PaniniTheDevelop has quit (Remote host closed the connection).
12:49:11  [[Fishing]]  https://esolangs.org/w/index.php?diff=66232&oldid=66211 * Dtuser1337 * (+24) 
13:04:39  [[Truth-machine]]  https://esolangs.org/w/index.php?diff=66233&oldid=66135 * Dtuser1337 * (+73) /* > */
13:06:16  [[Hello world program in esoteric languages]]  https://esolangs.org/w/index.php?diff=66234&oldid=66210 * Dtuser1337 * (+57) /* FiM++ */
13:06:58  [[Fishing]]  https://esolangs.org/w/index.php?diff=66235&oldid=66232 * Dtuser1337 * (-12) /* Hello, World! */ why adding 
 when there a space before it.
13:08:19  [[Turth-machine]]  https://esolangs.org/w/index.php?diff=66236&oldid=65569 * Dtuser1337 * (+22) 
13:10:51  [[Talk:MSM]]  https://esolangs.org/w/index.php?diff=66237&oldid=65203 * Dtuser1337 * (-41) Nani!? This must be the work of a enemy stand! they blanked the page and removed the redirect!!!!!!!!!!11111111111111111 this is awfullll!!!!!!!!!!!!!!!!!!!!11111!!!!!!!111111111!!!!!!!!
13:11:12  oh dear
13:14:34  [[User:Dtuser1337/Sandbox]]  https://esolangs.org/w/index.php?diff=66238&oldid=66101 * Dtuser1337 * (+2696) 
13:15:00  [[User:Dtuser1337/Sandbox]]  https://esolangs.org/w/index.php?diff=66239&oldid=66238 * Dtuser1337 * (-1) /* commands */
13:27:07  [[User:Dtuser1337/Sandbox]]  https://esolangs.org/w/index.php?diff=66240&oldid=66239 * Dtuser1337 * (+66) /* commands */
14:22:02 -!- arseniiv has quit (Ping timeout: 276 seconds).
14:24:25 -!- arseniiv has joined.
14:26:15 -!- APic has quit (Ping timeout: 268 seconds).
14:30:44 -!- APic has joined.
15:20:14  [[Flop]]  https://esolangs.org/w/index.php?diff=66241&oldid=65750 * InfiniteDonuts * (-239) 
15:41:06  [[Special:Log/move]] move  * InfiniteDonuts *  moved [[Flop]] to [[Brainflop]]: Name changed
15:41:20  [[Brainflop]]  https://esolangs.org/w/index.php?diff=66244&oldid=66242 * InfiniteDonuts * (+5) 
15:44:49 -!- tromp_ has joined.
15:47:23 -!- tromp has quit (Ping timeout: 252 seconds).
15:54:29 -!- wib_jonas has quit (Remote host closed the connection).
15:59:39 -!- cpressey has quit (Quit: I got BLISTERS on my FINGERS *thwannggg*).
16:15:08 -!- arseniiv has quit (Ping timeout: 276 seconds).
16:28:25 -!- arseniiv has joined.
16:31:20 -!- FreeFull has joined.
16:33:53  [[Hexar]] N https://esolangs.org/w/index.php?oldid=66245 * Enchant3d * (+6052) Created page with "'''Hexar''' is an [[esoteric programming language]] which uses almost only hexadecimal numbers. ==Language overview== Hexar runs on an array that can contain only positive num..."
16:35:04 -!- Lord_of_Life_ has joined.
16:35:06  [[Language list]]  https://esolangs.org/w/index.php?diff=66246&oldid=66223 * Enchant3d * (+12) /* H */
16:37:07 -!- Lord_of_Life has quit (Ping timeout: 245 seconds).
16:37:07 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
16:46:56  [[ABC]] M https://esolangs.org/w/index.php?diff=66247&oldid=65492 * Dtuser1337 * (+59) 
18:29:12  [[@NUM]]  https://esolangs.org/w/index.php?diff=66248&oldid=66209 * KrystosTheOverlord * (-4261) 
18:57:54 -!- Phantom_Hoover has joined.
19:03:06 -!- dingwat has joined.
19:22:43 -!- MrBismuth has quit (Read error: Connection reset by peer).
19:23:55 -!- MrBismuth has joined.
19:34:51 -!- imode has joined.
19:47:02 -!- APic has quit (Ping timeout: 276 seconds).
19:51:13 -!- Cale has quit (Ping timeout: 252 seconds).
19:56:05  [[Special:Log/newusers]] create  * Tetratrary *  New user account
20:04:19 -!- Cale has joined.
20:13:46 -!- APic has joined.
20:18:22 -!- APic has quit (Ping timeout: 245 seconds).
20:28:50 -!- MDude has quit (Ping timeout: 240 seconds).
20:49:45 -!- MDude has joined.
20:55:26 -!- b_jonas has joined.
21:05:08  Are there any interesting esolangs based on the idea of jumping into the middle of an instruction?
21:06:02  dunno. you can do that in a lot of low-level languages, but I don't know any that really require it
21:06:21  I know you can do it but usually it's only in special cases.
21:06:43  I'm thinking of a language where doing things like that is required to do computation.
21:07:22  maybe you could advance the instruction pointer by one byte instead of the size of an instruction (and have all instructions be at least 2 bytes large to make it interesting)
21:07:37  shachaf: there might be something like bytepusher, but that modifies an instruction as it executes it. I might have even seen one but I don't recall which esolang
21:08:32  I guess more broadly you could ask for something that interprets the same instructions multiple different ways.
21:10:11  shachaf: that's a bit easier. Piet can interpret the same instruction in different ways
21:10:51  heck, even in befunge we have instructions that we use in multiple ways depending on the direction of execution
21:11:01  I guess so.
21:11:03  that should count as similar to jumping into the middle of an instruction
21:11:11  It's funny that these disassemble differently:
21:11:16  `asm jmp 0
21:11:17  0:  e9 00 00 00 00   jmpq 0x5
21:11:18  `asm jmp $0
21:11:19  0:  e9 00 00 00 00   jmp 0x5
21:14:19  shachaf: I think that's because the `asm command guesses different assembly syntaxes from your input
21:14:57  Yes, that's why.
21:18:18  Forte, SMETANA, ///, Fuun DNA are all self-modifying, and in an interesting way where the self-modifying entails more than just modifying plain memory offset or immediate operands of instructions, but I don't think you could say that you usually jump into the middle of an instruction in them
21:18:37  even though in /// and Fuun DNA, you could overlap instructions in interesting ways if you wanted to
21:18:49  but that's impractical just like in x86
21:19:05  so all that you normally do is to put instructions as arguments into other instructions
21:19:15  or put parts of instructions as arguments into other instructions if you wish
21:19:36  ah yes
21:19:40  it was MiniMAX
21:19:54  hmm no
21:20:05  I think you can't overlap instructions in MiniMAX
21:20:30  no wait
21:20:32  you CAN overlap them
21:20:51  in fact iiuc, MiniMAX does essentially require you to overlap instructions if you want to write useful programs
21:20:56  shachaf: that's your answer, you want MiniMAX
21:22:32  Aha.
22:15:05 -!- APic has joined.
22:36:36  Today's possible GCC bug: with `#define b +` as the context, the expression `0b10` is either treated as a binary literal (-std=c11) or an error (-std=c11 -pedantic), while in a strictly conforming implementation I believe it should be treated as `0+10`.
22:39:08 -!- Lykaina has joined.
22:39:48  hi
22:39:56  Rationale: In translation phase 3 the input is decomposed into preprocessing tokens. C11 6.4p4 says "the next preprocessing token is the longest sequence of characters that could constitute a preprocessing token", which should at the start be "0" (as a pp-number), next "b" (as an identifier) and then finally "10" (again a pp-number). That sequence of tokens would then in translation phase 4 have the "b" 
22:40:02  token undergo macro invocation to expand to "+".
22:41:20  made a tiny version of echidna (unfortunately with all different letters) for my arduino
22:43:08  fizzie: so b10 is not an identifier?
22:43:13  I think "#define b +" should just crash the compiler.
22:43:41  int-e: Oh, I guess it is. Good point.
22:43:49  int-e: Well, you can modify the example appropriately.
22:44:15  Let's say `#define b10 +10` then.
22:45:42  Although maybe `#define b1 -1` and `0b1` is better, it's pleasantly symmetrically either +1 or -1. Or would be if it didn't get treated as a binary literal in all cases.
23:02:50 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
23:12:35 * Lykaina lets out an f-bomb
23:13:02  i just saved over something i was working on for a while
23:14:53  no way to effing restore the douments
23:16:36  sucks... the only condolence I can offer is that it'll likely be better the second time
23:17:32  `grWp backup
23:17:34  taneb:Taneb is not elliott, no matter whom you ask. He also isn't a rabbi although has pretended in the past. He has at least two backup keyboards with dodgy SHIFT KEys, cube root of nine genders, one of which is a Czech woman, and above average, not too voluminous, but calm eyebrows. He sometimes invents without noticing it (see: tanebventions).
23:17:40  `quote backup
23:17:41  791)  Backups are so like one of those circus guys walking on a wire except with a safety rope. \ 1082)  Possible business plan: data storage on the moon?   Getting at it after the collapse of civilization here might be an issue.   who cares about civilization? you have backups!
23:18:34  This channel is populated by smart people. Sometimes it shows.
23:19:07  Not sure this was one of those times.
23:20:02  int-e: Huh. Somehow I read your 16:16 comment as starting with the word "life", several times.
23:20:11  The word doesn't seem to be present now. Very odd.
23:22:33  shachaf: I went back in time and erased it, mwahahaha.
23:22:50  Was life better the second time?
23:23:05  no, it was gone
23:26:14  video game universe, everyone gets 3
23:26:29  that seems unfair to cats
23:27:02  `? cat
23:27:03  Cats are cool, but should be illegal.
23:27:14  Where do I express my membership in the cat fan club?
23:28:50  That's the sole purpose of Instagram I believe.
23:30:01  always these extrapolation problems... 0m0.175s / 0m1.565s / 0m13.975s / 2m5.592s / 18m58.191s / ???
23:30:29  (I was estimating 3 hours and it's at 164m)
23:30:38  http://sif.lesidhetree.com/sara/echidna/Echidna%20v0_11a1b_1.pdf
23:31:01  http://sif.lesidhetree.com/sara/echidna/echidna-uno-doc.pdf
23:32:05  I wish C varargs were better.
23:32:24  shachaf: fwiw, the statement "life sucks" would not face much opposition from my side.
23:32:45  `? life
23:32:46  ​‘Life,’ said Marvin, ‘don't talk to me about life.’
23:32:47  I'd probably limit myself to pointing out that it's better than the alternative.
23:32:56  is it?
23:33:23  Well, s/pointing out/claiming/ if you like.
23:33:51  There's potential in life. There's no potential in death.
23:33:54  It would be nice, I think, if C had some kind of runtime-accessible type info.
23:34:04  And then varargs included information about it.
23:34:29  I fake that for http://slbkbs.org/tmp/fmt.txt
23:35:11  the thing i had to redo and was swearing about the original: http://sif.lesidhetree.com/sara/echidna/dec%20sixbit.pdf
23:36:04  shachaf: but would it still be C then?
23:36:10  int-e: The ??? is 1h16m7.135s hth
23:36:29  fizzie: we're way past that point :P
23:36:38  int-e: No, but I guess that's OK.
23:36:56  I guess I should use this language: https://github.com/pervognsen/bitwise/blob/master/notes/ion_motivation.md
23:37:58  fizzie: https://gist.github.com/int-e/21f328a88bfd96146a5df0937b9b743d is the context... it *is* hard to predict these kind of searvhes.
23:38:37  What are you searching for?
23:38:44  fizzie: but I'd fit an exponential function
23:39:00  My extrapolation advice is: If f(1) = 1 and f(2) = 3, f is probably TREE.
23:39:12  shachaf: the current run is powers of two such that all but 13 of the last k digits are 9... maximizing k.
23:39:53  shachaf: the file has results for 13 replaced with 8..12
23:40:17  int-e: I always fit a polynomial of degree n if given n+1 points to work with.
23:40:27  Oh, it's done.
23:40:30  user    173m33.476s
23:40:47  what were you compiling?
23:40:57  or running?
23:41:13  Lykaina: see the above link... it's a C++ program
23:44:58  int-e: That reminds me, my "time" program only shows seconds, not minutes.
23:45:03  Is that worth fixing?
23:45:32  I think "time" should be built in to my shell. It should time every command it runs automatically, and give me the information if I request it.
23:45:36  shachaf: entirely up to you
23:45:51  arguably minutes are more human readable
23:46:02  but not much
23:46:52  "but not by much" is more proper I guess
23:47:16  The few times I ran it on time scales where minutes were useful, I divided by 60 manually.
23:48:23  Man, my time program is so good. It's the best.
23:51:53  did i pick the right subset of echidna for the arduino?
23:52:47  shachaf: It's great to hear that you're happy with *something*.
23:52:52  `which time
23:52:53  No output.
23:52:56  int-e: Oh no. :-(
23:53:02  Huh, there's no time program on HackEso at all.
23:53:03  int-e: Have I been complaining too much?
23:53:14  Just a shell builtin. Or maybe several of them.
23:53:21  `` type -a time
23:53:22  time is a shell keyword
23:53:28  Not even a builtin!
23:53:54  `time
23:53:55  ​/srv/hackeso-code/multibot_cmds/lib/limits: line 5: exec: time: not found
23:54:07  `date
23:54:09  Wed Sep 18 23:54:08 UTC 2019

2019-09-19:

00:00:13 -!- FreeFull has quit.
00:03:36  shachaf: I'm not sure about whether it's *too* much. :P
00:04:06 -!- oerjan has joined.
00:05:36  just backed up echidna-uno
00:06:18  `` date && time;
00:06:19  real: 0m0.000s, user: 0m0.000s, sys: 0m0.000s \ Thu Sep 19 00:06:19 UTC 2019
00:06:35  The empty command: it's fast.
00:06:47  Running commands isn't that fast.
00:07:13  takes several seconds to compile echidna
00:10:16  i'll go time it
00:11:29  `datereal0m0.901s
00:11:29  user0m0.512s
00:11:29  sys0m0.264s
00:11:30  ​/srv/hackeso-code/multibot_cmds/lib/limits: line 5: exec: datereal0m0.901s: not found
00:11:37  oops
00:12:18  stupid scrollwheel
00:13:34 * oerjan scrolls a bit in the logs and notices someone called PaniniTheDevelop
00:13:54  i'm now hoping for a sanskrit-grammar-based esolang
00:14:11 * oerjan won't read all the logs these days, alas
00:14:17  real0m2.296s
00:14:18  user0m1.595s
00:14:18  sys0m0.674s
00:14:27  that's another machine
00:15:11  the one i do most my coding on
00:15:43  hi oerjan 
00:15:50  hi Lykaina 
00:16:02  how's agora?
00:16:21  i don't know, i'm about a month backlogged, although it's still alive
00:16:27  wow
00:16:33  make that 1 month 11 days
00:17:04  where i'm at they were doing a Birthday Tournament based on the Fantasy Rules Committee
00:17:36  i'm thinking of rejoining
00:17:49  and trying to clear up bugs for a broken space minigame
00:17:59  (in Agor itself)
00:18:02  *Agora
00:19:02  but i need to find out if any of my email addresses are still receiving stuff
00:19:06 * oerjan is actually trying to read _that_ log, but has about 450 messages left
00:19:58  So is there a nomic-style thing based on something computer-interpretable which is good?
00:20:16  oerjan: are you adding messages to the log faster than you read them?
00:20:53  shachaf: i don't know but i had some fun in schemenomic way back
00:21:40  int-e: not on average but i go several days between binges
00:21:50  well, it's about the same days i'm on irc
00:21:57  a bit fewer
00:27:41  once again schlock mercenary (from yesterday) triggers my fridge logic: what's to prevent the pa'anuri from obliterating the station with their long gun the moment they notice it's been retaken?
00:28:18  unlike the ship, it's unlikely to be able to do massive evasion maneuvers
00:31:22 -!- Cale has quit (Remote host closed the connection).
00:31:50  oerjan: nothing? it is a great risk :P
00:32:48  (I don't know where Howard Taylor is going with this atm. My thought was that if you want to kill off a nigh-indestructible amorph, this is one way to do it.)
00:33:02 -!- arseniiv has quit (Ping timeout: 276 seconds).
00:33:22  he's been killed off before, restored from backup
00:33:30  and these days everyone has backups
00:33:36  Yeah that's the hole in my idea.
00:33:49  Maybe the backup servers... but those have never been talked about.
00:34:23  i hope they do multiple redundancy.
00:35:35  This is the last book... will he bring up old, forgotten lore? Gate keepers, attorney drones (too bad about that contract)...
00:36:15  and it's not clear how distributed they are.  many people might not want Petey / the Oafans to have that complete control so maybe they have their own servers.
00:36:28  Anyway. I like the characters, I've always liked the grand scheme of things so far... I forgive the details :)
00:36:46  I
00:36:54  I'll wait to see where this is going.
00:37:00  another fridge logic: _if_ petey controls all the backups then he could essentially do the Gatekeeper scheme without killing people
00:37:45  But he's benevolent... right?! :P
00:38:11  i'm hoping to see Pa'anuri talk at some point.  for other enemy races, tayler has pretty much always shown that not everyone is evil, but not for the pa'anuri.
00:39:11  Again, I'm happy to wait and see.
00:39:15  well maybe not always.  but often.
00:39:41  . o O ( attorney drones are another exception :P )
00:39:46  i'm thinking there are so many loose ends, how can they possibly fit in one book.
00:39:51  true
00:39:57 -!- Cale has joined.
00:40:22  I suspect some loose ends will be left behind for good.
00:40:28  Especially from the early books.
00:43:51  yeah
00:45:15  In the meantime I'm wondering who exactly the attacker in GG is. (Is it Lucrezia? Is it a van Rijn clank?)
00:45:35  i thought it was pretty clearly lucrezia
00:45:48  she admits to having killed Queens before, after all
00:46:01  It's just... time travel is so weird.
00:46:38  and she can hop bodies too
00:46:41  But yeah maybe for this particular question I'm just stupid.
00:47:09  i'm also wondering whether she's organic or a clank, though, the color is a bit ambiguous
00:52:18  lucrezia's time travel appears to be of the novikov self consistency principle kind, which is still mind bending but a bit saner than rewriting timelines
00:54:32  incidentally, that purple extradimensional gentleman apparently has a name that is only visible in the chapter selection menu
00:54:53  (although people on the girl genius wiki have picked it up)
01:06:21 -!- imode has quit (Ping timeout: 268 seconds).
01:13:30  "This is the last book..." => ah yes. and it's the last book of OotS too. it's crazy how far we've gone. we've been reading it for a while.
02:11:03 -!- Phantom_Hoover has joined.
02:52:34 -!- imode has joined.
03:17:02 -!- Phantom_Hoover has quit (Ping timeout: 265 seconds).
03:17:35  b_jonas: does this have enough from echidna? http://sif.lesidhetree.com/sara/echidna/echidna-uno-doc.pdf
03:18:25  oh, 256 1-byte memory on this one
03:41:00  correction: http://sif.lesidhetree.com/sara/echidna/echidna-uno-doc_1.pdf
04:26:23 -!- tromp_ has quit (Remote host closed the connection).
04:27:22 -!- oerjan has quit (Quit: Nite).
04:37:26 -!- Lord_of_Life has quit (Ping timeout: 276 seconds).
04:38:36 -!- Lord_of_Life has joined.
05:09:10 -!- tromp has joined.
05:13:50 -!- tromp has quit (Ping timeout: 276 seconds).
06:15:13  correction: http://sif.lesidhetree.com/sara/echidna/echidna-uno-doc_0002.pdf
06:15:47 -!- rodgort has quit (Quit: Leaving).
06:20:00 -!- rodgort has joined.
06:21:37  night
06:21:46 -!- Lykaina has quit (Quit: leaving).
06:47:42 -!- tromp has joined.
06:49:35 -!- tromp_ has joined.
06:53:56 -!- tromp has quit (Ping timeout: 276 seconds).
07:05:37 -!- Lord_of_Life has quit (Read error: Connection reset by peer).
07:10:35 -!- Lord_of_Life has joined.
07:39:55 -!- b_jonas has quit (Remote host closed the connection).
08:04:15  [[User talk:Fizzie]] N https://esolangs.org/w/index.php?oldid=66249 * YamTokTpaFa * (+365) /* Requesting to install Extension:Math to this wiki */ new section
08:05:12  [[Totally Accurate Malbolge]]  https://esolangs.org/w/index.php?diff=66250&oldid=55343 * YamTokTpaFa * (+29) 
08:05:41  [[Cubestate]]  https://esolangs.org/w/index.php?diff=66251&oldid=53053 * YamTokTpaFa * (+24) 
08:09:27 -!- imode has quit (Ping timeout: 265 seconds).
08:10:22  [[Template:Disambig]]  https://esolangs.org/w/index.php?diff=66252&oldid=30340 * YamTokTpaFa * (+160) 
08:10:38  [[Template:Disambig]] M https://esolangs.org/w/index.php?diff=66253&oldid=66252 * YamTokTpaFa * (-1) 
08:13:50  [[Esolang talk:Introduce yourself]] N https://esolangs.org/w/index.php?oldid=66254 * YamTokTpaFa * (+255) /* Shall we archive this project page regularly? */ new section
08:14:56  [[Mindcrush]]  https://esolangs.org/w/index.php?diff=66255&oldid=40559 * YamTokTpaFa * (+60) 
08:15:24  [[Codesine/implementation]]  https://esolangs.org/w/index.php?diff=66256&oldid=44357 * YamTokTpaFa * (+30) 
08:28:06 -!- cpressey has joined.
08:28:35 -!- Phantom_Hoover has joined.
08:42:35  [[FISHQ9+]]  https://esolangs.org/w/index.php?diff=66257&oldid=53379 * Dtuser1337 * (+4) /* C */
08:52:43 -!- tromp_ has quit (Remote host closed the connection).
08:54:13 -!- tromp has joined.
08:56:26 -!- tromp_ has joined.
08:59:13 -!- tromp__ has joined.
08:59:23 -!- tromp has quit (Ping timeout: 276 seconds).
09:00:39 -!- tromp_ has quit (Ping timeout: 252 seconds).
09:04:35 -!- tromp__ has quit (Ping timeout: 276 seconds).
09:12:47 -!- tromp has joined.
09:18:29  [[User talk:Fizzie]]  https://esolangs.org/w/index.php?diff=66258&oldid=66249 * Fizzie * (+901) /* Requesting to install Extension:Math to this wiki */ Thoughts.
09:20:56 -!- ais523 has joined.
09:25:10  fizzie: "0b10" is a pp-number (n1570 6.4.8p1), thus by 6.4p4 parsing it as "0 b 10" is not allowed; so this is a syntax error as there's no valid parses
09:25:38  there's a nice example in 6.4p5 that specifically talks about this case, and it's compared to the example of x+++++y (which is also a syntax error)
09:25:58  although I guess this is more about lexing than parsing
09:27:23  now, you can certainly make a reasonable argument that pp-numbers shouldn't allow random letters embedded in them, but they dod
09:27:24  *do
09:28:31  ais523: Oh, I didn't notice it has got /identifier-nondigit/ in it.
09:28:37  hmm, re the discussion of time(1): how does that command actually work? what's the API for timing commands?
09:28:37  That's a bit funky.
09:29:01  I just saw it's got special formats for e, E, p, P and thought it'd be an exhaustive list.
09:29:16  e, E, p, P are the only letters that bridge a sign to their right
09:29:29  other letters are allowed but don't incorporate a + or - to their right as part of the number
09:29:34 -!- wib_jonas has joined.
09:30:15  hmm, this reminds me of a huge annoyance I have with languages that allow - in identifiers
09:30:33  the problem is that identifiers then end up with a random mix of hyphens and underscores in and it's hard to remember which to use
09:30:35  ais523: that is at least more consistent with C++'s relaxed rules, which allow most combinations of numbers and letters as a token lexed to a user-defined literal
09:30:42  By the way, the context for this was whether GNU C (with -fno-gnu-keywords, otherwise it's clear) is a superset of C in the sense that all strictly conforming programs behave the same.
09:30:48  if a language allows hyphens in identifiers, it should probably ban underscores, and vice versa
09:30:49  (and their more relaxed rules for string literals and character literals)
09:30:59  this way we can have one preprocessor that works for all language variants
09:31:24  ah right, the preprocessor is meant to be the same between C and C++, isn't it?
09:31:24  I was reading through the extensions and landed on binary literals in the hopes of making those valid, but looks like the pp-number thing precludes that.
09:32:11  in C89/GNU89, you can use // comments to tell the two languages apart using the //*…*/ trick
09:32:38  oh, there's also the extern inline thing
09:32:39  ais523: I think the opposite way, a language should allow hyphens, underscores, and one or two more characters in identifiers, because that way you can conveniently put base64-encoded stuff into generated identifiers, and still have a delimiter 
09:33:01  but of course printable ascii characters are sparse, so this may not be practical in some languages
09:33:02  but maybe -fno-gnu-keywords would disable that? logically it should
09:33:33  and hyphens are already used for other meanings in C and many languages, so we shouldn't allow hyphens in particular
09:33:38  ais523: I think it disables 'inline' in C90 mode.
09:33:42  isn't that just an argument for allowing two punctuation marks as part of an identifier?
09:33:51  Er, GNU90 mode.
09:33:56  many languages have that, the most common choices being $ and _
09:33:57  Do you think languages should allow spaces in identifiers, like ALGOL 68?
09:34:21  shachaf: oddly the use of _ within identifiers may have indirectly come from ALGOL 68
09:34:27  ais523: yes, it doesn't need to be hyphen specifically, though there's some precedent for hyphens
09:34:45  in ambiguous situations you used a leading . to mark something a keyword and leading or trailing _ to mark something as an identifier
09:34:51  there's also precedent for not allowing hyphens, but allowing _ @ $ . and I think one more in assembly syntax
09:34:54  let me check 
09:34:57  and with two-word identifiers it was usual to put the _ between the words to mark them both as identifiers
09:35:16  though this is used more on windows
09:35:27  wib_jonas: it makes a lot of sense for asm to allow at least one character the source language doesn't
09:35:31  so that you can generate temporary identifiers
09:35:40  ais523: yes, or mangled identifiers
09:36:03  some languages allow arbitrary strings as identifiers, but you can't write them literally in source code
09:36:11  but on the other hand, it also makes sense to allow that character in the source language, possibly with some escaping, but heavily discourage using it in production, because it may clash with temporary or mangled identifiers,
09:36:24  there's some escape syntax, normally similar to that for strings but with a different delimeter
09:36:36  ais523: afaik php does that
09:36:47  so that if you _really_ want to, you can write C code that directly refers to C++ identifiers, even if they're mangled the windows way with @ signs, rather than the unix way with ZZ prefix
09:37:01  like, you can happily define $GLOBALS[""] but you cannot access it via $
09:37:03  we already have this working as the de facto way to access fortran identifiers from C
09:37:11  you just append an underscore
09:37:46  VHDL actually disallows two consecutive underscores from appearing anywhere in an identifier
09:37:48  ais523: Was this on plaforms that didn't support bold keywords?
09:37:51  presumably for this sort of reason
09:37:54  shachaf: i.e. all of them
09:37:58  "arbitrary strings as identifiers, but you can't write them literally in source code" => yeah. perl allows arbitrary or almost arbitrary strings, definitely much more freely than the ordinary identifier syntax
09:38:12  and in fact this is used for some internal hidden stuff, although somewhat inconsistently
09:38:13  "keywords in bold, identifiers in italic" is the "official" definition of the language but nobody actually stores programs like that
09:38:18  Should I support spaces in identifiers?
09:38:31  Hmm, why not?
09:38:40  It works for colorForth.
09:39:51  https://sourceware.org/binutils/docs-2.32/as/Symbol-Intro.html#Symbol-Intro says that gas allows $ _ . as punctuation
09:40:07  details depend on the architecture conventions
09:41:03  shachaf: that too depends on the language. in some languages it makes sense, in others it doesn't. it can also make sense to allow but _ignore_ spaces in identifiers.
09:41:42  wib_jonas: :: and ' are treated as synonymous inside an identifier
09:42:03  in Perl
09:42:10  ais523: IIRC only if you use symbolic references, not if you access the symbol table directly
09:42:12  let me check
09:42:26  also :: is special because it delimits packages
09:43:33  if you're accessing the symbol table directly, is it even an identifier any more?
09:44:48  anyway, ${":'::"} and ${"::':"} turn out to be different variables (the latter is the same variable as ${":::::"})
09:45:01  also :: is special because it delimits packages
09:45:10  `perl -e $f::g = 3; $t = 4; $u = 5; $::{"f::g"} = *t; $::{"f'g"} = *u; print join(",", ${"f::g"}, ${"f'g"}, ${$::{"f::g"}}, ${$::{"f'g"}});
09:45:11  3,3,4,5
09:45:29  ^ right. though I think a few of the rules have changed at some point after perl 5.12
09:45:40  yes, I know, ' is special for the same reason
09:45:57  this is mostly useless in modern Perl, but it has lead to some interesting modules like ACME::Don't
09:46:04  Ah, the T_PAAMAYIM_NEKUDOTAYIM token.
09:46:37  I think they at least changed the error message to no longer say that in PHP, and added T_DOUBLE_COLON as an alias for the token.
09:46:56  is there an explanation for why it was in Hebrew in the first place? IIRC the other tokens weren't
09:46:58  ais523: yeah, maybe it doesn't count as an identifier then, I don't know. the symbol table still doesn't behave like an ordinary hash, but its keys mostly do, only its values don't
09:47:07  …did PHP's parser use strlen for hashing too? :-D
09:47:40  I think it was in Hebrew just as a little easter egg about the developers.
09:50:27  (the reason PHP's built-in functions are named so inconsistently is that they used to be hashed using strlen, and thus needed a wide distribution among the possible names)
09:51:24  ew
09:51:38  One odd thing is that "nekudatayim" would be a more correct transliteration.
09:52:56  one of my favorite php bugs was that matching for class names or interfaces is made on lowercase of the name. this results in class Foo implement BarInterface not working on turkish locales because lowercase will result in a small i without a dot which does not match the small i with the dot that it's matched against
09:54:45  myname: right. which is why compilers shouldn't care about the locale, not even as much as javac does, to decide what encoding to decode string literals from
09:55:29  if a program uses locale-sensitive operations (e.g. is written case-insensitively), it should have an explicit locale declaration, just like programs typically have an explicit encoding declaration
09:56:17  also excel cares about the number and date formats that are set globally to the user, so some more obscure things that you can do with macros (that effectively eval a formula) will break if you use the spreadsheet on a machine with different settings,
09:57:22  it's a very common mistake to use an IO routine intended for human-readable numbers on machine-readable numbers or vice versa
09:57:27  because on locales with dot as the decimal separator, dot is parsed as decimal point, comma as argument separator, and semicolon as magic; on machines with comma as the decimal point, comma is parsed as decimal point, semicolon as function argument separator, and backslash as magic.
09:57:53  and these stupid industry systems that we use at work are even worse in this respect, depending on the global locale, as well
09:58:15  though not quite in the way that excel is, they depend on the locale in different ways
09:58:37  but the end result is also that you sometimes have to set global locale settings to be able to run a program
10:02:12  the locale settings for a program should in theory tell it how to interact with the user and the user's files, terminals, etc.
10:02:25  so that means you need two different APIs, one for the user's files, one for the program's own files
10:02:32  but this is a distinction that not enough languages draw
10:02:45  and most that do, don't draw in a useful manner
10:03:09  (Java, for example, has a concept of a "program's own files" when working out the security implications of opening a file, but this doesn't extend to encoding/locale as far as I know)
10:05:20  there's also the strange but tolerable results that you get on windows when a program uses a stock message box and the message in it is in a different language than the captions of the "Yes" and "No" buttons, because the latter come from windows's message language, the former from the program's
10:07:20  right, the Windows library has an API for "show me a dialog box with yes/no buttons" that's orders of magnitude easier to use than a custom dialog box would be
10:07:30  so that helps to get the dialog boxes standardised
10:07:51  (arguably it'd make sense to have an API for "show me a dialog box with n buttons, here's the text to show on them" but last time I checked, it didn't)
10:08:08  I wish platform APIs were much simpler, with things like that moved into a standard library that you can link if you want.
10:08:10  Luckily I finally managed to get a configuration of windows at work where the message language of every program is english, even that of office and firefox. Though firefox breaks that config once every few years.
10:08:59  I assume your workplace normally uses Hungarian?
10:09:13  So I only get mixed language stuff on machines other than my main one, though I do have to touch other machines (by remote access) often.
10:09:31  ais523: yes, or at least mixed hungarian and english, because many programs aren't localized to hungarian
10:10:25  surely the appropriate fallback for programs with no hungarian localisation would be Finnish? ;-)
10:10:35  mind you, windows 10 sort of requires you to install the message localization of windows in order to be able to use hungarian keyboard layout, even when that's not the primary keyboard layout. so I do have a full copy of hungarian messages on windows on the hard disk. 
10:11:27  oóőö
10:11:45  ais523: they don't have localization in finnish too. they're Siemens programs, they sometimes have parts that are accidentally localized only in german, not in english, or that can be switched to english but default to german, or where a list in the english help file is sorted by the german order.
10:11:46  `òh nó´
10:11:47  ​/srv/hackeso-code/multibot_cmds/lib/limits: line 5: exec: òh: not found
10:11:49  I guess Hungarian isn't /that/ hard to type on a UK keyboard (at least under X/Gnome)
10:11:50  Oops.
10:11:51  double accents?
10:12:13  I use the keyboard layout US International (AltGr deadkeys)
10:12:25  It's great. Everyone should have an AltGr key.
10:12:27  myname: Hungarian has a double acute, which is basically an acute and umlaut at the same timee
10:12:29  *time
10:12:52  i have no idea on how to pronounce that, but i like it
10:12:54  although the "acute" is more of a length mark, the macron is more standard for that
10:13:20  ais523: does that include uppercase letters like ÁÉŐ, and common punctuation like „a” b – c … d?
10:13:25  shachaf: what does altgr-` produce on that?
10:13:51  ÁÉÓ are easy enough
10:13:58  It behaves like a deadkey, so altgr-` a produces à
10:14:04  as are “”, but I don't know where the inverted ” is
10:14:05  But ` by itself produces `
10:14:25  ah, I see, so it's different from the UK layout but mostly just a rearrangement of keys it has
10:14:33  Which UK layout?
10:14:40  on a UK layout, dead grave is AltGr-#
10:14:47  Aha.
10:15:01  The default US English layout has no deadkeys and no way to type à
10:15:38  and this is the standard UK English layout
10:15:49  there are variants but they're mostly things like Dvorak that make really major changes
10:16:06  that said, the altgr-combinations work differently on Linux and Windows, and kind-of suck on Windows
10:16:08  I should probably make my own layout or at least my own compose key file at one point.
10:16:17  ais523: in theory yes, but I can be the devil's advocate and argue against. The letters á and é are overwhelmingly more common than any other accented letter in Hungarian, and "é" changes openness compared to "e" and "á" changes every vowel quality compared to "a". 
10:16:17  Since I often don't know how to type the things I want.
10:16:21  The length of vowels is hard to perceive in some context, you find situations where the length is uncertain in writing or can be changed deliberately for meter, and this is the most common for words ending in "ú", but very rarely happens for "e" vs "é". 
10:16:21  Linux has a really complete set of them
10:16:33  Fortunately I have a good Unicode searcher and selector.
10:16:47  the only real change I made to the layout was to move Compose to Caps Lock (and Caps Lock to Shift-Shift), because Compose is used often enough that the default binding of Shift-AltGr is awkward
10:18:13  I think I might also have re-enabled Ctrl-Alt-Backspace? but I don't want to try pressing it to find out
10:18:49  ais523: I don't usually bother with the altgr combinations on windows. I mostly just switch back to the US-english layout for typing fancy puntuation. There are even some ascii characters for which I really can't remember which key is it on with altgr on the Hungarian layout. The ampersand is somewhere in the z-m row, but I don't know where.
10:19:05  (I know I re-enabled a lot of Alt-SysRq sequences but those don't have much to do with the keyboard layout, and in fact are IIRC typed in QWERTY regardless of what the layout is)
10:19:09  Hmm, I use Caps Lock for Esc. Maybe I should map Esc to compose.
10:19:21  As for typing non-ascii stuff on windows, I mostly just open either Wordpad or Word, type the unicode character code in hex, press alt-x, and copy-paste.
10:19:49  having a dedicated key for Esc that means something on its own is an antipattern :-(
10:20:52  it's convenient but it's ambiguous with a lot of things that use Esc as a prefix
10:21:03  What uses Esc as a prefix?
10:21:08  I do type some hungarian text occasionally in mails, and for that I sometimes use the hungarian layout for words.
10:21:10   on a UK layout, dead grave is AltGr-#     Oooh, this is helpful
10:21:39  Apparently in my layout, AltGr-Shift-3 a produces ā
10:22:11  ā is altgr-shift-] a for me
10:22:38  the dead accents are basically all AltGr + punctuation on the right side of the keyboard
10:23:00  shachaf: I type that one by character code, 0x101
10:23:07  there's a sort-of logic to it, with AltGr-; AltGr-' AltGr-# acute, circumflex, grave
10:23:30  äåãāáâǎàă
10:23:41  "dead grave" sounds a lot scarier than it actually is
10:23:43  AltGr-' AltGr-6 AltGr-` seems much more logical.
10:24:18  indeed, but sequences like altgr-6 are risky to use for forward compatibility reasons
10:24:24  as that's where newly discovered punctuation marks go
10:24:37  (most notably, altgr-4 for €)
10:24:55  AltGr-Shift-4 produces £ here
10:25:05  there's a logic to the character codes in the iso-8859-1 and latin-extended-A regions too. the order is always the same: grave, acute, circumflex, tilde, umlaut, macron, brevis for vowels.
10:25:22  shachaf: ugh, I'd expect £ variants to be tied to 3
10:27:04  (It gets uglier for consonants.)
10:27:37  What does the x86-64 extension do?
10:27:39  you must have lots of fun on international shippings
10:28:00  Presumably it gives you access to a second set of punctuation marks.
10:28:10  huh?
10:28:44  If you use the REX prefix on ISO-8859-1, I mean.
10:28:58  aren't the REX prefixes capital letters?
10:29:08  apart from the null REX prefix, which is @
10:29:41  That's true.
10:29:45  I'm not sure whether rex.b or rex.x would be more appropriate for the second set of punctuation marks
10:30:13  `asm .byte 0x41, 0x90, 0x42, 0x90, 0x44, 0x90, 0x48, 0x90
10:30:13  Or rex.r? I don't think puncutation marks even use memory addressing.
10:30:15  0:  41 90   xchg %eax,%r8d \ 2:  42 90   rex.X xchg %eax,%eax \ 4:  44 90   rex.R xchg %eax,%eax \ 6:  48 90   rex.W nop
10:31:09  actually, yes, rex.r is the only one that makes sense in almost every context
10:31:20  although, hmm, no
10:31:39  as the examples above show, rex.b is the relevant bit when you have only the one non-fixed argument
10:31:52  presumably because most commands can take either register or memory
10:32:12  Oh, hmm.
10:32:28  so I'm guessing we use a prefix of capital A to switch to the other set of punctuation marks
10:32:57  `asm xchg %al, %sil
10:32:59  0:  40 86 c6   xchg %al,%sil
10:33:06  But https://www.felixcloutier.com/x86/xchg says 90+rd is XCHG EAX,r32
10:33:21  Why would that use REX.B instead of REX.R?
10:33:49  more to the point, why doesn't one affect the EAX and the other affect the r32?
10:33:51  Oh, I was mixed up.
10:34:09  REX.R specifically affects the "reg" field of the ModR/M byte.
10:34:30  Actually, no, this is still kind of odd.
10:35:15  `asm .byte 0x87, 0324
10:35:17  0:  87 d4   xchg %edx,%esp
10:35:31  `asm .byte 0x44, 0x87, 0324
10:35:32  0:  44 87 d4   xchg %r10d,%esp
10:35:45  `asm .byte 0x41, 0x87, 0324
10:35:46  0:  41 87 d4   xchg %edx,%r12d
10:35:47   REX.B: 1-bit (msb) extension of the ModRM r/m field 1 , SIB base field 1 , or opcode reg field, permitting access to 16 registers.
10:36:00  Oh, that's better than the source I read.
10:36:02  that's very clear
10:36:13  AMD invented this instruction set, so I use their documentation to learn about it
10:36:34  the " 1 " should be "¹", there was a character encoding mishap
10:36:41  it's just a reference to a footnote
10:36:53  I wonder why it's not REX.R, though.
10:37:11  To me the opcode reg field seems a lot like the modr/m reg field.
10:37:27  "a prefix of capital A to switch to the other set of punctuation marks" => actually it's more like a prefix  in utf-8
10:37:59  `unicode U+00C2
10:38:00  ​Â
10:38:46  wib_jonas: your statement is really confusing, not because I don't understand it, but because trying to make sense of it means mixing character encodings in a really weird way
10:39:04  are you assuming that the encoding is UTF-8-as-Latin-1 mojibake?
10:39:23  although mojibake isn't really a character encoding, it's something else
10:39:36  /encoded/ mojibake is a character encoding
10:39:54  you should be able to set the locale to, say, "UTF-8 misinterpreted as Latin-1 and then encoded in UTF-8"
10:49:31  hmm, actually Latin-2 would be the appropriate set to mojibake into in Hungary
10:49:52  but C2 is still  there
11:05:11  Is there any reason to target 32-bit x86 nowadays?
11:05:50 -!- Phantom_Hoover has quit (Ping timeout: 246 seconds).
11:07:03  my current attitude towards 32-bit x86 is to not worry about performance at all on it
11:07:13  I'll write programs that are only efficient on 64-bit systems
11:07:26  Will they still work on 32-bit systems? 
11:07:41  at the source code level, yes
11:07:50  I don't normally write raw asm, but when I do it's processsor-specific
11:10:50  is there such a thing as processor-indipendent asm?
11:12:02  ais523: "UTF-8 misinterpreted as Latin-1 and then encoded in UTF-8" is called double-utf, but yes
11:12:20  myname: WebAssembly is created as that
11:12:25  there were a few attempts before then that didn't catch on
11:12:32  and the more common version is à before a letter to turn it to an accented letter
11:12:34  also, C gets described at that sometimes, but I don't think it's an accurate description
11:14:27  and yes, it might not make more sense, but using a REX prefix to switch punctuation marks also doesn't make much sense
11:15:04  There's certainly various degrees of processor-dependedness, in the sense that you can target the lowest common denominator of a specific instruction set.
11:21:28  [[Salary program]] N https://esolangs.org/w/index.php?oldid=66259 * A * (+410) Created page with "The [[Salary program]] is a well-known [[Golf]]-oriented [https://esolangs.org/wiki/Category:Program_forms program form] on [https://codegolf.stackexchange.com/ CGCC] [https:/..."
11:24:32  myname: There's also LLVM.  The idea is quite old (see e.g. https://en.wikipedia.org/wiki/P-code_machine)
11:26:21  IIRC LLVM isn't portable, in the sense that different targeted platforms will have slightly differently looking LLVM
11:28:53  Right, LLVM is lower level in the sense that if you want to generate good optimized machine code through LLVM, then you already optimize the LLVM code you write to the particular cpu and instr set and other circumstances. In particular, you tell LLVM where to use 32-bit integers and where 64-bit ones, and that's a decision that depends on your cpu.
11:29:37  That seems like a rather ungenerous definition of "portable" to me
11:29:46  I wonder if it's portable in the sense of being able to transpile any LLVM IR onto any CPU
11:30:06  or, more, compile/assemble, I guess
11:30:11  not sure what the right verb for this is
11:31:03  It occurred me recently that "compiler", "assembler", and "linker" all have roughly the same meaning.
11:31:05  At any rate, it bills itself as portable, and it's fairly widely used, so one should at least be aware of it.
11:31:44  It also billed itself as low-level, and as a virtual machine.
11:32:15  I didn't think of LLVM as a universal asm because I didn't think of it as an asm
11:36:39  idk but the first line of the manual is "This document is a reference manual for the LLVM assembly language."
11:37:42 -!- ais523 has quit (Ping timeout: 258 seconds).
11:55:03  The LLVM modules generated by clang aren't portable in the sense that they contain datalayout -- https://llvm.org/docs/LangRef.html#data-layout -- and target triple -- https://llvm.org/docs/LangRef.html#target-triple -- specifications that identify the target processor. But I think those are optional, and it's probably possible to write LLVM modules that are applicable to more than one target.
11:57:21  cpressey: when LLVM bills itself portable, doesn't that mean that it can produce output machine code to multiple architecutres, but not necessarily from the same input? just like how gas and the rest of binutils are portable, they can assemble ARM assembly code to ARM machine code or x86_64 assembly code to x86_64 machine code, but not ARM assembly
11:57:21  code to x86_64 machine code.
11:57:44  ah yes, that's what ais hints about the word "portable" I guess
11:58:56  AIUI, the LLVM IR also encodes assumptions about the platform's ABI if you call anything external to the program, so it's not portable in that sense.
11:59:19  http://llvm.org/docs/FAQ.html#can-i-compile-c-or-c-code-to-platform-independent-llvm-bitcode "Also, since many platforms define their ABIs in terms of C, and since LLVM is lower-level than C, front-ends currently must emit platform-specific IR in order to have the result conform to the platform ABI."
12:00:24  But a self-contained program written in the LLVM IR might be "portable" to some degree.
12:04:45  [[Greentext]]  https://esolangs.org/w/index.php?diff=66260&oldid=55935 * YamTokTpaFa * (+9) 
12:05:43  [[Template:WIP]] M https://esolangs.org/w/index.php?diff=66261&oldid=66184 * YamTokTpaFa * (-2) 
12:10:34  [[Salary program]]  https://esolangs.org/w/index.php?diff=66262&oldid=66259 * A * (+209) 
12:11:01 -!- ais523 has joined.
12:13:29  OK, so LLVM is portable as a language in its own right, but can't be portable when used as a backend for something else because the "something else" may need to vary things based on the details of the platform and LLVM can't vary them the same way
12:16:52  ais523: no, I think it's more like that most of LLVM is portable, so it's portable enough that you can write working programs that LLVM can compile on multiple systems, but that's not typically what you do, because you use LLVM to make optimized programs, and you can't write good optimized program that LLVM compiles from the same source on multiple
12:16:53  platforms
12:17:05  this is even true to a lesser extent for C or C++ actually
12:17:19  but more true for LLCM
12:17:24  for LLVM
12:18:34  wib_jonas: well, you could write the program in "high-level" LLVM and optimise it for the target platform
12:18:44  it's not like LLVM translates directly into asm anyway, e.g. you need to do register allocation
12:20:09  yes, and LLVM knows a lot about the platform-specific stuff, it abstracts away most of the unportability, but not all of it
12:20:45  anyway, I don't really know much about this, because luckily I don't write programs in LLCM
12:20:51  in LLVM -- darn, I can't type this
12:21:05  that's for serious compiler maintainers to know about
12:28:02 -!- APic has quit (Ping timeout: 265 seconds).
12:47:08  lol... I'm reading the intel x86 architecture reference manual. it has some statements that are necessary but still funny.
12:47:37 -!- arseniiv has joined.
12:48:39  in particular, it has a note about when you execute from memory that is also used as paging table entries, and how when the cpu updates the dirty and accessed bits of those page table entries because of paging, it has less guarantees than usual about self-modifying code
12:49:39  they need this statement because, for legacy 386 compatibility reasons, x86 provides very strong guarantees about the semantics of self-modifying code (even though the performance of such is abysmal)
12:50:47  executing a page table is admittedly not something I had thought of
12:51:19  there are similarly silly cases, like executing an interrupt vector, which are at least likely to be easy to implement
12:52:00  (although I imagine that in some architectures, interrupt vectors are actually executable code rather than a list of addresses)
12:54:17  yes, 6502 has executable interrupt vectors, as in, the interrupts jump to a fixed address rather than load the jump address from a fixed address
12:59:37 -!- APic has joined.
13:22:15  It also has the ridiculous statement "Processors need not implement any TLBs." about caching page translation info
13:23:35 -!- Lykaina has joined.
13:23:55  http://sif.lesidhetree.com/sara/echidna/echidna-uno-doc_0002_1.pdf
13:26:48  i mean, hi
13:28:42  wib_jonas: hi
13:29:41  a thought I've been having: currently, assemblers do two jobs, one is converting asm to machine code, the other is resolving things like jump destinations and .align directives and the like
13:29:49  but the latter job duplicates what the linker does
13:30:27  perhaps it would make sense for assemblers to /only/ do the first job, and the linker is the only thing that does the second
13:30:47  (for performance, this means that you would probably want to link individual object files as they were created, and then link those object files together later in the build)
13:31:11  current linkers support incremental link, I think, even though it isn't the normal way to do things; this would be an extreme version of that
13:32:50  the advantage of doing things this way is that the exact layout of an object file in memory could be deferred to later in the build if necessary
13:33:06  ais523: I think that would be rather inefficient in the common case, when and a lot of references are quickly resolved by the assembler, and would be inefficient to emit symbolically to the linker, since the linker would have to do all the tasks of the second pass of the assembler, plus the assembler is usually not run separately but is built into
13:33:06  the compiler in such a way that it doesn't go through actual assembly syntax.
13:33:54  as in, the assembler resolves all the local references, so the linker only moves larger sections around
13:34:51  well, the advantage of leaving the local references unresolved is that you can move small parts of the code around, e.g. to substitute a short jump for a long jump in the case where the target happens to be nearby
13:35:05  present compilers have to leave enough space for the longest possibile jump
13:35:13  How much this matters may depend on the cpu architecture of course, in some older cpus you'd have a lot of local references because there are few ways to avoid jumps and you have to load large constants as memory accesses rather than immediates.
13:35:46  if your large constants are memory accesses you'd often be loading from rodata anyway (= you need the linker)
13:35:54  although I guess there's an argument for putting them in text
13:36:40  ais523: I don't think that will often happen, because each function (in the low-level sense) will be assembled to the same section, and you use calls and returns rather than jumps between functions, and those can't be short even if the functions are close to each other.
13:37:01  if there's an opportunity for a short jump, then the functions will be compiled together at the optimizer and inliner state already.
13:37:04  tail calls are jumps, in some calling conventions
13:37:56  ais523: no, you can't load all the constants from rodata, because then you have to load their _address_ somehow, and you'd have to load those from rodata too etc
13:38:10  you have relocations
13:38:19  but I see, assuming PIC
13:38:36  then rodata probably isn't in a constant space relative to text due to ASLR, and you don't want to do the relocation at runtime
13:38:41  on those older cpus, you load the long immediates from the text with IP-relative or similar accesses. you can still do that on modern cpus like x86_64, it's just usually not worth because they have more convenient immediates.
13:38:47  although, hmm
13:38:56  this is for old cpus which don't have a way to load a full immediate
13:39:00  maybe rodata is in a constant location relative to text, because rodata is constants too
13:39:02  a full sized immediate
13:39:04  only a small one
13:39:14  wib_jonas: modern CPUs can't load full sized immediates either
13:39:28  ais523: sure, but they're closer to it
13:39:46  on x86-64 largest possible immediate is 64 bits for movabs, largest register is typically 256 bits wide
13:40:21  right, but the 64 bit load is enough to give the address into anywhere else at least
13:41:26  but I guess you're right, you could load such constants (or even index small tables) from the code section and place them close to the function
13:41:34  that still usually works on x86_64
13:46:37  basically, by putting the read-only data and the code into the same section (but not in the same cache line), you guarantee that they're no farther than 2**31 bytes, so you can access them with a simple and efficient RIP-relative access, and the linker doesn't have to translate the addresses
13:47:10  now I'm wondering if it's bad to have executing code and read-only data on the same cache line
13:47:38  it's obviously bad to have executing code and writable data on the same cache line, but there's no obvious reason why in the former case you couldn't just load it into both L1 caches
13:49:26  fwiw, the thing that inspired the "let's do the linking outside the assembler" idea was that I was reading about how TLS is implemented
13:49:46  and there are four different ways to implement TLS, some of which are faster but less general, and the optimisation is done by the linker
13:50:01  which means it has to delete code sequences from the executable and replace them by sequences of different length, sometimes
13:50:18  currently this is implemented by leaving padding in the code so that the linker can overwrite it, but that seems ridiculous
13:50:24  ais523: also, if the linker moved around code in small parts, then the assembler would have to be able to tell it not only how to move the code, but also how to adjust the detailed debugging information and the unrolling info. that would make the linker even more complicated than it already is.
13:51:30  ais523: same cache line => only bad in the sense that it can waste the L1 cache, because the L1 cache is separated to an L1D cache that is used for data access only and an L1C cache that is used for code access only, and both are small, so you'd have a half-used entry for the same cache line in both; 
13:52:00  well, it depends on whether you can fit other useful data into the same cache line
13:52:08  if not there's no actual loss
13:52:25  plus to some amount the same thing for decode caches and branch prediction and branch target caches, but those usually work at 16-bit sized units rather than 64-bit ones currently
13:52:32  err, depending on where the code ends
13:52:54  if you have 1½ cache lines of code and ½ a cache line of data, you want to merge them into 2 cache lines, not separate them into 3
13:53:17  as either way you end up with 3 cache lines between the two L1 caches
13:53:21  ais523: yes, if you can fit read-only data without losing space, then it's not bad, but separating data and code to separate cache lines is a good enough general rule and you rarely lose from following it
13:53:50  so why not have rodata in a fixed location relative to text, and put the constants in rodata?
13:54:35  "rodata in a fixed location relative to text" is probably required anyway (especially if you don't have a PIC base register), otherwise the references to data from rodata will be too expensive
13:54:35  ais523: in fact it may make sense to separate them to separate pages, at least on some cpus... I don't recommend the recommendations taht the optimization manual says
13:54:57  but even if they're in separate pages, they can be within 2**31 bytes from each other, which is still useful
13:55:04  fwiw, many compilers seem to prefer using multiple movabs instructions
13:56:22  ais523: sort of, but putting them to fixed location can be done in the linker, which places those two segments and resolves references between them at link time. I think it could even place them within 2**31 from enough (unless they're very large of course)
13:57:27  multiple movabs instructions => sure, if you can use them, use them
13:57:57  interestingly, AMD doesn't use the term "movabs"
13:58:00  at that point it's a tricky call, can depend on what's tight in that part of the code, L1 cache accesses or decoding
13:58:00  to them it's just a variant of the mov instruction
13:58:15  does intel use it? I think they don't either\
13:58:32  I think movabs is just an AT&T assembly syntax thing
13:58:41  I would have thought movabs would decode quickly; it's easy to find the end of it, for example
14:02:02  `asm .byte 0x66, 0x66, 0x48, call 0x12345678
14:02:06  ​/tmp/asm.s: Assembler messages: \ /tmp/asm.s:1: Error: junk at end of line, first unrecognized character is `0' \ /tmp/asm.s: Assembler messages: \ /tmp/asm.s:1: Error: junk at end of line, first unrecognized character is `0'
14:02:09  `asm .byte 0x66, 0x66, 0x48; call 0x12345678
14:02:11  0:  66 66 48 e8 00 00 00 00   data16 data16 callq 0x8
14:02:23  `asm .byte 0x66, 0x66, 0x48; call $0x12345678
14:02:24  0:  66 66 48 e8 00 00 00 00   data16 data16 call 0x8
14:02:25  ais523: it's not just about the speed of decoding, it's also that if you use, say, four movabses to load a 32 byte constant rather than a single 32-byte memory load, then you get longer code, which uses up more of the decoded cache
14:02:47  `asm .byte 0x66, 0x66, 0x48; callq $0x12345678
14:02:48  0:  66 66 48 e8 00 00 00 00   data16 data16 call 0x8
14:02:54  it could also decode slowly, but that's less of a problem
14:03:05  hmm, I wonder what's happening to the argument to call
14:03:19  but I guess most of the time the decoding won't be the problem
14:03:24  oh right, the µop cache
14:03:43  it's kind-of crazy that something like that is beneficial
14:03:49  ais523: that, and the other cache that runs very short loops, but you don't put constant loads in those
14:05:05  the branch predictors on modern processors predict loop counts for loops with a small fixed loop count
14:05:23  ais523: it's beneficial only in intel cpus, not on amds, because intel has a broken decoder that only decodes one aligned 16-bit block of code per cycle, and if you write floating point machine learning code that never hits an L1 cache miss, then it will execute four floating-point add-multiplies in a clock cycle, and those four instructions are
14:05:24  longer than 16 bytes
14:05:29  arguably it'd make more sense just to have a processor instruction for a loop with a small fixed count, then the prediction could be perfect
14:05:33  s/16-bit/16-byte/
14:06:37  in AMD processors there are three decode units and an instruction can take up one, two, or all three of them (the three-unit instructions also cause a pipeline stall in the decode, so they're recommended against)
14:07:08  at least, that's how it worked last time I checked, it might have changed since
14:08:20  `asm nopw %cs:0x0(%rax,%rax,1)
14:08:21  0:  2e 66 0f 1f 04 00   nopw %cs:(%rax,%rax,1)
14:08:34  that's not as long as I thought it would be
14:09:19  perhaps there should be a VEX version of a NOP?
14:09:33  "2E" for segment override, "66" for data size override, "0F 1F" for the opcode, "04" for mod/rm byte, "00" for SIB byte
14:10:12  but you can add a displacement if you want a longer one
14:10:21  and drop the segment override, that never helps
14:11:14  ais523: the intel manual and the amd manual both describe what nops you should use, and the intel gives a 9-byte nop as the longest, but all the nops that are longer than one byte have an input dependency on a general register that you can choose
14:11:30  the amd version is easier
14:12:22  that said, when writing or compiling actual code, you can use instructions that are technically not nops, but are fast and don't do anything that matters in the context of the particular code, such as zero a register
14:13:01  that works for shorter nops only I think, but there it may sometimes be easier than following intel's recommendations
14:13:10  for longer nops I think you're out of luck
14:13:46  `asm .byte 0xc4, 0xe1, 0x79, 0x1f, 0x04, 0x00
14:13:47  0:  c4 e1 79 1f   (bad)  \ 4:  04 00   add $0x0,%al
14:14:01  no no
14:14:06  that was an attempt to encode a NOP using VEX, just for fun
14:14:19  (I know you can't actually use VEX on non-SSE instructions)
14:14:33  (but it's in an opcode map that means the syntax exists, at least, the processors just reject it)
14:14:35  I mean like sub %r8w, %r8w
14:14:53  no wait
14:14:57  `asm sub %r8w, %r8w
14:14:58  0:  66 45 29 c0   sub %r8w,%r8w
14:15:01  it shouldn't be word-sized
14:15:06  although that isn't a no-op, of course
14:15:10  it should be dword or qword size
14:15:17  sub %r8d, %r8d
14:15:21  which is only three bytes
14:15:29  `asm .byte 0x67; and %r8, %r8
14:15:30  0:  67 4d 21 c0   addr32 and %r8,%r8
14:15:34  yeah, I think you can do this only for two or three byte long nops
14:15:55  maybe more if you zero an SSE register, but on newer cpus only
14:15:56  there's no reason you /can't/ stick an 0x67 prefix on there
14:16:03  even if 0x66 would cause trouble
14:16:12  although, both sub and and change flags
14:16:19  (and is better because at least it doesn't change the register)
14:16:38  doesn't the 0x67 prefix cause a decoding slowdown?
14:16:55  not sure; it's used so rarely that maybe it does
14:17:17  yes, but it doesn't _read_ the flags, and doesn't _read_ the registers, it only writes them
14:17:31  surely lea is the best instruction, anyway?
14:18:06  `asm leaq 0(%r8), %r8
14:18:08  0:  4d 8d 00   lea (%r8),%r8
14:18:17  you could use a 4-byte displacement there
14:18:26  `asm leaq 0(%r12), %r12
14:18:27  0:  4d 8d 24 24   lea (%r12),%r12
14:18:30  on newer cpus, you can get four and five byte instructions to zero an xmm register
14:18:52  that can be terrible for performance in some cases, initializing the FPU takes ages
14:19:00  if it's switched off for power-saving purposes
14:19:05  (probably bad for power drain, too)
14:19:14  admittedly, lots of things use vector registers nowadays
14:19:29  `asm leaq 0x12345678(%r12), %r12
14:19:30  0:  4d 8d a4 24 78 56 34 12   lea 0x12345678(%r12),%r12
14:19:40  or more likely, if you're using 32-byte ymm registers and you suddenly zero a 16-byte one
14:19:59  `asm .byte 0x4d, 0x8d, 0xa4, 0x24, 0x00, 0x00, 0x00, 0x00
14:20:00  0:  4d 8d a4 24 00 00 00 00   lea 0x0(%r12),%r12
14:20:06  "lea is the best instruction" => again, that depends on what for and where
14:20:06  that should be a true NOP, I think
14:20:14  and might be pretty fast to both decode and run
14:20:26  doesn't play well with 0x66 prefixes, though
14:22:20  and I think on intel it's strictly worse than nopw 0(%rax,%rax,1)
14:22:50  according to AMD, an lea runs in one cycle if it only has one register and no scale on the LHS
14:23:03  no, I mean worse than nopw 0(%r12,%r12,1)
14:23:12  sorry
14:23:17  worse or equal, obviously
14:23:18  although, on AMD (and probably also Intel), a nop runs in zero cycles (the only time it spends is the time spent in decode)
14:24:03  I think that only applies to 0x90 nop, though
14:24:16  which is why the recommended pattern on AMD is 0x66 0x66 0x66 0x90
14:24:22  repeated to fill space
14:24:37  the eight-byte nop doesn't execute, the only cost it has is that it has a false _read_ dependency on %r12, so it won't be scheduled until the value of %r12 is available
14:25:05  it doesn't actually compute the address or attempt access the memory if I understand correctly
14:25:23  and I think it doesn't even tie up any execution core, but that doesn't typically matter
14:25:28  s/core/unit/
14:25:39  0x90 NOP has the benefit that it isn't scheduled at all, though
14:26:26  whereas an instruction like sub %r12d,%r12d is three bytes long, doesn't depend on any input register, and only writes flags, not any register in execution
14:26:44  0x90 nop is very magical
14:26:45  yes it does, it writes 0 in %r12d
14:27:02  do you mean sub $0, %r12d
14:27:04  ais523: the effect writes the register, but the execution units and the register file don't know that
14:27:18  it's handled in decoding/scheduling by renaming the register
14:27:36  so that %r12 will refer to a zero register rather than whatever entry contained the value before the instruction
14:27:44  oh I see, in that case you should be using xor I think
14:27:52  xor vs sub doesn't matter
14:28:04  it does also write the register for the purpose of dependencies (but doesn't read)
14:28:18  don't the processors that special case sub-of-itself also special case mov 0?
14:28:34  I don't think so, but I'm not sure
14:28:45  mov $0 seems to be superior in two ways: a) it doesn't change flags (thus removing potential false dependencies on flags), b) the encoding is longer
14:29:09  `asm movq 0x00000000, %r12d
14:29:10  ​/tmp/asm.s: Assembler messages: \ /tmp/asm.s:1: Error: operand type mismatch for `movq' \ /tmp/asm.s: Assembler messages: \ /tmp/asm.s:1: Error: operand type mismatch for `movq'
14:29:12  `asm movq 0x00000000, %r12
14:29:13  0:  4c 8b 24 25 00 00 00 00   mov 0x0,%r12
14:29:23  I dunno
14:29:44  maybe it depends on how the 0 is encodedd
14:29:48  `asm movq 0x00, %r12
14:29:49  0:  4c 8b 24 25 00 00 00 00   mov 0x0,%r12
14:29:58  although I don't think there is an 8-bit mov into a non-8-bit register
14:30:04  `asm movzxq 0x00, %r12
14:30:09  ​/tmp/asm.s: Assembler messages: \ /tmp/asm.s:1: Error: unsupported syntax for `movzx' \ /tmp/asm.s: Assembler messages: \ /tmp/asm.s:1: Error: invalid instruction suffix for `movzx'
14:30:13  `asm movzx 0x00, %r12
14:30:16  0:  4c 0f b6 24 25 00 00 00 00   movzbq 0x0,%r12
14:30:28  that one probably isn't optimized, to be fair
14:30:40  oh, I forgot the $
14:30:42  for a long nop, I'd also suggest prefetcht2 0, which is 8 bytes long
14:30:43  so it segfaults :-)
14:30:48  `asm movq $0x00, %r12
14:30:49  0:  49 c7 c4 00 00 00 00   mov $0x0,%r12
14:30:52  and can be 9 byte if you add a redundant REX prefix
14:31:01  `asm movzxbq $0x00, %r12
14:31:02  ​/tmp/asm.s: Assembler messages: \ /tmp/asm.s:1: Error: no such instruction: `movzxbq $0x00,%r12' \ /tmp/asm.s: Assembler messages: \ /tmp/asm.s:1: Error: no such instruction: `movzxbq $0x00,%r12'
14:31:13  movzx doesn't allow an immediate, right
14:31:24  `asm movzbq $0x00, %r12
14:31:25  ​/tmp/asm.s: Assembler messages: \ /tmp/asm.s:1: Error: operand type mismatch for `movzb' \ /tmp/asm.s: Assembler messages: \ /tmp/asm.s:1: Error: operand size mismatch for `movzb'
14:31:29  hi Lykaina 
14:31:33  ais523: r12 is callee-saved, that's why it segfaults
14:31:37  yes, it helps if you get the instruction name right, but not enough ;-)
14:31:45  wib_jonas: no, I dereferenced NULL, that's why it segfaults
14:31:49  oh
14:32:14  I find the "numbers are memory addresses by default" pattern pretty unintuitive
14:32:49  I wonder if you could also use a two-byte short jump as a nop of between 2 and 120something bytes long
14:33:31  of course that's also not always applicable, it works best if you have no other jump in the 16-byte block
14:33:52  or something like that, I'm not sure how all that works
14:35:29  is there an unconditional two-byte jump?
14:35:47  `asm jmp 0x8
14:35:49  0:  e9 00 00 00 00   jmpq 0x5
14:35:55  `asm jmp $0x8
14:35:56  0:  e9 00 00 00 00   jmp 0x5
14:36:08  `asm jmp a; .align 8; a: nop
14:36:10  0:  eb 06   jmp 8  \ 2:  66 0f 1f 44 00 00   nopw 0x0(%rax,%rax,1) \  \ 0000000000000008 : \ 8:  90   nop
14:36:14  yes, there is
14:38:24  ...
14:39:50  If you search the web for static deadlock detection you get papers on statically detecting deadlock in Go, Java, C with pthreads, C#, Erlang, the Linux kernel, and a language called "SHIM"
14:40:46  Odd way to do that.
14:40:50  hmm… Rust doesn't guarantee deadlock-freedom, so that would be an obvious language to try
14:40:51  there's no unconditional jump with 16-bit offset by the way, despite that there are conditional jumps with 16-bit offset, all for historical reasons
14:40:52  `asm jmp .+8
14:40:53  0:  eb 06   jmp 0x8
14:41:06  I think the basic idea is simple - every place you acquire a resource, check what resources you already could've acquired. Form a graph. If it's got a cycle, you've got a problem.
14:41:17  Something like that anyway
14:41:23  wib_jonas: conditional and unconditional jumps normally have different rules on what offset sizes they allow, not just on x86
14:42:05  well, that boils down to the well-known algorithm of "always take locks in a specific order"
14:42:22  the 8-bit unconditional jump comes from the original 8086, or perhaps before, yet it's still actually useful on x86_64
14:42:32  there's a Valgrind plugin that looks for locks being taken in an inconsistent order at any point during the program lifetime, even if no actual deadlock happens
14:42:51  and sure
14:42:59  an 8-bit unconditional jump is frequently used to implement "else", so it makes sense that it'd still be around
14:43:51  yeah, it comes from before: the z80 already had an unconditional jump with 8-bit offset
14:44:42  on the 6502, I think unconditional jumps are 16 bits (absolute, not offset), conditional jumps are 8-bit (offset)
14:45:17  it's a 16-bit-address processor so you don't need any more bits than that
14:48:28  I'm reading the LLVM spec: there's a lot of behaviour that's target-specific in subtle ways, but so far I haven't seen anything that forces you to use it
15:10:12 -!- wib_jonas has quit (Remote host closed the connection).
15:32:27  [[Seed]]  https://esolangs.org/w/index.php?diff=66263&oldid=66019 * Palaiologos * (+117) 
15:33:12  [[User:Palaiologos]]  https://esolangs.org/w/index.php?diff=66264&oldid=63560 * Palaiologos * (+69) 
15:49:19 -!- arseniiv has quit (Quit: gone completely :o).
15:53:28 -!- cpressey has quit (Quit: A la prochaine.).
16:00:44  [[Hexar]] M https://esolangs.org/w/index.php?diff=66265&oldid=66245 * Enchant3d * (+41) 
16:01:55  [[Hexar]] M https://esolangs.org/w/index.php?diff=66266&oldid=66265 * Enchant3d * (-20) 
16:14:16  effing fire drill in my building. couldn't find my keys and got locked out
16:14:46  (since then, found keys after being let back in)
16:15:40  Fun fun fun
16:22:11 -!- imode has joined.
16:37:26 -!- Lord_of_Life_ has joined.
16:39:00 -!- Lord_of_Life has quit (Ping timeout: 258 seconds).
16:39:01 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
16:40:15 -!- sebbu has quit (Read error: Connection reset by peer).
16:41:05 -!- sebbu has joined.
17:05:54 -!- FreeFull has joined.
17:15:18 -!- Phantom_Hoover has joined.
17:17:21 -!- b_jonas has joined.
17:18:16  ais523: by the way, shachaf asked for one of your esolangs in https://esolangs.org/logs/2019-09-18.html#lgd
17:19:47  right, in MiniMAX commands have a read word and a write word so overlapping them is the only way to produce a memory location that can be both read and written
17:31:37  heh
17:31:45  https://twitter.com/volatile_void/status/1174015227924570119 "Little-known fact “NaN” is a recursive acronym, it stands for “Not a NaN”"
17:32:33  I was going to say "how can an x be a not-x" but then realised that NaN isn't comparable with itself
17:32:33  so that's cleverer than it seems
17:33:30  exactly
17:33:40  it's like those numbers used in bistromathic drives
17:34:34  hmm, is it the case that NaN != NaN? or just that !(NaN == NaN)?
17:34:40  both of those
17:36:48  ooh
17:36:54  this one you ais might be qualified to answer
17:36:58  https://twitter.com/gro_tsen/status/1174039625347846144
17:37:08  "Serious question: what plausible use cases exists for a “char ****p” (or more indirections)? I only once used a “char ***p” and that already seemed very contrived (and I was confused every time I re-read this code)."
17:40:12  I'm not sure there is one
17:40:23  the void ***** referenced in Three Star Programmer's documentation is a joke
17:41:24  I guess a page table is sort-of like a void ****** or so with a constant but large number of *s
17:44:06  https://github.com/boostorg/mpl/blob/develop/include/boost/mpl/assert.hpp#L222 uses a 13-star type
17:44:47  The standard use for char *** is when you want to pass &argv to a function that wants to muck with it.
17:45:22  olsner: lol
17:45:57  olsner: is that testing for compiler brokenness of some sort?
17:46:45  hm, and the line above that is a typedef with 12-star pointer to pointer-to-member of the 13-star type, so that's effectively a 26-star type or something
17:46:46  actually, no, it looks more like it's trying to come up with a type that isn't in use elsewhere in the program
17:46:57  yeah, I think that's what they're doing
17:48:23  Should I write "int const x;" instead of "const int x;"?
17:48:46  shachaf: it doesn't matter
17:48:56  they're the same thing
17:48:56  Or "int const *x;", I suppose that's more relevant.
17:49:17  I know they have the same meaning.
17:49:39  I always use "const int" for those, even though it requires you to change const placement when making fancier types
17:49:39  after a code formatter taught me how to do it, I started always using *const (no whitespace) for situations where the pointer itself is const
17:49:44  A program without whitespace is also "the same thing" as a program with whitespace, but you can still ask questions about it.
17:49:47  if you are writing code for an existing project, or your supervisor asks you to follow a certain coding style, write it in a way to match the style of that code or follow those recommedations. otherwise, write whatever.
17:50:00  the same is true for int *x; versus int* x;
17:50:07  so I prefer "const int x;", "const int *x;", etc., because that makes it clearer that it's the pointer referent that's const, not the pointer itself
17:50:35  ais523: The idea of "int const x;" is that it's consistent with "int *const x;"
17:51:12  shachaf: sure, but these are points of coding style where even people who write good C/C++ programs don't agree, and they mostly came to the agreement that either is fine
17:51:24  b_jonas: What if I don't have a supervisor and I just want things to be good instead of bad?
17:51:33  shachaf: yes, but when you move up to "int const *const x;" the pattern doesn't feel like it holds any more
17:51:35  I try not to write C/C++ polyglots.
17:51:38  so for some stupid whitespacing or style, people might complain if it's code that they'll read, but for this one, nobody will complain unless you have to match an existing coding style
17:51:54  isn't "C/C++" undefined behaviour?
17:52:13  sure
17:52:22  ok, let's say C++ programs
17:52:31  `! c float C = 4.0; printf("%f", C/C++);
17:52:34  1.250000
17:52:37  and if shachaf asks about this in C programs, then I can't help much
17:52:40  I don't understand C
17:52:45  I was expecting a warning
17:53:13  does `! c build with all the warnings on?
17:53:44  I don't understand C++.
17:53:52  I mostly understand C.
17:54:06  I think very few people understand C++.
17:54:35  olsner: probably not; I actually wasn't expecting it to work at all
17:55:29  `` printf '#include \nint main(void) { float C = 4.0; printf("%f", C/C++); }' | gcc -Wall -Wextra -x c /dev/stdin
17:55:31  ​[01m[K/dev/stdin:[m[K In function ‘[01m[Kmain[m[K’: \ [01m[K/dev/stdin:2:40:[m[K [01;35m[Kwarning: [m[Ktoo many arguments for format [[01;35m[K-Wformat-extra-args[m[K] \ [01m[K/dev/stdin:2:55:[m[K [01;35m[Kwarning: [m[Koperation on ‘[01m[KC[m[K’ may be undefined [[01;35m[K-Wsequence-point[m[K]
17:55:53  `` printf '#include \nint main(void) { float C = 4.0; printf("%f", C/C++); }' | gcc -fno-diagnostics-color -Wall -Wextra -x c /dev/stdin
17:55:55  ​/dev/stdin: In function ‘main’: \ /dev/stdin:2:40: warning: too many arguments for format [-Wformat-extra-args] \ /dev/stdin:2:55: warning: operation on ‘C’ may be undefined [-Wsequence-point]
17:56:06  If you do it in C++ constexpr you might get useful information about UB.
17:56:17  ``` set -e; gcc -fdiagnostics-color=never -Wall -O -o tmp/a.out -x c - <<< $'#include\n''int main(void) { float C = 4.0; printf("%f", C/C++); return 0; }'; tmp/a.out # there is a warning
17:56:19  ​: In function 'main': \ :2:49: warning: operation on 'C' may be undefined [-Wsequence-point] \ 1.250000
17:56:25  ah, you've been faster
17:56:26  `` printf '#include \nint main(void) { float C = 4.0; printf("%f", C/C++); }' | gcc -fno-diagnostics-color -Wall -Wextra -x c /dev/stdin
17:56:27  ​/dev/stdin: In function ‘main’: \ /dev/stdin:2:40: warning: too many arguments for format [-Wformat-extra-args] \ /dev/stdin:2:55: warning: operation on ‘C’ may be undefined [-Wsequence-point]
17:56:33  `` printf '#include \nint main(void) { float C = 4.0; printf("%%f", C/C++); }' | gcc -fno-diagnostics-color -Wall -Wextra -x c /dev/stdin
17:56:36  ​/dev/stdin: In function ‘main’: \ /dev/stdin:2:49: warning: operation on ‘C’ may be undefined [-Wsequence-point]
17:56:38  there we go
17:56:49  I had to look up -fdiagnostics-color=never , I didn't remember the option syntax
17:56:51  both printf(1) and my IRC client use % as an escape symbol
17:57:00  b_jonas: so did I, I just looked it up faster
17:57:33  info is such a good documentation format in terms of the user experience (some of its internals are ridiculous, though)
17:57:49  write a filter that translates color escape sequences to IRC colors
17:58:23  What? I hate using info.
17:59:04  ais523: I don't use printf for this. I just use the $'foo' literals.
17:59:33  shachaf: info as in the program, or info as in the format?
18:00:20  because I think what gives the good user experience is when the docs are written in texinfo format well, which is hard to write, but when it's written that way, it compiles to multiple different formats including info, html, pdf, each of which you can read with multiple clients.
18:00:26  "including"
18:00:36  well, it compiles to info, html, pdf, but not much else.
18:00:53  I mean the program.
18:01:28  shachaf: that I can understand. read one of the outputs with a different client
18:01:42  very few other formats allow both index search (often in multiple indexes by subject) /and/ free text search /and/ have a hierarchical table of contents
18:01:53  the html output produced is decent, not the one overloaded with client-side scripts that you see on the web these days
18:02:06  I found the appropriate gcc option by typing "idiagnostics-" and a newline
18:02:13  in about 5 seconds
18:02:16  *ahem* chm
18:02:19  but can info produce man pages?
18:02:41  olsner: I don't think so, at least not in a sane way
18:02:43  b_jonas: in chm's predecessor, .hlp, the free text search took several minutes
18:02:52  although that was likely related to the computers at the time
18:03:36  also, AFAIK neither .chm nor .hlp allow the whole thing to be easily read in depth-first order (whereas info does)
18:03:38  is chm basically just restricted html wrapped up in a compressed file with some extra info about the table of contents?
18:03:42  yes
18:04:10  what I don't know is how you can sanely export the extra info in some easily usable format
18:04:22  I can export the html
18:06:35  that reminds me, there's a certain documentation format that I find somewhat annoying
18:07:20  Documentation in UHS format, so that you don't accidentally reveal too much to the user.
18:07:21  namely when the help is embedded in the program, and you can print it by invoking it with like programname help topic, but you have to do it one node at a time, and it can be hard to find out what all the nodes are, plus you may have to iterate over multiple programs
18:07:27  for some reason, version control software uses this
18:07:44  it's the most annoying for subversion, which has really good user reference documentation, but tucked away this way
18:08:06  you have to iterate over all svn* programs, run them with help, then with help topic, then with help topic again for topics that are two levels deep
18:08:28  hg technically does it too, but it also comes with all that documentation installed as a single manpage, which negates all the drawbackzs
18:08:30  b_jonas: "man git-commit", etc.
18:08:44  ais523: yes, I'm not talking about git, only svn, hg, and fossil
18:08:49  ah, OK
18:09:03  I also don't understand why it's only version control software that do this
18:09:22  because they're copying svn
18:09:35  if only they had a command like programname help all, that would also fix the problem
18:09:53  at one point I started to write a script to export all the docs from svn, but I haven't finished it
18:09:59  "helpfull" is a flag with a good name.
18:10:00  I should do that so I can do full text searches
18:10:07  fizzie: yeah, that could work too
18:10:07  or, well, a likely reason is that VCS is particularly likely to want to bundle a large number of commands with separate behaviour into one executable
18:10:20  fizzie: as long as (programname help) tells that that command exists
18:10:22  that said, busybox does this correctly
18:11:10  I'm not too familiar with busybox. I only use it when running the debian installer.
18:11:37  it's basically one executable that implements cut-down versions of a lot of different commands
18:11:49  to benefit from being able to share code between them
18:12:05  basically, it's a size-optimized minimal userland
18:12:24  ais523: yes, but for svn it's not even one executable, it's twenty, with zero or one or two levels deep help depending on which program it is
18:12:53  Somehow my system supports "man git commit", with a space.
18:12:56  of course, you only need five of those twenty programs, but how would you know which five unless you can read their help?
18:13:11  shachaf: yes, that's a little magic built into man
18:13:28  Built in? That's scow.
18:13:41  Anticompetitive.
18:14:16  heh, busybox's documentation is comparable to the program itself
18:14:17  It should be forced to show a dialog on first use listing possible alternatives.
18:14:41  clear is documented by busybox as "Clear screen", not even a full stop
18:14:45  shachaf: try (man apt get)
18:14:54  whereas the manual page for clear(1) is one and a half pages
18:15:18  ais523: the manual is shorter because the busybox programs usually have fewer options or features than the programs that they mimic though
18:15:29  yes
18:15:33  busybox clear doesn't have any
18:15:40  but then, clear(1) only has three
18:16:05  most of it is a discussion of the history of clearing screens
18:17:18  huh, busybox actually is a complete userland, it has things like init and crond
18:17:45  ais523: yes, that's its point, you put it on a disk with a libc plus a few device files and directories, you get a full tiny userland
18:18:14  it's used in debian's generated initrd so you get a small rescue system if it can't mount root for some reason
18:18:19  also dpkg, which I guess makes sense if you're using it as a rescue system for Debian
18:18:29  mind you, busybox is configurable at compile time, so which programs it has may depend on which system
18:18:34  you can probably compile it to not have init
18:19:36 -!- tromp has quit (Remote host closed the connection).
18:19:47  init isn't really big anyway, all the complicated parts are off-loaded to getty and login
18:21:09  complicated parts like setting up the serial terminal for logins when you don't know in advance what sort of modem and terminal the remote party has
18:21:42  setting environment variables from key=value entries that the user writes after their username
18:22:11  it has mke2fs, which is a bit of a surprise and seems out of place
18:22:21  printing /etc/issue and interpreting all the possible escape sequences in ity
18:22:32  I wouldn't want a cut-down simplified program to be making my filesystems
18:22:32  why?
18:22:41  mke2fs is exactly what you want on a rescue system
18:22:50  to be able to set up a real system, or repair a half-working one
18:22:54  especially as ext2 is pretty old by now and it doesn't to ext3/ext4
18:23:06  b_jonas: why would you want to reformat a disk when repairing a half-working system?
18:23:17  ais523: not a whole disk, just a partition, like a boot partition
18:23:22  especially as you're only going to have to rereformat it later using mkfs.ext4
18:23:44  and generally if I'm trying to solve a problem, I'd expect reformatting things to make it worse, not better
18:23:48  or a temporary fs to which you copy files from some cds or network 
18:24:03  fsck (which it doesn't have) would be a much more useful program to include
18:24:07  I think it has a getty as well.
18:24:22  ais523: obviously you don't want to reformat a part of the disk from which you want to save the data
18:24:28  A lot of the OpenWRT userland is in busybox.
18:24:36  ais523: and mkfs is a much simpler smaller program than fsck
18:24:54  ais523: fsck has to know a lot of things about the file system, including handling all the invalid states that it shouldn't be in
18:25:07  mkfs only has to know about valid and empty states, the rest is handled by the kernel afterwards
18:25:55  ais523: as for ext2 vs ext3, you can add an ext3 journal to an existing ext2 partition afterwards with tune2fs
18:26:00  with the -j option
18:26:21  ext4 would be nice, but I think the mkfs required for that would be bigger
18:26:48  And Android uses toybox, which also has a bunch of programs: http://landley.net/toybox/status.html
18:26:55  and ext2 is a good enough common denominator for when you need a scratch filesystem to store things on but don't need it to be maximally efficient, just readable and writable by most software
18:27:52  ais523: even my custom dos bootfloppy has the format program to format a partition, both for this sort of temporary thing, or to bootstrap a bootable dos onto a hard disk
18:29:07  of course that boot floppy is highly obsolete now
18:35:33  ais523: also, at some point I ran a system with the grub-l boot loader on a different disk from the root file system. in that case, if the hard disk with the boot loader breaks down, I can repair it by creating a boot partition on the other disk, format it to either ext[23] or vfat, and installing the grub-l boot loader and config files for it there. nowadays the simpler option would be to install grub2 
18:35:39  of course, but imagine the same thing before grub2 was stable.
18:36:08  (actually my system is still configured that way, but there is a boot file system already on the other disk, so I don't have to create it)
18:37:34  I'll have to stop using grub-l when I use a hard disk larger than 2 terabyte as root disk, but not before
18:38:02 -!- ais523 has quit (Ping timeout: 240 seconds).
18:42:54 -!- ais523 has joined.
18:56:39 -!- tromp has joined.
19:01:13 -!- tromp has quit (Ping timeout: 258 seconds).
19:02:43 -!- tromp has joined.
19:07:47 -!- tromp has quit (Ping timeout: 276 seconds).
19:16:37 -!- ais523 has quit (Ping timeout: 268 seconds).
20:01:21  wait what
20:01:58  do you recall what I said a few days ago about Sonic and Zelda?
20:02:49  it turns out that in the Banjo-Kazooie video games, the name of the player characters are Banjo and Kazooie, Kazooie being the bird and Banjo the big creature. I never suspected that. Just what kind of Nintendo game is that to have such a title?
20:06:06 -!- MrBismuth has quit (Read error: Connection reset by peer).
20:08:42 -!- Lykaina has quit (Quit: leaving).
20:32:16 -!- MrBismuth has joined.
20:53:03 -!- arseniiv has joined.
21:14:32 -!- imode has quit (Ping timeout: 276 seconds).
21:18:10 -!- tromp has joined.
21:38:07 -!- imode has joined.
22:00:01 -!- Lykaina has joined.
22:00:13  hi
22:00:55  this is the now-working arduino subset: http://sif.lesidhetree.com/sara/echidna/echidna-uno-doc_0003.pdf
22:14:48 -!- atslash has quit (Ping timeout: 258 seconds).
22:15:10 -!- atslash has joined.
22:22:50 -!- atslash has quit (Ping timeout: 240 seconds).
22:23:32 -!- atslash has joined.
22:31:36  oh by the way
22:32:08  I said earlier that at work, I finally have a windows installation where none of the software messages are localized to hungarian. 
22:32:12  Including office.
22:32:47  Well, this almost bit me back. The result is that MS Word defaults to letter paper size, and I have to change that explicitly.
22:42:10 -!- FreeFull has quit.
22:45:56  how much time and money is wasted annually by the fact that letter and A4 are slightly different
22:54:30  kmc: probably not much money, it just bothers the sense of aesthetic of geeks like us when people zoom documents down to fit the paper
22:57:05  also the form that I have to fill for sending registered mail on snailmail post is half a centimeter higher than the envelopes that you usually use as the outer layer of such mail, so if I put them together in a folder to be able to find the pair easily at the post office, the top and bottom of the form likely gets crumpled
22:58:20  the post office has been using the same form for decades, they probably have a huge warehouse filled with them because they were printed in a high quantity when they didn't yet know how unpopular the internet would make snail mail
22:59:21 -!- imode2 has joined.
23:00:29 -!- imode has quit (Ping timeout: 276 seconds).
23:01:34  ah no! it's not the same warehouse full, because I have two different versions, and one of them refers to a government law dated to 2012
23:01:40  and a web address
23:02:17  they still all have the checkbox saying package, despite that you need the other red form for packages, not this green form
23:02:26  I don't understand 
23:03:56  kmc: too much
23:04:25  and I have one of the versions on two different colored paper sheets, so they probably weren't all printed together
23:04:57  heck, I think I have at least three different versions, even ignoring the paper color
23:11:38 -!- olsner has quit (Ping timeout: 240 seconds).
23:24:48 -!- imode2 has quit (Remote host closed the connection).
23:27:16 -!- imode has joined.
23:33:10 -!- olsner has joined.
23:38:26 -!- olsner has quit (Ping timeout: 240 seconds).

2019-09-20:

00:03:14 -!- olsner has joined.
00:13:38 -!- Phantom_Hoover has quit (Quit: Leaving).
00:31:07 -!- imode has quit (Ping timeout: 268 seconds).
00:41:54  brb
00:42:01 -!- Lykaina has quit (Quit: leaving).
00:54:19 -!- Lykaina has joined.
00:54:33  back
00:57:11  with the arduino mega version of echidna, it doesn't have an lcd attached, but it does have ethernet...
00:57:45  i connected an ethernet/sd shield to it
00:58:29 -!- heroux has quit (Ping timeout: 258 seconds).
00:59:28 -!- hppavilion[1] has joined.
00:59:28 -!- heroux has joined.
00:59:38 -!- arseniiv has quit (Ping timeout: 240 seconds).
01:06:09 -!- oerjan has joined.
02:00:13  i have everything in the arduino mega2560 version of echidna that is unrelated to the ethernet. now i have to find out how ethernet works on it.
02:01:09  see the arduino uno pdf for more information
02:06:50  it's identical to uno 0003 from L - Z i think
02:07:06  G - J are different
02:17:57  i mean, G,I,J,K are different
02:19:14 -!- sebbu has quit (Ping timeout: 240 seconds).
02:21:41 -!- sebbu has joined.
02:51:58 -!- Lykaina has quit (Quit: leaving).
03:11:20 -!- Lykaina has joined.
03:12:03  why did i come back on?
03:15:41 -!- Lykaina has quit (Client Quit).
04:38:34 -!- Lord_of_Life has quit (Ping timeout: 265 seconds).
04:40:22 -!- Lord_of_Life has joined.
05:02:22 -!- hppavilion[1] has quit (Remote host closed the connection).
06:02:25 -!- oerjan has quit (Quit: Nite).
06:27:09 -!- tromp has quit (Remote host closed the connection).
06:59:42 -!- tromp has joined.
07:01:31 -!- imode has joined.
07:20:57  there is no way to implement 'swap' in terms of dup, drop, roll and last.
07:21:18  :(
07:25:02  there _is_ a way to implement `roll` in terms of dup, swap, drop and last, though!
07:26:04 -!- nfd9001 has joined.
07:32:55 -!- tromp has quit (Remote host closed the connection).
07:34:08  dup, drop, swap, last, begin, end, while, 1, 0, +, -, =
07:34:21  you could even drop `=`.
07:37:33 -!- b_jonas has quit (Quit: leaving).
07:46:39 -!- tromp has joined.
07:50:28  you could also probably drop dup.
07:50:53 -!- tromp has quit (Ping timeout: 252 seconds).
08:01:49 -!- tromp has joined.
08:06:29 -!- imode has quit (Ping timeout: 276 seconds).
08:09:19  [[Spoon]]  https://esolangs.org/w/index.php?diff=66267&oldid=56538 * Rdebath * (+615) Took a couple of minutes to copy-paste an interpreter and link to trivial BF subst
08:15:45 -!- cpressey has joined.
08:31:47  [[BF-RLE]]  https://esolangs.org/w/index.php?diff=66268&oldid=57764 * Rdebath * (+141) Crosslinking
08:33:01  Good morning.
08:39:45  Associativity and confluence are related: (a),(b),(c) => [ (a,b),c | a,(b,c) ] => (a,b,c)
09:01:37 -!- tromp has quit (Remote host closed the connection).
09:20:50 -!- tromp has joined.
10:25:55 -!- mniip has quit (Ping timeout: 610 seconds).
11:53:52  https://github.com/catseye/Nested-Modal-Transducers  <-- a reactive theory thing I've been working on
11:54:54 -!- cpressey has quit (Quit: Rebooting).
11:59:10 -!- cpressey has joined.
12:01:36  reactionary theory, hmm
12:13:09 -!- nfd9001 has quit (Ping timeout: 258 seconds).
12:14:07 -!- sprocklem has quit (Ping timeout: 268 seconds).
12:56:41 -!- arseniiv has joined.
13:09:31 -!- Lykaina has joined.
13:13:10  hi
13:28:11  hi Lykaina 
13:42:50  [[User:InfiniteDonuts]]  https://esolangs.org/w/index.php?diff=66269&oldid=65654 * InfiniteDonuts * (+5) 
13:51:38  [[Special:Log/newusers]] create  * Raito9 *  New user account
14:03:53 -!- jakobrs has joined.
14:15:45 -!- mniip has joined.
14:43:58  [[Esolang:Introduce yourself]]  https://esolangs.org/w/index.php?diff=66270&oldid=66219 * Raito9 * (+146) Added myself
14:45:30  [[Advanced Brainfuck]] M https://esolangs.org/w/index.php?diff=66271&oldid=65342 * Raito9 * (+5) Made some minor grammatical changes to sentences
14:49:03 -!- jakobrs has quit (Ping timeout: 245 seconds).
15:09:39 -!- jakobrs has joined.
15:10:12  [[Esolang:Sandbox]]  https://esolangs.org/w/index.php?diff=66272&oldid=65844 * PaniniTheDeveloper * (+71) 
15:17:47 -!- jakobrs has left.
15:51:44  [[Brainflop]]  https://esolangs.org/w/index.php?diff=66273&oldid=66244 * InfiniteDonuts * (+775) 
15:52:22  [[Language list]]  https://esolangs.org/w/index.php?diff=66274&oldid=66246 * InfiniteDonuts * (-11) /* F */
15:53:00  [[Language list]]  https://esolangs.org/w/index.php?diff=66275&oldid=66274 * InfiniteDonuts * (+16) /* B */
15:59:16 -!- cpressey has quit (Quit: A la prochaine.).
16:18:35 -!- imode has joined.
16:38:04 -!- Lord_of_Life_ has joined.
16:40:26 -!- Lord_of_Life has quit (Ping timeout: 240 seconds).
16:40:27 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
17:13:09 -!- FreeFull has joined.
18:23:43 -!- b_jonas has joined.
18:23:50  yay!
18:24:14  it's my vacation! I'm traveling to N-R W starting tomorrow morning. I still have a lot of packing and stuff to do.
18:28:45 -!- iczero has quit (Remote host closed the connection).
18:28:45 -!- BWBellairs has quit (Quit: boxmein's znc went down :().
18:29:12 -!- iczero has joined.
18:29:34 -!- BWBellairs has joined.
19:09:32  hi all! What do you use to make djvu files, if any?
19:09:48  b_jonas: nice weather to you
19:10:08  I don't make djvu files
19:10:16  today I made my first djvu ever
19:10:37  and also the second, the third, and the fourth is on its way
19:11:08  arseniiv: what do the files depict?
19:11:22  (they’re using different modes)
19:12:14  they depict a school textbook on a second foreign language
19:13:07  (I mean, usual school, not university, I don’t remember what it’s called specifically)
19:13:29  I should make a pdf of the Zichy Arany book. I almost have it too, I prepaired all the layout and all, I just got annoyed by the fact that either pdf wants to contain only baseline jpegs, not progressive ones, which would make the high-res pdf twice the size it should have, or this pdf writer software believes that.
19:14:12  b_jonas: :( unfortunate
19:14:13  what do you mean by "second foreign language"?
19:14:47  this is a problem only for the high resolution scans, but I want a pdf that has the high resolution scans
19:15:16  I might also make a more compressed pdf with lower quality images, but only as an alternative
19:16:24  b_jonas: today in some places they study two languages, but one of them apparently more fiercely, and the other less, so this book is under 100 pages
19:17:33  ah, so it's a textbook that is beginner level at the foreign language, but for older students?
19:18:22  yeah I presume something like that (it’s on Deutch so I can’t say)
19:23:25  don’t know if it’s useful. My school English was not bad but I wouldn’t be able to chat here with only that, I think. The university course gave me something essential, as well as reading fiction
19:25:31  if I wouldn’t be lazy to deal completely with proper tense and article usage, I could even write well now
19:26:53 -!- budonyc has joined.
21:24:50 -!- budonyc has quit (Ping timeout: 240 seconds).
21:41:52 -!- budonyc has joined.
22:06:53 -!- aloril has quit (Remote host closed the connection).
22:08:57 -!- aloril has joined.
22:27:07 -!- imode has quit (Ping timeout: 245 seconds).
23:17:43 -!- budonyc has quit (Quit: Leaving).
23:23:21 -!- imode has joined.
23:33:13 -!- arseniiv has quit (Ping timeout: 252 seconds).
23:49:10 -!- FreeFull has quit.

2019-09-21:

00:04:20  [[Mobius]]  https://esolangs.org/w/index.php?diff=66276&oldid=32348 * Salpynx * (+244) /* Instructions */  Show sample instruction colours (RGB / CYMK)
00:09:27  [[Mobius]] M https://esolangs.org/w/index.php?diff=66277&oldid=66276 * Salpynx * (+0) correct Hz symbol
01:16:35 -!- b_jonas has quit (Quit: leaving).
01:29:44 -!- imode has quit (Ping timeout: 276 seconds).
03:06:56 -!- Lykaina has quit (Quit: leaving).
03:22:18 -!- imode has joined.
04:13:15 -!- tromp has quit (Remote host closed the connection).
04:40:10 -!- Lord_of_Life has quit (Ping timeout: 268 seconds).
04:42:30 -!- Lord_of_Life has joined.
04:44:47 -!- tromp has joined.
04:49:56 -!- tromp has quit (Ping timeout: 276 seconds).
06:15:31 -!- tromp has joined.
06:18:13 -!- imode has quit (Ping timeout: 268 seconds).
06:20:17 -!- tromp has quit (Ping timeout: 276 seconds).
06:48:33  [[User:Zzo38/Untitled 2]]  https://esolangs.org/w/index.php?diff=66278&oldid=63016 * Zzo38 * (+536) 
06:51:07 -!- tromp has joined.
06:58:56  [[User:Zzo38/Untitled 3]] N https://esolangs.org/w/index.php?oldid=66279 * Zzo38 * (+1465) Created page with "There is a set of scheduled subroutine calls, each on a given turn number, counting from 0 being the current turn and positive numbers are in future. On each turn, all subrout..."
07:02:24  [[User:Zzo38/Untitled 3]]  https://esolangs.org/w/index.php?diff=66280&oldid=66279 * Zzo38 * (+774) 
07:05:38  Maybe there should be a category on esolang wiki for non-interactive I/O.
07:11:28  Did you see my [[User:Zzo38/Untitled 2]] and [[User:Zzo38/Untitled 3]] esolang and also what can it be called?
07:13:53  [[Esolang:Sandbox]] M https://esolangs.org/w/index.php?diff=66281&oldid=66272 * A * (+30) 
07:41:54  [[String]]  https://esolangs.org/w/index.php?diff=66282&oldid=51803 * Zzo38 * (+48) 
07:47:57  [[User:Zzo38/Untitled 3]]  https://esolangs.org/w/index.php?diff=66283&oldid=66280 * Zzo38 * (+96) 
07:48:33  [[User:Zzo38/Untitled 3]]  https://esolangs.org/w/index.php?diff=66284&oldid=66283 * Zzo38 * (+65) 
07:54:15 -!- Star651 has joined.
08:05:40 -!- nfd9001 has joined.
08:06:48  [[Talk:From INTERCAL to LOLCODE: The Esoteric Programming Story]]  https://esolangs.org/w/index.php?diff=66285&oldid=35260 * Star651 * (+484) /* suggestion */
08:09:16 -!- Star651 has quit (Remote host closed the connection).
08:25:35 -!- tromp has quit (Remote host closed the connection).
08:42:27 -!- tromp has joined.
08:44:02 -!- tromp has quit (Remote host closed the connection).
08:44:51 -!- tromp has joined.
09:31:04 -!- FreeFull has joined.
10:46:55  [[Imperative]] N https://esolangs.org/w/index.php?oldid=66286 * A * (+650) Created page with "[[Imperative]] is a minimalist language designed to fit into the definition of an imperative language. == Definition == 1.Imperative programming  Most imperative languages sup..."
10:52:52  [[Imperative]] M https://esolangs.org/w/index.php?diff=66287&oldid=66286 * A * (+332) 
10:53:25  [[Imperative]] M https://esolangs.org/w/index.php?diff=66288&oldid=66287 * A * (+68) 
12:45:24  [[UsableSeed]] N https://esolangs.org/w/index.php?oldid=66289 * Palaiologos * (+1142) Created page with "UsableSeed is a language based Seed. Programs only contain two instructions - length and random seed, separated by a space. To execute a Seed program, the seed is fed into a [..."
12:46:32  [[UsableSeed]]  https://esolangs.org/w/index.php?diff=66290&oldid=66289 * Palaiologos * (+55) 
13:03:29 -!- arseniiv has joined.
13:25:32  [[B****f***]] N https://esolangs.org/w/index.php?oldid=66291 * MiroslavRD * (+23) Redirected page to [[Brainfuck]]
13:54:46  precious pseudo-PG-13 redirects
13:55:59  as if people aren’t satisfied with the various obfuscations and abbreviations that do already exist
13:56:44  who in their sane mind would want to write B****f*** instead of BF if they need a censored name
13:57:08   /rant off
14:21:51 -!- tromp_ has joined.
14:25:08 -!- tromp has quit (Ping timeout: 246 seconds).
15:19:59 -!- xkapastel has joined.
15:23:20  [[UsableSeed]] M https://esolangs.org/w/index.php?diff=66292&oldid=66290 * Ais523 * (+4) many readers won't know what 05AB1E is; redlink it so that if a page about it is written, it'll provide that informatioin
16:41:52 -!- Lord_of_Life_ has joined.
16:42:27 -!- Lord_of_Life has quit (Ping timeout: 265 seconds).
16:44:46 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
16:49:36  arseniiv: The people who like to write it in long form
16:51:03  zzo38: I agree this is not completely without merit, but still they could write it explicitly :P
16:52:11  I think it should not need to be censored, but some people like to do anyways.
17:13:13 -!- ocharles_ has joined.
17:15:41 -!- Hooloo42 has joined.
17:16:11 -!- mynery has joined.
17:20:21 -!- Effilry has joined.
17:20:42 -!- Hooloovo0 has quit (*.net *.split).
17:20:42 -!- zzo38 has quit (*.net *.split).
17:20:42 -!- FireFly has quit (*.net *.split).
17:20:43 -!- myname has quit (*.net *.split).
17:20:43 -!- haavard has quit (*.net *.split).
17:20:43 -!- ocharles has quit (*.net *.split).
17:20:52 -!- ocharles_ has changed nick to ocharles.
17:21:04 -!- mynery has changed nick to myname.
17:25:23 -!- imode has joined.
17:27:11 -!- zzo38 has joined.
17:28:10 -!- haavard has joined.
18:08:43 -!- Effilry has changed nick to FireFly.
18:13:28 -!- imode has quit (Remote host closed the connection).
18:15:57 -!- imode has joined.
19:07:34  Which error number from sysexits.h should be used in case of a memory allocation error?
19:14:37 -!- nfd9001 has quit (Ping timeout: 245 seconds).
19:28:18 -!- andrewtheircer has joined.
19:28:53  hi
19:31:32 -!- andrewtheircer has changed nick to andrewtheircer_.
19:34:27  w
19:38:22 -!- andrewtheircer_ has quit (Remote host closed the connection).
19:39:00 -!- andrewtheircer_ has joined.
20:06:56 -!- andrewtheircer_ has quit (Remote host closed the connection).
20:10:59 -!- Sgeo__ has joined.
20:13:48 -!- Sgeo_ has quit (Ping timeout: 268 seconds).
20:14:14 -!- andrewtheircer_ has joined.
20:26:21 -!- imode has quit (Remote host closed the connection).
20:29:32  hi imod
20:52:45 -!- lambdabot has quit (Remote host closed the connection).
20:55:34 -!- lambdabot has joined.
21:14:47 -!- imode has joined.
21:26:00  ewelp
21:29:43 -!- ais523 has joined.
21:30:53  @botsnack
21:30:53  :)
21:35:26  this is a less appropriate channel, but only slightly, so I may as well ask here too: does anyone here know of a way to do a string eval in moderl Perl without using the letter 'e'
21:35:39  (one nice thing about asking in #esoteric rather than #perl is that you don't have to attempt to justify what you're doing)
21:37:17  ais523: Hmm, b_jonas is the most likely person to know, and they are not here.
21:37:39  good afternoon
21:37:42  (it doesn't hurt to ask, of course)
21:37:44  i am a nigerian programmer
21:37:53  I agree that b_jonas would be a good person to ask
21:40:25  ais523: I only know of eval and s///e, so I can't really help.
21:41:27  (I suspect everything I just wrote was redundant.)
21:45:03  is lemonlimeskull here
21:57:45  `! perl print qx<$^X -E $_ $_>for q<'print q[print qx<$^X -E $_ $_>for q<],chr 39,$ARGV[0],chr 39,">"'>
21:57:46  print qx<$^X -E $_ $_>for q<'print q[print qx<$^X -E $_ $_>for q<],chr 39,$ARGV[0],chr 39,">"'>
21:57:54  no lowercase e :-)
21:58:18  #perl have come up with ideas for removing the capital E too
21:58:26 -!- imode has quit (Ping timeout: 240 seconds).
22:06:04 -!- ais523 has quit (Remote host closed the connection).
22:07:16 -!- ais523 has joined.
22:08:32  mmm
22:20:45 -!- imode has joined.
22:26:40 -!- andrewtheircer_ has quit (Remote host closed the connection).
23:29:23 -!- ais523 has quit (Ping timeout: 246 seconds).
23:30:21  [[Esolang:Introduce yourself]]  https://esolangs.org/w/index.php?diff=66293&oldid=66270 * Tetratrary * (+231) /* Introductions */
23:37:41 -!- arseniiv has quit (Ping timeout: 276 seconds).
23:41:33 -!- Cale has quit (Ping timeout: 245 seconds).
23:56:28 -!- oerjan has joined.

2019-09-22:

00:00:36  I thought of a idea of a new conspiracy for Magic: the Gathering, which could be:  Nonbasic objects with the chosen name are legendary.  (You could also do this with other supertypes, such as snow and world. Which are good depends on the rest of the set, I think.)
00:01:19 -!- imode has quit (Ping timeout: 265 seconds).
00:04:25  (Or make it all three.)
00:09:29  And maybe also ongoing. The official rules currently do not do anything with ongoing except for schemes, but I think it should also suppress the similar state-based actions for Sagas and for phenomena, too.
00:09:34 -!- Cale has joined.
00:36:51 -!- Hooloo42 has quit (Quit: Temporarily refracted into a free-standing prism.).
00:39:49 -!- Hooloovo0 has joined.
01:17:30 -!- imode has joined.
01:29:43 -!- xkapastel has quit (Quit: Connection closed for inactivity).
01:45:43 -!- imode has quit (Ping timeout: 265 seconds).
02:04:13  void setDirection() {
02:04:14    (Clockwise == true) ? (Step++) : (Step--);
02:04:25  is using ?: for side effects like that scow? i'm pretty sure it's scow
02:05:03  Seems kind of scow.
02:05:08  A bit. I'd prefer `Step += Clockwise ? 1 : -1;`
02:05:16  I was about to say that.
02:05:25  Except I was wodnering whether Clockwise could have other values
02:05:48  `Clockwise == true` implies it's of type `bool`, so it better not
02:05:49  ​/srv/hackeso-code/multibot_cmds/lib/limits: line 5: exec: Clockwise: not found
02:05:56  lol
02:05:58  it's C++ actually
02:06:02  so anything could be anything or do anything
02:06:19  Sure, but there are things that only a jerk would do.
02:06:47  this is arduino code
02:07:02  a lot of arduino code is written by non-programmers and is awful
02:07:09  Ah.
02:07:13  this particular code doesn't seem awful, just a little weird
02:07:29  for one, arduino libs recklessly abuse overloading
02:07:47  like, a driver will have Foo(int, int) and Foo(int, int, int)
02:07:55  obviously, the first means to use the I2C bus and the second to use SPI
02:08:03  because I2C has 2 wires and SPI has 3 (or four)
02:08:05  :P
02:08:12  are you fucking kidding me
02:08:23  sadly, no
02:08:27  fuck
02:08:29  this is far from universal but I've seen it
02:08:38  I think it was even an AdaFruit example lib :/
02:09:03  o well
02:09:54  `addquote  (one nice thing about asking in #esoteric rather than #perl is that you don't have to attempt to justify what you're doing)
02:09:55  1334)  (one nice thing about asking in #esoteric rather than #perl is that you don't have to attempt to justify what you're doing)
02:13:17  > length "< kmc> `addquote" == length "< HackEso> 1334)"
02:13:19   True
02:58:01 -!- imode has joined.
03:15:23  [[*]] M https://esolangs.org/w/index.php?diff=66294&oldid=66023 * Voltage2007 * (+2) minor grammatical changes
03:33:05  [[Joke language list]] M https://esolangs.org/w/index.php?diff=66295&oldid=64912 * Voltage2007 * (+64) /* General languages */
03:36:14  [[APLWSI]]  https://esolangs.org/w/index.php?diff=66296&oldid=61028 * Voltage2007 * (+77) /* Example programs */
03:39:27  [[APLWSI]]  https://esolangs.org/w/index.php?diff=66297&oldid=66296 * Voltage2007 * (-78) Made a mistake.
04:42:26 -!- Lord_of_Life has quit (Ping timeout: 240 seconds).
04:46:49 -!- Lord_of_Life has joined.
04:59:58 -!- msippel415 has joined.
05:00:01 -!- msippel415 has quit (Client Quit).
05:21:49 -!- Hooloovo0 has quit (Remote host closed the connection).
05:24:18 -!- Hooloovo0 has joined.
06:08:23 -!- oerjan has quit (Quit: Nite).
06:10:20  [[Special:Log/newusers]] create  * TwilightSparkle *  New user account
06:16:07  [[Esolang:Introduce yourself]]  https://esolangs.org/w/index.php?diff=66298&oldid=66293 * TwilightSparkle * (+235) 
06:19:51  [[1+]] M https://esolangs.org/w/index.php?diff=66299&oldid=39718 * TwilightSparkle * (+20) 
06:23:34  [[1+]]  https://esolangs.org/w/index.php?diff=66300&oldid=66299 * TwilightSparkle * (+36) 
06:23:49  [[1+]] M https://esolangs.org/w/index.php?diff=66301&oldid=66300 * TwilightSparkle * (-7) 
06:43:35  "A startling view of life in 1984! Forbidden love! Fear! Betrayal!" - blurb for Orwell's 1984
06:47:48  [[1+]]  https://esolangs.org/w/index.php?diff=66302&oldid=66301 * TwilightSparkle * (+47) /* Examples */
07:05:31 -!- Lord_of_Life has quit (Read error: Connection reset by peer).
07:10:34 -!- Lord_of_Life has joined.
07:15:14  [[4004]] N https://esolangs.org/w/index.php?oldid=66303 * A * (+1929) Created page with "[[4004]] is a simpllified Intel 4004 microprocessor architecture that does not involve ROM manipulation. == Reference == 
 Register groups  NameSize ( Bits ) Accumulat..."
07:16:47  [[4004]] M https://esolangs.org/w/index.php?diff=66304&oldid=66303 * A * (-300) Simplified a bit
07:31:48  [[4004]] M https://esolangs.org/w/index.php?diff=66305&oldid=66304 * A * (-320) 
07:34:11  [[4004]]  https://esolangs.org/w/index.php?diff=66306&oldid=66305 * A * (-85) 
07:36:07  [[4004]] M https://esolangs.org/w/index.php?diff=66307&oldid=66306 * A * (-280) 
07:37:08  [[4004]]  https://esolangs.org/w/index.php?diff=66308&oldid=66307 * A * (-35) 
07:46:14  [[1+]]  https://esolangs.org/w/index.php?diff=66309&oldid=66302 * TwilightSparkle * (+2) 
07:51:59 -!- imode has quit (Ping timeout: 246 seconds).
09:42:02  [[1+]] M https://esolangs.org/w/index.php?diff=66310&oldid=66309 * TwilightSparkle * (+1) 
09:55:33 -!- xkapastel has joined.
11:36:32 -!- arseniiv has joined.
11:43:44  [[1+]]  https://esolangs.org/w/index.php?diff=66311&oldid=66310 * TwilightSparkle * (+42) 
13:11:42  [[1+]]  https://esolangs.org/w/index.php?diff=66312&oldid=66311 * TwilightSparkle * (+0) 
13:22:16 -!- Frater_EST has joined.
13:24:07  [[1+]]  https://esolangs.org/w/index.php?diff=66313&oldid=66312 * TwilightSparkle * (+40) /* Examples */
14:08:16 -!- imode has joined.
14:16:08 -!- Sgeo_ has joined.
14:19:44 -!- Sgeo__ has quit (Ping timeout: 276 seconds).
14:21:41 -!- Sgeo_ has quit (Ping timeout: 276 seconds).
14:41:25 -!- Frater_EST has left.
14:52:40 -!- xkapastel has quit (Quit: Connection closed for inactivity).
14:54:47 -!- FraterEST has joined.
15:35:14 -!- sebbu has quit (Ping timeout: 240 seconds).
15:47:28 -!- sebbu has joined.
15:56:26 -!- MDude has quit (Ping timeout: 240 seconds).
16:04:43  [[Brainfuck]] M https://esolangs.org/w/index.php?diff=66314&oldid=66228 * Palaiologos * (+79) Add asm2bf
16:39:20 -!- Sgeo has joined.
16:42:50 -!- Lord_of_Life has quit (Ping timeout: 240 seconds).
16:47:56 -!- Lord_of_Life has joined.
17:38:26 -!- xkapastel has joined.
18:39:18  I think I figured out in Ghostscript it is possible with the "display" device for the C code to read and write the page raster, even before the page is finished. This can be advantageous with what I intend to do with TeXnicard (the ability to use PostScript for page layout but using TeX related stuff for text rendering; of course PostScript text rendering still works too)
20:10:08  if you have subtraction, equality to zero and AND, is it possible to construct less than and greater than.
20:10:18  I wanna say yes..
20:10:34  I can actually search for that.
20:12:40  Do you mean a bitwise AND? You have not given all of the information I think
20:19:23  just a logical AND.
20:19:40  sorry.
20:20:48  assume unsigned integers as well.
20:20:57  don't try to exploit overflow.
20:21:15  OK, but then what happen if you try to subtract a bigger number from a small number?
20:21:45  saturation, I suppose?
20:22:07  1 + MAX == MAX in that scenario.
20:22:46  If the result is zero when it would otherwise be negative, then I think so.
20:23:04  interesting.
20:23:18  hmmmmm.
20:25:24  Actually, some time before, I thought of similar thing but I used only unindexable variables, counted loops (without early exit), and successor.
20:25:56  y'know what, assume you have the full pos/neg range.
20:26:01  -inf to +inf.
20:26:07  that's actually a lot harder.
20:26:41  Yes, then it is difficult, if you do not have saturation. I expect it won't be done with what you have, but, I don't know.
20:28:46  I have a feeling you could do it... the first target is less than another number.
20:29:50  you can construct multiplication and division with == 0.
21:01:04 -!- Sgeo_ has joined.
21:04:16 -!- Sgeo has quit (Ping timeout: 265 seconds).
21:25:56  I am concerned about my choice between symbolic/numeric instruction places and notation like state machines.
21:26:29  the latter seems like a more general/unopinionated equivalent to the former.
21:26:58  the concept of state machines are also much older than that of "atomized" variants of different machines.
21:28:34  the problem is one of combining them and specifying them linearly.
21:28:51  state machines have a convenient graphical notation, nonlinear.
21:29:04  but they don't have a _linear_ notation that makes things like composing machines from smaller machines convenient.
21:33:37  I guess this would be an equivalent linear notation for graphs.
21:56:13 -!- FraterEST has quit (Ping timeout: 252 seconds).
22:06:04  [[MineFriff]]  https://esolangs.org/w/index.php?diff=66315&oldid=58059 * JonoCode9374 * (+29) 
22:43:00  Medieval Barber {1W} Creature - Human (1/1) ;; Haste ;; {1}, {T}: Create a 1/1 Leech creature token. ;; {2}: Prevent the next 1 damage to target damageable other than ~ this turn. Any player can use this ability.
23:12:02  The sysexits.h does not explain EX_CONFIG very well; it just says "configuration error".
23:42:27  [[Deadfish]]  https://esolangs.org/w/index.php?diff=66316&oldid=66212 * Voltage2007 * (+573) /* Java */ Added an interpreter
23:59:10 -!- FreeFull has quit.

2019-09-23:

00:25:43 -!- ais523 has joined.
00:26:17  zzo38: I use EX_CONFIG in cases where the program couldn't meaningfully start because a configuration file it depends on was malformed or missing required informatoin
00:27:32  there's a more detailed explanation of sysexits.h in the BSD man page, https://man.openbsd.org/sysexits
00:27:58  although not much more detailed
00:29:58 -!- ais523 has quit (Client Quit).
00:30:58 -!- GeekDude has joined.
00:54:05 -!- MDude has joined.
00:58:02 -!- arseniiv has quit (Ping timeout: 240 seconds).
01:32:09 -!- Sgeo__ has joined.
01:35:18 -!- Sgeo_ has quit (Ping timeout: 245 seconds).
01:41:03 -!- oerjan has joined.
01:54:22   y'know what, assume you have the full pos/neg range. <-- not possible in a bounded number of instructions, i think.
01:55:43  well, you didn't say you had looping instructions, so not possible at all.
01:57:03  the thing is, subtraction commutes with negating all numbers involved.  so the only thing to distinguish things if you negate everything is that AND gives 1 and not -1 (i assume)
01:57:36  *only way
01:59:25  imagine if the numbers you start with are multiples of a googolplex
02:03:36  it will take you more than a googol operations to magnify a 1 into something of similar size - and only then do you have any chance of a distinguishing test result.
02:07:42  that is, if you start with numbers x, y, then every number you can construct will be of the form i*x + j*y + k (where the k comes from AND results)
02:08:05 -!- xkapastel has quit (Quit: Connection closed for inactivity).
02:08:45  and this will be zero exactly when i*(-x) + j*(-y) + k is, _unless_ k is divisible by gcd(x,y).
02:09:05  oh and nonzero
02:09:19  in which case it _might_ not be, if you're lucky.
02:10:23  and it will take you on the order of log (gcd(x,y)) operations to get a k that large.
02:32:41 -!- Lykaina has joined.
02:40:57  assume I have looping instructions.
02:41:13  including "break if == 0"
02:46:04  hi
02:47:15  so hard to get certain people's attention in irc. (i refer to another channel on another network)
02:52:00  imode: ok then you can basically do something like: construct 1 using AND, then use it to increment/decrement counters to search for x and y among all numbers.
02:52:53  and keeping track of which you find first and whether they're >0 or <0
02:53:36  yikes. there's no way to speed that process up? I have access to constants and everything...
02:54:15  i don't really think so
02:54:39  interesting... you seem so limited. :\
02:54:48  if you don't have <0 or >0.
03:13:32 -!- atslash has quit (Ping timeout: 265 seconds).
03:14:27 -!- hppavilion[1] has joined.
03:25:20 -!- atslash has joined.
03:30:32 -!- Lykaina has quit (Quit: leaving).
04:10:27 -!- imode has quit (Ping timeout: 245 seconds).
04:17:06 -!- sprocklem has joined.
04:19:59 -!- tromp_ has quit (Read error: Connection reset by peer).
04:20:50 -!- tromp has joined.
04:21:09  [[1+]] M https://esolangs.org/w/index.php?diff=66317&oldid=66313 * TwilightSparkle * (+2) /* Fibonacci sequence */
04:33:38 -!- imode has joined.
04:42:50 -!- Lord_of_Life has quit (Ping timeout: 240 seconds).
04:44:14 -!- tromp has quit (Ping timeout: 276 seconds).
04:44:23 -!- Lord_of_Life has joined.
04:45:35  [[1+]]  https://esolangs.org/w/index.php?diff=66318&oldid=66317 * TwilightSparkle * (+53) 
04:59:44  [[1+]] M https://esolangs.org/w/index.php?diff=66319&oldid=66318 * TwilightSparkle * (+45) 
05:07:37 -!- tromp has joined.
05:19:06 -!- tromp has quit (Read error: Connection timed out).
05:20:01  [[1+]]  https://esolangs.org/w/index.php?diff=66320&oldid=66319 * TwilightSparkle * (+39) /* Examples */
05:48:31 -!- tromp has joined.
06:04:32 -!- tromp has quit (Read error: Connection timed out).
06:05:56  [[Keg]]  https://esolangs.org/w/index.php?diff=66321&oldid=66035 * JonoCode9374 * (+81) /* See also */
06:05:59 -!- oerjan has quit (Quit: Nite).
06:26:50 -!- imode has quit (Ping timeout: 240 seconds).
06:27:26 -!- tromp has joined.
06:43:11 -!- tromp has quit (Read error: Connection timed out).
06:56:04 -!- tromp has joined.
07:11:14 -!- tromp has quit (Read error: Connection reset by peer).
07:11:41 -!- tromp has joined.
07:44:11 -!- cpressey has joined.
07:53:03  Good morning. There was something very important I needed to tell you about all your base, but I've forgotten what it was.
08:45:44  I made Robin's ref impl able to run on Hugs, even the random numbers and I/O parts.  I'm running the test suite on it now.  It's taking... a while to finish.
08:53:44  26 minutes, to be precise.  (compared to about 1 minute 8 seconds when it's compiled by ghc.)
09:46:49  [[An Odd Rewriting System/Odd.hs]] N https://esolangs.org/w/index.php?oldid=66322 * Chris Pressey * (+1791) Add Haskell implementation of An Odd Rewriting System.
09:48:47  [[An Odd Rewriting System]] M https://esolangs.org/w/index.php?diff=66323&oldid=58485 * Chris Pressey * (+71) Link to Haskell implementation.
09:54:24  [[Talk:Deque]] N https://esolangs.org/w/index.php?oldid=66324 * YamTokTpaFa * (+186) /* Isn't this article's expression unified? */ new section
10:10:15  Consider a language where programs automatically loop after N steps, and on each step, N grows.  Programs can modify themselves, so that they can grow on each loop.
10:11:21  cpressey: consider me considering
10:11:46  If this is the only way to loop, and if N grows by a constant additive amount, this could be TC.  But if N grows by a multiplicative factor, is it?
10:11:56  (Is it could be TC?)
10:12:18  You'd need an inner loop to make it grow enough to get to the next loop.
10:13:02  idk, not terribly interesting by itself, but maybe it could be developed
10:13:32  Do you have to have enough instructions to make it to N to loop?
10:13:39  Or can it autopad with no-ops
10:14:11  (noöps)
10:14:17  I was thinking of having some fairly generic instruction set which could include no-ops.
10:15:48  It seems like N could start out "too small" as well
10:17:02  One could also try to make an "evil" version where N grows, but not in a way that is easy to predict
10:47:46  Or otherwise make it difficult to construct a no-op.  In a lot of languages it's easy, in some it might be impossible, but ideally you'd want to strike some middle ground
10:51:27 -!- tromp_ has joined.
10:53:53 -!- tromp has quit (Ping timeout: 246 seconds).
10:55:53  [[Keg]] M https://esolangs.org/w/index.php?diff=66325&oldid=66321 * A * (+24) /* See also */ This link also includes irrelevant questions.
11:00:15  "A Turing-complete language that admits a quine also admits a way to build a no-op" -- I wonder if that's true?
11:00:37  My gut feeling is that it's probably true
11:02:59  thats a tough one
11:04:01  where is that from
11:12:37  Not really from anywhere, just from me thinking about how one might make a language where it's not possible to write a program that does nothing
11:16:08 -!- nfd9001 has joined.
11:52:02 -!- hppavilion[1] has quit (Ping timeout: 240 seconds).
12:08:38  What's a no-op?
12:09:00  Oh, there's a whole discussion above.
12:11:11  Does no-op mean a program of length n+k that computes the same thing as a program of length n?
12:15:37  I was using the word to mean the identity function, more or less.  A program that does nothing.  If you tack it on to some other program, it doesn't change the meaning of that program.
12:16:13  There are sort of a lot of assumptions about programs in there.
12:17:13  Oh, a whole program, not an instruction.
12:17:19  That seems easier.
12:17:48  But a language could easily be Turing-complete and still require programs to always print something?
12:17:58  I think that came from, if you don't have a no-op instruction, can you build one out of the other instructions.
12:20:05  Maybe. If you force the program to always output something, then you say that's Turing complete because you can reduce every program to a TM, you're kind of pushing the "no-op-ness" into the TC reduction.
12:21:12  Well, OK.
12:21:38  I'm not sure the TC reduction is such a useful way to talk about programs for other purposes.
12:24:48  I think that's why I started thinking about quines.
12:33:02  Trying to think of it another way: say you have an algebra, and it doesn't have an identity element (perhaps it's a semigroup). It's claimed that one can express any computation they like in this algebra. Could this claim be true?
12:40:52  How can it be said that an algebra can express a computation?
12:47:12 -!- xkapastel has joined.
12:49:09  That, itself, is an interesting question.
12:53:35  I once saw a paper that showed that the Hercules-Hydra battle could be expressed in braid theory.
12:53:39  is there a good proof of rice theorem
12:55:15  rain2: My rough version of Rice's theorem is: It's undeciable to show that a Turing machine does X, because you can take that Turing machine and replace "X" with "halt" and you get the Halting Problem, which you already know is undecidable.
12:55:36  I know that's not the same thing as a good proof.
12:56:17 -!- sprocklem has quit (Ping timeout: 276 seconds).
12:57:09  A rock solid proof
13:02:44  I'm pretty sure there's been a machine-checked proof of it in something like Lean or Coq but I have been unable to find anything with a quick web search.
13:05:58  https://github.com/leanprover-community/mathlib/blob/master/src/computability/halting.lean#L165
13:06:47 -!- imode has joined.
13:06:55  Apparently they prove the undecidability of HP based *on* Rice's theorem in that
13:08:17  wow
13:08:48  i'll try to understand these theorem statements
13:09:29  Do you like "Rice's theorem for the computable reals"?
13:10:52  yes
13:10:54  do you?
13:17:04  I think I like it.
13:21:06  It could be useful for thinking about infinite programs.
13:21:17  are infinite programs superturing
13:21:33 -!- Sgeo__ has quit (Read error: Connection reset by peer).
13:22:25  I would say uncountably infinite programs have to count as "superturing" in some sense.  Countable ones, probably not.
13:24:04  https://cs.stackexchange.com/questions/77487/decidable-properties-of-computable-reals
13:24:10  Rice's theorem for reals holds in every reasonable version of computable reals
13:26:32  rain2: Yes, I like it.
13:26:58  It's interesting that it's a version of Rice's theorem that holds for programs that are guaranteed to halt.
13:28:13  What are other things you can say about programs that you know some things about?
13:29:08  For example what properties of a total function are decidable given a guaranteed-to-halt program that computes it?
13:30:02  oh interesting
13:31:03  Also: The computable reals are countable, but they're not computably countable.
13:31:45  why aren't they computably countabl?
13:33:01  I'm a bit confused: The program that generates a computable real isn't guaranteed to halt. Quite the opposite, it has to be able to run indefinitely to compute some computable numbers, such as square roots.
13:36:24  Guaranteed to halt = "total" = "recursive" = R; Computable real = "computably enumerable" = "recursively enumerable" = RE; R < RE.
13:37:48  R ⊊ RE
13:38:16  cpressey: Oh, well, if you define it that way it's productive.
13:38:31  I was thinking you give the program a required precision and it gives you an approximation within that precision.
13:38:40  In which case it halts on every input.
13:39:15  Sure, but you can write an analogous program for uncomputable reals too.
13:39:29  It halts because it's a finite approximation.
13:40:01  Not because of some property that the real it's approximating, has.
13:40:15 * cpressey grammars
13:40:49  What do you mean?
13:40:57  You can't compute uncomputable reals.
13:41:39  You can write a program that asks for a precision and computes an approximation of Chaitin's omega to that precision.
13:42:13  You certainly can't.
13:42:25  You can.  It has in fact been done.
13:43:10  I don't believe you, cpressey
13:43:18  OK, let me find the paper.
13:43:18  In fact, I believe you are mistaken here
13:43:43  With N bits of that constant you can solve the halting problem of programs of a size proportional to N
13:44:18 -!- arseniiv has joined.
13:44:44  There are Ns known to have programs of that size where it's undecidable whether they halt or not
13:45:13  What does it mean for it to be undecidable whether a particular program halts?
13:46:08  (Obviously I Agreeneb.)
13:47:12  Taneb: the key word is "approximation".  Perhaps there is a limit to the amount of precision you can ask for.
13:47:21  A proof of whether it halts or not is outside ZFC (or some other axiom scheme of your choice, but that might requre a different N)
13:47:55  cpressey: I think the limit might be about 5
13:47:55  (Or rather, expect to get, when you ask for it.)
13:48:15  Oh, I'd call that "unprovable", not "undecidable".
13:48:44  But, hmm, that still doesn't make sense to me.
13:49:01  Surely if the program halts, you can prove that much in ZFC.
13:49:19  I guess you're not naming a particular program but only saying (metatheoretically?) that one exists.
13:49:49  There are theorems outside ZFC. We can construct a turing machine that it halts iff one such theorem is true.
13:51:15  I'm having trouble finding the paper but I wouldn't be surprised if 5 bits was all you could get so, OK, I withdraw any implication I might have made that you can get an arbitrary precision that you ask for in that case.
13:51:29  That wasn't exactly what I was trying to drive at in any case.
13:52:21  Any function that produces a finite approximation of anything will of course terminate always.  That's not what we're talking about when we talk about computable reals.  We're distinguishing them from uncomputable reals, ones that no TM can produce.
13:53:19  cpressey: The point is that it can produce approximations to any precision you ask.
13:53:34  An infinite stream of bits can be represented as a function : N -> 2 that always halts in the same way.
13:54:58 -!- ais523 has joined.
13:55:04  Okay. I see it differently, in a way that has nothing to do with approximations.
13:55:46  I don't think the way you see it really matters because however you construct the computable reals they come out the same.
13:55:49  How do you like representing them?
13:55:50  cpressey: assuming you can't append to the program faster than 1 instruction per instruction, your multiplicatively growing language would probably want lots of imps to work
13:56:11  (an imp is an instruction that adds a copy of itself to the running program; this is Core Wars terminology but could generalise to other languages)
13:56:26  the imps are more useful than no-ops because they tend to multiply, whereas no-ops just sit there
13:57:38  shachaf: How do I like representing a computable real? With the Turing machine that writes it to its tape, I suppose.
13:57:58  Writes what?
13:58:32  There's a TM that writes pi to its tape, there's a TM that writes 1 to its tape, there's a TM that writes e to its tape, and so forth, for any computable real you can pick. Would you agree?
13:58:36   "A Turing-complete language that admits a quine also admits a way to build a no-op" -- I wonder if that's true? ← what about a language where all commands echo when run? quining is trivial, no-ops don't exist
13:58:51  I don't know what you mean by writing a number to its tape, so maybe I agree.
13:59:26 -!- ais523 has quit (Client Quit).
13:59:38 -!- ais523 has joined.
14:00:08  Turing machines write symbols on their tapes.  Suppose the alphabet of symbols is "0123456789.".  Then there's a TM that writes "3.14159..." on its tape, where "..." is standing in for the rest of pi.
14:00:38  Oh, a decimal expansion.
14:00:41  No, I don't agree.
14:00:44  Decimal is of course not necessary, but it's the base I tend to use the most in my daily like.
14:00:52  No base works.
14:00:52  *life
14:01:14  Well, if you want addition to be computable.
14:01:29  I believe you can use bases which have redundant representations
14:01:33  e.g. binary with digits 0, 1, 2
14:01:58  the problem with using a traditional base (say decimal) is that you might end up with a computable number that happens to be a terminating decimal but you can't prove it
14:02:03  I don't care about the base. I'm trying to communicate the general definition.
14:02:26  No base works.
14:02:44  https://en.wikipedia.org/wiki/Richardson%27s_theorem is the relevant theorem
14:02:46  Well, maybe the thing ais523 said works, I'm not sure.
14:03:15  shachaf: basically, the thing you can't do with computable reals is determine for certain whether two things that are actually equal happen to be <= or >= each other
14:03:21  if two things are actually not equal, you can tell them apart
14:03:31  ais523: You can't determine for certain *anything* about computable reals.
14:03:37  That's the "Rice's theorem for computable reals" above.
14:03:59  Oh, you mean determine for certain in the weaker sense of semidecidability, never mind.
14:04:02  shachaf: with the definitions I'm aware of, a < b is semi-decidable: it's always decidable if it happens to be true
14:04:09  but might not be decidable if it happens to be false
14:04:13  Yes.
14:04:26  cpressey: You certainly want addition to be computable. Say I add "0.666..." and "0.333...". What should the answer be?
14:04:50  this means that a general "base" representation of a computable real you use has to be one with semi-decidable equality, e.g. in hyperbinary, 022222… and 10000… might or might not be equal
14:04:51  shachaf: Did I claim computable reals can be compared to each other, or added to each other?
14:05:12  Maybe not, but then you're wildly deviating from anything anyone calls the computable reals.
14:05:18  cpressey: the ability to produce a base-N expansion (for any N) implies the abilty to compare
14:05:36  You *can* compare decimal expansions, that's exacty the problem.
14:05:59  e.g. in the case of pi, you need to compare to 3.1415 and 3.1416 to determine that the fourth digit after the decimal point is a 5
14:07:02  I guess I should ask what you mean by the reals in the first place.
14:07:22  Presumably you don't construct the reals in maths as decimal expansions but as Cauchy sequences or Dedekind cuts or something.
14:09:21  You can presumbly construct the reals as equivalence classes of decimal expansions.
14:09:32  ais523: How do you figure that implication? It's not so much that the TM "does produce" the expansion, as, if the TM were to run forever somehow, it "would produce" it.
14:10:11  cpressey: suppose you have a number for which it's undecidable how it compares to 3.1415; the Turing machine won't get past three digits past the decimal point no matter how long you run it
14:10:47  ais523: Where did the undecidable number come from?
14:11:04  I thought you were talking about computable numbers
14:11:14  cpressey: I thought we were discussing the computable reals; for any rational number there's a computable real number that's equal to it, but undecidably so
14:11:22  by Richardson's Theorem, which I linked above
14:12:03  OK, as usual, my brain is too small to follow everything that is going on in one of these conversations.
14:12:36  Fine, I surrender.  I only thought this was how computable reals were defined, because it's how I recall them being defined in Turing's original paper.
14:12:43  But I might be mis-remembering how he defined them.
14:13:28  If decimal (etc) expansions don't work, pick some expansion that does work.  Does any expansion work?
14:13:46  If there is one, make a TM that writes all the parts of it onto its tape, "forever".
14:14:39  The point about 0.666... + 0.333... is that when you see the trillionth digit you might have to change your mind about the first digit.
14:14:46  hyperbinary is the most common expansion that works
14:14:51  Because the answer might be either 0.999...8 or 1.000...1
14:15:05  shachaf: Sure, the TM might have to revise its tape, all the way back to the beginning.
14:15:10  AFAIR there are several computable real definitions: weaker ones, stronger ones
14:15:14  Any representation of the computable reals might have to change its mind arbitrarily far in.
14:15:25  arseniiv: that doesn't surprise me
14:15:29  That's why I talked about finite approximations.
14:16:04  I'm not interested in approximations and I don't think you need to invoke them to talk about the objects themselves.
14:16:11  so some phenomena may exist only for those sufficiently weak/strong
14:16:18  cpressey: But Cauchy sequences are sequences of approximations.
14:16:38  All I'm talking about here is a particular kind of Cauchy sequence.
14:17:00  fwiw, Wikipedia seems to agree with cpressey's definition of computable reals
14:17:23  in the original definition by Minsky
14:17:41  but says that that definition was since found to be flawed
14:18:08  there's a section discussing the difference: https://en.wikipedia.org/wiki/Rounding#Table-maker's_dilemma
14:19:17  This is all somewhat related to something I thought of recently: Consider the computable, infinite initial GoL configurations. Some, like "infinite barberpole" or "empty space" can be simulated by a TM; others can't even though they are computable.
14:19:33  The latter relates to "Rice's theorem for computable reals".
14:19:37  There is no approximation going on here.
14:20:23  Er well, I should say, you could probably try to "approximately evolve" a GoL form.
14:20:24  to me it's not obvious that a TM can't simulate all computable GoL configurations: can't it compute the value of any given cell after n steps via computing the initial state of the (2n+1)×(2n+1) neighbourhood around it and simulating that?
14:20:31  I'm not sure on this, though
14:20:37  You might be even be able to get more than 5 bits of precision out of it, who knows.
14:21:11  shachaf: re the 5 bits thing: do you know what the smallest/simplest program is for which it isn't known whether or not it halts?
14:21:22  I guess in some mathematical formalization
14:21:32  ais523: BB(5) is unknown, right?
14:21:35  we ran that competition at CGCC and I'm currently winning with a 3-byte Brachylog program
14:21:39  With a few candidates.
14:21:41  shachaf: that sounds about right
14:21:43  ais523: Every column of the GoL playfield could be a different irrational number.  Every cell needs to be evolved to the next state.  The effects of all the cells propogate at the speed of light.  I don't think a TM can do all that.
14:22:10  "different irrational number" = infinitely tall binary expansion of such, in dead/alive cells, of course
14:22:19  cpressey: it can compute the value of any specific cell after any specific number of steps
14:22:24  https://en.wikipedia.org/wiki/Busy_Beaver_game#Exact_values_and_lower_bounds
14:22:25  perhaps you're using a different definition?
14:22:55  ais523: Maybe I don't know what I'm talking about.
14:23:44  I think thinking of the reals as infinite sequences of digits is a very common computer scientist thing to do.
14:23:51  And I think it's really pretty wrong.
14:23:52  it's interesting… a TM seems incapable of holding "the whole thing" in its memory at any given time, but for any concrete question you have about a particular cell and a particular time, the TM can answer it
14:24:14  simply by computing only the relevant parts and discarding all the data it doesn't need
14:24:36  this is due to the speed-of-light issues: in a language like RUBE you couldn't do it because data transmission can be arbitrarily fast there
14:25:01  In what sense is that not holding "the whole thing" in memory?
14:25:01  I guess because you depend on the oracle?
14:25:58  much of the information about the state of the GoL automation is never computed
14:26:57  Sure, but so what? If a program computes an infinite sequence of bits, it doesn't hold "the whole thing" in memory, but it can answer questions about any particular bit.
14:27:22  I guess the speed of light thing makes it slightly different.
14:27:31  This is the same trick that Hashlife uses.
14:28:00  ais523: There does seem to be an inherent slowdown at least; every time you need some information about a cell you haven't computed yet, you need to simulate its entire history so that you know for sure what it is
14:28:26  yes
14:29:00  actually this is one of the main reasons I don't like Turing machines as the standard basis of computation
14:29:10  they have inherent slowdowns in a weird and artificial-feeling way
14:29:39  I prefer counter machines because they are at least consistently slow, which feels more natural than Turing machines being slow at some things and fast at others
14:31:29  counter machines ftw!
14:31:41  what about queue automata?
14:31:49  I have a hard time believing simulating such a GoL playfield on a counter machine would not also have the same slowdown
14:32:10  TMs but without the need for data shifting.
14:32:16  cpressey: it does, probably worse
14:32:30  my complaints about TMs aren't that the slowdown exists, but that it's applied inconsistently
14:32:36  Okay
14:36:22  Still, say there is some expansion of a real that a TM can write to a tape. A real is computable if some TM writes its expansion to its tape "eventually". Then: if A and B are computable reals, then why is A + B not a computable real?
14:36:41  A + B will also be written "eventually"
14:36:56  What's your answer to my 0.666... + 0.333... question?
14:37:35  That if you have a TM computing 0.666... and a TM computing 0.333... you can make a TM that computes 0.666... + 0.333 ?
14:37:42  Oh, wait, you said something I didn't expect, which is that a program can change its mind and erase digits after it writes them.
14:37:51  I missed the final ellipsis there
14:37:59  I thought the output was append-only.
14:38:13  shachaf: hmm, I think that works
14:38:14  If it's not then these things don't seem useful.
14:38:36  What does?
14:38:38  it raises some interesting philosophical problems, though
14:38:50  shachaf: being able to rewrite your output so far, when outputting a computable real as decimal
14:39:00  "other GoL configurations can't be computed by a TM" <-- why is this.
14:39:18  it's like a halting tester that outputs "doesn't halt", runs the program it's testing, and if it halts, erases the "doesn't halt" and outputs "halts" instead
14:39:38  imode: it's apparently not true, I was wrong
14:39:55  was gonna say.
14:40:00  ais523: Right.
14:40:15  ais523: Hmm, this is a lot like call/cc.
14:40:26  Which makes sense becuase using call/cc you can decide anything.
14:40:31  how are counter machines > TMs.
14:41:31  TMs effectively give you access to two stacks, where pushing on one pops the other and vice versa
14:41:36  some problems map neatly onto that model, some don't
14:41:47  which ones don't.
14:42:11  I'm also not sure how to reconcile the infinite GoL playfield thing with shachaf's "Rice's theorem for the computable reals" though.
14:42:22  cpressey: I don't see the connection?
14:42:29  cpressey: assume you only have to consider sparse cells.
14:42:30  a good example is string find-and-replace: on a TM that operation is fast if the replacement string is no longer than the search string, slow if it's longer
14:42:35  shachaf: Well the playfield is literally filled with computable reals
14:42:36  cpressey: To be clear, "Rice's theorem for infinite sequences of bits" doesn't hold.
14:42:47  Plenty of things about infinite sequences of bits are decidable, like "is the first bit 0?".
14:42:47  ais523: that makes sense, also why I like queue automata vs. TMs.
14:42:51  actually I think it might be slow if the replacement string is shorter, too
14:43:01  yeah because you need to shift data left and right.
14:43:12  with most models, the search-and-replace is the same speed regardless of the relation in length between the search and replacement strings
14:43:27  even with counter machines? how is that possible?
14:44:09  with counter machines the computational complexity is pretty horrible but it's the same in both cases
14:44:10  shachaf: even if I define my infinite sequences of bits as being binary expansions of irrational numbers?
14:44:19  I can't remember whether it's O(n²) or O(n³)
14:44:52  cpressey: You mean real numbers?
14:45:03  I don't actually understand what you mean.
14:45:19  0.111... = 1.000..., as binary expansions.
14:45:25  But they're different as sequences of bits.
14:45:32  shachaf: Well I said "irrational numbers", I'll let you figure out if that means "real numbers"
14:45:48  Maybe I was talking about the irrational integers.
14:45:57  cpressey: I assumed you'd treat "000..." as a rational number, but now I'm not sure what you mean.
14:46:12  "Rice's theorem for the irrational numbers [only, not including the rationals]" also doesn't hold.
14:46:55  shachaf: beause the undecidable cases are actually rational, you just don't know it?
14:47:40  shachaf: There is a number we call pi.  You can write out a binary expansion of pi.
14:47:54  Well, not *you* you, but you know what I mean.
14:48:14  oh, I was meant to say “register machines ftw”, not counter machines
14:48:25  what bothers me about counter machines is that at a glance, they seem actually practical. you don't have to construct numbers out of symbols, you just _have_ them and can do arithmetic. but in order to do anything useful, you need to construct data structures using compounding arithmetic ops and... ugh.
14:48:50  I like that one can extend register machine definition so that registers hold values of any simple inductive type
14:49:03  arseniiv: I'm not automatically opposed to register machines but think they can be awkward to define
14:49:14  like binary strings instead of naturals
14:49:40  ais523: I'm not sure that's what I mean?
14:49:48  shachaf: nor am I
14:49:51  ais523: I would say it's because the Baire space is totally disconnected.
14:50:08  cpressey: Yes, I agree that I can write out a binary expansion of pi.
14:50:39  is there any way to perform general computation on counter machines outside of constructing some kind of linear tape.
14:50:48  (I should read on counter machines vs. register ones, I seem to forget what the difference was)
14:53:18  OK, well, I think I see the reconciliation now.  The TM simulating the infinite GoL form, is at every step working on a finite segment of the thing.
14:53:22  hm maybe I didn’t want to say “register machines…” after all. I meant a machine with type constructors and “conditional-jump destructor” as operations
14:54:50  yeah if there were infinitely active cells in some kind of pattern, the GoL wouldn't even update.
14:54:56  so my flavor of Minsky machine would have an additional CLR op, corresponding to Z constructor. We can omit it because it’s the only nullary constructor, for a type with more than one nullary constructor we can’t
14:55:12  s/, for a type/; for a type
14:57:11 -!- nfd9001 has quit (Ping timeout: 250 seconds).
14:57:20  arseniiv: I take it these are recursive types? (otherwise it's hard to see how it ends up TC)
14:57:25   is there any way to perform general computation on counter machines outside of constructing some kind of linear tape. => for my kind of machine for type Str = Empty | O Str | I Str, we can effectively have as many stacks of bits as we wish, I think it’s better than a tape
14:57:29  I like that formalization
14:57:36  ais523: yeah, recursive
14:57:54  it's basically what I used to prove the subset of JavaScript which uses only the characters +[]=` as Turing-complete
14:58:11  (thanks, I like it too, it seems pretty neat and concise)
14:58:27  I'm not sure if it has a name
14:58:29  wait, as many stacks of bits... 1's and 0's, or just unary.
14:58:49  what machine are we talking about here. INC/JZDEC?
14:58:57  (though it’s only concise when we have recursive types defined already; I don’t know how to define them quickly)
15:00:10  like what I mean by "general computation" is more about convenience than anything. you can build up to random access memory with a TM.
15:00:37  if you're just using a counter machine as a TM or a 2-stack PDA... what's the point.
15:00:43  cpressey: I don't think that's where th confusion is.
15:00:44  apart from knowing you can/speed concerns.
15:00:57  imode: no, this machine would have ops [CLR, redundant], APPEND0, APPEND1, “JEMPTYCASE” which jumps to three different places in case of "", in case of s + "0" and in case of s + "1" and truncates the value to s in the last two cases
15:01:25  cpressey: But it's not quite clear to me. The main point I was making was to distinguish bit streams from real numbers.
15:01:50  also there is an accompanying recursive function formalism which also can be extended to work with values of an arbitrary recursive type
15:02:08  shachaf: What properties does a real number have that a bitstream derived from that real number does not have?
15:02:20  cpressey: Oh, I guess I can say that I want this property: The real number is the limit of a sequence, and the sequence is what you write down.
15:02:29  Though, I somewhat object to "stream"
15:02:34  That means you can't arbitrarily change the sequence.
15:02:56  https://esolangs.org/wiki/YEOOIIOOIOA is based on the rec. fun. formalism corresponding to the machine defined above
15:03:05  cpressey: I'm a bit confused by that question. A real number is a completely different thing from an encoding of that number.
15:03:17  arseniiv: then you're not talking about the same machine I am.
15:03:21  What property does a partial function have that a Turing machine that computes that function does not have?
15:04:47  shachaf: I've never seen a real number, and I've never seen an infinite sequence of bits either, so really, I can't say.
15:05:03 -!- sleepnap has joined.
15:05:23  That's fair!
15:05:27  I've always thought there was a certain amount of irony in the word "real" being applied to them, tbh
15:05:28  There are two levels of encoding here.
15:06:32  arseniiv: a counter machine on the order of INC and JZDEC.
15:06:36  that's what I'm talking about.
15:09:29   if you're just using a counter machine as a TM or a 2-stack PDA... what's the point. => oh but we can use a more complicated type, like lists of lists, and index into those lists in a linear time, or maybe binary trees, and index them even more efficiently
15:10:04   arseniiv: then you're not talking about the same machine I am. => yes
15:11:08  imode: though IDK the usual machine you meant seems nice to me too
15:12:28  not because it implements things in a simple manner, but e. g. because these machines compose nicer than TMs
15:13:13 -!- imode has quit (Ping timeout: 265 seconds).
15:13:28  But I still don't understand your statement.
15:13:50  I rarely understand anything
15:14:25 -!- xkapastel has quit (Quit: Connection closed for inactivity).
15:16:40  I like thinking of a kind of computable reals where they are r: N → Q × Q where fst r(i) < snd r(i) and fst r(i) < fst r(i+1) and snd r(i) > snd r(i+1), though IIRC it’s not the strongest definition
15:19:34  Don't you need something to constrain the rate of convergence?
15:19:38  ah, the interval lengths should also decrease geometrically
15:19:56  yes, I opened the page ais523 mentioned
15:19:57  Sure, that works.
15:20:12  Which page?
15:20:16  Oh.
15:22:25  Here's a fun fact:
15:22:43  Did you know you can sort a list of computable reals (or infinite sequences of bits)?
15:23:41  how do you sort an infinite sequence that starts with 1s forever, but might have a 0 somewhere down the line?
15:23:54  oh, finite list, each element is infinite
15:24:03  Yes, a finite list.
15:24:19  that's sort-of a trick question because you can output the sorted finite list, but you can't identify which element of the sorted list corresponds to which element of the original
15:24:27  Yes.
15:24:36  shachaf: I did know that! I think because you told me at some point (maybe you tweeted about it)
15:24:56  Until I heard of this, I thought of sorting algorithms as extracting a permutation from their input and applying it.
15:25:31  But here you can't extract a single bit of order information from the input and you can still sort it (extensionally, not intensionally).
15:25:48  gravity sort is a good example of a sorting algorithm that doesn't feel like extracting a permutation
15:26:26  I mean comparison sorts.
15:26:48  that isn't a comparison sort though, you need to ine
15:26:54  I guess strictly speaking this isn't a comparison sort. But until I heard about this I thought of sorting networks as comparison sorts.
15:26:55  *interleave the comparisons for it to work
15:31:44 -!- nfd9001 has joined.
15:35:52 -!- imode has joined.
15:36:10  arseniiv: you mentioned that counter machines 1. compose well and 2. give you access to lists, etc.
15:36:15  "We shall avoid confusion by speaking more often of computable sequences than of computable numbers." - Turing 1936
15:36:18  how is that possible with only counters? some kind of arithmetic encoding?
15:38:08  it requires a large amount of memory.
15:38:35  large numbers, rather.
15:39:03  Looking at the paper again, I don't think I was misremembering it. He argues that some infinite sequences of 0's and 1's cannot come from any Turing machine. You can go further and put a "." in front of that and call it a "real number" if you like.
15:40:26 -!- nfd9001 has quit (Ping timeout: 240 seconds).
15:40:54  cpressey: I take it you're a finitist, or an ultra-finitist.
15:41:42  cpressey: I mean, certainly if you write "0." followed by any infinite sequence of bits, that names a real number.
15:41:58  imode: I find the concept of completed infinity rather suspect, while I find the concept of potential infinity invaluable. If you know a good label for that, please do let me know.
15:42:22  probably somewhere around finitist.
15:44:50  I think I'd call myself a formalist before I'd call myself a finitist. Clearly, you can manipulate strings of symbols representing propositions about large cardinals, if you like...
15:46:29  that reminds me of another reason why I don't like counter machines: they require giant numbers to get anything done.
15:47:44  imode: they compose well in any case, but give access to lists only when we use a sufficiently complex recursive type for their values, unfortunately
15:47:44  about composing: if we have machines A1, …, An, B that implement functions f1, …, fn, g, we can implement g ∘ (f1, …, fn) by a big machine which has all the counters of A1, …, An, B, and sequentially executes commands for A1, …, An, B with minor modifications (when Ai halts, we start A(i+1), and we copy from output registers of all Ai to input registers of B before starting it)
15:47:44  I think it’s clearer than TMs as the tape corresponds to inputs and outputs not in that a straight way
15:49:33 -!- andrewtheircer_ has joined.
15:49:45  what do you mean "sufficiently complex recursive type".
15:49:51  we're just talking about positive integers here, yeah.
15:49:57  hi imode
15:51:55  imode: for Minsky machine, yes, but when I talked about lists and indexing, I meant the extension :D
15:52:21  wasn't there a way to encode pairs arithmetically?
15:52:32  yes, of course
15:52:58  pairing function.
15:53:04  that was it.
15:53:22  it requires absurdly large numbers for any suitably sized pairs.
15:53:33  but as we want to not make huge numbers and long computations, the more complex type seems more natural
15:53:44  exactly
15:53:58  by the by, you can do that composition easily with TMs as well.
15:54:22  I don't know if you can compose wang B-machines in the same manner because of the way you execute instructions.
15:54:34  but TMs are literally just wiring state machines up correctly.
15:54:51  so say you have a type Tree = Leaf | Branch Tree Tree, you can encode with them a nice data store as well as indexes to that store, and work with all that more or less easy
15:56:04   by the by, you can do that composition easily with TMs as well. => when I last thought about that, it seemed there should be much of gluing needed, isn’t that so?
15:56:18  not really. you can concatenate machines to do arbitrary things.
15:56:42  one machine's halt state feeds into another machine's start state, and you can build small atomic machines that move the tape left or right unconditionally.
15:56:51  and do stuff like add numbers, etc.
15:56:52  even with multiple inputs and outputs on a tape?
15:56:59  yeah. that's not really a problem.
15:57:21  say we need to shuffle them
15:57:22 -!- ais523 has quit (Quit: quit).
15:57:42  still not that much of a problem, you can build shuffling machines.
15:57:47 -!- cpressey has quit (Quit: A la prochaine.).
15:57:50  and then compose them together. it's literally just wiring.
15:58:25  imode: and with counter machines, you don’t need any shuffling at all :P
15:58:35  define shuffling.
15:59:01  if you're transforming input into output, you can segment the tape into two, the former being your "read" space, the latter being your "write" space.
15:59:17  the former segment can store your input, the latter segment can store your output.
15:59:27  you can build machines to read/copy input elements to the work tape.
16:00:12  IDK, they are more transparent to me
16:00:12   define shuffling. => moving substrings not containing an empty symbol from one place of the tape to the other place so that order of these substrings changes, I think that’ll do
16:00:31  not a problem once you have a machine built that does just that.
16:01:05  basically "read all symbols until end of 'token' marker, copy them to the place the cursor was previously.
16:01:20  of course, but we need to discover that machine first
16:01:44  it's not hard to create one...
16:01:48  and it seems quite tedious to write that machine out
16:01:59  what do you mean tedious.
16:02:07  you can build it from things like search machines.
16:02:11  (write out explicitly)
16:02:32  I mean, it’ll take me a while, I’ll need to write search machines out too
16:02:35  "seek to read segment, seek to Nth symbol in read segment"
16:02:40  here, I have some literature for you.
16:02:51  imode: thanks :D
16:03:09  np! :)
16:03:23  let's see if I can find it..
16:03:24  I’m sure it’s possible and I’m almost sure it would seem natural when you saw all that, but…
16:03:47  also do you think composing Markov algorithms is easy too?
16:04:27  that I experimented with. it was a little more flexible because you could always do things like define separate symbol spaces via rule prefixes.
16:04:29  https://web.stanford.edu/class/archive/cs/cs103/cs103.1132/lectures/19/Small19.pdf
16:04:34  great set of slides.
16:04:47  mhm
16:05:18  goes all the way up to a reasonably usable programming language.
16:05:25  which eventually gets reduced down to a native state form.
16:05:46  …eventually… ;)
16:05:51  what is this
16:06:57  you'd do this with a counter machine anyway.
16:07:28  . o O ( even these slides say “Turing machines are hard” almost at the start )
16:08:00 -!- andrewtheircer_ has quit (Remote host closed the connection).
16:08:56  imode: ah, a language compiling into them, yeah, I did that with something C-like, with constructs like `local  {  }` to declare fresh registers
16:09:00  TMs are hard because of the unweildy nature (at a glance) of state machines. it's an unstructured control graph, with cycles and everything. but as with everything, you break it down into small re-usable chunks.
16:09:00  As opposed to lambda calculus, which is squishy
16:09:23  Complete opposite end of the Moh scale
16:09:42  Oh, apparently it's Mohs, not Moh's
16:09:59  mo's scale.
16:12:33  arseniiv: wang's B-machines are pretty much a prelude to things like brainfuck.
16:12:41  "atomization" was the first step.
16:21:57  you need to do this in counter machines as well. really in any machine model..
16:22:12  in order to get to something halfway usable.
16:27:00  im back\
16:31:31 -!- MDude has quit (Ping timeout: 265 seconds).
16:41:53 -!- Lord_of_Life_ has joined.
16:44:34 -!- Lord_of_Life has quit (Ping timeout: 265 seconds).
16:44:47 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
16:51:12 -!- FreeFull has joined.
16:59:12 -!- sleepnap has left.
16:59:16  machines that manipulate nonlinear media are difficult to internalize.
17:00:29  assume a TM's tape was suddenly replaced with an undirected, unlabeled graph. how would it navigate?
17:03:04  imode: is there hope at all? I don’t see
17:04:12  I have no idea. you can highlight the current vertex, but there's little else you can do off the top of my head, unless you have a method of storing the path.
17:04:21  despite unlabeled at the start, can we label vertices and edges as we go?
17:04:53  yeah, it would be in a sense equivalent to store several paths
17:05:38  what would your condition even be.
17:05:59  though as we don’t know where to go, it’s still not obvious what we could do except maybe traverse one of the connected components
17:11:11  you could say "in state X, if you're not at a vertex you've previously visited, do Y and go to state Z, otherwise go to state W."
17:11:39  we could use different labels
17:11:49  you could use loops of vertices as labels.
17:11:59  and the length of those loops as differentiating labels.
17:12:23  hm how would it label us any particular vertex?
17:12:56  you can construct "macro-vertices".
17:13:14  are we able to tweak the graph?
17:13:19  Taneb: I think I did twit it. But I also learned about it from a twit.
17:14:20  tweak?
17:16:01  imode: add/remove vertices or edges, for example
17:16:53  you could, yeah.
17:17:39  and make loops in place of a vertex, then
17:18:23  though I’m not sure at all it’s possible with only several simple operations
17:18:30  this is kind of why I think linear media is better than nonlinear media.
17:18:52  what's more universal and basic than linear tape.
17:19:35  maybe unordered collections of objects... but there's not much there.
17:21:07  maybe the linear tape is as good as N or Z, for respective kinds of unboundedness
17:21:22  I mean, is good for precisely same reasons
17:22:03  probably, yeah.
17:22:17  and is bad too…
17:22:45  hm imagine a data store indexed by hereditarily finite sets
17:23:45 -!- j-bot has joined.
17:24:07  as they can be canonically ordered, it’s quite tempting
17:25:30  we can go to the least element, the greatest element, or we can go to powerset or s ↦ {s}
17:25:51  first two. of course, not for ∅
17:26:54  could we traverse all the elements of some known set, though?..
17:27:27  we stand at that set, then we go to the least element, then we have forgotten what we were to traverse
17:27:37 -!- MDude has joined.
17:28:29  ah, we could go to the set not containing the least/greatest element. Then we could eat all them away sequentially
17:28:46  though we won’t be able to extract what we’ve eaten
17:33:12  [[Semantic Brain]] M https://esolangs.org/w/index.php?diff=66326&oldid=51670 * SilverWingedSeraph * (+8) Fix my name.
17:45:28  anyway yesterday I recalled values with statically checked states because of the following problem: you want to write a thing that computes some value or a more elaborate value without recomputing what was already computed and without computing what isn’t needed for the level of elaboration asked for by a callee. What syntax would be appropriate to write such a thing and not to have a headache
17:45:28  the part about not computing what’s not needed can be dealt with using a lazy data structure, but the first part seems unwieldy: imagine it’s less expensive to compute f(a) from g(a) and vice versa than f and g themselves. Then if I want my premature optimization, I need to write something complex, maybe like this for an OOP language:
17:45:28  class GetFG { A a;   FA? fa := null;   GA? ga := null;   ctor(a) { this.a := a; }   fun get_g() { if (ga) return ga; elif (fa) return ga := g_from_f(fa); else return ga := g(a); }   /* get_f is likewise */ }
17:45:28  you can see this is very clumsy
17:45:28  I thought about extending coroutines with a public API like classes but it seems going nowhere too
17:45:43  this is too general a question too, though
17:46:36  maybe it, or some specification of it, has a name?
18:19:48  [[Talk:Quiney]]  https://esolangs.org/w/index.php?diff=66327&oldid=46265 * KrystosTheOverlord * (+150) 
19:12:32 -!- Hooloovo0 has quit (Quit: Temporarily refracted into a free-standing prism.).
19:14:50 -!- Hooloovo0 has joined.
20:30:47 -!- Phantom_Hoover has joined.
20:33:19  some guy just tried to sell me on his concatenative language and "hard won ideas of programming language design tried over decades".
20:33:55  what is it with egos.
20:42:46  imode: what language, is it well-known?
20:43:03  it is not. it is not even released. one doubts that it ever will.
20:43:22  is it statically typed?
20:43:25  nope.
20:43:35  I approve of your decision
20:44:35  was just having a discussion with him about what I'm trying to look for in a language, and I posted some work in progress examples of mine (one I actually have a C compiler for), and he just kept calling it a tarpit and told me to "readjust my position" or something.
20:44:56  there are too many dynamically typed concatenative languages, too many stacks they bear with them on us
20:45:11  oh could I have a look?
20:45:38  sure, it's a previous version (prior to me moving to a queue instead of a stack for the work area).
20:46:21  readjust your position, don’t use unit tests 
20:46:28  ah, that one! :D
20:46:45  he also said "You had everything to gain and you lost it."
20:46:53  hm
20:46:54  "now you're on the losing side" or whatever.
20:47:03  like whaaaaaat the fuuuuuck.
20:47:18  who says things like that.
20:47:40  there are seven sides but some people think in binary
20:47:59  gene ray save me now.
20:48:49  https://hatebin.com/dsijqhwkec the C compiler for the old version, the newest version (using expanded keywords and definitions) is here https://hatebin.com/imhzdlmjba
20:49:37  gonna be writing a C compiler for the new version in C. it's honestly really trivial and like, nothing to even get into.
20:50:45  the longer keywords get reduced to single symbols.
20:51:39  the conversation was interesting in and of itself before everything turned violent. I was trying to figure out how to make a language like this into something like a pointfree prolog.
20:54:09  hm
20:54:48  imode: pointfree in the usual sense, no explicit arguments? Didn’t see that prolog
20:55:07  no explicit arguments, no variables.
20:55:21  yeah, prolog requires variables.
20:55:28  ah, yes, no variables too. How does it look?
20:55:36  I have no idea, to be honest.
20:56:09  I imagine it could be done by pushing symbolic variable names on to the queue/stack.
20:56:27  and then just passing those around until you hit rock bottom assertions.
20:56:41  orrrr you don't, and you error out.
20:58:32  also in light of my remark about static typing now I think about if your language is typable. At least whether one can reason about stack safety / length. I don’t immediately see if `[`, `]` and control things like these can be reasoned about in a simple way
20:59:06  imode: ah, I meant how its syntax should look like
20:59:17  ahh, I honestly don't know, that's what we were brainstorming about. :)
20:59:58  for things like stack/queue effects, you can annotate your source properly, and each annotation specifies part of the larger "compile-time program".
21:00:10  : factorial ( num -- ) ... ;
21:00:25  : dup ( any -- any any ) ... ;
21:00:26  maybe one should draw these programs as tree pictures or like de Brujin indices, but these seem point-bound
21:00:59  imode: yeah, these simple operations are typable easy, I agree
21:01:13  this way you can guard against over/underflow, as well as typing.
21:02:03  I did something like that and even encoded it as Haskell heterogeneous lists with type vars instead of Nil, that is the rest of the stack we conserve
21:02:19  curry's basis for getting into combinators, IIRC, was to build logical sentences without variables.
21:05:20  hm, also can I ask lambdabot or someone else to remind me a thing after some time?
21:06:00  or I need to write a note so I don’t forget to think about `[` and `]`
21:06:29  you're on your own
21:07:22  hahaha. cron job is usually good. :)
21:07:42  Oh sure. `at` exists for such purposes.
21:07:49  fyi, `[` and `]` are 'begin an infinite loop' and 'end an infinite loop'.
21:08:07  Delivery may be tricky unless you have local mail set up.
21:08:51  . o O ( at midnight kill -9 - 1 )
21:09:22  oops, there should be no space between - and 1.
21:09:47  Ah I didn't know that `at` had a `teatime` timespec :)
21:10:17  seriously?
21:10:30  "You may also specify midnight, noon, or teatime (4pm)"
21:10:41  beautiful.
21:12:11  The real problem with writing notes as reminders is where to put the note that reminds you to read your notes.
21:21:16  yes
21:21:57  I put them on my precious desk and move them from place to place there
21:22:25  also there are some notes in a phone app
21:23:58 -!- atslash has quit (Quit: This computer has gone to sleep).
21:26:31  arseniiv: do you have categories? "not important" "not right now" "let's do this later"?
21:27:21  I desire to have them but still don’t
21:27:46  "not important" "not right now" "let's do this later"? => these are default
21:28:07  . o O ( Bitcoin is a very expensive religion. )
21:35:42  analyst and catalyst walk into a bar
21:48:26 -!- grumble has quit (Quit: Whose thought XML was a good idea in the first place?).
21:49:55  I saw a scientology shop in town yesterday.
21:50:02 -!- grumble has joined.
21:50:08  For some reason the phrase "expensive religion" brought it to mind.
21:50:31  They would've had a free video on Dianetics to view.
22:09:27  Ah "free".
22:10:20  i wrote a shell script that generates markdown
22:10:28  fizzie: there's one just up the street from me
22:10:48  and the main one in SF is rather fancy https://www.scientology-sanfrancisco.org/inside-our-church/
22:10:50  "We waste NN minutes of your time but we also make you feel like it was a gift so now you a) owe us and b) have to justify spending NN minutes of your time on our ideas"
22:10:56  I see them in the subway sometimes marketing their "free stress test"
22:11:05  bitch I don't need a stress test I already know I'm stressed
22:11:13  GCC sources have .md files, but they're actually "machine description" files rather than markdown files, but GitHub still attempts to render them as markdown.
22:11:20  kmc: Seeing scientology called a church is so unreal :)
22:11:22  i see a lot more jehova's witnesses though
22:11:29  int-e: eh...
22:11:39  I assume the London one was a much less fancy, although obviously I only saw the front.
22:11:45  many churches are a bit nutty
22:11:52  the only difference between a religion and a cult is popularity
22:11:55  kmc: They tried that in Germany too. The courts looked at them and said, no, you're not a church. And that was it. :)
22:12:08  sure, cults tend to be abusive, but a lot of things generally recognized as religions are also abusive
22:12:23  kmc: It's just another difference between the US and here.
22:12:32  well, your government is more willing to draw the line
22:12:35  it's still an arbitrary line
22:12:47  freedom of religion is strong in the USA
22:12:50  for good or for ill
22:13:02  I really like the satanists, because they troll the fundamentalist christians
22:13:32  if a public school has a christian club they'll try to set up a satanism club
22:13:41  https://goo.gl/maps/xUPRwEjfkpdei2v69 I guess that's pretty fancy.
22:13:43  when some fundies put a 10 commandments sculpture on the courthouse lawn, the satanists responded with a huge statue of Baphomet
22:14:09  fizzie: have you watched the British sitcom "Peep Show"?
22:14:19  They've got a different fancier place that's the actual church, that's just a "life improvement center".
22:14:36  it might be the funniest tv show i've ever seen. certainly in the top few
22:14:47  anywhere, there's a whole episode where one of the characters joins the "New Wellness Center"
22:14:47  No.
22:16:37  "It's based on the seven sacred truths from the golden tablets found in the asteroid which crashed in Siberia in 1911. It's a really great book. You'd love the chapter on orgones. Orgones are the invisible molecules of universal life energy which govern our moods and our actions. Negatives orgones are the source of all the problems in the world."
22:16:42  "And you believe that?"
22:16:44  "Well, how do you explain all the problems in the world?"
22:16:47  "I mean, I couldn't just There are so many historical and economic factors—"
22:16:49  "Exactly! You haven't got a clue."
22:18:04  the Bay Area is still a leading exporter of cults
22:18:10  People's Temple being the most famous one
22:18:25  but more recently we have the Berkeley Rationalists
22:18:42  and OneTaste which is a sort of startup sex cult / yuppie lifestyle brand
22:21:05  fun fact: People's Temple ran a ham radio station at Jonestown, which they used to communicate with the organization back in SF, and they would also acknowledge contacts with whoever was on the airwaves
22:21:39  it was a prized contact because people collect countries and there were not many stations in Guyana at that time (probably still the case)
22:21:47 -!- MDude has quit (Ping timeout: 276 seconds).
22:21:56  http://hamgallery.com/qsl/country/Guyana/wb6mid3_b.jpg https://jonestown.sdsu.edu/wp-content/uploads/2013/07/fccDieckman.jpg
22:23:30  1978 was a crazy year for San Francisco
22:24:19  918 people died in Jonestown, many of whom had family and friends in San Francisco, including our congressional representative (who also just happened to be a vocal critic of the CIA)
22:25:14  then 9 days later, the mayor and a city supervisor (the first openly gay elected official in california history) were assassinated by another city supervisor
22:25:36  kmc: The original motivation was for RAII-like things.
22:25:50  the only assassination of a major US city mayor ever, i believe
22:25:53  kmc: Python's "with" takes effect for a nested scope, but often you'd want it to take effect for a scope instead.
22:26:00  I mean for the rest of the scope.
22:26:07  { with(lock)`; ... }
22:26:08  then riots over the verdict of that trial
22:27:01  shachaf: sure
22:27:03  makes sense
22:27:08  that's kind of like defer
22:27:09  isn't it
22:29:27  Sure, defer is for the second part.
22:29:45  I think it's reasonable to acquire a lock and release it at the end of a scope.
22:30:01  I just think the RAII approach where you need an object for it is kind of silly.
22:31:50  perhaps
22:32:04  but it's a case of getting a feature for free from another feature (destructors for types with actual content)
22:36:10  Did you intentionally swap channels, or unintentionally? 
22:36:32  I spent a while going up the backscroll looking for where that was coming from.
22:40:37 -!- Sgeo has joined.
22:46:16  there are other channels?
22:46:30  fungot: what shall we do about this blasphemy?
22:46:30  int-e: still many evils remained: and, if this were done, my whole duty in this respect he sometimes reminds us of the violent ebbs and flows of public feeling, it seems, however, is what nobody will dispute. the king performs a sacrifice: but the entrails are fnord and from the necessity of watchful preparation and powerful establishment." but still, as far as i am concerned in the public service. he never can show that even u
22:46:42  fizzie: It seemed more ontopic here?
22:46:58  ^style
22:46:58  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 ukparl youtube
22:47:04  ^style speeches
22:47:04  Selected style: speeches (misc. speeches from Project Gutenberg)
22:47:05  It probably was.
22:47:10  mm
22:47:26  I don't think I have a list of those speeches anymore.
22:47:28  fungot: how do we squash the nonbelievers.
22:47:28  imode: ladies and gentlemen,--you receive me with so much good has not been refuted by my honourable friend. he calls upon us to raise that united cry which has so excellent a writer would not cease to write. in the next parliament. but, if the country has to pay two millions, it will never apply itself sufficiently to works of that kind deserves our fullest recognition. i recognise to the full the responsibility for it.
22:48:00  sounds complicated and expensive.
22:56:38 -!- FreeFull has quit.
22:59:09  i wanna conquer the world, give all the idiots a brand new religion
23:00:52  kmc: will that limit climate change?
23:01:07  (I almost wrote "avert" but it's too late for that)
23:02:04  who knows
23:20:34  it’s like pendulum
23:21:12  or a cat
23:26:02 -!- arseniiv has quit (Ping timeout: 246 seconds).
23:36:42 -!- budonyc has joined.
23:39:07  still have no idea why dup, drop, swap and last are "universal" for queue automata.
23:39:34  I guess it makes sense.
23:40:05  dup creates information, drop removes information, swap reorders information, last shifts information around.
23:40:17  What's last?
23:40:31  take an element from the rear of the queue and bring it to the front.
23:40:43  Oh, I missed the word "queue".
23:40:43  1 2 3 last -> 3 1 2
23:41:20  What's "universal" for stack automata?
23:41:44  that I am unsure of. probably pick and roll, I guess?
23:41:52  not really stack ops..
23:42:08 -!- Phantom_Hoover has quit (Read error: Connection reset by peer).
23:42:31  I wonder how this compares to S and K, which also duplicate and delete.
23:42:45  that's what I'm trying to figure out.
23:42:50  B C K W is more directly a duplicate/delete, thing, I guess.
23:42:54  S is kind of a compound operation.
23:43:07  C is like swap, K is like drop, W, is like dup
23:43:25  ..._interesting_.
23:44:55  you may only need dup, drop and swap, now that I think about it. `last` is for convenience.
23:45:10  rolling the queue can just be : roll dup drop ;
23:45:34  _provided_ you don't dequeue the top symbol.
23:46:01  if you do, then you need to do... : roll swap last last swap last ;
23:46:43  3 2 1 -> 1 2 3 -> 3 1 2 -> 2 3 1 -> 1 3 2 -> 2 1 3
23:47:22  roll puff puff swap
23:49:27  'last' is kind of a hack, though. I can build a queue machine that will do it in linear time.
23:58:59 -!- oerjan has joined.

2019-09-24:

00:29:30 -!- MDude has joined.
00:42:11 -!- budonyc has quit (Quit: Leaving).
00:55:47 -!- Lykaina has joined.
02:07:21  https://pressron.wordpress.com/2016/08/30/what-we-talk-about-when-we-talk-about-computation/
02:08:30  this post is interesting, because it presents a dichotomy that I've been struggling with.
02:08:40  that of models of programming vs. models of computation.
02:14:07 -!- lf94 has joined.
02:14:13  Modal the language is a model of programming, while the underlying machine model is a model of computation. 
02:15:10  the split between the two is pretty clear; a model of programming requires a validator, compiler or other machinery to function properly prior to performing computations, while a model of computation doesn't.
02:16:20  I don't like models of programming because there's always something to be simplified. some underlying detail that can be exposed, judged and eliminated if found redundant.
02:16:33  you can _build_ models of programming on top of models of computation.
02:17:20  so it's a matter of finding just the right match.
02:35:31 -!- Lykaina has quit (Quit: leaving).
03:44:41 -!- imode has quit (Ping timeout: 246 seconds).
03:57:13 -!- sprocklem has joined.
04:06:25  [[1+]]  https://esolangs.org/w/index.php?diff=66328&oldid=66320 * TwilightSparkle * (+87) 
04:43:17 -!- Lord_of_Life has quit (Ping timeout: 265 seconds).
04:47:02 -!- Lord_of_Life has joined.
04:53:46 -!- rodgort has quit (Quit: Leaving).
05:01:19 -!- rodgort has joined.
05:08:42 -!- atslash has joined.
05:17:01 -!- atslash has quit (Quit: Leaving).
05:19:28 -!- MrBismuth has quit (Ping timeout: 245 seconds).
05:21:06 -!- atslash has joined.
05:25:45 -!- MrBismuth has joined.
05:29:43  [[1+]]  https://esolangs.org/w/index.php?diff=66329&oldid=66328 * TwilightSparkle * (+147) 
05:43:40  [[1+]] M https://esolangs.org/w/index.php?diff=66330&oldid=66329 * TwilightSparkle * (+102) /* Turing-Completeness */
05:49:44 -!- JonoCode9374 has joined.
05:51:34 -!- JonoCode9374 has quit (Remote host closed the connection).
05:56:07 -!- oerjan has quit (Quit: Nite).
08:03:24 -!- cpressey has joined.
08:08:57  Good morning.  Interesting conversation here yesterday, but largely a tangent and I never returned to the thing that started it, which was:
08:09:05   It's interesting that it's a version of Rice's theorem that holds for programs that are guaranteed to halt.
08:09:49  Rice's theorem states that all nontrivial properties of the RE sets are undeciable.  There are gobs and gobs of nontrivial properties of recursive functions that are decidable.
08:12:59  Rice's theorem doesn't say anything about sets other than SE sets, and neither, as far as I can tell, does "Rice's theorem for the computable reals".
08:13:07  s/SE/RE/
08:13:37  Nor would I expect "Rice's theorem for the computable reals" to say anything about sets other than the RE sets, because the computable reals are an RE set.
08:43:47 -!- j-bot has quit (Ping timeout: 245 seconds).
08:43:51 -!- HackEso has quit (Remote host closed the connection).
08:43:58 -!- HackEso has joined.
11:08:43  cpressey: No, I certainly wasn't suggesting that it's a direct consequence of Rice's theorem.
11:10:05  Rice's theorem is a connectness theorem, and so is "Rice's theorem for the computable reals".
11:14:45  Actually I'm not sure what you're saying here.
11:15:23  I'm saying "Rice's theorem for the computable reals" is not " a version of Rice's theorem that holds for programs that are guaranteed to halt."
11:16:02  Rice's theorem is a statement about the RE sets. So is "Rice's theorem for the computable reals".
11:17:35  They don't say anything useful when you apply them to a more specific set, like R.
11:18:52  By "a version of", I mean "it makes the same statement about a different thing".
11:19:19  The computable reals are an RE set.
11:19:32  It's not an essentially different thing.
11:19:55  Wait, what do you mean? Of course it is.
11:20:01  Explain how.
11:20:09  No, wait.
11:20:12  This is the tangent.
11:20:26  This has nothing to do with machines that always halt.
11:20:43  You don't have a version of Rice's theorem that says something about machines that always halt.
11:21:03  A version of Rice's theorem that holds for [a special set of] programs that are guaranteed to halt.
11:21:16  Or equivalence classes thereof.
11:21:32  In brief, what does this theorem say?
11:21:40  Which one?
11:21:48  "A version of Rice's theorem that holds for [a special set of] programs that are guaranteed to halt."
11:22:07  I think I was just talking about Rice's theorem for the computable reals at that time.
11:22:18  What does this theorem you refer to, say?
11:22:23  A computable real is a program : Q+ -> Q
11:22:53  Such that two computable reals that converge to the same value are considered equivalent.
11:23:25  "Rice's theorem for the computable reals" says that, given a computable real, no nontrivial property of the real number it represents is decidable.
11:24:00  "The real number it represents" is not a guaranteed-to-halt function.
11:24:20  What? Functions don't halt.
11:24:23  shachaf: that statement doesn't feel quite right
11:24:32  And real numbers aren't functions.
11:24:43  "The real number it represents" is not a guaranteed-to-halt program.  <--- better?
11:24:51  No, real numbers aren't programs either.
11:25:09  You literally just said they were.
11:25:13  shachaf | A computable real is a program : Q+ -> Q
11:25:35  OK, that's probably the thing Taneb was objecting to.
11:25:42  I'm on the cusp of concluding you're arguing in bad faith.
11:25:55  Yikes. Let me try to be more precise.
11:26:12  in what sense is a program from Q+ to Q a real?
11:26:40  Given a series of approximations, find a closer approximation?
11:26:45  A computable real is a special kind of real number.
11:27:23  A "program representing a computable real" -- which I should have a shorter name for -- is a program that can approximate it to any precision you ask for.
11:28:10  then what is the Q+ ?
11:28:18  Positive rationals.
11:28:29  We can know a lot more about that program, that we can know about the computable real that it approximates finite approximations of. You seem to be conflating these two objects.
11:28:37  s/that/than/
11:29:11  Yes, the theorem is definitely about properties of the real represented by the program, not the program itself.
11:29:19  This is also the case with the regular Rice's theorem.
11:30:39  If r is a computable real, it has a bunch of programs representing it. Say f is one. For any positive rational error bound e, |f(e) - r| < e
11:30:58  "If P is a function from the computable reals to booleans, then P is either trivial or undecidable", is this a correct statement of the theorem?
11:31:35  Sure.
11:31:43  (Where I guess "undecidable" means "uncomputable".)
11:32:06  Hmm, I should be more careful since I'm trying to be precise.
11:32:10  shachaf: For "This is also the case with the regular Rice's theorem", could i ask you to actually restate "the theorem is definitely about properties of the real represented by the program, not the program itself" in terms of regular Rice's theorem.
11:32:42 -!- j-bot has joined.
11:33:07  Taneb: A function takes an argument which is a computer program. It can decide plenty of those things about those programs. If we insist that it returns the same value for the same computabler real, whatever program we use to represent it, then it's uncomputable.
11:33:26  i wld agree with that
11:33:34  Yes, I agree with that too
11:33:36  we cannot decide if a computable real is positive
11:34:18  We cannot decide programatically in general, certainly
11:34:47  We can fairly easily decide whether 4, which is a computable real, is positive or not
11:36:40 -!- xkapastel has joined.
11:36:43  cpressey: The regular Rice's theorem says the same thing.
11:36:57  cpressey: https://en.wikipedia.org/wiki/Rice%27s_theorem calls it "semantic properties"
11:38:16  shachaf: So what does any of this have to do with always-halting programs?
11:38:41  Only that representatives of computable reals always halt.
11:39:08  I think I phrased it in that particular way as a leadup to something else which maybe I didn't say.
11:39:10  What does Rice's theorem tell you about these representatives?
11:39:20  Absolutely nothing
11:39:27  Taneb: I agree.
11:39:53  Which is why I find "It's interesting that it's a version of Rice's theorem that holds for programs that are guaranteed to halt." so misleading.
11:41:24  The programs representing computable reals must halt by any reasonable definition
11:41:36  (or be productive, but that doesn't really work with TMs)
11:41:38  "it's a version of" doesn't mean "it's a consequence of"
11:42:08  "It's a version of" means it can be stated as a seperate theorem. Can you state it?
11:42:38  I'd love to hear this version of Rice's theorem that says interesting things about programs that are guaranteed to halt.
11:42:43  Rice's theorem for computable reals?
11:42:50  It's been stated multiple times in the past half hour
11:43:06  Rice's theorem for the representatives of computable reals.
11:43:20  No such thing, just like there's no Rice's theorem for Turing machines
11:43:39  Taneb: I suppose it's too much to hope to hear shachaf agree that there's no such thing?
11:44:20  I feel like Taneb is mostly in completely agreement with me here.
11:44:44  At least I feel like I'm in complete agreement with Taneb.
11:44:48  shachaf: certainly in the broad strokes
11:45:03  Taneb: Every last detail, no exceptions!
11:45:31  Okay, well.  Is the nature of my objection still unclear?
11:45:43  cpressey: If we call the regular one "Rice's theorem for partial functions", then we can call this one "Rice's theorem for the computable reals".
11:46:13  In which case, sure, "Rice's theorem for Turing machines" and "Rice's theorem for representatives of computable reals" don't exist?
11:46:18  shachaf: I don't care what you call it, I don't care about connectedness, I'm trying to say it has no bearing on always-halting programs.
11:46:33  This seems like a silly distinction to make, because Rice's theorem is about both Turing machines and partial functions.
11:47:12  OK, I really don't understand what you're saying. Representatives of computable reals are a special set of programs that always halt.
11:47:25  Yes, I know.
11:47:55  This theorem says, given one of these programs, what can you decide about the thing it represents?
11:48:02  Or rather it says you can't decide anything.
11:48:45  I feel like you must be reading something more into what I said before but I'm not sure what.
11:49:12  I guess I'm pretty bad at explaining what I'm objecting to.
11:49:19  Representatives of computable reals are programs that always halt, and this theorem has a bearing on them. That seems clear and uninteresting so it's probably not what you mean.
11:50:25  I guess it must not be.
11:51:48  Suppose I have a program, call it P.
11:51:56  There's a separate question that I had the other day, which is: Given a Turing machine that's guaranteed to halt, what properties are decidable about the function it represents?
11:52:08  Suppose P is known to always halt.  But suppose that I don't know what P is supposed to do.
11:52:17  But that question had nothing to do with the reals.
11:52:56  And also nothing to do with Rice's theorem.
11:53:29  Lots and lots of nontrivial properties are decidable for a machine that's guaranteed to halt.
11:53:47  "Does it accept '123'?"  Well, just run it and see?
11:54:13  I certainly didn't have the impression you thought of this as a "separate question".
11:54:39   It's interesting that it's a version of Rice's theorem that holds for programs that are guaranteed to halt.
11:54:45   What are other things you can say about programs that you know some things about?
11:54:51   For example what properties of a total function are decidable given a guaranteed-to-halt program that computes it?
11:57:15  Yes, those are separate questions.
11:57:46  What I was thinking when I said that was: We know Rice's theorem, which is about Turing machines we don't know anything about. But what about the large universe of possible theorems about what's decidable if we know some things?
11:58:05  properties to that can decided by finite support
11:58:23  (remove "to")
11:58:51  Yes, that sounds right.
12:00:32  `olist 1181
12:00:33  olist 1181: shachaf oerjan Sgeo FireFly boily nortti b_jonas
12:00:37  Okay, my confusion was regarding how closely-related you were proposing those statements to be.
12:02:06  Or questions, rather
12:02:22  This computable real theorem is certainly not about all Turing machines that always halt. And it's not about them representing the same kind of thing, either.
12:02:57  So a few offhands sentences 24 hours ago were written confusingly.
12:03:03  But I don't think that's bad faith.
12:07:47  So you and Taneb both used the word "productive", and I suspect that's how I think of computable reals -- and definitely not as being represented by halting approximation functions -- which probably attributes to some of the confusion too.
12:08:12  Oh, you'll object to "halting function" again now won't you
12:08:56  I wasn't going to, but if you're being precise, I don't think a function can halt or not halt (though a partial function can be defined or not defined at a point).
12:09:17  Well, I can't call them "total functions" because the total functional programming people decided that includes things that map things to bottom
12:09:37  What? No they haven't.
12:11:12  That was kind of supposed to be a joke.
12:11:22  Ah.
12:11:34  Anyway, I don't think there's a big distinction between the "productive" representation and the one I used, except Turing machines aren't usually very good at expressing productivity.
12:12:07  I want to add one important distinction, which is that a "productive" machine can't go back and change its mind an unbounded time after it's outputted something.
12:12:52  I was at no point considering an unretractable output tape - just the regular tape of a TM.  That's how I learned the definition of computable number, that's all.
12:12:58  I think you permitted that with your decimal expansion representation the other day, and it doesn't work.
12:13:21  If your tape is completely retractable, then you can't get any information at all about the real number in any finite amount of time.
12:13:27  That seems pretty bad.
12:14:16  That's what they call "uncomputable", yes.  But at the same time, you don't have to have a strong guarantee about when and where a cell of the tape will never be overwritten.
12:14:36  Just that it will eventually not be overwritten again.
12:14:56  "Revised" might be a better word even.
12:15:50  I want the computable real to give me definite information about the real in finite time. I think that's a pretty reasonable request of a program.
12:15:51  As I said yesterday: this is basically Turing's original formulation; apparently it's subtly wrong?
12:16:14  Finite, but not necessarily known beforehand how much.
12:16:22  Well, it's wrong in the sense that it doesn't agree with the modern definition, and it's not very useful.
12:20:32  It's easy enough to fix it to work: You just insist that you can't rewrite the number "too much".
12:20:59  In particular, when you write the nth bit, you can't change the number you've already written by more than 2^-n.
12:22:45  Yes, I don't disagree with this.
12:22:52  Something like this.
12:23:43  Maybe you could say, Every finite prefix of a computable real is computable in finite time.
12:24:10  That leads into having a halting approximation program.
12:25:33  Well, reals don't have a unique prefix, is what I'm trying to say in the first place.
12:26:39  If you can't eventually nail down the first digit of a computable real, then it's not computable.
12:26:52  What's the first digit of 0.333... + 0.666...?
12:27:30  Oh, "eventually". That doesn't sound very computable to me, if it's not bounded.
12:28:22  But you're okay with "productive".
12:28:36  To me they're not different?
12:29:10  I'm OK with "productive" but not "a productive stream of digits".
12:30:03  Exactly because you can't always nail down even the first digit.
12:31:50  The sum of 0.333... + 0.666... is 0.(3,6)(3,6)(3,6)..., so the first digit to the right of the decimal point is (3,6).
12:32:42  What's that?
12:35:16  You wouldn't like it.  It's got  something to do with a productive stream of digits.
12:36:17  What is 0.333... if not a productive stream of digits?  And you're asking me to *add* these objects which you apparently do not accept.
12:36:44  Yes, I'm bringing up this object to show the problem with the stream of digits representation.
12:36:59  But maybe you're still talking about the version that supports rewrites, in which case it works fine.
12:38:35  I don't have any problem with 0.333... + 0.666... = 0.999..., for what it's worth.
12:39:25  [[1+]] M https://esolangs.org/w/index.php?diff=66331&oldid=66330 * TwilightSparkle * (+2) 
12:40:10  Is the fact that 1.000... and 0.9999... represent the same number, an actual problem?
12:40:38  0.(3,6)(3,6)(3,6)... can represent that number too, as far as I can see?
12:41:49  For 1.111... - 0.111... I might nail down the first few digits as 1.000... but regardless of my choice of which to nail down, it's the same number?
12:43:11  I don't understand your notation.
12:43:39  The problem is that if the trillionth digit is a 7, you might have to go back and change the 0. to a 1..
12:58:10  Sure, so maybe you can't nail it down until you've passed the trillionth digit.  But there is some point at which you can nail it down.  That's what I mean by "eventually".  If there is no such point, then it's not computable.
12:59:28  But you don't know what that point is.
12:59:37  That's what I want out of "computable".
12:59:49  (And also the standard definition.)
13:00:16  (I should be more careful with saying things like that parenthetical.)
13:00:38  But if it's a computable real, you know that the point exists, at some finite time after you start.  Thus: Every finite prefix of a computable real is computable in finite time.
13:01:40  Is 0.9 a prefix of 1.001?
13:01:49  Oh, I misread.
13:10:38  Anyway that's why I don't have a problem with writing digits to a TM's tape.  You get the 1st one in finite time, you get the 2nd one in finite time, and so forth.  Maybe this isn't the best way, maybe it's what you and/or Taneb mean by "TMs are bad at that", but I don't see how it's invalid.
13:11:08  You can't report when you have a digit
13:15:52 -!- arseniiv has joined.
13:16:15  I'm fine with that, and also I'm fine with, if you do want such a report, you can use some other representation.
13:40:58  imode: re. models of computation vs. models of programming: an interesting thing though I’m not sure this is how it is?
13:51:56  arseniiv: why do you think that?
13:52:19  I think there is a clear distinction, and if we were to program in assembly, our model of programming directly maps to the model of computation
13:54:01  lf94: I haven’t read to the end yet
13:59:05  cpressey: This is the distinction between "Cauchy sequences" (normally used for the reals) and "quickly-converging Cauchy sequences" (normally used for the computable reals).
13:59:54  I think by "TMs are bad at that" Taneb just meant that there's no standard mechanism for TMs to produce intermediate output. But you can make one up easily enough.
14:00:13  Anyway quickly-converging Cauchy sequences have a guaranteed rate of convergence, which makes them useful for computation.
14:02:45  re. that post: hm clearly Minsky machines compute (partial) functions N^m → N^n. These functions of course aren’t that sophisticated but… I don’t see a clear border
14:06:02  still that distinction has some merit
14:12:36  > All those representations  pass Bauer’s first condition — they are directly useful for simulating computations — but they differ widely with respect to the second test, namely the complexity of deciding the language of the representation. => aah
14:12:37   :1:38: error: lexical error at character 's'
14:12:52  oops I did it again
14:24:45 -!- Sgeo_ has joined.
14:28:07 -!- Sgeo has quit (Ping timeout: 265 seconds).
14:29:28 -!- sprocklem has quit (Ping timeout: 245 seconds).
14:33:47 -!- arseniiv_ has joined.
14:36:02 -!- arseniiv has quit (Ping timeout: 240 seconds).
14:56:24 -!- xkapastel has quit (Quit: Connection closed for inactivity).
15:17:09 -!- imode has joined.
15:31:35  arseniiv_: re: that classification, yeah it's incredibly useful. it allows us to actually classify different formal systems.
15:31:56  in a more productive way than just feeling around.
15:33:32  imode: could you modify modal so I can pipe content to it
15:33:45  I would like to write my modal code in vim, and then pipe this content to modal
15:34:04  I guess I can just call it...
15:34:11  lf94: sure, I can do that.
15:34:25  Also I don't think the clear command works
15:34:38  IMO clear command is very important actually.
15:34:50  You can dynamically re-arrange statements to your benefit
15:34:57  (As in, clear command should be a fundamental importance)
15:35:10  the clear command works. it just resets everything to defaults.
15:35:24  line 407.
15:35:24  I tried it the other day ... maybe it was on your telnet interpreter...
15:35:31  ok :)
15:36:01  I'll add a command switch to just evaluate a file.
15:38:18  or just give you an alternative interpreter.
15:38:40  you should add a switch for interpreter mode
15:38:46  otherwise, pipe mode
15:38:47  :D
15:39:07  bear in mind, this language/interpreter is not being worked on.
15:42:00  it doesn't need to be :)
15:42:30  This is very exploratory for me
15:45:05  https://hatebin.com/wljbtaonwn here you are.
15:45:22  just run it the same as normal. it'll evaluate your file and exit.
15:45:33  along with printing out the time taken.
15:45:58  to test, just run it with a file containing 1 + 2
15:45:59  or something.
15:50:55  modal is a bad language because it's unpredictable and masks the underlying model of computation while relying heavily on it for its reduction semantics.
15:54:43  lf94: what I was working on _after_ modal is a combinatory interpreter using some of the same evaluation tactics as modal, i.e using a queue.
15:55:15  combinatory logic is confusing even to me, though. not because the underlying model is confusing, but after a certain point, things just look like a mess.
15:55:28  that was about the time I swapped to more machine models.
15:57:23 -!- cpressey has quit (Quit: A la prochaine.).
16:03:26  "it's unpredictable"
16:03:45  eh, that was a misspeaking. its evaluation method is unconventional.
16:03:49  I think it can be made predictable
16:04:01  using certain patterns or maybe modifying the interpreter behavior a tad
16:05:36  a better method imho is to keep the _concept_ of term rewriting around, but look at the base model of computation a little more closely.
16:06:19  this interpreter is juggling two associative arrays, one of which is totally cleared every time a reduction takes place and is only needed for the internal mechanics of reduction. it is also juggling a queue that holds the entire expression.
16:07:14  dropping the reduction semantics just gives you a queue automaton that behaves a lot like a traditional Forth if you add the right operators other than dup, swap, drop, namely 'last'.
16:08:49  the next question is.. is this the right level of abstraction. we've traded something reasonably elegant for a machine model, with instructions executing sequentially, etc.
16:09:49  and better yet, is this the right machine model.
16:12:19  I was thinking maybe assembly with a more modern macro system would be the best.
16:13:06  performant and maintainable code
16:13:25  and you can write a simple interpreter if you keep to a subset of a popular ISA
16:13:53  and then you can write in this assembly language forever
16:14:22  and then you can build more powerful tools on top of this
16:18:12  yeah. if you telnet into imode.tech on port 1024, you can see something I've been working on.
16:18:43  it's a forth-like concatenative language based around queue automata.
16:43:00 -!- Lord_of_Life_ has joined.
16:45:44 -!- Lord_of_Life has quit (Ping timeout: 268 seconds).
16:45:52 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
16:55:05 -!- FreeFull has joined.
17:01:57 -!- Phantom_Hoover has joined.
17:05:11 -!- arseniiv_ has changed nick to arseniiv.
18:03:39 -!- LKoen has joined.
18:34:57  imode: read that article you sent me yesterday. very interestign.
18:35:28  Only further makes me think, why are we not working from machine models
18:36:34  I guess it really _does_ prevent us from higher order thinking
18:37:08  like a register move: ld a, b is /similar/ to a = b; but it's also vastly different
18:37:24  a = b, a and b are very abstract, whereas ld a, b; these are concrete
18:39:31 -!- sprocklem has joined.
18:41:16  I think this is why stack based languages are appealing
18:45:58  (the stack provides a way to have arbitrary variables)
18:54:46  I'm seeing that you can write a forth interpreter/compiler in such a way that it can re-arrange the postfix to become prefix
18:54:49  + 1 2 vs 1 2 +
19:03:28  yeah one needs to read RTL instead of LTR and reverse arguments of all ops
19:04:30  though we can read LTR and use a stack of incomplete applications
19:11:36  I'm just saying we can have a forth where we read LTR
19:35:05 -!- andrewtheircer_ has joined.
19:35:41  hi
19:37:16  lf94: of course
19:37:34  andrewtheircer_: hi
19:37:40  sup
19:37:46  new eso projects?
19:51:59  lf94: a more pure form imo of forth-like langs is ones where a queue is used. because of the universal nature of queue automata (they're turing complete), you can theoretically pack everything from main memory to a call stack onto a single work area.
19:52:14  yes
19:53:22  whether it's a suitable machine model is something I'm investigating.
19:54:33  why wouldnt it be
19:54:51  I'm a sucker for minimalism.
19:55:34  as far as I can tell, the only queue manipulation primitives required for a model like mine are duplicate, swap, drop and an operator I'm calling 'last'.
19:55:54  this plus control flow structures and comparisons.
19:56:47 -!- sprocklem has quit (Ping timeout: 265 seconds).
19:56:51  'last' seems to be a dirty hack as well. it takes something from the end of the queue and pushes it to the start.
19:57:03  imode call it peek
19:57:09  oh
19:57:17  3 2 1 last -> 1 3 2
19:57:21  imode: if your queue is circular...
19:57:26  call it rotate
19:57:36  or shift
19:57:39  it's less of a naming thing and more of an issue with semantics.
19:58:09  that's just like a bitwise shift though
19:58:16  that would be a right-shift
19:58:32  left-shift would go the other way
19:58:36  2 1 3
19:58:54  'last' can be implemented in a traditional queue automaton pretty easily: all you have to do is roll through the queue, keeping track of the last logical symbol you encountered.
19:58:55  I think shifting should be a primitive and is definitely not a hack
19:59:18  it takes linear time and uses the state of the automata's FSM to hold that last logical symbol.
19:59:32  what's this about
19:59:37  why not use a linked list
20:00:00  why use one, the interface is the same.
20:10:56  BTW is there a page with computational automata hierarchy? It could be useful for someone
20:11:40  I’d call imode’s one a half-deque automaton
20:12:50  automata
20:13:03  we have pop/push at the front and pop from the back, though one can factor dup, drop, swap and last through different set of operations
20:13:25  andrewtheircer_: plural of “automaton” :)
20:13:35  i was saying
20:13:38  automata is the topic
20:13:39  nice
20:13:43  i hope we can get to CAs
20:13:54  'cos i have made a metaphor out of them
20:14:41  there was a discussion of CAs a day earlier
20:15:09  though there wasn’t much and it wasn’t the topic itself
20:19:32  arseniiv: I'd call it a queue automaton with a built-in.
20:20:01  it's easy to construct a machine that performs 'last'. it just takes N*M time.
20:48:37 -!- arseniiv_ has joined.
20:51:37 -!- arseniiv has quit (Ping timeout: 250 seconds).
20:54:20 -!- arseniiv_ has changed nick to arseniiv.
20:59:20 -!- andrewtheircer_ has changed nick to andrewthediscord.
20:59:25 -!- andrewthediscord has changed nick to andrewtheircer.
21:10:12 -!- andrewtheircer has quit (Remote host closed the connection).
21:25:09 -!- Sgeo__ has joined.
21:28:47 -!- Sgeo_ has quit (Ping timeout: 268 seconds).
21:32:12 -!- Lykaina has joined.
21:35:26  imode: in your pythonic C compiler, I saw both s.d and s->d, though you probably saw that already
21:35:43  compiler-to-C, I mean
21:36:23  ah, never mind
21:36:42  yup, the stack is a local.
21:36:58  I missed that there are *s in functions where s->... etc.
21:37:00  my bad
21:37:26  `:` is hard to type
21:37:26  ​/srv/hackeso-code/multibot_cmds/lib/limits: line 5: exec: :`: not found
21:37:37  eh
21:38:04  today I’m dancing on bots’ legs
21:39:33  and `?` and `;` are too even if we take `[…]` as primitive instead of `[` and `]` separately
21:40:20  though it’s obvious it’s me alone who wanted to type this language :D
21:42:39  I mean, for what I know, there’s no sense to encode the fact that `[` and `]` have to be balanced and `?` and `;` should only occur inside `[…]`, in their types
21:43:29  I don’t know if it’s even possible, and as a theoretical interest I’d be glad to see how if it is
21:44:35  and disregarding these syntactic constraints and `:` all of it is of course typable easily
21:45:30  if conservatively
21:46:38 -!- Sgeo_ has joined.
21:46:40  something I have been mulling about in the back of my mind is a graph rewriting language.
21:46:43  e. g. we could allow inside `[…]` a code that grows the stack, but we better disallow that
21:46:57 -!- Lykaina has quit (Quit: leaving).
21:47:11  imode: not like Eoderdrome or what it’s called?
21:47:26  ah, https://esolangs.org/wiki/Eodermdrome
21:48:03  ah′, it has a fixed initial state
21:48:23  probably not what you think
21:49:10  nah, more flexible.
21:49:19  I thought so
21:49:37 -!- Sgeo__ has quit (Ping timeout: 245 seconds).
21:49:54  imode: also am I right this compiler generates a code for `:` without bound checking?
21:50:05  you are correct.
21:51:49  aren’t you afraid somebody will write an OS in this language and make an error using `:`? ::D
21:52:12  if someone chooses this language to write an OS in, I'll be too shocked to consider the security issues. :P
21:52:34  hm I personally am afraid of C programs maybe now
21:52:47 * arseniiv segfaulted
21:52:56  gg.
21:53:20  the graph rewriting language would rewrite undirected, unlabeled graphs.
21:54:59  rules are of the form a1 a2, a3 a4, ..., aN aM -> b1 b2, b3 b4, ... bN bM;
21:54:59  hm it’s occurred to me now someone could do something with hypergraphs too
21:55:04  Sounds like Eodermdrome.
21:55:12  it isn't.
21:56:00  you essentially try to match the graph bit by bit on the left hand side, remove all matched items, and then construct a new subgraph on the right hand side.
21:56:21  how should it connect to the old parts?
21:56:23  here's an explosion: A B -> A B A
21:56:29  err.
21:56:36  A B -> A B, B A
21:57:06  that'd just be an infinite loop because the graphs are undirected.
21:57:27  if you do A B -> A B, B C, C A, you'll generate an ever-expanding loop of vertices.
21:57:37  any variables on the RHS are autogenerated vertices.
21:57:50  any variables that are unused, rather. sorry, cooking dinner.
21:57:54  Then it's an unlabeled multigraph?
21:58:12  no, just an unlabeled graph. multiple edges aren't allowed.
21:58:42  Oh, I didn't read the adjustment to "explosion".
21:59:08   if you do A B -> A B, B C, C A, you'll generate an ever-expanding loop of vertices. => not a simple loop though. It would look like some foam
21:59:24  it would, because it'd match nondeterministically.
21:59:57  it'd be a bunch of loops. small ones to large ones.
22:00:33  in order to make anything actually useful, you need to build two things: labels and directed edges.
22:00:43  it almost tempts me to analyze how their lengths would be distributed but I don’t know asymptotic methods
22:01:35  you can abstract high enough until you can build things like lists and sequential statements. you can construct finite state machines.
22:01:38  and a tape.
22:01:59  sky's the limit after that, tbh.
22:02:14   and a tape. => it was obvious in hindsight :D
22:02:29  Anyway, it *still* sounds quite Eodermdrome-y, disregarding the input/output aspects. But maybe the devil's in the details then.
22:02:36  you can build, for example, a lot of RDF stuff.
22:02:53  fizzie: it's pretty far from eodermdrome because I can construct arbitrary graphs.
22:03:37  you can reconstruct SPARQL using the language.
22:04:50  one thing I dislike about this approach is 1. there's no clear method on storing a graph (many approaches, not all of them ideal), and 2. the rewrite mechanism involves some behind-the-scenes work.
22:07:20  there's no machinery that directly correlates to a graph rewrite language. string rewriting and turing machines/queue machines are pretty much hot swappable.
22:08:18  labeled metavertices and oriented metaedges are an interesting problem, it’s not immediately obvious how to construct them for abstraction not to break when matching them
22:10:05  (also for the sake of fun I’d consider hyperedges. They don’t seem to make things much easier nor much harder)
22:10:18  (I mean, as a primitive)
22:12:01  I see a metavertex as a core which encodes its label and has e. g. a special vertex to which “edge hubs” are connected
22:12:05  hm no
22:12:58  maybe we should delineate parts encoding different things by several graphs not occuring in any other place
22:14:50  like K_n are not hard to match but K_n ⊂ K_(n+1)
22:15:42  K_m,n promise more, K_(m+1),n seems not to be a subgraph of K_m,(n+1) if m ≠ n?
22:18:14  hmm what if you allow n = 0
22:18:48  (which has the odd property that K_(m+1),n doesn't have any vertice with degree m+1)
22:19:04  vertex
22:22:57  yes we should pick m, n large enough
22:29:47 -!- sprocklem has joined.
22:30:47  there's a lot of issues imo with this kind of rewriting scheme, which is why I've strayed away from it.
22:31:01  a lot of times in rewrite languages it's hard to get your code to _not_ do something.
22:31:09 -!- Sgeo__ has joined.
22:31:23  at first let’s encode a vertex labeled n ∈ N as A—(B—)^n where A, B are nice graphs and A has one special vertex and B has two, to link them; and encode an edge → as —C—D—, with former conventions
22:31:24  enter conditional or constrained rewriting
22:31:56  then we need to enforce constraints on A, B, C, D to not allow accidental matches
22:32:55  maybe we need to add “buffer vertices” connecting to a vertex and all the edges incident to it
22:33:34  or maybe they could connect closely
22:34:12 -!- Sgeo_ has quit (Ping timeout: 245 seconds).
22:34:30  is it a good idea?
22:36:42  I think the whole thing is a bad idea. I keep coming back to it to see if it's a good one, but every addition is just compensating for something.
22:37:03  maybe we need to add “buffer vertices” connecting to a vertex and all the edges incident to it => I mean “connecting to a metavertex and all metaedges…”
22:39:09  it certainly seems to not be too effective regarding its implementation nor implementation of something in it
22:39:32  to be not too*
22:39:55  linear media is always gonna win out vs. any kind of graph or tree structure.
22:40:32  hm I wonder now how about undirected trees
22:41:20  but maybe with a fixed finite set of labels
22:42:28  oh we could simulate a tape of directed trees
22:42:56  encode*
22:43:44  couldn’t simulate if subtree patterns aren’t allowed
22:44:08  [[Byter]] M https://esolangs.org/w/index.php?diff=66332&oldid=49879 * PaniniTheDeveloper * (+1) 
22:47:14 -!- lambdabot has quit (Remote host closed the connection).
22:50:00 -!- lambdabot has joined.
23:09:40  maybe I should just use a tape instead of a queue.
23:10:32 -!- Phantom_Hoover has quit (Ping timeout: 246 seconds).
23:11:16  'last' is just "move the tape to the left" anyway.
23:11:33  hm.
23:12:51 -!- FreeFull has quit.
23:13:58  use two stacks (a rubber tape)
23:14:07  rubber tape?
23:14:19  you know, stretchable
23:14:26  flexible
23:14:45  ah, that you can just arbitrarily insert under the cursor vs. moving everything over?
23:14:51  yes
23:14:56  yeah I was thinking about that...
23:26:30 -!- LKoen has quit (Remote host closed the connection).
23:27:25  hm you can use ror and rol (one of them is last) and banish pick, as you can decrement the index and shift it further until it’s zero
23:28:07  though you’ll need to shift an additional copy of the unchanged index to return back
23:29:18  imode: ^ if that’s of any use
23:29:56  one of them is last => s/is/formerly known as
23:30:11  you know, it's funny.
23:30:52  https://hatebin.com/ysmcogarab
23:31:00  pretty  much what I did. lol.
23:32:05  hm seems pretty long
23:32:56  though I don’t remember all the primitives, what they are this time?
23:33:30  dup, drop, swap, last, begin ([), repeat (]), if/while (?)...
23:34:12  ah I mis-eyed or something, then
23:34:21  there are definitions at the top
23:34:37  yup!
23:36:57  (hm is sswap really swapping two top values and then getting two from the bottom? why is it useful?)
23:38:24  I think I greatly misunderstand now, but maybe I’ll get it soon
23:39:42  sswap behaves like forth's swap.
23:40:08  swap grabs the top two values, then enqueues both of them but swapped.
23:40:15  aaaah
23:40:20  so grabbing the last two values means they're pushed to the front of the queue again.
23:40:30  1 2 3 sswap -> 2 1 3
23:40:42  vs. 1 2 3 swap -> 3 2 1
23:40:49  and 1 2 dup -> 2 2 1?
23:41:47  I was thinking today why you call it a queue automaton and didn’t even consider I should reinterpret what swap and dup are doing here
23:42:49  1 2 dup -> 1 2 1
23:42:58  you could also interpret it as 1 2 dup -> 2 1 1
23:43:08  what how
23:43:22  hm
23:43:26  examine the top of the queue (leftmost item)
23:43:35  enqueue a copy of it.
23:43:37  I didn’t read “1 2 3 sswap -> 2 1 3” properly
23:43:52  I thought you take from the right end
23:43:56  ahh, sorry.
23:44:02  my convention is always from the left.
23:44:16  I should have declare mine too
23:44:24  declared*
23:44:51  now I think it would go smoothly
23:47:05  telnet into imode.tech, port 1024 to access a REPL.
23:47:51 -!- LKoen has joined.
23:48:05  what's interesting is that you can define `factorial` as `: factorial range product ;`
23:51:43 -!- oerjan has joined.
23:56:22 -!- LKoen has quit (Quit: “It’s only logical. First you learn to talk, then you learn to think. Too bad it’s not the other way round.”).

2019-09-25:

00:05:04  hm I tried to abuse PuTTY for telnet to no result
00:18:07  my REPL hung up on you?
00:19:11  I get a terminal window which closes almost instantly
00:19:41  that's... weird.
00:19:50  maybe try netcat instead.
00:21:02  oh now I get ::> but then a dialog box tells me “connection closed by remote host”
00:21:22  ...
00:21:25  bizzare.
00:21:50  no errors on my end.
00:26:37  usually I'd see "broken pipe" or something.
00:34:11  a tape with an insertion feature that can be implemented as a constant time operation is starting to look better than a queue.
00:34:29  can be implemented internally as a circular buffer that can expand on either end.
00:36:10  anyway maybe later I’ll run your old interpreter code if it’s not too old yet
00:37:24  arseniiv: https://hatebin.com/usnmammjft in case you want to run the REPL locally, sorry it's not working remotely.
00:38:54  imode: thanks once more!
00:39:54  np.
00:54:07  imode: roll won’t work for a singleton queue but last presumably will, so…
00:54:08  something I take issue with as well is the concept of "atomization" in the style of bohm. structured languages need validation (matching beginning/ending loops, etc.) while unstructured needs minimal validation (checking that all jumps are within memory bounds).
00:54:16  arseniiv: singleton queue?
00:54:23  a queue with a single element?
00:54:28  precisely
00:54:36  yeah...
00:54:47  you can do : roll dup drop ;
00:55:03  but wouldn’t you make roll a primitive?
00:55:17  considering that circular buffer thing
00:55:18  why not, when you can define it?
00:55:27  ah yeah if I was using a tape, I'd just have left and right.
00:56:21  roll would be 'right' and last would be 'left'.
00:56:38  operands would just look left or right.
00:57:30  argwards and reswards :D
00:57:43  if you were to add two numbers together, for example, it'd "consume" them and insert the result under the cursor. internally, if you wanted to compile this down to something that didn't have insertion/deletion capabilities, you could implement shifting the tape left or right.
00:59:10   you can do : roll dup drop ; => neat! I haven’t checked immediately
00:59:46  because I implemented 'dup' to just examine the head of the queue.
01:00:15  i.e 1 2 dup -> 1 2 1, vs. 1 2 dup -> 2 1 1
01:00:40  if you implemented it to be destructive, you'd do something like : roll dup last drop ;
01:00:40  it makes sense as you take arguments from the left… or right, I take from the right
01:01:01  ah, you mean that distinction
01:01:29  yeah. it's either "look at the head of the queue, see what its value is, enqueue a copy of it without dequeueing it."
01:01:38  or "dequeue an element, enqueue two of that element".
01:01:48  if you use the former, it's just : roll dup drop ;
01:02:02  if it's the latter, it's : roll dup last drop ;
01:02:06  if I had realized queue programming is so much more fun that stack one some time ago
01:02:39  honestly this is more like tape-based programming with insertion and deletion under the cursor.
01:02:43  alas I remember writing two or three half-finished stack concatenative language implementations
01:02:45  but it _is_ hella fun.
01:02:57  same... I used to be a stack evangelist.
01:03:07  I can't justify the juggling and arbitrary stack primitives.
01:03:18  imode: now the tape, yes, it’s still fun and it even acquires additional charm
01:03:34  I had a sketch of a language that was essentially built in two parts.
01:04:02  the underlying state machine description of an operation/machine, and the macro language for stitching together machines.
01:04:23  I never got to a place where I was happy with it.
01:04:45  the macro language looked a lot like forth.
01:05:26  if you placed down a machine, and it was identified to have "anchor points", any machines you placed after that would be "glued" to those anchor points in sequence.
01:06:26  so 1 2 + if 4 5 + ; 6 7 + would reduce to an actual state graph.
01:07:28  hm I just had a non-minimalistic idea: if one is to go with a circular tape to the end, for every operation F there could be a dual operation F* taking each of its arguments from the other end and placing its results likewise, and if you define F, F* is defined automatically as the elementwise * of its body
01:07:38  1 -> 2 -> + -> if/1 -> 4 -> 5 -> + -> ;       if/2 -> 6 -> 7 -> + -> halt
01:07:50  arseniiv: _exactly_.
01:08:31  and I still haven’t read the last posts
01:08:32  would definitely want a circular tape. for no other reason than it's confusing when considering boundary conditions.
01:09:03  a bounded tape is just a circular tape with markers.
01:10:38  you _could_ implement a two or one-way infinite tape, though.
01:10:59  just insert a blank.
01:11:59  why did we need an infinite tape yet?
01:12:12  TMs traditionally have an infinite tape.
01:12:24  i.e you can keep going in a direction and you have the memory you need.
01:12:52  so if your goal is to reach the end of the universe and put a bit there, you can build a machine that does that... but it won't halt.
01:12:55  ah, there is a plan to fit a TM in this setting?
01:13:08  well, what you're slowly drilling down to _is_ a turing machine.
01:13:16  /if/ you want to be Turing-complete, you need an infinite number of states (configurations)... the unbounded tape is how TMs achieve that.
01:14:38  the difference here is we're just talking about things built as extensions to TMs.
01:14:45  imode: I don’t want to end up with TM! :P I’m happy with a circular tape with a thing between two cells working on it, it’s better than a marked cell
01:15:35  well, what's a circular tape but a bounded/unbounded tape that has markers signifying where to seek when you wrap around.
01:16:20  of course there is an isomorphism
01:16:29  if your tape looks like [ 1 2 3 4 >5< ], and you move right, you can seek all the way back to [ and move right once.
01:16:45  hm or how is it called when one bounded tape corresponds to a class of unbounded tapes
01:17:09  I agree, of course
01:17:24  point is there's always a way to "drill down".
01:17:40  any operation can be reduced to its appropriate state graph.
01:17:56  though I like the circular presentation, it implies left/right are O(1)
01:18:13  exactly. you can "stop" at a certain set of operations and present them as constant time.
01:18:17  on TM they are linear on our tape length
01:18:18  and impement them as primitives.
01:19:20  what could I say :)
01:20:32  the only issue I have is the command representation as it stands. this queue language is really just some macros that could reduce to a state graph.
01:21:06  I’ll go sleep of circular tapes of nonstandard lengths flying through ℵ₁ parallel universes
01:21:18  hahaha, dream well man.
01:22:08 -!- arseniiv has quit (Quit: gone completely :o).
01:26:50 -!- imode has quit (Ping timeout: 240 seconds).
01:34:07  `icode ℵ₁
01:34:08  ​[U+2135 ALEF SYMBOL] [U+2081 SUBSCRIPT ONE]
02:10:08 -!- Phantom_Hoover has joined.
02:13:40 -!- Sgeo_ has joined.
02:16:42 -!- Sgeo__ has quit (Ping timeout: 245 seconds).
02:17:38 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
02:43:31 -!- imode has joined.
03:51:03 -!- Sgeo has joined.
03:53:38 -!- Sgeo_ has quit (Ping timeout: 240 seconds).
04:09:46 -!- Lykaina has joined.
04:44:35 -!- Lord_of_Life has quit (Ping timeout: 265 seconds).
04:47:40 -!- Lord_of_Life has joined.
04:54:35  [[1+]] M https://esolangs.org/w/index.php?diff=66333&oldid=66331 * TwilightSparkle * (+6) /* Examples */ Hash index starts from 0!!
05:10:51  [[1+]]  https://esolangs.org/w/index.php?diff=66334&oldid=66333 * TwilightSparkle * (+149) /* Turing-Completeness */
05:12:04  [[1+]]  https://esolangs.org/w/index.php?diff=66335&oldid=66334 * TwilightSparkle * (+53) /* Turing-Completeness */
05:19:29 -!- Sgeo has quit (Ping timeout: 276 seconds).
05:20:28  [[1+]]  https://esolangs.org/w/index.php?diff=66336&oldid=66335 * TwilightSparkle * (+34) /* Turing-Completeness */
05:25:53 -!- Lykaina has quit (Quit: leaving).
05:31:53 -!- Frater_EST has joined.
06:00:25 -!- oerjan has quit (Quit: Nite).
06:39:01 -!- Sgeo has joined.
07:05:23 -!- Lord_of_Life has quit (Read error: Connection reset by peer).
07:10:46 -!- Lord_of_Life has joined.
07:42:02 -!- imode has quit (Ping timeout: 268 seconds).
07:45:45 -!- LKoen has joined.
07:50:20 -!- LKoen has quit (Remote host closed the connection).
07:51:20 -!- LKoen has joined.
08:18:01 -!- cpressey has joined.
08:27:47 -!- MrBismuth has quit (Read error: Connection reset by peer).
08:31:36 -!- Phantom_Hoover has joined.
08:38:25 -!- LKoen has quit (Remote host closed the connection).
08:40:37 -!- LKoen has joined.
08:42:19 -!- LKoen has quit (Remote host closed the connection).
08:44:52 -!- LKoen has joined.
08:56:57 -!- LKoen has quit (Remote host closed the connection).
09:03:22 -!- LKoen has joined.
09:25:39  Hah: "As long as theoretical computer scientists can’t even prove basic conjectures like P≠NP or P≠PSPACE [...]"
09:26:02  (from Q8 at https://www.scottaaronson.com/blog/?p=4317)
09:27:41  i once witnessed someone trying to explain to somebody who really didn't get it why P is a subset of PSPACE
09:27:46  quite hillarious
09:28:43  intuitively this is easy... a P algorithm can only touch a polynomial amount of memory (tape, whatever).
09:29:02  Making it formal is probably quite tedious.
09:29:03  yeah, it is easy
09:29:54  (Especially if your model of computation is *not* Turing Machines but something closer to reality like RAM machines)
09:32:00  Whose name is attached to NSPACE(f(x)) = DSPACE(f(x)^2)?
09:32:14  idk, I've always seen RAM machines as just hiding (a polynomial number of) head movements
09:33:09  cpressey: Well personally I find P too coarse; exponents matter in practice.
09:33:47  There's the old joke that theory is more important than practice, except in practice
09:35:28  Savitch (I meant \subseteq instead of =... I kind of forgot to go back and change it.)
09:38:12  What's all this about quantum supremacy now. Oh gosh. Scott Aaronson. I'm not sure I want to read this.
09:39:09  Taneb: i once was told a piece of conversation like "so, how are your studies different from mine" "well, we are doing more theorie: runtime analysis, proofs, ..." "if you proove something, it isn't theory anymore"
09:40:25  I suppose debunking quantum hype is a noble calling, but so is not caring about it.
09:40:42  cpressey: But he does care now.
09:40:42  cpressey: that article is neither
09:41:21  >_> I should stop trying to make jokes.
09:42:08  Sorry, I didn't observe any joke when I collapsed your sentence.
09:47:25  `unidecode ☰𝌁𝌃
09:47:26  ​[U+2630 TRIGRAM FOR HEAVEN] [U+1D301 DIGRAM FOR HEAVENLY EARTH] [U+1D303 DIGRAM FOR EARTHLY HEAVEN]
09:55:06   Is there also a trigram for just plain earth?
09:58:20  ski: ^^ question for you ;-)
10:10:27  `unidecode ☷
10:10:27  ​[U+2637 TRIGRAM FOR EARTH]
10:20:21  I saw those at home, but at work they're just boxes. :/
10:20:26  Must be missing some fonts.
10:41:17 -!- Frater_EST has quit (Ping timeout: 245 seconds).
10:41:44 -!- LKoen has quit (Remote host closed the connection).
10:46:14 -!- LKoen has joined.
10:50:54 -!- LKoen has quit (Ping timeout: 246 seconds).
11:21:11  [[Byter]] M https://esolangs.org/w/index.php?diff=66337&oldid=66332 * PaniniTheDeveloper * (+0) 
11:46:03 -!- Phantom_Hoover has quit (Ping timeout: 265 seconds).
12:38:37  int-e : also ⌜𝌅⌝ (and apparently also ⌜𝌀⌝ ?)
12:38:54  `unidecode 𝌅𝌀
12:38:55  ​[U+1D305 DIGRAM FOR EARTH] [U+1D300 MONOGRAM FOR EARTH]
12:39:39  "usually associated with human (Chinese ren), rather than earth" (the latter one)
12:41:56  int-e : i was pondering the other day, using these (mono|di|tri|tetra|hexa)-grams as pixels (sortof), wondering why the internal ordering was inconsistent among them, and trying to make some sense of the associations of different meanings to the bits/trits
12:42:41  (perhaps the I Ching would explain some of it ?)
12:43:35  (in particular the internal ordering of the hexagrams is strange)
12:44:28 * ski glances at fizzie
12:49:40 -!- sebbu has quit (Quit: reboot).
12:50:46  ski: hmm it embeds a fancy complementation operation (mirror image, except when the symbol is vertically symmetric; in that case, the boolean complement is taken instead)
12:50:47 * ski just realized what int-e meant by
12:50:53   ski: Now does that mean that shift-o (for example) can produce any of A, B, H or I?
13:15:39  [[Pie]] N https://esolangs.org/w/index.php?oldid=66338 * InfiniteDonuts * (+327) Created page with "==Introduction== Pie is an 2-dimensional esoteric programming language created by [[User:InfiniteDonuts]] that is sort of a [[Befunge]]/[[PATH]] hybrid. Like Befunge, i..."
13:16:48  [[User:InfiniteDonuts]]  https://esolangs.org/w/index.php?diff=66339&oldid=66269 * InfiniteDonuts * (+68) 
13:21:28  [[Pie]]  https://esolangs.org/w/index.php?diff=66340&oldid=66338 * InfiniteDonuts * (+176) 
13:23:50  the github link results in a 404
13:26:02  InfiniteDonuts doesn’t have any public repositories yet.
13:26:10  this may be why
13:28:10  well
13:33:35  [[Pie]]  https://esolangs.org/w/index.php?diff=66341&oldid=66340 * InfiniteDonuts * (+5) 
13:41:39  ski: https://en.wikipedia.org/wiki/King_Wen_sequence somewhat explains the duality (but there's also a lot of mystification surrounding all this)
13:47:27  I wonder about compiling Scheme to Javascript using CPS. JS has poor TCO support so you'd want to make a trampoline. But would you construct a custom trampoline for each program? It sounds like a neat approach regardless of the practical benefits it may or may not have.
13:51:16  I remember borrowing "Compiling with Continuations" from the library years & years ago. I remember liking it but I never got too deep and I don't remember any of the content specifically.
13:53:28 -!- Frater_EST has joined.
13:54:24  I think there's usually an assumption there that you'll be compiling to a machine language that has conventional jumps, though. Compiling to another high-level language with functions (and closures, even), but not TCO, would be putting a different twist on it.
13:55:06  there's always for (;;) { switch (foo) { ... } }
13:55:20  Yeah, that's what I meant by "trampoline".
13:55:44  or stuff like  while (next != NULL) {  next = (*next)(); }
13:57:50  Great. I now want to write a Scheme compiler that compiles to trampolined code, as if I don't already have enough on my todo list.
13:58:08 -!- Frater_EST has quit (Ping timeout: 246 seconds).
13:58:15  Thanks, personal interests! You're really helpful sometimes.
13:58:31 -!- Frater_EST has joined.
14:04:50 -!- Frater_EST has quit (Ping timeout: 240 seconds).
14:06:36 -!- Frater_EST has joined.
14:06:44  [[Language list]]  https://esolangs.org/w/index.php?diff=66342&oldid=66275 * InfiniteDonuts * (+10) /* P */
14:11:01 -!- Sgeo_ has joined.
14:13:57 -!- Sgeo has quit (Ping timeout: 268 seconds).
14:24:55 -!- Frater_EST has left.
14:31:46 -!- arseniiv has joined.
14:33:03  hi hi
14:34:28  hi arseniiv 
14:37:03  I thought up a monoid thinking about types for stack operations. Though I already knew how to encode them with heterogeneous lists, I think a monoid looks more operationally usable. Or at least it looks neat in case we’re concerned only with stack under/overflow and not types of its elements;
14:38:45  [[L]]  https://esolangs.org/w/index.php?diff=66343&oldid=53989 * InfiniteDonuts * (+100) /* Hello World */
14:39:57  [[L]]  https://esolangs.org/w/index.php?diff=66344&oldid=66343 * InfiniteDonuts * (+77) 
14:41:09  in generic case, it’s a free monoid on t⁺, t⁻ for all types t, factored by t⁺t⁻ = e; in the simplest it’s a free monoid on +, − factored by +− = e. Now the last one looks almost like integers but with a quirk, so I thought maybe we need to name these things numbers too. Here, all balanced strings of + and − equal to e and we end up with a unique presentation of each element as −^m +^n
14:41:36  in stack op terms it means m elements are popped and then n are pushed
14:41:53  we can’t pop from empty stack so −+ is not e
14:42:27  likewise with the general version, and we even may generalize to deques
14:43:55  as two ends of a deque are basically independent from this perspective if we don’t know its length
14:43:56  [[Pie]]  https://esolangs.org/w/index.php?diff=66345&oldid=66341 * InfiniteDonuts * (+87) 
14:44:53 -!- imode has joined.
14:45:05  now, we could do something like this with checking well-placedness of [ and ] but ? and ; would get in the way
14:45:11  himode
14:47:13  . o O ( now I propose calling those +−-things plumbers as the stack may be viewed as a tube )
14:48:36 -!- Frater_EST has joined.
14:49:07  allo arseniiv.
14:51:09  whoa, if you link with -fno-plt, ld will turn statically linked calls from indirect jumps to direct jumps.
14:55:09 -!- Frater_EST has quit (Remote host closed the connection).
14:55:42  [[Special:Log/newusers]] create  * Lewis *  New user account
14:58:06  int-e, ty
14:58:36  arseniiv : hm, reminds me of some kind of bra-ket description of something with regexen ?
14:58:52  (BTW how old is trampoline idea)
14:59:18  perhaps you could find some mention in some Scheme paper
14:59:31  ski: it reminded me about something QM too, creation and annihilation operators should work that way too IIRC
15:01:53  arseniiv :  might have some relevant paper about it
15:02:22  er, sorry
15:02:31  cpressey : that ^ was for you
15:05:01  are you still working with that C compiler?
15:06:21  ski: thanks!
15:07:11  arseniiv: the thing I don't like about my current language is [ and ]. it kind of fails the model of computation check because [ and ] have to be balanced for the underlying logic to work.
15:08:33  which means that a PDA or counter machine is required to validate the language.
15:09:28 * ski supposes it was possibly both for arseniiv and cpressey ..
15:12:30  I fail to see how pie is notably different from befunge except it being underspecified
15:15:11  arseniiv: http://www.cs.indiana.edu/hyplan/dfried/ts.ps talks a bit about the history. As I understand it, the idea is old but appears in slightly different forms and doesn't get the name "trampoline" until about 1995.
15:17:30 * ski supposes cpressey got that link off  :)
15:17:59  Indirectly, yes (The paper was listed there but wasn't archived; I had to search to find a copy of it)
15:18:09 * ski nods
15:18:14  too bad the domain expired
15:19:45   arseniiv: the thing I don't like about my current language is [ and ]. it kind of fails the model of computation check because [ and ] have to be balanced for the underlying logic to work. => right. That they stand in the way of typing the program is almost the same thing here
15:20:32  cpressey: thanks! (hmm I need a postscript viewer…)
15:21:02  arseniiv : perhaps `gv' ?
15:21:45  (someone mentioned `zathura' and `okular' too. and i think `evince' can do it ?)
15:22:02 * ski . o O ( `xpdf' )
15:23:10  I don't think there's a real solution to that problem. apart from manual jumps. I still think there needs to be a linear notation for state machines.
15:23:52  I'm on Ubuntu; `evince` can view .ps directly, and there is also `ps2pdf`
15:25:29  (apparently `ps2pdf` is part of `ghostscript`)
15:27:44  arseniiv, imode: fwiw, the last few concatenative languages I've designed have not had nesting or names, sort-of for the same reasons you mention. I've been calling them "purely concatenative" for that reason. They're not very nice to program in though.
15:28:19  cpressey: mine doesn't have nesting. [ and ] form an infinite loop.
15:28:31  it's a control flow construct more than anything.
15:32:02 -!- GeekDude has quit (Ping timeout: 240 seconds).
15:36:21 * ski usually uses `gv'
15:37:38 * ski idly ponders mapping concatenative to categorical
15:38:28  yay I converted that ps
15:38:53 * ski idly ponders how to convert PDF to PS
15:39:02  now I can uninstall ghostscript mwahaha
15:39:38  any structured control flow requires an external validator, so I guess it fits under a model of programming rather one of computation. unstructured, state-driven or pattern-based control flow are the only candidates for a model of computation.
15:42:13  why are array languages classified under "unstructured", I wonder.
15:42:49  where ?
15:43:08  wikipedia
15:43:27  https://en.wikipedia.org/wiki/Non-structured_programming <-- right-hand sidebar, right under "Non-structured".
15:43:45  I mean I guess APL has a goto statement, doesn't it?
15:43:55  maybe they mean "structured" in the sense of the "structured programming" paradigm ?
15:44:05  more than likely, yeah.
15:44:14  which APL fits under.
15:44:24  hm, looks that way
15:44:30  never liked array languages. they're complicated to implement.
15:44:38  NESL ?
15:44:46  NESL?
15:44:48  yes
15:44:55  whazzat.
15:45:00  
15:45:13  "Nested data parallelism"
15:45:50  are you saying this isn't complicated to implement?
15:46:37  or that this fits the definition of an array language.
15:47:16 -!- GeekDude has joined.
15:56:00  hm, perhaps rather that it is complicated to implement
15:56:16  (and mayeb fits the definition, not sure ?)
15:57:52  ok well TIL there's a very close correspondence between CPS and A-Normal Form.  (I knew of ANF previously but didn't see the connection to CPS at all.)
15:58:00  probably. I've seen people touting APL and K, etc. as "languages with the smallest implementations", but when your implementations are obfuscated and optimized for size rather than simplicity, it's a moot damn point.
15:58:22 -!- cpressey has quit (Quit: A la prochaine.).
16:01:28  array languages _are_ interesting, though. while they do have control flow operations, a lot of code I see doesn't even have any of them.
16:01:41  it's all operations on data.
16:03:13  they're hella messy, though..
16:05:50 * ski . o O (  )
16:10:38  unstructured control flow is hard to compose without sophisticated tooling, though. for example, creating a state machine that enters either a 'true' or 'false' state upon some comparison operation is fine, but composing two machines means identifying where the "anchor" points are for that given machine and attaching two subsequent machines accordingly.
16:14:10  stitching together state machines is also complex because you need names for duplicate/intermediary states as well...
16:20:32  if you used a line numbering approach, it could work. you still need some machinery to stitch together arbitrary code snippets, though.
16:23:07 * ski . o O ( ⌜10 PRINT "VOOB ";␤20 GOTO 10⌝ )
16:25:11 -!- grumble has quit (Quit: And this chaos, it defies imagination).
16:29:48 -!- grumble has joined.
16:32:01 -!- sebbu has joined.
16:43:43 -!- Sgeo has joined.
16:43:44 -!- Lord_of_Life_ has joined.
16:44:37 -!- Sgeo_ has quit (Ping timeout: 240 seconds).
16:46:37 -!- Lord_of_Life has quit (Ping timeout: 240 seconds).
16:46:38 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
17:10:52  arseniiv: you could probably get away with not validating [ and ] if you mean [ to be "push a symbol to the tape representing the current instruction pointer" and ] to be "jump to the instruction pointer represented on the tape".
17:12:22  though "conditional/unconditional break" would be difficult at that point, because you have to jump to an unspecified address..
17:15:03  you know what I didn't think of, though. relative addressing.
17:23:17 -!- FreeFull has joined.
17:25:36  imode: `[ ] ? ;` are not so hard to validate as to represent as something typeful
17:26:29  they aren't hard to validate, no. but because they require validation, they don't meet my requirement anymore.
17:27:13  oh, also it occurred to me as I drifted off that your new implementation of `pick` now can take any nonnegative integer index. Even if it’s too big, we’ll just wrap around several times and that’s it
17:27:35  exactly. :)
17:28:12   but because they require validation, they don't meet my requirement anymore. => yeah. I meant from my typing perspective
17:28:18  ahh.
17:30:15  of course that’s why compilers don’t use typing as the only kind of static information, but still I’ll be glad to unify them for cases as simple as this
17:32:15  anyway it looks too philosophical. There is a constructive approach: program a validator which takes word at a time and then try to encode that as types; this is how I ended up with that +− monoid
17:32:34  this whole thing is largely philosophical lol
17:32:35  previously I thought of those types as m → n where m, n : N
17:33:27  but in this form they have no easy law of composing (f: m → n, g: m′ → n′, f ∘ g: ???); and the monoid representation has, it’s just a concatenation
17:34:08  "vertical composition" ?
17:34:17  (or is it "horizontal" ?)
17:34:22 * ski can never recall ..
17:34:49  −+ ∘ −−+ = −(+−)−+ = −−+
17:35:31  ski: don’t remember either
17:36:12  though maybe the notation is too cryptic, here f: m → n means f pops m values and then pushes n values
17:36:19  (or dequeues and enqueues)
17:36:41  oh
17:37:36 * ski idly wonders whether there's a name for monoids with left- and right- inverses like that
17:38:46  FTR I was going to ask about that too
17:38:59  maybe someone knows
17:39:45  they seem to be in a sense halfway to a free group
17:44:16  yea, first i was going to suggest free group, to you :)
17:44:39  (until i saw "we can’t pop from empty stack so −+ is not e")
17:44:57 * ski idly recalls talking to someone doing random walks in groups
18:04:06  also we can define “multiplication” as can be done on (N, +) and (Z, +), by considering all [anti]endomorphisms. Here, they seem to form a group ≅ Z, so this “multiplication” is not that good; anyway “multiplying” by n would mean replacing each ± by ±^n if n ≥ 0, or by ∓^n if n ≤ 0. This makes not a lot of sense for applications of that monoid here, though
18:08:14  would that be a group action ?
18:08:18  now that I'm thinking of it, I don't think there's any model of computation that _doesn't_ require some validation of the code prior to execution other than perhaps cellular automata.
18:12:15  depends how you set things up
18:12:33  CA source code is binary strings and CA valid source code is binary strings
18:12:45  lisp source code is ascii text and valid lisp source code is well balanced brackets
18:13:08  but you could say, CA source code is ascii text and the only valid CA inputs are ones only using the 0 and 1 symbols
18:13:48  not really the case, here. state machines need to be stored in some format in some place, and that format needs to be some form of a state table.
18:14:15  brainfuck and my language are stored as linear text sequences, but only valid sequences contain matched brackets.
18:15:03  CAs are literally just "here's some data, with some regions linked together in some topological fashion, and data exists in those regions, and depending on what data is next to what, data in certain regions changes".
18:15:56  I disagree completely
18:16:11  feel free to, I guess.
18:17:35  ski: if I’m correct it would be a monoid action as (Z, ⋅) is what acts in this case, not (Z, +): m×(n×a) = (mn)a
18:19:04  (and not (m+n)a)
18:24:29 -!- MDude has quit (Ping timeout: 246 seconds).
18:25:14  mhm
18:49:49  `asm label: nop; nop; addr32; jmp label
18:49:49  0:  90   nop \ 1:  90   nop \ 2:  67 eb fb   addr32 jmp 0