< 1543709034 536068 :sprocklem!~sprocklem@unaffiliated/sprocklem QUIT :Ping timeout: 250 seconds < 1543709247 122163 :sprocklem!~sprocklem@unaffiliated/sprocklem JOIN :#esoteric < 1543710058 719524 :S_Gautam!uid286066@gateway/web/irccloud.com/x-mfesceqzgcjgashx QUIT :Quit: Connection closed for inactivity < 1543710586 160427 :user24!~user24@p200300C3AF1538389188699962FE6860.dip0.t-ipconnect.de JOIN :#esoteric < 1543710830 393157 :imode!~imode@unaffiliated/imode JOIN :#esoteric < 1543710941 708375 :zzo38!~zzo38@24-207-47-161.eastlink.ca PRIVMSG #esoteric :I thought of once a rule variation for mahjong that if you have menzentsumo it does not count 1 han but it does reduce your requirement by 1 han (reducing it normally to zero, although sometimes it will still be 1) < 1543710950 526331 :zzo38!~zzo38@24-207-47-161.eastlink.ca PRIVMSG #esoteric :What do you think of this? < 1543711043 570016 :rain1!~My_user_n@unaffiliated/rain1 PRIVMSG #esoteric :I don't know mahjong so i can't comment < 1543711062 12156 :zzo38!~zzo38@24-207-47-161.eastlink.ca PRIVMSG #esoteric :OK < 1543712032 117781 :Hello!43bd0f4b@gateway/web/freenode/ip.67.189.15.75 JOIN :#esoteric < 1543712069 793683 :Hello!43bd0f4b@gateway/web/freenode/ip.67.189.15.75 QUIT :Client Quit < 1543712512 984193 :Phantom_Hoover!~phantomho@unaffiliated/phantom-hoover QUIT :Read error: Connection reset by peer < 1543714171 381188 :AnotherTest!~turingcom@59-100-168-134.cust.static-ipl.aapt.com.au JOIN :#esoteric < 1543714425 948754 :user24!~user24@p200300C3AF1538389188699962FE6860.dip0.t-ipconnect.de QUIT :Remote host closed the connection < 1543714519 422997 :MDead!~MDude@c-73-187-225-46.hsd1.pa.comcast.net JOIN :#esoteric < 1543714559 607845 :user24!~user24@p200300C3AF1538389188699962FE6860.dip0.t-ipconnect.de JOIN :#esoteric < 1543714610 973552 :MDude!~MDude@c-73-187-225-46.hsd1.pa.comcast.net QUIT :Ping timeout: 246 seconds < 1543714832 412455 :MDead!~MDude@c-73-187-225-46.hsd1.pa.comcast.net QUIT :Ping timeout: 250 seconds < 1543715099 769535 :MDude!~MDude@c-73-187-225-46.hsd1.pa.comcast.net JOIN :#esoteric < 1543715303 240147 :sprocklem!~sprocklem@unaffiliated/sprocklem QUIT :Remote host closed the connection < 1543715410 103507 :sprocklem!~sprocklem@unaffiliated/sprocklem JOIN :#esoteric > 1543716196 991028 PRIVMSG #esoteric :14[[07Brain-Flak14]]4 10 02https://esolangs.org/w/index.php?diff=58535&oldid=54319 5* 03Ais523 5* (+355) 10/* External resources */ add BrainFlak::Symbolic > 1543716236 622549 PRIVMSG #esoteric :14[[07Brain-Flak14]]4 M10 02https://esolangs.org/w/index.php?diff=58536&oldid=58535 5* 03Ais523 5* (+14) 10/* External resources */ apparently it needs the http://; also mention the implementation language < 1543716605 239274 :doesthiswork!~Adium@131.191.115.81 JOIN :#esoteric < 1543716686 952330 :doesthiswork!~Adium@131.191.115.81 QUIT :Client Quit < 1543720050 406963 :doesthiswork!~Adium@131.191.115.81 JOIN :#esoteric < 1543720438 519136 :b_jonas!~x@catv-176-63-24-69.catv.broadband.hu QUIT :Quit: leaving < 1543720450 912178 :tromp!~tromp@ip-217-103-3-94.ip.prioritytelecom.net QUIT :Remote host closed the connection < 1543720485 249381 :tromp!~tromp@ip-217-103-3-94.ip.prioritytelecom.net JOIN :#esoteric < 1543723890 410246 :Sgeo_!~Sgeo@ool-18b98dd9.dyn.optonline.net JOIN :#esoteric < 1543724062 734078 :Sgeo!~Sgeo@ool-18b98dd9.dyn.optonline.net QUIT :Ping timeout: 250 seconds < 1543724675 202711 :Sgeo_!~Sgeo@ool-18b98dd9.dyn.optonline.net QUIT :Read error: Connection reset by peer < 1543725096 82155 :zzo38!~zzo38@24-207-47-161.eastlink.ca PRIVMSG #esoteric :One thing I thought of for SQLite that I don't know whether or ont it would improve anything is sqlite3_str_context() function, which returns a string building object and makes the result of the function to effectively be whatever is then appended to the string, if your program does not call sqlite3_str_reset() or sqlite3_str_finish() on it. < 1543725858 955211 :zzo38!~zzo38@24-207-47-161.eastlink.ca PRIVMSG #esoteric :Also, I wrote a shell script to download and compile SQLite < 1543725994 954232 :Sgeo!~Sgeo@ool-18b98dd9.dyn.optonline.net JOIN :#esoteric < 1543726727 365494 :user24!~user24@p200300C3AF1538389188699962FE6860.dip0.t-ipconnect.de QUIT :Quit: Leaving < 1543727736 242484 :arseniiv!~arseniiv@77.79.183.229.dynamic.ufanet.ru JOIN :#esoteric < 1543729209 9718 :Essadon!~Essadon@81-225-32-185-no249.tbcn.telia.com QUIT :Quit: Qutting < 1543729436 874105 :hexfive!~hexfive@50-46-223-124.evrt.wa.frontiernet.net QUIT :Quit: WeeChat 2.2 < 1543730438 495704 :nfd9001!~nfd9001@c-73-157-90-101.hsd1.wa.comcast.net JOIN :#esoteric < 1543731825 407874 :zzo38!~zzo38@24-207-47-161.eastlink.ca PRIVMSG #esoteric :SQLite does not have a upsert that causes it to become an error if the WHERE clause does not match. < 1543731867 11837 :Cale!~cale@2607:fea8:995f:fb71:5845:2e98:a3d5:b85a QUIT :Remote host closed the connection < 1543732375 977084 :xkapastel!uid17782@gateway/web/irccloud.com/x-rrshxbiympnsuwhb QUIT :Quit: Connection closed for inactivity < 1543733006 396520 :AnotherTest!~turingcom@59-100-168-134.cust.static-ipl.aapt.com.au QUIT :Ping timeout: 250 seconds < 1543733181 993893 :zzo38!~zzo38@24-207-47-161.eastlink.ca PRIVMSG #esoteric :(One idea is that after the WHERE clause of a upsert you can optionally add "ELSE ABORT", "ELSE ROLLBACK", "ELSE FAIL", or "ELSE IGNORE" (the default if none is specified, which corresponds to the current behaviour).) < 1543733622 519872 :imode!~imode@unaffiliated/imode QUIT :Ping timeout: 244 seconds < 1543734151 997657 :hexfive!~hexfive@50-46-223-124.evrt.wa.frontiernet.net JOIN :#esoteric < 1543734908 978137 :zzo38!~zzo38@24-207-47-161.eastlink.ca PRIVMSG #esoteric :Other suggestions of rule variations of mahjong I have seen include menzenron instead of menzentsumo, and another is "reverse yakitori" where you start without yakitori but if you deal into someone's hand then you do have yakitori. < 1543734961 766392 :zzo38!~zzo38@24-207-47-161.eastlink.ca PRIVMSG #esoteric :(You could also do both ways yakitori together: if you win or if you deal into someone else's hand, it can be changed; whichever one applied last is in use) < 1543735095 153696 :zzo38!~zzo38@24-207-47-161.eastlink.ca PRIVMSG #esoteric :One thing I thought of also is a variant where red dora is not affected by dora indicators, even if the indicator is four of that suit < 1543736618 980015 :Sgeo!~Sgeo@ool-18b98dd9.dyn.optonline.net QUIT :Ping timeout: 246 seconds < 1543736754 246220 :Sgeo!~Sgeo@ool-18b98dd9.dyn.optonline.net JOIN :#esoteric < 1543737603 255921 :tromp!~tromp@ip-217-103-3-94.ip.prioritytelecom.net QUIT :Remote host closed the connection < 1543737618 433434 :tromp!~tromp@ip-217-103-3-94.ip.prioritytelecom.net JOIN :#esoteric < 1543738366 513408 :doesthiswork!~Adium@131.191.115.81 QUIT :Quit: Leaving. < 1543738490 739331 :doesthiswork!~Adium@131.191.115.81 JOIN :#esoteric < 1543739442 997386 :gurmble!~grumble@freenode/staff/grumble JOIN :#esoteric < 1543739528 544326 :tromp!~tromp@ip-217-103-3-94.ip.prioritytelecom.net QUIT :Remote host closed the connection < 1543739560 819263 :tromp!~tromp@ip-217-103-3-94.ip.prioritytelecom.net JOIN :#esoteric < 1543739619 742540 :tromp!~tromp@ip-217-103-3-94.ip.prioritytelecom.net QUIT :Remote host closed the connection < 1543739621 318150 :doesthiswork!~Adium@131.191.115.81 QUIT :Quit: Leaving. < 1543739632 381329 :tromp!~tromp@ip-217-103-3-94.ip.prioritytelecom.net JOIN :#esoteric < 1543739872 964397 :oerjan!oerjan@hagbart.nvg.ntnu.no JOIN :#esoteric < 1543739951 796227 :grumble!~grumble@freenode/staff/grumble QUIT :Ping timeout: 633 seconds < 1543742435 987379 :Lord_of_Life!~Lord@unaffiliated/lord-of-life/x-0885362 QUIT :Ping timeout: 246 seconds < 1543742594 342618 :Lord_of_Life!~Lord@77.28.219.184 JOIN :#esoteric < 1543742594 536058 :Lord_of_Life!~Lord@77.28.219.184 QUIT :Changing host < 1543742594 536106 :Lord_of_Life!~Lord@unaffiliated/lord-of-life/x-0885362 JOIN :#esoteric < 1543743844 52095 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu JOIN :#esoteric < 1543744119 490279 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :`makelist bobadventureslist b_jonas < 1543744121 44996 :HackEso!~h@techne.zem.fi PRIVMSG #esoteric :makelistlist bobadventureslist: shachaf < 1543744138 775534 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :`bobadventureslist http://bobadventures.comicgenesis.com/d/20181201.html < 1543744139 312903 :HackEso!~h@techne.zem.fi PRIVMSG #esoteric :bobadventureslist http://bobadventures.comicgenesis.com/d/20181201.html: b_jonas < 1543744183 547670 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :`makelist ehlist b_jonas < 1543744184 979356 :HackEso!~h@techne.zem.fi PRIVMSG #esoteric :makelistlist ehlist: shachaf < 1543744251 702902 :shachaf!~shachaf@unaffiliated/shachaf PRIVMSG #esoteric :who put me on makelistlist < 1543744318 608327 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :shachaf: ask the mercury repo if you want to know < 1543744380 725829 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :zzo38: in sqlite, do these new window functions allow you to write a parenthisized subquery that returns the group_concat of a query but with values concatenated in a deterministic sort order given by an ORDER BY clause? < 1543744404 324146 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :just wondering < 1543745613 937310 :AnotherTest!~turingcom@59-100-168-134.cust.static-ipl.aapt.com.au JOIN :#esoteric < 1543746929 936878 :AnotherTest!~turingcom@59-100-168-134.cust.static-ipl.aapt.com.au QUIT :Ping timeout: 246 seconds < 1543747289 450845 :oerjan!oerjan@hagbart.nvg.ntnu.no QUIT :Quit: Later < 1543748461 217169 :Hooloovo0!Hooloovoo@hooloovoo.blue QUIT :Ping timeout: 260 seconds < 1543748864 389951 :AnotherTest!~turingcom@59-100-168-134.cust.static-ipl.aapt.com.au JOIN :#esoteric < 1543749306 694251 :Hoolootwo!Hooloovoo@hooloovoo.blue JOIN :#esoteric < 1543750764 383192 :AnotherTest!~turingcom@59-100-168-134.cust.static-ipl.aapt.com.au QUIT :Ping timeout: 250 seconds < 1543752141 175730 :user24!~user24@p200300C3AF07FD942C5C3BFBAC971B0D.dip0.t-ipconnect.de JOIN :#esoteric < 1543752593 709815 :Phantom_Hoover!~phantomho@unaffiliated/phantom-hoover JOIN :#esoteric < 1543753639 300687 :Essadon!~Essadon@81-225-32-185-no249.tbcn.telia.com JOIN :#esoteric < 1543754146 309490 :user24!~user24@p200300C3AF07FD942C5C3BFBAC971B0D.dip0.t-ipconnect.de QUIT :Quit: Leaving < 1543754823 241754 :hexfive!~hexfive@50-46-223-124.evrt.wa.frontiernet.net QUIT :Quit: WeeChat 2.2 < 1543756247 134690 :xkapastel!uid17782@gateway/web/irccloud.com/x-hwebmcqezxkgofgd JOIN :#esoteric < 1543756788 712369 :Phantom_Hoover!~phantomho@unaffiliated/phantom-hoover QUIT :Ping timeout: 252 seconds < 1543759191 218906 :Phantom_Hoover!~phantomho@unaffiliated/phantom-hoover JOIN :#esoteric < 1543759224 726558 :doesthiswork!~Adium@131.191.115.81 JOIN :#esoteric < 1543764464 219320 :limbo_!ar@45.63.9.236 JOIN :#esoteric < 1543764515 578056 :limbo_!ar@45.63.9.236 PRIVMSG #esoteric :Is there an explaination for the limes in the wiki logo on esolangs.org? < 1543766419 782525 :fizzie!fis@unaffiliated/fizzie PRIVMSG #esoteric :Not a real one. It's called "trilime", though. < 1543766617 955480 :fizzie!fis@unaffiliated/fizzie PRIVMSG #esoteric :https://esolangs.org/logs/2011-05-24.html#l5x 2011-05-25 21:31:34 I think the official answer is "it's just an image Graue chose as a placeholder, and people decided they liked it" < 1543768480 936262 :limbo_!ar@45.63.9.236 PRIVMSG #esoteric :ha! I've done that exact thing before, but with a public-domain image of a cactus. < 1543768488 678985 :limbo_!ar@45.63.9.236 PRIVMSG #esoteric :It's a good logo. < 1543769402 467841 :zzo38!~zzo38@24-207-47-161.eastlink.ca PRIVMSG #esoteric :b_jonas: Yes, window functions do allow you to use a deterministic sort order (unlike normal aggregate functions) < 1543770593 109382 :zzo38!~zzo38@24-207-47-161.eastlink.ca PRIVMSG #esoteric :That is OK, although I think that a proper logo should be made specific for Free Hero Mesh. < 1543770653 797555 :ais523!~ais523@unaffiliated/ais523 JOIN :#esoteric < 1543770677 271428 :ais523!~ais523@unaffiliated/ais523 PRIVMSG #esoteric :regular expressions can be implemented efficiently by compiling them into NFAs < 1543770687 559434 :ais523!~ais523@unaffiliated/ais523 PRIVMSG #esoteric :is there a similar efficient compilation technique for regular expressions + backreferencess? < 1543770708 90089 :zzo38!~zzo38@24-207-47-161.eastlink.ca PRIVMSG #esoteric :I don't know < 1543771045 921252 :ais523!~ais523@unaffiliated/ais523 PRIVMSG #esoteric :oh, it's been shown that there almost certainly isn't: https://perl.plover.com/NPC/NPC-3SAT.html < 1543771054 319408 :ais523!~ais523@unaffiliated/ais523 PRIVMSG #esoteric :3SAT in regex+backreference :-) < 1543771733 996326 :oerjan!oerjan@hagbart.nvg.ntnu.no JOIN :#esoteric < 1543772129 820594 :zzo38!~zzo38@24-207-47-161.eastlink.ca PRIVMSG #esoteric :Another thing I thought of for mahjong is to avoid rounding errors by making all hands worth 25 fu. There may be other ways to do this too though, such as not rounding at all. Since, this rounding sometimes results a hand being worth more for tsumo win than with ron win, even though it is supposed to be same. < 1543772167 907458 :zzo38!~zzo38@24-207-47-161.eastlink.ca PRIVMSG #esoteric :(Different hands are still worth different amount of han, but fixed at 25 fu.) < 1543772183 838895 :zzo38!~zzo38@24-207-47-161.eastlink.ca PRIVMSG #esoteric :Do you like mahjong? < 1543772337 427218 :int-e!~noone@int-e.eu PRIVMSG #esoteric :ais523: hmm, why 3SAT when the same code works for SAT? < 1543772356 578257 :int-e!~noone@int-e.eu PRIVMSG #esoteric :(CNF-SAT if you will) < 1543772368 371113 :ais523!~ais523@unaffiliated/ais523 PRIVMSG #esoteric :int-e: probably just a case of doing the minimum necessary amount of work < 1543772379 619413 :ais523!~ais523@unaffiliated/ais523 PRIVMSG #esoteric :you know that implementing 3SAT is sufficient, so you don't notice it works even without the 3 < 1543772416 141217 :oerjan!oerjan@hagbart.nvg.ntnu.no PRIVMSG #esoteric :as long as they're SATisfied. < 1543772458 715392 :ais523!~ais523@unaffiliated/ais523 PRIVMSG #esoteric :that's not even really a pun? SAT is an abbreviation for "satisfaction" already < 1543772479 588422 :int-e!~noone@int-e.eu PRIVMSG #esoteric :but it has unSATisfactory instances... or something like that. < 1543772513 475034 :ais523!~ais523@unaffiliated/ais523 PRIVMSG #esoteric :if you wanted a pun you'd have to use SATurate or SATchel or some similarly unrelated word < 1543772522 818155 :int-e!~noone@int-e.eu PRIVMSG #esoteric :(fwiw, "satisfiability" is the usual term) < 1543772665 999859 :fizzie!fis@unaffiliated/fizzie PRIVMSG #esoteric :As famously used in the Rolling Stones song, I can't get no satisfiability. < 1543772706 637055 :fizzie!fis@unaffiliated/fizzie PRIVMSG #esoteric :(It's about the NP-completeness of the problem.) < 1543772780 104937 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :zzo38: deterministic sort order goes most of the way, good. can you use any ordinary aggregate function for that, or do you have to write a custom window function aggregate function? is the sqlite built-in function string_concat (or whatever it's called) suitable? < 1543772788 850058 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :group_concat < 1543772917 39802 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :ais523: re backreferences, also https://laurikari.net/tre/ is a thesis project proving that implements regular expressions with capture groups efficiently, there's obviously a lot of work done with it, it implements backreferences but for that it falls back to a slower alternate implementation, < 1543772968 375419 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :which also shows that at least there's no easy way to extend the implementation to backreferences, because clearly Ville Laukari has worked a lot on the theory there. < 1543773154 949780 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :ais523: also, there's a one-line proof that factoring reduces to regexes with backreferences: https://www.perlmonks.com/?node_id=510925 https://www.perlmonks.com/?node_id=52469 < 1543773179 909656 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :that doesn't make it NP-complete, because factoring likely isn't, but still, it shows that we don't know a polynomial time implementation < 1543773183 609206 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :hm wait < 1543773185 179145 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :that doesn't wrok < 1543773189 17862 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :that's for unary < 1543773201 519498 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :we can factor unary numbers in polynomial time < 1543773279 53987 :ais523!~ais523@unaffiliated/ais523 PRIVMSG #esoteric :thinking about this a bit more, I suspect regex+backreferences is implemented by a nondeterministic LBA, rather than a nondeterminstic finite state machine < 1543773314 214133 :ais523!~ais523@unaffiliated/ais523 PRIVMSG #esoteric :there's no particular reason to expect those to be fast in general, but there may be a method of implementing them efficiently in the cases that typically arise in practice < 1543773468 622630 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :"you know that implementing 3SAT is sufficient, so you don't notice it works even without the 3" - hehe. I have a published NP-completeness proof where I reduce to SAT, not 3-SAT specifically, because the proof automatically works for any expression reduced to conjuctive normal form. < 1543773490 53206 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :It's not a very useful proof, mind you, because the problem we reduce to is not something you are generally interested in. < 1543773590 928878 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :ais523: you can probably read Ville Laukari's book and source code for how he implements them < 1543773603 466188 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :and there are a few other independent implementations < 1543773611 857049 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :a gnu one in libc in particular < 1543773613 954075 :ais523!~ais523@unaffiliated/ais523 PRIVMSG #esoteric :many mathematicians are suspicious of P-inequivalence proof claims based on 3SAT because they often would work for 2SAT as well < 1543773630 616697 :ais523!~ais523@unaffiliated/ais523 PRIVMSG #esoteric :that might be one of the simplest ways to prove that such a proof might contain an error < 1543773659 869382 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :ais523: yeah, but this isn't a P-equivalence proof. this is a proof for hardness of a decision problem. 2-SAT reduces to it too, but that's not a problem. < 1543773691 865946 :ais523!~ais523@unaffiliated/ais523 PRIVMSG #esoteric :right, with proofs in that direction you don't care if they work for 2-SAT too < 1543773736 701444 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :I made the proof because I wanted to see why we don't know an algorithm for a certain other decision problem, only I couldn't prove hardness of that particular problem rigorously. < 1543773749 854575 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :So I proved hardness of a less interesting problem. < 1543773757 551841 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :One that is NP., < 1543773814 143572 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :The actual problem we're interested in might be in P for all we know, but on the other hand it need not be in R. < 1543773831 967955 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :It's somewhere low in the arithmetic hierarchy. < 1543773858 280830 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :Probably at some greek letter plus _1 < 1543773903 878180 :ais523!~ais523@unaffiliated/ais523 PRIVMSG #esoteric :which one's R? < 1543773904 994474 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :I have some reason to suspect that it might not be in R, but I can't really conjecture it. < 1543773911 324377 :ais523!~ais523@unaffiliated/ais523 PRIVMSG #esoteric :there are so many complexity classes that I keep forgetting their names < 1543773937 875985 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :ais523: recursive decision problems, the ones for which there's a det' algorithm that always terminates and gives correct result < 1543773948 596578 :ais523!~ais523@unaffiliated/ais523 PRIVMSG #esoteric :right, just looked it up < 1543773962 743231 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :at least I think some people call it R, but the naming conventions in that field are terrible < 1543773969 855817 :ais523!~ais523@unaffiliated/ais523 PRIVMSG #esoteric :decision problems that can be solved both ways, i.e. you can write a Turing machine that halts on true, and also a Turing machine that halts on false < 1543773976 142905 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :hopefully Knuth cleans them up at least a little in volumes 4 and 5 < 1543773980 851538 :ais523!~ais523@unaffiliated/ais523 PRIVMSG #esoteric :and yes, Complexity Zoo calls it R, that's my normal source for these things < 1543773987 297718 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :yeah. < 1543773998 223432 :ais523!~ais523@unaffiliated/ais523 PRIVMSG #esoteric :(if you can write a Turing machine that halts on true, but maybe can't write one that halts on false, that's RE) < 1543774077 749252 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :Iirc in this case we do have a proof that it's at some particular level of the arithmetical hierarchy, but it's not obvious at first glance. < 1543774090 824811 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :Or maybe it is, depending on how you interpret "obvious". < 1543774153 433594 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :Stupid problem defined with multivariate calculus that you have to reduce to a discrete problem by a calculus theorem like the uniform continuity or some other compactness stuff. < 1543774289 764366 :oerjan!oerjan@hagbart.nvg.ntnu.no PRIVMSG #esoteric : that's not even really a pun? <-- i considered not capitalizing SAT, would that have helped? < 1543774361 601764 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :Calculus if full of these things by the way. The staple example is finding arbitrarily close rational bounds for the real roots of a polynomial with integer coeffs. That one does go down with an elementary calculus argument, but you wouldn't guess the algorithm unless someone tells you. < 1543774381 25737 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :And I don't even know the proof for complex roots. < 1543774429 514820 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :I think the complex version uses Gerschgorin circles, but it could need more. < 1543774471 738372 :ais523!~ais523@unaffiliated/ais523 PRIVMSG #esoteric :oerjan: a bit < 1543774501 79586 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :s/Gerschgorin circles/Geršgorin circles/ < 1543775535 863481 :imode!~imode@unaffiliated/imode JOIN :#esoteric < 1543776170 713877 :ais523!~ais523@unaffiliated/ais523 PRIVMSG #esoteric :come to think of it, I suspect you can run regexes in O(n**(2r+1)), where r is the number of backreferences used in the regex < 1543776204 876531 :ais523!~ais523@unaffiliated/ais523 PRIVMSG #esoteric :that wouldn't violate the boolean-satisfaction result above, because the more variables you have, the larger r gets < 1543776353 443749 :ais523!~ais523@unaffiliated/ais523 PRIVMSG #esoteric :the algorithm for doing so is trivial: for each backreference, iterate over the O(n**2) substrings of the input; for each of the sets of potential backreferences values produced, run the regular expression with the backreferences hardcoded, then verify that the capture groups match the hardcoded backreferences < 1543776406 996602 :ais523!~ais523@unaffiliated/ais523 PRIVMSG #esoteric :of course, a cubic implementation for one backreference isn't particularly "efficient", but polynomial time beats the exponential time that most implementations use < 1543777872 756997 :ais523!~ais523@unaffiliated/ais523 QUIT :Quit: quit < 1543778190 90383 :zzo38!~zzo38@24-207-47-161.eastlink.ca PRIVMSG #esoteric :b_jonas: All of the built-in aggregate functions can be used as window functions. If you are defining your own functions, you must define a few additional methods in order to work as a window function; such functions can also be used as ordinary aggregate functions. < 1543778743 628546 :j-bot!eldis4@firefly.nu QUIT :Ping timeout: 250 seconds > 1543780361 800069 PRIVMSG #esoteric :14[[07Ases14]]4 10 02https://esolangs.org/w/index.php?diff=58537&oldid=54842 5* 03Gamer 5* (-15) 10 > 1543780641 625204 PRIVMSG #esoteric :14[[07Symbols14]]4 10 02https://esolangs.org/w/index.php?diff=58538&oldid=39458 5* 03Gamer 5* (+51) 10 > 1543780712 618560 PRIVMSG #esoteric :14[[07SeMo-PATH14]]4 10 02https://esolangs.org/w/index.php?diff=58539&oldid=57516 5* 03Gamer 5* (+0) 10/* Computational Class */ > 1543780735 699881 PRIVMSG #esoteric :14[[07Symbols14]]4 10 02https://esolangs.org/w/index.php?diff=58540&oldid=58538 5* 03Gamer 5* (+0) 10/* Examples */ > 1543781354 394795 PRIVMSG #esoteric :14[[07A:;14]]4 M10 02https://esolangs.org/w/index.php?diff=58541&oldid=46643 5* 03Gamer 5* (+4) 10/* Commands */ > 1543781696 504291 PRIVMSG #esoteric :14[[07A:;14]]4 10 02https://esolangs.org/w/index.php?diff=58542&oldid=58541 5* 03Gamer 5* (+32) 10/* Example programs */ > 1543781817 322036 PRIVMSG #esoteric :14[[07A:;14]]4 10 02https://esolangs.org/w/index.php?diff=58543&oldid=58542 5* 03Gamer 5* (+6) 10/* Example programs */ > 1543781852 894126 PRIVMSG #esoteric :14[[07A:;14]]4 10 02https://esolangs.org/w/index.php?diff=58544&oldid=58543 5* 03Gamer 5* (+2) 10/* Example programs */ > 1543781908 939965 PRIVMSG #esoteric :14[[07A:;14]]4 10 02https://esolangs.org/w/index.php?diff=58545&oldid=58544 5* 03Gamer 5* (+3) 10/* Example programs */ < 1543783959 897331 :oerjan!oerjan@hagbart.nvg.ntnu.no QUIT :Quit: Nite < 1543784845 381692 :AnotherTest!~turingcom@59-100-168-134.cust.static-ipl.aapt.com.au JOIN :#esoteric < 1543785623 44204 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :zzo38: I know they can all be used in window function expressions. I'm asking if they are still guaranteed to be called with rows in a deterministic order. < 1543785626 410161 :Lord_of_Life_!~Lord@79.125.199.58 JOIN :#esoteric < 1543785691 1123 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :ais523: lol. that definitely isn't a practical algorithm. I think you can do better, and libtre almost certainly doesn't do that. < 1543785753 401623 :Lord_of_Life!~Lord@unaffiliated/lord-of-life/x-0885362 QUIT :Ping timeout: 245 seconds < 1543785753 703304 :Lord_of_Life_!~Lord@79.125.199.58 NICK :Lord_of_Life < 1543785754 84257 :Lord_of_Life!~Lord@79.125.199.58 QUIT :Changing host < 1543785754 84306 :Lord_of_Life!~Lord@unaffiliated/lord-of-life/x-0885362 JOIN :#esoteric < 1543785769 10092 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :Hmm... maybe you're right. For some devious backreference expressions, like /(.*)\1/, that might actually be efficient. < 1543785795 959628 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :No no. I think there's a linear time algorithm for finding /(.*)\1/ longest match. < 1543785832 207604 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :I react fast, eh? < 1543787712 616465 :moei!~moei@softbank221078042071.bbtec.net QUIT :Quit: Leaving... < 1543787918 382400 :AnotherTest!~turingcom@59-100-168-134.cust.static-ipl.aapt.com.au QUIT :Ping timeout: 250 seconds < 1543789019 998768 :Lord_of_Life_!~Lord@79.125.199.58 JOIN :#esoteric < 1543789050 416930 :Lord_of_Life!~Lord@unaffiliated/lord-of-life/x-0885362 QUIT :Ping timeout: 244 seconds < 1543789056 602754 :Lord_of_Life_!~Lord@79.125.199.58 NICK :Lord_of_Life < 1543789078 756308 :Lord_of_Life!~Lord@79.125.199.58 QUIT :Changing host < 1543789078 756350 :Lord_of_Life!~Lord@unaffiliated/lord-of-life/x-0885362 JOIN :#esoteric < 1543789525 227876 :arseniiv!~arseniiv@77.79.183.229.dynamic.ufanet.ru QUIT :Ping timeout: 246 seconds < 1543789669 980668 :Lord_of_Life!~Lord@unaffiliated/lord-of-life/x-0885362 QUIT :Quit: Laa shay'a waqi'un moutlaq bale kouloun moumkine < 1543789700 499460 :int-e!~noone@int-e.eu PRIVMSG #esoteric :b_jonas: now try the factoring thing: (..*)\1\1* < 1543789726 925508 :int-e!~noone@int-e.eu PRIVMSG #esoteric :oops, that should have one more . < 1543789782 478382 :int-e!~noone@int-e.eu PRIVMSG #esoteric :(hmm. I guess I'm counting capturing groups) < 1543789859 761437 :Lord_of_Life!~Lord@79.125.199.58 JOIN :#esoteric < 1543789859 946718 :Lord_of_Life!~Lord@79.125.199.58 QUIT :Changing host < 1543789859 946764 :Lord_of_Life!~Lord@unaffiliated/lord-of-life/x-0885362 JOIN :#esoteric < 1543791049 777170 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :int-e: see above. that's for unary numbers, and we can factor unary numbers in sublinear times, even sublinear for a fixed regex, which is pretty rare for a regex that is anchored to match the whole string (it's commonplace for a regex like /^a/ < 1543791053 796499 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :) < 1543791141 743136 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :we have series of regexen (strings as regexes without anchors actually) such that we can match any in linear time, but the constant factor goes to zero as a limit < 1543791271 815822 :tromp!~tromp@ip-217-103-3-94.ip.prioritytelecom.net QUIT :Remote host closed the connection < 1543791286 826159 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :Even I know how to implement factoring unary in O(n**(1/4)) time because I've implemented the corresponding algorithm for integers with arithmetic available. < 1543791303 402488 :b_jonas!~x@catv-176-63-24-97.catv.broadband.hu PRIVMSG #esoteric :well, O(n**(1/4 + epsilon)) but still < 1543791303 821541 :tromp!~tromp@ip-217-103-3-94.ip.prioritytelecom.net JOIN :#esoteric < 1543791816 481687 :tromp!~tromp@ip-217-103-3-94.ip.prioritytelecom.net QUIT :Remote host closed the connection < 1543791832 412639 :tromp!~tromp@ip-217-103-3-94.ip.prioritytelecom.net JOIN :#esoteric < 1543793352 821475 :imode!~imode@unaffiliated/imode QUIT :Ping timeout: 250 seconds < 1543794215 99644 :Phantom_Hoover!~phantomho@unaffiliated/phantom-hoover QUIT :Read error: Connection reset by peer > 1543794470 359403 PRIVMSG #esoteric :14[[07HARSH14]]4 M10 02https://esolangs.org/w/index.php?diff=58546&oldid=58529 5* 03ShareMan 5* (-149) 10/* Language Overview */ Deleted interpreter info from language section, and fixed some grammar > 1543794632 388664 PRIVMSG #esoteric :14[[07HARSH14]]4 M10 02https://esolangs.org/w/index.php?diff=58547&oldid=58546 5* 03ShareMan 5* (+296) 10/* Interpreter Help */ Added info about interpreter operation < 1543794730 772634 :Lord_of_Life!~Lord@unaffiliated/lord-of-life/x-0885362 QUIT :Ping timeout: 250 seconds < 1543794784 388505 :imode!~imode@unaffiliated/imode JOIN :#esoteric < 1543794868 762647 :Lord_of_Life!~Lord@77.29.186.118 JOIN :#esoteric < 1543794868 947586 :Lord_of_Life!~Lord@77.29.186.118 QUIT :Changing host < 1543794868 947629 :Lord_of_Life!~Lord@unaffiliated/lord-of-life/x-0885362 JOIN :#esoteric > 1543794878 77191 PRIVMSG #esoteric :14[[07HARSH14]]4 M10 02https://esolangs.org/w/index.php?diff=58548&oldid=58547 5* 03ShareMan 5* (+234) 10/* Examples */ Added new example programs > 1543794924 824465 PRIVMSG #esoteric :14[[07HARSH14]]4 M10 02https://esolangs.org/w/index.php?diff=58549&oldid=58548 5* 03ShareMan 5* (+2) 10/* Interpreter Help */ Fixed formatting < 1543795060 655531 :tromp!~tromp@ip-217-103-3-94.ip.prioritytelecom.net QUIT :Remote host closed the connection < 1543795101 965101 :tromp!~tromp@ip-217-103-3-94.ip.prioritytelecom.net JOIN :#esoteric