00:10:10 no, my hon. and learned friend fungot, I expect you to die 00:10:10 b_jonas: it is on that that the government have, the procedure is the same. 00:18:37 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 00:19:24 -!- Rudolph has joined. 00:35:29 -!- Rudolph has quit (Ping timeout: 250 seconds). 00:44:11 -!- tromp has quit (Remote host closed the connection). 00:44:50 -!- tromp has joined. 00:45:43 -!- b_jonas has quit (Quit: leaving). 01:06:59 -!- Rudolph has joined. 01:24:23 Now I implemented the + and - requests of Netsubscribe at least, although it isn't so useful because notifications are not yet implemented. Do you like this? 01:29:36 -!- Rudolph has quit (Ping timeout: 250 seconds). 01:35:30 -!- Essadon has quit (Quit: Qutting). 01:57:48 -!- Rudolph has joined. 02:04:52 -!- user24 has joined. 02:06:45 -!- user24 has quit (Client Quit). 02:24:27 -!- Rudolph has quit (Ping timeout: 240 seconds). 02:35:07 -!- sprocklem has quit (Quit: sprocklem). 02:35:54 -!- sprocklem has joined. 02:41:19 -!- Rudolph has joined. 02:51:30 -!- sprocklem has quit (Quit: brb). 02:52:20 -!- sprocklem has joined. 02:53:59 -!- nfd9001 has joined. 03:10:15 I'm totally sold on combinators. Curry's work, Backus' FP, Iverson's APL and J.. they're all tied together by algebra, each language forming an algebra of programs. 03:11:24 Does quantum entanglement that joins stuff being extending backward in time from the point of view of both experimenters? To me it would seem like that, rather than affecting the other one "instantly", like they say it is. 03:12:01 https://www.quora.com/Does-Bohmian-mechanics-explain-entanglement 03:17:49 It looks like difference to what I mentioned. 03:26:56 -!- S_Gautam has quit (Quit: Connection closed for inactivity). 03:29:41 -!- Lord_of_Life has quit (Ping timeout: 250 seconds). 03:30:47 -!- Lord_of_Life has joined. 04:17:21 -!- hexfive has quit (Quit: WeeChat 2.2). 05:10:01 -!- doesthiswork has quit (Quit: Leaving.). 05:25:27 -!- Sgeo has joined. 05:26:43 -!- FreeFull has quit (Ping timeout: 245 seconds). 05:27:04 -!- Sgeo_ has quit (Ping timeout: 250 seconds). 05:33:55 -!- doesthiswork has joined. 06:11:16 -!- Rudolph has quit (Ping timeout: 250 seconds). 06:37:36 -!- Lymia has quit (Quit: Hugs~ <3). 06:39:47 -!- Lymia has joined. 06:47:37 -!- Rudolph has joined. 07:19:32 -!- Rudolph has quit (Ping timeout: 268 seconds). 08:07:58 -!- tromp has quit (Remote host closed the connection). 08:08:13 -!- tromp has joined. 08:12:00 -!- Rudolph has joined. 08:39:30 -!- amokavarshan has joined. 08:39:56 hi 08:40:10 need help in a program 08:42:35 need help in a program 08:59:47 What help in what program? 09:01:11 zzo38, i solved it before you asked but anyway thanks for asking 09:02:48 zzo38, are you there 09:03:10 Am I where? 09:05:28 http://dpaste.com/1P7FNJT ; why a space is need before %c in scanf to get the program work 09:06:59 Perhaps because of a line break after each line that you have to consume. 09:07:34 oh 09:14:14 -!- imode has quit (Ping timeout: 268 seconds). 09:14:22 zzo38, 09:35:16 -!- AnotherTest has joined. 09:46:18 -!- arseniiv has joined. 09:47:07 [[Analog Synth]] N https://esolangs.org/w/index.php?oldid=58752 * Salpynx * (+4671) information density joke language with multi-interpreter 09:48:18 [[Analog Synth]] M https://esolangs.org/w/index.php?diff=58753&oldid=58752 * Salpynx * (-5) 09:53:02 -!- amokavarshan has quit (Quit: Leaving). 10:01:15 -!- tromp has quit (Remote host closed the connection). 10:01:51 -!- tromp has joined. 10:13:15 -!- tromp has quit (Remote host closed the connection). 10:13:30 -!- tromp has joined. 10:29:49 -!- Rudolph has quit (Ping timeout: 246 seconds). 10:48:27 -!- Rudolph has joined. 10:53:22 -!- Rudolph has quit (Ping timeout: 250 seconds). 11:25:01 -!- Rudolph has joined. 11:57:10 -!- Rudolph has quit (Ping timeout: 272 seconds). 12:05:30 [[Talk:The Waterfall Model]] https://esolangs.org/w/index.php?diff=58754&oldid=58751 * Chris Pressey * (+1036) /* Waterclocks over the reals */ 13:02:05 -!- Rudolph has joined. 14:27:18 -!- Essadon has joined. 14:38:51 -!- S_Gautam has joined. 14:50:11 -!- sleepnap has joined. 15:03:52 -!- Rudolph has quit (Quit: WeeChat 2.2). 15:31:01 -!- Lord_of_Life has quit (Ping timeout: 268 seconds). 15:31:12 -!- Lord_of_Life has joined. 16:58:32 -!- S_Gautam has quit (Quit: Connection closed for inactivity). 19:43:29 -!- b_jonas has joined. 19:44:18 `ehlist http://eheroes.smackjeeves.com/comics/2711313/look-out-below/ 19:44:19 ehlist http://eheroes.smackjeeves.com/comics/2711313/look-out-below/: b_jonas 19:52:50 -!- FreeFull has joined. 20:11:43 https://i.redd.it/nx4xu1y9r0521.jpg 20:31:18 -!- imode has joined. 20:42:31 are there any resources out there on building cyclic graphs from collections of trees? 20:44:09 haskell might have something to say about that. 21:02:47 -!- salpynx has joined. 21:05:29 Based on the recent Waterfall Model language activity, I have thought up a "serious" and hopefully interesting variant stemming from the silly title variation "Your Mince may Pong" (punning on "Your Pong May Minsky", clever n-dimensional bouncing ball equivalent). 21:05:46 It is a biological E-Coli style bacterial simulation of the Waterfall mechanics. Instead of Waterclocks, there are n bacterial strains that have a maximum population density in their environment. Once the maximum density is reached, a strain's growth rate halts due to passive competitive pressures. 21:06:01 The population becomes stressed, and this triggers a specialized antibiotic metabolites ("interference competition mode") which is a cocktail of antibiotic substances that different strains have differing weaknesses to. The populations of all strains reduce by differing amounts, and then further growth can occur. 21:06:43 I believe this is equivalent to the Waterfall Model mechanics. 21:07:32 how would one go about generating a maze with / and \ walls such that there is a start point at the top and an end at the bottom, no points are disconnected from the start and end points, and the route from the start to the end is not obvious 21:10:41 Initially I conceived the "interference competition mode" to reduce the populations being triggered suddenly, but I wonder if the antibiotic substances could be released continuously and change growth rates - would that be equivalent, or does the "water top up" need to be sudden and discreet? 21:17:48 oren: using whatever algorithm http://www.mazegenerator.net/ uses for a square maze, and rotate by 45°? Maybe I'm missing something, but the angled walls don't change the problem. You'll just end up with a diamond shaped maze, which I think is what you are specifying? 21:29:58 neat resource: http://www.astrolog.org/labyrnth/algrithm.htm#perfect via wiki page on " Maze generation algorithm" 21:34:21 -!- FreeFull has quit. 22:04:28 -!- FreeFull has joined. 22:19:31 -!- salpynx has quit (Quit: Page closed). 22:27:52 -!- sprocklem has quit (Quit: brb). 22:30:56 -!- sprocklem has joined. 22:34:03 -!- FreeFull has quit (Ping timeout: 268 seconds). 22:36:15 wait what? 22:36:22 `bobadventureslist http://bobadventures.comicgenesis.com/ 22:36:23 bobadventureslist http://bobadventures.comicgenesis.com/: b_jonas 22:36:39 no argh 22:36:47 `bobadventureslist http://bobadventures.comicgenesis.com/d/20181218.html 22:36:47 darn 22:36:47 bobadventureslist http://bobadventures.comicgenesis.com/d/20181218.html: b_jonas 22:37:52 imode: building cyclic graphs from collections of trees => um, I think there was some crazy conjecture, with special cases proved, about getting complete digraphs as disjoint unions of several trees or stuff like that 22:37:58 -!- AnotherTest has quit (Ping timeout: 250 seconds). 22:38:05 maybe it wasn't just tournaments, I'm not sure 22:38:14 but definitely involving disjoint union of trees 22:38:46 imode: is that the kind of thing you're looking for? 22:39:51 yes! 22:40:08 I'll log that down and look it up, thank you! :D 22:40:08 salpynx: but there's already an esoteric language with "Your Minsky" in its name. do you really want another one? 22:40:31 -!- FreeFull has joined. 22:41:05 imode: hmm, I'll have to look up the exact reference too then. I think I heared it on a conference, so I'll have to look it up in a conference volume that I have left in my parens' house. 22:41:24 -!- sleepnap has left. 22:41:45 but then you'll probably find some references to such things elsewhere 22:42:37 anything works, at your leisure of course. :) 22:42:40 do you think the Bobadventures guy will be able to keep a regular update schedule for this short adventure by the way? 22:43:17 imode: yeah, I'll have to write a note to myself, I'll be in their apartment in a few days but I'll probably forget to grab that conference volume. 22:43:39 that's alright, you've at least provided me some search terms. :) 22:44:17 that reminds me, I shouldn't forget to take the exercise ball pump to the office tomorrow. I'll put it in my backpack now. 22:46:23 salpynx: that's the random diagonals kind of maze. there's a more interesting maze that I have ported to an IRC-based interpreter that would print more than one line at some point. 22:47:36 https://www.perlmonks.com/?node_id=764894 this maze generator. I was thinking about that, um, recently, because if I ever make that esolang that I wanted, then I should port this maze generator to it as the main example program 22:48:10 it's a nice full example, because it requires you to do nontrivial random accesses to an array, and nontrivial arithmetic 22:48:21 well, multiple arrays, but still 22:48:52 I mean Consumer society by "that esolang that I wanted" 22:49:28 -!- ais523 has joined. 22:50:11 oh hello ais523 22:51:53 hi 22:53:48 apparently salpynx mentioned something with Your ... Minsky, but I don't really understand what it has to do with Minsky 22:54:21 b_jonas: it's a change-of-viewpoint of The Waterfall Model 22:57:38 ah I see! so he wants a reinterpretation of Waterfall Model 22:57:43 makes sense 22:59:14 as in, a reflavoring of the same abstract model 23:06:01 -!- tromp has quit. 23:11:09 -!- salpynx has joined. 23:14:22 b_jonas: Yes, I have been following the Waterfall Model chat on the talk page of https://esolangs.org/wiki/Your_Pong_May_Minsky and playing with the Waterfall Model interactive tutorial recently, and wrote an interpreter for it, so I am steeped in Waterfall Model ATM. Forgot that maybe not everyone is following the same discussions :) 23:17:05 ais523: Thank you for that language, it is really neat and I think you have hit your goal of making it easy to implement in awkward langauges. I had been struggling for a while to proove universality of my language ΙΧΘΥΣ, and was able to come up with a conversion relatively easily 23:17:56 the more I study The Waterall Model the more fundamental it seems, somehow 23:18:04 The interactive tutorial + documentation is very nice too, and fun to play with. 23:18:08 I've been using it for TCness proofs too 23:18:32 I need to write more of the tutorial at some point; I got held up by my own lack of skill (I can't teach something I don't know myself) 23:18:49 lol "Improvement: Move the left context to be displayed on the left" 23:19:30 "current behaviour: left context is displayed ot the right" 23:19:39 ais523: how does it seem fundamental? 23:20:21 imode: most systems at a similar level of abstraction compile into it easily 23:20:31 that is, low-powered counter machines 23:20:46 I had been working on (again starting from a silly joke) analog computing versions of esolangs, and had a version of `+` and '+-` outputting voltages to an oscilloscope... I had a capacitor discharging and realised if I could trigger tops ups to other caps, that would be Waterfall Model 23:21:32 I need to find some existing oscillator circuits to borrow some ideas from, but I think it should be possible, and that give you the continuous model 23:22:42 ais523: what's the semantics of the model? I can't parse the wiki page so well right now. 23:23:14 imode: you have X counters, they all decrease at a steady rate (discretely or continuously), when one of them hits 0 then every counter is increased by a specified amount depending on which counter hit 0 23:23:25 imode: following the external resource link gives a good description 23:23:38 so a program could say, say, "when counter 1 hits 0, increase it by 3, and counter 2 by 5" 23:24:22 wow, that solves the problem of checking a particular counter for zero. you have it built-in.. 23:24:41 salpynx: "wasy to implement in awkward languages" => but you don't mean that you'll actually want to implement bignum precision in bacterial colonies, that's just flavor, right? 23:24:46 so 1 -> 1:3, 2:5, etc. 23:25:02 right 23:25:19 programs are typically written as a matrix, the cell at (x, y) shows how much counter y increases when counter x zeroes 23:25:33 that is.. wild. 23:25:58 (there's also a column 0 showing the initial values, and a row 0 to make it easier to parse) 23:26:19 ais523: right, low-powered counter machines with no size limit on their integers. it won't help much with machines where I want to manipulate symbols and don't want an exponential slowdown 23:26:42 I still find it difficult to process how it is Turing complete, but it does seem surprisingly powerful. 23:26:57 b_jonas: have you seen https://esolangs.org/wiki/Simpler_Subskin? 23:27:03 for machines where you have to use counters, and don't mind one level of exponential slowdown, there I can understand that you want to use it for turing completeness proof 23:27:14 iirc any 2 counter machine is TC if you allow unbounded space for integers. 23:27:19 or really natural numbers. 23:27:20 ais523: by the way, have you given some reasonable upper bound for how many clocks you need for TC? 23:27:28 imode: not quite, you need to handle the control flow somehow 23:27:37 2 counters + arbitrary control flow is TC, the control flow can sometimes be complex though 23:27:38 with integer numbers only in the program 23:27:39 ais523: true, but that can be a single operation. 23:27:57 b_jonas: I've spent weeks trying to figure it out, including recently 23:28:07 regarding my biological simulation idea, I'd love it if there were bacteria that behave that way (I'm no biologist, but I tried to use real bacterial concepts), that would make a possibly real biological computer 23:28:11 my current guess is somewhere in the 9/10 range 23:28:22 imode: for Minsky machines, 2 counter is enough for double-exponential slowdown, 3 counters for single-exponential slowdown turing completeness, and you don't get better than that with a larger number of counters 23:28:31 well, at least not better than exponential 23:28:38 but Waterfall model is much more restricted 23:28:44 -!- ais523 has quit (Quit: sorry for my connection). 23:28:50 I'll stick with combinatory logic lol. 23:28:57 -!- ais523 has joined. 23:29:04 9..10 range? I'll be interested to see that 23:29:27 yeah, 9/10 if you don't mind using the slash there... I'd prefer the slash only for datetime ranges 23:29:31 it's confusing with numbers 23:29:53 for some reason I was thinking about it as "9 or 10" not "9 to 10" 23:30:02 oh 23:30:04 still 23:30:23 -!- sprocklem has quit (Quit: sprocklem). 23:30:36 b_jonas: Well, I don't think I'll be playing with real bacteria just yet, but I found this pre-existing tool https://github.com/HaseloffLab/CellModeller that does most of the hard simulation work for cell behaviour. I only thought this up yesterday, so give me some time :) 23:30:43 anyway, 10 counters would be amazing, I'll be interested to hear about what you getr 23:30:50 -!- sprocklem has joined. 23:30:56 hmm wait 23:31:00 computing is beautiful. 23:31:28 ais523: do you mean that you're hoping for a TC *proof* for something like 10 counters, or only that the truth is around 10 counters but we can't hope to prove that? 23:31:35 -!- S_Gautam has joined. 23:31:37 the latter is more believable to me 23:31:48 b_jonas: explicit construction 23:32:02 I think the truth is probably actually in the 5 to 7 range but that I don't expect to optimise things that far 23:32:31 ais523: I think you have hit on something pretty special with it, I'm kinda new to esolangs but it jumped out as something pretty accessible yet bizarrely powerful 23:33:09 -!- sprocklem has quit (Client Quit). 23:33:25 -!- sprocklem has joined. 23:33:27 ais523: good 23:33:33 I'll definitely be interested 23:33:49 are the logs down? I've been trying to figure out what if anything I missed during connection trouble, but I can't load the logs either 23:34:05 logs were up today, let me check 23:34:26 and yes, examining a small but powerful model is interesting, that's also why I should document Consumer Society 23:34:52 while it's much more powerful and harder to implement than anything using counter machines, it still seems minimalistic but powerful in some sense 23:36:00 in that it can efficiently simulate not only turing machines, but also turing machines with only polynomial slowdown, and more, I think I can prove it can simulate even pointer machines or arbitrary indexed RAM accesses with slowdown of a factor that's a polynomial of the length of address accessed 23:36:24 but it's minimalistic in the sense that it has a version that has as few features as you can hope, if you remove anything from that version, it will no longer be able to do anything 23:36:46 and that version has very few primitves 23:37:15 basically just two, one for reading and one for writing, but obviously you can count these things differently 23:37:29 -!- oerjan has joined. 23:38:10 cheers. o/ 23:38:11 -!- imode has quit (Quit: WeeChat 2.3). 23:38:41 although... hmm, I wonder 23:38:46 eep 23:39:03 `quote 23:39:03 1148) Note to self: if a recipe says "serves 4", I am not physically able to eat it all in one sitting 23:39:49 ais523: yeah, logs on https://esolangs.org/logs seem to be down now 23:40:05 I get an 504 Gateway Time-out 23:40:28 . o O ( why is b_jonas pinging ais523 instead of me ) 23:40:52 i guess he may have been talking about the same thing. _i may never know_ 23:41:36 oerjan: ais523 asked if the logs were down 23:41:59 oerjan: you would know that if you could access the logs 23:41:59 i guess i didn't ask, i just tested all the other fizzie bots 23:42:07 indeed 23:42:21 `echo Iv+WJ5un3/uqrCP9LkxjNgD7dWj3kVUhlPoeBtr8MUc= 23:42:22 Iv+WJ5un3/uqrCP9LkxjNgD7dWj3kVUhlPoeBtr8MUc= 23:42:26 that bot is up 23:42:38 [ 'Iv+WJ5un3/uqrCP9LkxjNgD7dWj3kVUhlPoeBtr8MUc=' 23:42:38 b_jonas: Iv+WJ5un3/uqrCP9LkxjNgD7dWj3kVUhlPoeBtr8MUc= 23:42:42 hm tunes is no longer in my url history 23:42:42 that bot is also up 23:43:07 I think the other logs don't have fresh input these days 23:43:08 oerjan: http://tunes.org/~nef/logs/esoteric/18.12.18 23:43:10 they're only older logs 23:43:17 clog is still here, and still logging, although it loses connection sometimes 23:43:29 wtf 23:43:37 hi clog btw 23:43:38 yeah, you're right, that is running 23:44:00 ais523: i've been gone for more days than that. 23:44:13 oerjan: you can get to the others via URL editing 23:44:17 or just removing the date at the end for a list 23:45:49 hmm, there's actually an even more serious restriction of Consumer society possible that I believe is still TC, and I'll have to think about whether that one also allows to simulate RAM machines efficiently 23:46:07 I have been thinking of other similar restrictions, but not that particular one, so I'm not sure if it works 23:46:13 ais523: i started with the latter 23:46:21 I'll have to add that to my TODO 23:46:28 b_jonas: did you miss my comment earlier about Simpler Subskin, btw? 23:46:46 ais523: no, but I haven't read what that does yet 23:46:56 ah, that's very new 23:47:02 last week 23:47:10 it was designed "for" you, in the sense that it is (or should be) a counter machine with only a linear slowdown over Turing machines (i.e. if a Turing machine runs a program in time t, Simpler Subskin takes time kt for some k) 23:49:00 ais523: oh, I know something similar to that. I have an OISC where the basic operation is a double indirection subtract, and program and data is in the same array, so the loop is like m[2] = (m[m[m[0]++]]-=m[m[m[0]++]]) < 0; or something close to that 23:49:07 it's likely you can compile it into The Waterfall Model in a way that optimising implementations can decompile, too; I'd expect to see the results running with a log-slowdown compared to Turing machines on ratiofall (you'd need a "sparse bigint" to get log-log slowdown, which I think is the best you can do on a practical computer) 23:49:42 so m[0] is the IP and m[2] is the comparison indicator that has a value of 0 or 1, and you can use that to conditional jump in the next statement by using a 0 address 23:50:20 b_jonas: right, there are lots of OISCs 23:50:25 the same thing works without the double indirection, like m[2] = (m[m[0]++]-=m[m[0]++]) < 0; but then you need self-modifying code 23:50:31 I'm not even sure which version I had, let me check 23:50:32 this was my aim to go as simple as possible (i.e. no memory-mapping, no indirection) 23:51:19 the only problem is that I only wrote one program for it, and that one program sucks because it depends on 32-bit word size, so subtraction is modulo 2**32, and that dependence is totally unncessary, I should have written the program better 23:51:44 let me check what rule I used exactly, it might not be exactly the same, just something simlar 23:52:24 it's possible that I had the souce before the destination in the memory, not after 23:55:25 -!- salpynx has quit (Ping timeout: 256 seconds). 23:56:09 the loop says, in perl for(my@a=(0,42,0,0,...);$a[1];$a[3]&&print chr$a[4]){$a[2]=-(($a[$a[$a[1]++]]-=$a[$a[$a[1]++]])<0)} 23:56:46 that $a[$a[$a[1]++]] bit is pretty reminiscent of Three Star Programmer 23:56:49 but the brackets aren't quite in the right place 23:57:18 so actually IP is in cell 1, and the comparison indicator has values 0 and -1, probably because there's a subtraction involved somewhere 23:57:21 hmm 23:57:31 and the comparison indicator is in cell 2 23:57:49 darn, don't I have the assembler sourcecode for this program somewhere? let me check my archives 23:57:55 https://www.perlmonks.com/?node_id=483243 by the way 23:58:00 I want to figure out how conditionals work 23:58:50 I wrote "ctx->ctx->ctx" the other day. 23:58:57 It's just such a good name for any sort of context.