←2020-01-12 2020-01-13 2020-01-14→ ↑2020 ↑all
00:01:20 -!- Frater_EST has joined.
00:22:08 -!- sleepnap has joined.
00:32:17 <zzo38> Do you have any question and feature request of TeXnicard? I am working on writing TeXnicard so if anyone who is interested in it has some idea, then, I would like to your opinion of it please.
00:33:04 -!- arseniiv has quit (Ping timeout: 268 seconds).
00:35:05 <zzo38> Also, can any of the vector output formats of Ghostscript be converted to SVG?
00:48:56 -!- Frater_EST has left.
01:08:56 <kmc> zzo38: inkscape can open PDF and save SVG
01:11:14 <fizzie> It can also open EPS files.
01:32:26 -!- sleepnap has quit (Quit: Leaving.).
02:00:04 -!- xkapastel has quit (Quit: Connection closed for inactivity).
02:01:40 -!- FreeFull has quit.
03:12:10 -!- Lord_of_Life has quit (Ping timeout: 268 seconds).
03:13:25 -!- Lord_of_Life has joined.
04:00:00 -!- Taneb has quit (Quit: I seem to have stopped.).
04:01:38 -!- Taneb has joined.
04:18:44 -!- MDude has quit (Quit: Going offline, see ya! (www.adiirc.com)).
05:01:14 -!- xelxebar has joined.
07:41:53 -!- imode has quit (Ping timeout: 260 seconds).
08:03:53 <zzo38> I saw a way to encode integers where first it starts with however many "1" bits of the length of the absolute value in bits, and then the sign, and then the bits in binary omitting the high bit (which is always set anyways). But I thought another way could be to encode the length using bijective binary instead of unary.
08:08:02 -!- j-bot has quit (Ping timeout: 258 seconds).
08:12:55 -!- FireFly has quit (Quit: Goodbye).
08:13:36 -!- FireFly has joined.
09:47:30 -!- b_jonas has quit (Remote host closed the connection).
10:23:11 -!- kspalaiologos has joined.
10:38:21 <int-e> Ah, this is my kind of joke: "[...] needs JavaScript to function properly and provide you with a fast, stable experience. Please enable JavaScript or check your browser's settings."
10:39:53 <int-e> (Sometimes I miss the pre-Navigator WWW. (Before <blink>animated</blink> gifs.)
10:40:27 <int-e> And dometimes I miss closing parentheses.)
10:46:22 <kspalaiologos> actually I believe old web was really nice
10:49:17 -!- MDude has joined.
10:58:29 <kingoffrance> what i miss is the bottle neck was e.g. my 28.8k modem; the text of the page would load, and then youd wait for the rest to load; as opposed to know, text might not appear until it does <unknown> and you get to sit and wait and watch <x requests> to <y> servers for <who knows what>
10:58:43 <kingoffrance> s/as opposed to know/as opposed to now/
10:59:17 <kingoffrance> in the worst days of animated gif ads, etc. i recall the text would load and you could browse even before the images all did, etc.
10:59:27 <kingoffrance> s/browse/peruse the text/
11:49:35 <esowiki> [[FAKE]] M https://esolangs.org/w/index.php?diff=68815&oldid=65590 * Argv0 * (+291) /* Examples */ Added an example
12:02:34 -!- arseniiv has joined.
14:14:05 -!- sprocklem has quit (Ping timeout: 265 seconds).
14:15:25 <kspalaiologos> gif ads were better than flash ads for sure
14:31:44 -!- wib_jonas has joined.
14:45:31 <kspalaiologos> J learning time
14:45:41 <kspalaiologos> where did I finish the last time
14:46:09 <kspalaiologos> https://esolangs.org/logs/2020-01-10.html#lhj
14:48:39 <wib_jonas> kspalaiologos: you gave a solution to the sum of 3-chunks problem, but I'm not sure if you actually understood how the rank conjunction work enough to be able to use it well in the future.
14:48:48 <wib_jonas> If you don't care about that part, you can solve the train timetable problem.
14:49:50 <kspalaiologos> well I undestand a tiny bit how it works
14:49:56 <kspalaiologos> but I don't feel confident really
14:58:19 -!- sleepnap has joined.
15:07:30 -!- sprocklem has joined.
15:11:15 -!- Lord_of_Life_ has joined.
15:14:26 -!- Lord_of_Life has quit (Ping timeout: 240 seconds).
15:14:27 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
15:30:53 <Taneb> I've had a possibly dumb idea and I'd like to know if it's been done already
15:31:07 <Taneb> Graph parsing
15:31:46 <Taneb> Given a directed graph of labelled nodes, and a language, is there a sequence of connected nodes such that the labels of the sequence is a member of the language?
15:33:22 <int-e> it's called the intersection of a language with a regular language?
15:33:34 <int-e> (more or less)
15:34:24 <int-e> For example, the intersection of a context-free language with a regular language is context-free.
15:37:06 -!- sprocklem has quit (Ping timeout: 268 seconds).
16:08:45 -!- Frater_EST has joined.
16:19:27 -!- imode has joined.
16:21:12 -!- Frater_EST has quit (Read error: Connection reset by peer).
16:22:47 -!- Frater_EST has joined.
16:25:14 -!- Frater_EST has left.
16:35:25 -!- Sgeo__ has joined.
16:38:26 -!- Sgeo_ has quit (Ping timeout: 240 seconds).
17:09:24 -!- wib_jonas has quit (Remote host closed the connection).
17:48:03 -!- sprocklem has joined.
17:51:42 <esowiki> [[Esolang:General disclaimer]] https://esolangs.org/w/index.php?diff=68816&oldid=67011 * DmilkaSTD * (-4)
17:52:54 <esowiki> [[Esolang:General disclaimer]] https://esolangs.org/w/index.php?diff=68817&oldid=68816 * DmilkaSTD * (+48)
17:55:23 <esowiki> [[(HA)pple waITING]] https://esolangs.org/w/index.php?diff=68818&oldid=68076 * DmilkaSTD * (-1)
17:56:25 <esowiki> [[]] https://esolangs.org/w/index.php?diff=68819&oldid=66194 * DmilkaSTD * (+12)
17:59:51 <esowiki> [[Elevator]] https://esolangs.org/w/index.php?diff=68820&oldid=62021 * DmilkaSTD * (+28)
18:10:16 <esowiki> [[Mind reader]] N https://esolangs.org/w/index.php?oldid=68821 * DmilkaSTD * (+575) Created page with "Mind reader is a esolang with a binary instructions.<br> Each instruction has a length of 9 characters (9 BITS). This language has 2 variables (2 REGISTERS) called flow_regist..."
18:10:34 <esowiki> [[Mind reader]] https://esolangs.org/w/index.php?diff=68822&oldid=68821 * DmilkaSTD * (+12)
18:10:58 <esowiki> [[Mind reader]] https://esolangs.org/w/index.php?diff=68823&oldid=68822 * DmilkaSTD * (+2)
18:11:11 <esowiki> [[Mind reader]] https://esolangs.org/w/index.php?diff=68824&oldid=68823 * DmilkaSTD * (+4)
18:12:27 <esowiki> [[Mind reader]] https://esolangs.org/w/index.php?diff=68825&oldid=68824 * DmilkaSTD * (+29)
18:12:41 <esowiki> [[Mind reader]] https://esolangs.org/w/index.php?diff=68826&oldid=68825 * DmilkaSTD * (+18)
18:13:13 <esowiki> [[(HA)pple waITING]] https://esolangs.org/w/index.php?diff=68827&oldid=68818 * DmilkaSTD * (+47)
18:17:10 -!- FreeFull has joined.
18:24:23 <esowiki> [[Mind reader]] https://esolangs.org/w/index.php?diff=68828&oldid=68826 * DmilkaSTD * (+183)
18:24:37 <esowiki> [[Talk:Burn]] https://esolangs.org/w/index.php?diff=68829&oldid=68766 * Hex96 * (+69) /* a slightly more serious attempt */
18:33:33 -!- sleepnap has quit (Quit: Leaving.).
18:38:06 <esowiki> [[Shader state]] N https://esolangs.org/w/index.php?oldid=68830 * DmilkaSTD * (+137) Created page with "== In construction == This language is a page for the idea that I had. == Idea == A esolang that make shaders but like a Turing machine."
18:39:26 -!- LKoen has joined.
18:40:06 -!- b_jonas has joined.
18:56:48 -!- jix has quit (Ping timeout: 260 seconds).
19:16:46 -!- jix has joined.
19:43:00 -!- sleepnap has joined.
20:04:44 -!- sprocklem has quit (Ping timeout: 268 seconds).
20:22:53 <kspalaiologos> I've made a Lempel-Ziv 77 decoder
20:22:55 <kspalaiologos> in brainfuck
20:23:02 <kspalaiologos> it's around 25k big
20:23:07 <kspalaiologos> but it works, slowly, but works
20:23:17 <b_jonas> I made one of those in perl once
20:23:48 <b_jonas> but I didn't use it for anything useful, I just encoded the 12 days of christmas song with it
20:24:41 <b_jonas> https://www.perlmonks.com/?node_id=521169
20:26:05 <kspalaiologos> it's awesome
20:26:20 <b_jonas> there are much better ways to compress that poem
20:26:41 <kspalaiologos> yep
20:26:54 <kspalaiologos> kolmogorov complexity, I know
20:27:23 <b_jonas> I'll have to write a 99 bottles of beer program in Consumer Society
20:27:32 <b_jonas> it's pretty easy
20:28:04 <b_jonas> admittedly that's because I decided to add a simple syntax to print string literals to Consumer Society, for convenience of debugging
20:28:12 <kspalaiologos> interesting
20:28:23 <kspalaiologos> I may write on in J
20:28:27 <kspalaiologos> this seems like an amazing challenge
20:28:34 <kspalaiologos> brb
20:28:36 -!- kspalaiologos has quit (Quit: Leaving).
20:47:55 <esowiki> [[Psychairefatback]] https://esolangs.org/w/index.php?diff=68831&oldid=67517 * Ashtons * (-1635) Redirected page to [[Language list]]
20:48:13 <esowiki> [[User:Ashtons]] https://esolangs.org/w/index.php?diff=68832&oldid=67028 * Ashtons * (-33)
20:49:23 <esowiki> [[Language list]] https://esolangs.org/w/index.php?diff=68833&oldid=68813 * Ashtons * (-23) /* P */
21:09:27 <zzo38> I might use the SQLite page cache in my own program, using SQLITE_CONFIG_GETPCACHE2 to access it. I will see if it is suitable, but my idea is to use for pictures that might be reused several times, so is useful to cache them.
21:10:54 -!- sprocklem has joined.
21:15:33 -!- Frater_EST has joined.
21:18:34 <fizzie> I think I used something more or less LZ77+Huffman to compress the NKIs for rfk86.
21:19:16 <b_jonas> by "something more or less LZ77+Huffman", do you mean deflate?
21:20:43 <fizzie> I don't think it was deflate in all the details (as in, the exact same bitstream format, and support for both static/dynamic Huffman trees), but algorithmically speaking sure, it would've been more or less equivalent.
21:21:24 -!- Frater_EST has left.
21:22:33 <fizzie> Oh, it's documented in the Perl script that compresses it.
21:28:32 <fizzie> It doesn't compress across messages at all, to make it possible to decompress only the selected NKOs (I thought it was NKI, but looks like it's NKO) so the compression rate isn't great, 18866 to 12093 bytes.
21:43:57 <b_jonas> fizzie: well, the main difference, as far as I know, is that deflate uses LZW as opposed to LZ77, where the difference is that in LZ77, you have literal bytes and repeats strictly alternating, whereas in LZW, literal bytes and repeats can come in any sequence. this means that in LZW, you need to have the bytes and the repeats in the same huffman tree, but it's still almost always a win.
21:44:23 <b_jonas> I think the advantage of LZ77 is mainly the simpler decompressor code
21:45:01 <b_jonas> but I admit I'm not following this whole compression technology too closely
21:45:40 <b_jonas> I'm just using various compressors and decompressors as black boxes, and know a little about their performance characteristics so I can decide when to use what.
21:50:06 <b_jonas> also, what's the point of learning it, when in a few decades, all compression will be obsolete because, people want to transfer and store everything encoded with strong cryptography, and every compression leaks information through side channels. we'll just be streaming full resolution videos uncompressed through wireless internet, because internet bandwidth will increase more quickly than the demand for
21:50:12 <b_jonas> better quality video.
21:59:20 <zzo38> I made a implementation of robot find kitten in Glulx, and uses Huffman but not LZ77 (although there are some strings of multiple characters that are given a single Huffman code), because that is a function built in in Glulx.
22:01:13 <zzo38> (I implemented the compression myself (in JavaScript), although the decompression code is one that I didn't write.)
22:01:38 <fizzie> https://zem.fi/tmp/ticket.jpg - the C programmer's train ticket.
22:02:34 <zzo38> Is there any train station called VOID VOID VOID VOID?
22:02:47 <fizzie> I don't think so. At least in the UK.
22:03:46 -!- FreeFull has quit.
22:04:51 -!- sprocklem has quit (Ping timeout: 265 seconds).
22:06:54 -!- FreeFull has joined.
22:24:03 -!- LKoen has quit (Remote host closed the connection).
22:46:25 <b_jonas> zzo38: probably no, at least not in Europe, because none of bahn.de, oebb.at, sj.se, elvira.hu recognize it as a train station name. They suggest Voitsdorf.
22:46:52 <b_jonas> But I hear American towns sometimes have weirder names, so maybe it's a railway station over there
22:47:59 <fizzie> There's a Void-Vacon in France, but it doesn't seem to have a railway.
22:49:10 <fizzie> https://en.wikipedia.org/wiki/Void-Vacon - quite stubby.
22:50:06 <b_jonas> the conversations on this channel sometimes get surreal
22:50:33 <fizzie> It's a shame it's not just "Void", otherwise there could be some nice street signs on nearby roads with VOID → on them.
22:51:21 -!- LKoen has joined.
22:52:00 <kingoffrance> eh, its a thing "nothing sucks like a vax" people love to find product names/etc. theres a page with various "unix" spottings for example
22:52:11 <fizzie> Not sure if those would just get stolen, which I understand is what happens to most amusing towns, like the town of Fucking in Austria.
22:52:21 <kingoffrance> i have seen a mop IIRC called "libman" which i am waiting for a library that deals with man pages to appear
22:52:29 <kingoffrance> perhaps there is one already
22:52:49 <kingoffrance> s/mop/mop brand/
22:53:01 <b_jonas> kingoffrance: no, libman would deal with men. if it dealt with manpages, that would be libroff or libmanpage or something like that
22:53:09 <b_jonas> maybe libmandb
22:53:39 <b_jonas> fizzie: there's a Perl
22:54:41 <b_jonas> kingoffrance: "UNIX" is not particularly surprising anymore, there's a car tyre company of that name here
22:54:48 <b_jonas> highly advertised
22:56:58 <kingoffrance> i have a "boost" nutrition drink in front of me right now
22:57:05 <kingoffrance> this "boost" i would drink
22:57:52 <kingoffrance> but if you chug it, that won't work out well
22:58:08 <b_jonas> meh, it's easy when people choose reasonably common words for two different brands
22:58:27 <b_jonas> and also when it's two things called "Athena" or "Athene" because heck that goddess is so overused
23:07:16 -!- sleepnap has quit (Ping timeout: 268 seconds).
23:26:07 <b_jonas> or maybe overinvoked
23:29:21 <kingoffrance> `8ball will b_jonas be punished for not sufficiently believing in Athena?
23:29:23 <HackEso> As I see it, yes.
23:29:40 <b_jonas> what?
23:29:59 <b_jonas> how do I not sufficiently believe if I say that naming things of Athena is a mention rather than a use?
23:30:17 <kingoffrance> well thats a good answer, you were trying to point out the posers
23:30:28 <kingoffrance> the lukewarm
23:36:59 <LKoen> hi
23:37:25 <LKoen> today a coworker aksed me "I read a paper today stating 'magic the gathering is turing complete' and I had no idea what they meant, can you explain?"
23:37:45 <b_jonas> LKoen: we have a link to the more recent of those papers from the wiki
23:37:48 <b_jonas> let me find it
23:37:56 <LKoen> oh
23:38:54 <b_jonas> link is near bottom of https://esolangs.org/wiki/Talk:StackFlow
23:38:58 <b_jonas> a bit hidden, sure
23:39:07 <b_jonas> we might need a proper article about Magic: the Gathering
23:40:28 <b_jonas> ask ais523 about details, especially why cute kittens are no longer involved
23:42:06 <b_jonas> or maybe kittens are still involved in ais523's construction
23:42:15 <b_jonas> but not in that other construction in those articles
23:46:14 <zzo38> I also set up a NNTP to discuss some of the stuff relating to Magic: the Gathering, including mathematical stuff such as Turing-completeness, and custom cards, and questions about game rules; not about the more common stuff such as deck construction and buying/selling cards and tournaments.
23:56:32 -!- sprocklem has joined.
←2020-01-12 2020-01-13 2020-01-14→ ↑2020 ↑all