00:15:53 i don't remember if i've mentioned it before, but solving tatham's Loopy puzzle by only deleting lines (except for the final check) makes it a bit more challenging 00:17:25 some of the geometries make this more or less difficult 00:23:17 although it makes the final check a bit of boring clicking 00:24:15 [[Esolang:Introduce yourself]] https://esolangs.org/w/index.php?diff=55869&oldid=55813 * Asangi a4ac * (+140) /* Introductions */ 00:24:27 [[Hexsp]] N https://esolangs.org/w/index.php?oldid=55870 * Asangi a4ac * (+2314) Created page with "'''Hexsp''' is a programming language made by Otakuto. It is basically Lisp written in Hexspeak. Every code is written in hexadecimal numbers and it is supposed to resemble ma..." 01:02:52 [[Hexsp]] https://esolangs.org/w/index.php?diff=55871&oldid=55870 * Asangi a4ac * (+111) 01:03:02 -!- MDude has joined. 01:04:00 [[Hexsp]] https://esolangs.org/w/index.php?diff=55872&oldid=55871 * Asangi a4ac * (+18) /* Sample Code */ 01:04:39 fungot: have you seen quintopia? 01:04:39 boily: i an- they were all democrats rely on ignorance of it you just even if you sit in the restaurant we were at the beginning 01:04:54 fungot: in a restaurant? which one? 01:04:55 boily: but i do merchandising and mystery shopping 01:05:06 fungot: a mysterious shopping restaurant????? 01:05:06 boily: um that type of thing that's what i need and i love to 01:05:37 . o O ( the restaurant that wasn't there yesterday ) 01:05:48 hily. 01:07:16 [[Hexsp]] https://esolangs.org/w/index.php?diff=55873&oldid=55872 * Asangi a4ac * (+209) 01:08:38 bonsœøirjan! 01:08:56 [[Language list]] https://esolangs.org/w/index.php?diff=55874&oldid=55855 * Asangi a4ac * (+12) /* H */ 01:09:58 . o O ( yesterday, I ate a restaurant that wasn't there. it wasn't there again today... ) 01:12:14 so that's what happened to the CIA's restaurant, you fiend! 01:14:48 which CIA? 01:17:38 the one which rhymes with "today" hth 02:03:34 -!- boily has quit (Quit: FAVOURITE CHICKEN). 02:27:02 what's your favorite model of computation? 02:30:30 I'm warming up to string rewriting. 03:10:52 -!- oerjan has quit (Quit: Nite). 03:27:08 -!- trout has quit (Quit: /dev/null is full). 03:28:24 -!- variable has joined. 03:30:54 -!- Sgeo has joined. 03:33:21 -!- Sgeo__ has quit (Ping timeout: 265 seconds). 05:59:43 Do you know what is the computation class of the Free Hero Mesh preprocessor? (ignoring hash table limits and memory limits) 06:03:22 -!- arseniiv has joined. 06:12:01 [[Your Pong May Minsky]] https://esolangs.org/w/index.php?diff=55875&oldid=55868 * Zzo38 * (+40) Add category 06:13:39 -!- xkapastel has quit (Quit: Connection closed for inactivity). 09:28:04 -!- tromp has quit (Ping timeout: 256 seconds). 09:56:54 -!- xkapastel has joined. 10:30:32 [[]] N https://esolangs.org/w/index.php?oldid=55876 * Iamcalledbob * (+7785) Created page with "'''Chicken''' is an [[esoteric programming language]] by Torbjrn Sderstedt, in which "chicken" is the only valid symbol. ==Language overview== A chicken program consists..." 10:35:02 [[]] https://esolangs.org/w/index.php?diff=55877&oldid=55876 * Iamcalledbob * (-6515) 11:23:18 -!- ais523 has joined. 11:40:20 -!- SopaXorzTaker has joined. 11:47:01 -!- ais523 has quit (Quit: sorry for my connection). 11:47:14 -!- ais523 has joined. 12:04:55 -!- xkapastel has quit (Quit: Connection closed for inactivity). 12:20:52 -!- boily has joined. 12:31:06 [[Talk:Your Pong May Minsky]] N https://esolangs.org/w/index.php?oldid=55878 * Ais523 * (+1901) /* Continuous waterfalls */ new section 12:41:35 -!- AnotherTest has joined. 12:52:02 -!- AnotherTest has quit (Ping timeout: 276 seconds). 13:35:09 is the integral of an analytic function necessarily analytic? (I love that this is potentially relevant for an esolang I'm making…) 13:35:43 `quote 13:35:44 1280) i don't approve of nuclear-free zones; without nuclei we'd not exist hth 13:35:47 `quote 13:35:47 1196) I am in room number 404. I keep not finding it and walking past the door. 13:35:49 `quote 13:35:50 711) Just seen this comment on reddit: "Parallel programming has been a solved problem for decades." I might have to stop reading the internet. 13:35:52 `quote 13:35:53 866) Taneb: The other day on the channel I came up with BRAINLISPCODE, a LOLCODE-style LISP with an embedded bf derivative. I thought you should know. :-I 13:35:56 `quote 13:35:57 745) The world would be a much classier place if the world was full of Gregors. True, but how many of them are on fire? 13:37:08 err, indefinite integral 13:41:16 -!- SopaXorzTaker has quit (Remote host closed the connection). 13:46:20 -!- SopaXorzTaker has joined. 13:53:14 [[Special:Log/newusers]] create * Zackmowrer * New user account 14:09:04 [[Esolang:Introduce yourself]] https://esolangs.org/w/index.php?diff=55879&oldid=55869 * Zackmowrer * (+276) /* Introductions */ 14:12:21 -!- SopaXorzTaker has quit (Quit: Leaving). 14:38:26 `5 quote 14:38:29 1/2:1267) pikhq: The Google way isn't exactly NIH. They have their own variant of it. \ 972) ok im sober now and DNS makes sense again [...] Domain Name System [...] ♫ domain name system ♫ \ 151) I don't trust ducks. They always look like they're planning something. I'm not sure it's a good idea to give them language capabilities. \ 192) [CTCP] Received CTCP-ERRMSG reply from clog: unknown CTCP: ERRMSG. \ 97) `n 14:38:32 2/2:t> [...] i'm a law student so i am loving my bread machine 14:42:43 -!- erkin has joined. 15:12:12 -!- SopaXorzTaker has joined. 15:14:01 -!- boily has quit (Quit: TOOL CHICKEN). 15:21:30 [[Talk:Your Pong May Minsky]] https://esolangs.org/w/index.php?diff=55880&oldid=55878 * Ais523 * (+220) a correction in the proof 15:35:34 -!- variable has quit (Quit: /dev/null is full). 15:39:39 -!- oerjan has joined. 15:48:46 -!- variable has joined. 15:55:45 is the integral of an analytic function necessarily analytic? <-- yes 15:55:45 -!- variable has quit (Read error: Connection reset by peer). 15:56:02 good to know 15:56:16 -!- variable has joined. 15:56:17 I'm surprised that isn't mentioned anywhere on the relevant Wikipedia page (or at least if it is, I can't find it) 15:56:21 same radius of convergence on the power series iirc 15:56:23 but the Taylor series definition made it seem likely 15:58:08 -!- xkapastel has joined. 16:03:29 -!- oerjan has quit (Ping timeout: 256 seconds). 16:04:50 -!- variable has quit (Quit: Found 1 in /dev/zero). 16:28:03 -!- contrapumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…). 16:28:58 -!- contrapumpkin has joined. 17:32:34 -!- AnotherTest has joined. 17:49:32 -!- variable has joined. 17:53:13 -!- AnotherTest has quit (Ping timeout: 256 seconds). 18:07:47 -!- xkapastel has quit (Quit: Connection closed for inactivity). 18:10:48 -!- erkin has quit (Quit: Ouch! Got SIGIRL, dying...). 18:15:13 -!- SopaXorzTaker has quit (Remote host closed the connection). 18:21:36 -!- jix has quit (Quit: leaving). 18:22:22 -!- jix has joined. 18:52:22 -!- AnotherTest has joined. 18:56:30 -!- AnotherTest has quit (Ping timeout: 245 seconds). 19:06:07 -!- AnotherTest has joined. 19:10:51 -!- AnotherTest has quit (Ping timeout: 256 seconds). 19:11:10 [[R U DS]] N https://esolangs.org/w/index.php?oldid=55881 * Zackmowrer * (+1815) Created page with "'''R U DS''' is an simple, [[:Category:Output only|output-only]] [[esoteric programming language]] [[Category:Languages]] created by Zackery Mowrer in [[:Category:2018|2018]]...." 19:22:30 [[Language list]] https://esolangs.org/w/index.php?diff=55882&oldid=55874 * Zackmowrer * (+13) /* R */ 19:27:50 ais523: for counter machines with a limited number of counters (let's call it 4 or 5), how would you represent sequential strings? godel numbering? 19:28:21 imode-desktop: most likely as digits of a number 19:28:31 e.g. you interpret the string in base 256 19:28:35 if it's a string of octets 19:28:40 or base 10 if it's a string of digits, etc. 19:28:47 that's an easy form to work with in counter machines because divmod tends to be easy 19:29:43 alright. how about instructions? do counter machines always have atomic instructions or are equivalent transition tables available for counter machines? 19:31:45 i.e for every transition in a TM, I'm doing multiple operations in a single step, whereas for something like register machines I do larger operations incrementally by combining several atomic instructions. 19:32:13 -!- tromp has joined. 19:33:18 I guess you could have a kind of state transition table and simply list out whether each counter is incremented or decremented, and build things like multi-register NOPs off of that. 19:34:28 it could be as simple as a boolean flag. 1 if you're incrementing, 0 if you're decrementing. 19:35:40 -!- xkapastel has joined. 19:36:27 imode-desktop: I think it's natural to build a test for zero into the decrement operation, in which case it's not perfectly symmetric with the increment. 19:51:31 int-e: good point. it'd still work though. if you wanted to increment _just one register_ (let's say you had 3), you could specify a state where you increment all of them, then decrement all but the one you want preserved. 19:52:29 control flow could be specified by a bitmask of the registers you wanted to check. 19:53:13 that's so ... unmathematical 19:53:13 so the notation for 3 registers would be `State:Reg1Zero,Reg2Zero,Reg3Zero:Reg1,Reg2,Reg3` 19:53:44 and atomic instructions are any better? :P 19:53:53 all this shit is arbitrary. 19:56:27 counter machines tend to vary a lot on how control flow works 19:56:58 having it as a side effect of decrement is common, though, as that's the only time you have useful information to check 19:59:29 -!- erkin has joined. 20:03:05 int-e: I'm actually genuinely curious, what part of that is unmathematical? vs. practically any other abstract machine formulation that's been presented since turing's paper. 20:03:36 imode-desktop: "bitmask" :P 20:04:10 oh bugger off. :P 20:04:18 (these binary operations are not very natural, if you can forgive the pun) 20:05:04 it's not really a bitmask, you use 0 to determine if you're decrementing and 1 to determine if you're incrementing, so "Increment register 1 and decrement registers 2 and 3" looks like 100. :P 20:05:55 "If you're in state 2, and registers 2 and 3 are zero, increment register 1, decrement registers 2 and 3, and go to state 3." 20:06:07 2:011:100:3 20:06:32 There's no accounting for taste. :P 20:06:45 taste be damned, it looks funny. :P 20:06:58 besides, isn't that the point of an esolang. 20:07:39 it may be 20:18:10 `? this 20:18:11 This is something people on the channel like to talk about. We're often unsure what this is, though. 20:18:34 `? this page 20:18:35 This page intonationally left blank. 20:19:00 `learn This page is under construction. 20:19:02 Learned 'thi': This page is under construction. 20:19:03 Oops. 20:19:05 `revert 20:19:06 Done. 20:19:12 `le//rn this page//This page is under construction. 20:19:14 Relearned 'this page': This page is under construction. 20:25:38 int-e: re-reading what you said keeps piquing my interest: what defines a natural operation? sans the pun. 20:28:25 imode-desktop: Hmm, without the pun, it's really a matter of conventions (what does everybody else do?), elegance (is this needlessly complicated), and taste (uh the bit that cannot be defined but that one still forms strong opinions about). 20:29:14 the second is something that I'm concerned about, first maybe, third not so much. :P 20:29:44 So, there's no hard definition. (Note that there are interdependencies... elegance implicitly refers to conventions. 20:29:47 ) 20:30:55 I'd be hard-pressed to prove that implicit dependance. conventions are useful as a starting point imho but treating them as an upper limit gives you a sense of tunnel vision. 20:31:47 if we define "elegance" as the negation of needless complication, then there's a lot of old models that follow needless complication. 20:32:30 What I mean is that expressing things in terms of established notions, even somewhat clumsily, is usually preferred to developing a new language just to make a single definition elegant. Of course if that language extends to other definitions... well then you may be on the way to a new mathematical theory. 20:33:55 with a funny mention, term rewriting. not only do you have to maintain a list of bound variables + storage for all of the bound term trees for those variables, you have to go through the process of pattern matching on terms, which isn't that hard, but something I'd hardly call natural from my perspective. 20:35:11 that imho is needlessly complicated. deceptively simple because it relies on the ability to keep state in your head relatively easily and relies on yor pattern matching ability, but deviates from what can be done strictly mechanically. 20:38:04 then again, that's just my perspective. I don't like anything that can't be done strictly mechanically in a trivial way unless it can be _reduced_. mainly because the more allowances you give, the more we're just talking in some abstract notation for algorithms, and my train of thought falls apart. 20:45:26 -!- Phantom_Hoover has joined. 20:48:40 [[CopyPasta Language]] M https://esolangs.org/w/index.php?diff=55883&oldid=55576 * BoutonIA * (+22) Add Category:Languages 21:25:01 -!- sprocklem has quit (Quit: []). 21:50:33 -!- sprocklem has joined. 21:52:50 -!- sprocklem has quit (Client Quit). 21:53:15 -!- sprocklem has joined. 22:50:03 -!- Sgeo_ has joined. 22:51:45 -!- Sgeo has quit (Ping timeout: 248 seconds). 23:00:03 -!- danieljabailey has quit (Quit: ZNC 1.6.5+deb2build2 - http://znc.in). 23:00:23 -!- danieljabailey has joined. 23:02:30 -!- Sgeo has joined. 23:04:35 -!- Sgeo_ has quit (Ping timeout: 260 seconds). 23:14:20 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 23:15:13 -!- MDude has quit (Ping timeout: 248 seconds). 23:23:35 -!- Sgeo_ has joined. 23:27:11 -!- Sgeo has quit (Ping timeout: 265 seconds). 23:53:40 -!- oerjan has joined. 23:54:12 * oerjan is using webchat, nvg seems to be having network problems 23:55:00 I keep thinking that means Taneb. 23:55:10 `? ngevd 23:55:11 ​$m𨳸e:^O˥=_5r8ָ9H5AdB 23:55:40 `? nvd 23:55:41 nvd is what Taneb calls himself when he wants to feel professional. 23:55:44 `? nvg 23:55:45 nvg? ¯\(°​_o)/¯ 23:56:56 -!- boily has joined. 23:58:32 `learn NVG is a student computer club in Trondheim, whose servers are frequently infiltrated by oerjan. Not to be confused with nvd. 23:58:34 Learned 'nvg': NVG is a student computer club in Trondheim, whose servers are frequently infiltrated by oerjan. Not to be confused with nvd. 23:58:51 helloily.