00:17:50 -!- idris-bot has quit (Ping timeout: 268 seconds). 00:18:08 -!- Melvar has quit (Ping timeout: 255 seconds). 00:30:53 -!- Melvar has joined. 00:58:58 -!- mich181189 has joined. 01:46:22 -!- oerjan has joined. 02:39:27 -!- variable has quit (Ping timeout: 240 seconds). 02:41:27 -!- arseniiv has quit (Ping timeout: 256 seconds). 02:44:28 is there a canonical way to compare two strings non-destructively in thue? 02:47:05 I'm thinking of having a cursor walk through a segmented list of key/value pairs. can't think of anything other than "leave a marker, take a character, leave character in temporary location, take character from pattern, leave marker, move to two strings, check for any invalid pairs." 02:52:20 -!- variable has joined. 02:57:36 -!- trout has joined. 03:00:41 -!- variable has quit (Ping timeout: 276 seconds). 03:06:20 -!- trout has quit (Ping timeout: 260 seconds). 03:07:55 -!- variable has joined. 03:19:20 -!- Guest1_ has joined. 03:21:35 -!- variable has quit (Ping timeout: 240 seconds). 04:05:38 -!- Guest1_ has quit (Quit: Textual IRC Client: www.textualapp.com). 04:10:12 -!- Hoolootwo has joined. 04:11:01 -!- tromp has quit (Remote host closed the connection). 04:13:24 -!- variable has joined. 04:14:21 -!- Hoolootwo has changed nick to hooloovo0. 04:21:36 -!- oerjan has quit (Quit: Nite). 04:31:13 -!- xkapastel has quit (Quit: Connection closed for inactivity). 04:45:22 -!- trout has joined. 04:48:42 -!- variable has quit (Ping timeout: 260 seconds). 05:19:36 -!- variable has joined. 05:21:51 -!- trout has quit (Ping timeout: 240 seconds). 05:51:17 -!- trout has joined. 05:54:12 -!- variable has quit (Ping timeout: 260 seconds). 05:57:08 -!- variable has joined. 05:57:18 -!- trout has quit (Ping timeout: 260 seconds). 07:18:10 -!- doesthiswork has quit (Quit: Leaving.). 07:41:19 -!- tromp has joined. 08:26:38 [[English Binerdy]] https://esolangs.org/w/index.php?diff=55887&oldid=55801 * Plokmijnuhby * (+564) 08:42:22 -!- Naergon has joined. 10:02:16 [[Hamiltonian]] N https://esolangs.org/w/index.php?oldid=55888 * Plokmijnuhby * (+2072) Created page with "Hamiltonian is an esolang based on the travelling salesman problem. Finding the result of a Hamiltonian computation is an NP-complete problem. == Syntax == Any given program..." 10:04:22 [[Hamiltonian]] M https://esolangs.org/w/index.php?diff=55889&oldid=55888 * Plokmijnuhby * (-17) 12:10:42 -!- doesthiswork has joined. 12:11:45 -!- SopaXorzTaker has joined. 12:59:20 -!- xkapastel has joined. 13:06:35 -!- MDude has quit (Ping timeout: 260 seconds). 13:57:32 -!- arseniiv has joined. 14:17:05 -!- Naergon has quit (Ping timeout: 248 seconds). 15:55:39 -!- erkin has joined. 16:37:48 -!- MDude has joined. 16:38:31 -!- laerling has joined. 17:33:52 <\oren\> we asked for a new coffee machine and corporate sent us this abomination of Silicon Valley hubris 17:33:57 <\oren\> https://www.marsdrinks.ca/solutions/machines/flavia-creation-500/ 17:34:52 sweet jesus. 18:24:20 -!- Cale has quit (Ping timeout: 276 seconds). 18:36:03 -!- Cale has joined. 18:38:47 -!- SopaXorzTaker has quit (Remote host closed the connection). 19:07:20 [[R U DS]] M https://esolangs.org/w/index.php?diff=55890&oldid=55881 * Zackmowrer * (+2) 19:32:17 -!- erkin has quit (Quit: Ouch! Got SIGIRL, dying...). 19:34:38 -!- erkin has joined. 19:44:39 -!- erkin has quit (Remote host closed the connection). 20:01:36 -!- AnotherTest has joined. 20:10:30 anybody have any resources for compiling down to thue or thue-like languages? 20:12:29 -!- moei has quit (Quit: Leaving...). 20:14:19 it seems pretty difficult from an imperative perspective, because you'd most likely squash down to an instruction stream + loop delimiters, ala the brainfuck-in-thue interpreter. 20:15:15 rather than simulate RAM, because from what I can see, simulating RAM implies a pretty large overhead. 20:39:45 -!- Phantom_Hoover has joined. 21:07:37 imode-desktop: Heh, what do you think of rule 110 as a string rewriting system: http://paste.debian.net/1029965/ (the inspiration here is that Thue presents an opportunity for parallelism) 21:09:57 (This is supposed to simulate the 1001111 glider against the 00010011011111 background pattern as described in https://en.wikipedia.org/wiki/Rule_110 ...) 21:11:17 But I'm not sure that it's correct... my main focus was on the 32 rules for the 110 rule itself. 21:11:41 oh the parallelism opportunities are already very clear to me. rule 110 is hilarious. 21:13:37 recently I wanted to build a "stateful sort" in thue, whereby you'd continually spawn sets of workers and managers to both A: sort the string as they marched along, and B: competed for space while checking if the string is sorted. 21:14:38 the algorithm was "sort the string by the pattern `ba -> ab`, then sort the string by the pattern `ab -> ba`, then halt." 21:14:47 -!- AnotherTest has quit (Ping timeout: 245 seconds). 21:16:33 https://ptpb.pw/DHPW/text the ruleset in particular, https://ptpb.pw/Bf1F/python and the corresponding interpreter. 21:18:07 it's pretty neat that you can do something like this. I'm still working on speeding it up by not having to spawn workers, but propagating the state by interleaving it between individual symbols on the string. you'd face a storage overhead but it's worth it. 21:20:11 (I know my interpreter isn't strictly thue, but I needed non-delimited comments and a sane substitution syntax.) 21:29:47 -!- erkin has joined. 21:51:51 -!- laerling has quit (Quit: Leaving). 22:05:44 -!- boily has joined. 22:49:33 I wonder how you'd optimize a thue interpreter.. 22:51:00 -!- erkin has quit (Quit: Ouch! Got SIGIRL, dying...). 23:06:11 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 23:37:11 -!- arseniiv has quit (Ping timeout: 256 seconds).