00:00:08 `` cat wisdom/dahl | h 00:00:09 (Morse code is what "dahl dih dahl dahl" made me think of) 00:00:10 Royahl Dahhl ihs the kihng ohf Nohrway. 00:00:41 `thanks h 00:00:42 Thanks, h. T. 00:00:54 poor harald will be so disappointed that he's no longer the king. 00:01:26 oh that reminds me of something i thought of 00:02:08 is it sleep? 00:08:16 -!- ais523 has joined. 00:10:11 `le/rn remorse/.--. . --- .--. .-.. . / .-- .. - .... / -. --- / .-. . -- --- .-. ... . / .. -. ... .. ... - / --- -. / ... .- -.-- .. -. --. / . ...- . .-. -.-- - .... .. -. --. / .. -. / -- --- .-. ... . / -.-. --- -.. . --..-- / -... ..- - / --- -. .-.. -.-- / --- -. -.-. . .-.-.- 00:10:14 `cat bin/h 00:10:14 Learned «remorse» 00:10:15 ​#!/usr/bin/perl -p \ s/([aeiouy])([bcdfghjklmnpqrstvxz])/$1h$2/ig 00:10:31 * oerjan flogs himself --~~~~~~ 00:10:40 `culprists wisdom/remorse 00:10:41 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: culprists: not found 00:10:47 `culprits wisdom/remorse 00:10:49 oerjan 00:16:19 -!- hppavilion[1] has joined. 00:23:48 -!- vanila has quit (Quit: Leaving). 00:26:31 -!- XorSwap has joined. 00:32:48 -!- ais523 has quit (Read error: Connection reset by peer). 00:33:32 -!- ais523 has joined. 00:38:45 what did what's-his-name mean about the vampires twh <-- no clue hth 00:39:03 -!- lleu has joined. 00:39:32 oerjan: tdnh hth 00:41:32 I'm making a python library called Machina :) 00:41:51 It's all about abstract machines 00:42:21 (I'm all about dos AMs `bout dos AMs, no CISC, all about...) 00:44:16 -!- b_jonas has quit (Ping timeout: 272 seconds). 00:45:44 -!- mad has joined. 00:47:21 shachaf: possibly just that they shouldn't punish him for attacking them 00:47:37 but he can attack the high priestess too so... 00:48:14 kinda wondering... for a directed graph to be turing complete, it needs to have an infinity of non-identical nodes 00:49:23 a directed graph is not by itself a model of computation so cannot be turing complete without something added 00:49:23 since if it doesn't have an infinity of nodes it can't store an infinite tape... 00:50:23 it's not even mutable 00:50:26 and if those nodes are identical (ie the graph has infinite symmetries which makes the nodes identical), then the program can't retrieve the infinite tape from its node position 00:50:57 oerjan : what's mutable is the position of the currently considered node 00:51:00 mad: a tape doesn't have to be infinite, just growable. 00:51:17 mad: ah so the graph is the state space 00:51:19 well, it's not infinite at any moment but it must be infinitely growable 00:51:20 yes 00:52:49 well then it's pretty obvious yes 00:54:04 the other requirement I'm ending up with for turing completeness is kinda weird though... 00:54:53 it seems rather awkward to define exactly what else a graph needs then 00:55:01 it seems to require multiple different possible "growth rates"... which would explain the wire-crossing problem 00:55:06 like if you number the nodes 00:55:39 you can have additive nodes: node 1000 goes to 1017 for instance (+17) 00:56:09 it is enough to have multiplicative nodes, that gives you the ability to encode fractran. 00:56:13 and multiplicative nodes: node 1000 goes to 2000 (*2) (possibly combined with additive) 00:56:31 *a fractran program 00:56:45 and the reverses (subtractive, divisive with different destinations depending on reminder) 00:57:27 but I think that as long as you have two different growth scales (like additive and exponential, additive and quadratic etc) then it works 00:57:30 you don't need division with anything but 0 remainder 00:58:25 mad: it is enough to have multiplication and division (with remainder 0) by 2 and 3 00:58:35 erm 00:58:45 if you have an FSA control too 00:59:12 otherwise, add a few more primes 00:59:23 fsa can be emulated if you have a periodic pattern in some cases I think 00:59:50 i say, take a look at fractran. 00:59:59 ...which I guess sis the same as adding more primes 01:02:32 what if you have *3 and /2 and additive? 01:03:05 it kinda has multiple scales ish but they're like all one-way 01:05:14 additive scale only is insufficient I think 01:05:58 since it's equivalent to fsa + one bignum 01:06:14 (minsky machine is turing complete but it takes fsa + two bignums) 01:06:15 i suspect that won't work. this reminds me very vaguely of my one brush with cstheory.stackexchange http://cstheory.stackexchange.com/questions/21525/conjecture-about-two-counters-automata/29197#29197 01:06:45 although that's really about how 2-cell minsky machine needs its input in very particular format 01:07:32 well, yeah 01:07:43 hm *3 and /2, are you trying to involve collatz here? :P 01:07:49 :D :D :D :D 01:08:12 coll a tzpade a tzpade 01:08:45 I guess that's why collatz is hard, it has nearly all the elements of a turing machine and it's hard to tell if it has just enough or just too few 01:08:46 imho 01:11:08 in fact, because of collatz you can at least encode a computation that's very hard to predict the result of 01:13:48 * oerjan wonders if anyone's tried to bound from below the hardness of predicting collatz 01:13:49 other things that I wonder if they're turing complete are (add n to digit-reversed n, repeat until you get a palindrome) https://www.youtube.com/watch?v=bN8PE3eljdA and (writing an integer as a sum of 3 cubes of integers including negatives) https://www.youtube.com/watch?v=wymmCdLdPvM 01:14:02 `? ngevd 01:14:05 ​)ylwM%h"v,G-)7gI:<_s\U:N8{K;f}AlCqͩ"2P \ ړSEu3wfB>Ru+a^̇VxdK̷Őv^9;VrnfwevVTg_/̯,{;Я^DѾ}V1G?hmXvsN,8 01:14:33 digit-reversing looks like a good method of getting the double-stack you need to get an infinite tape 01:16:51 stupid hackego, that breaks my terminal 01:17:17 arguably that's a bug in the lient 01:17:19 *client 01:17:59 mad: what's with the "until you get a palindrome" halt condition? just because you wanted an arbitrary halt condition? 01:18:04 my client works ok but i can't use ^L to see the raw version 01:18:12 err 01:18:16 M-L 01:18:26 ais523: lychrel numbers, e.g. it's unknown if 196 ever gives one 01:19:13 ais523 : I didn't come up with this, it's just that when I saw it, well, it has wildly varying number of steps and some that seem to go on forever... that's a candidate for turing completeness to me 01:19:40 statistically, it probably doesn't, because once it grows enough heuristically the chances get miniscule that it ever will. 01:20:05 and it has been shown to grow to more than a billion digits. 01:20:12 (without a palindrome) 01:20:49 what I want to know is... is there a way to program in this system 01:21:15 oerjan: I mean, restricting the halt condition just makes TCness proofs harder 01:21:40 mad: you might take a look at Dupdog on our wiki 01:21:42 ais523: oh right 01:21:56 we don't know how to program that either (or if it's possible) 01:22:10 once the number gets palindromic I think it just grows following 2^x * n 01:22:16 and i believe ais523 has a few other examples 01:22:25 xigxag is the other one 01:22:39 mad: no, it can turn nonpalindromic again 01:22:40 although xigxag is a bit different because it grows exponentially in all nontrivial cases 01:22:46 oh 01:22:47 right 01:22:53 it's not like it's a preserved property 01:23:02 yeah you're right on that one 01:23:06 the question is if you can get Turing behaviour "inside" the string somehow 01:24:50 i never finished my investigation of the mccullough2 machine 01:25:32 then there's the mandlebrot set that has this kindof property as well 01:25:33 i got to the point where everything either obviously halted, diverged, or went into a weird minsky-like subsystem of <= 6 registers 01:26:16 so theoretically there could still be something TC inside but i doubt there's enough complexity for it 01:26:17 since it's about something that can halt or not, can potentially have infinitely growable information store (in the digits of the current complex number) 01:27:20 mad: well complex numbers don't necessarily have finite number of digits 01:27:46 although i guess if you start with that, it won't suddenly become infinite 01:28:02 well 01:28:08 http://esolangs.org/wiki/McCulloch's_second_machine for people who are having trouble finding the link (it took me a few tries) 01:28:29 if you chose your z to have rational r and rational i, your current value is always rational no? 01:29:19 oerjan: I've been sort-of specializing in weird restricted minskyalikes recently 01:29:30 although I assume the rules of this one are bizarrely complex? 01:30:18 bizarre, but not _that_ complex 01:30:44 my holy grail would be something in the family of a simple recursive equation applied until you hit some halt condition 01:30:51 ideally fitting on a single line 01:35:23 ais523: the relevant strings are of the form [24]*5[24]+5[24]*, which can be reanalyzed by ignoring all even-length sequences of 4s and then considering lengths of sequences of 2s as registers. 01:35:29 iirc 01:36:20 and then you can formulate the further evolution as register shuffling and addition/increments 01:36:38 if collatz turned out to be turing complete then it would qualify since you can write it as f(x) = (5 * (x mod 2)+1) * x/2 + (x mod 2) 01:37:00 and if you have more than about 6 registers it grows exponentially, while if the 5s ever get joined it halts. 01:39:42 (earlier stages where you have other digits and/or a different number of 5s than two will quickly reduce) 01:41:22 mad: err, generalized collatz is turing complete 01:41:40 oh hm i also simplified by looking only at those recurring steps where it starts with a 5 01:41:51 (then you only have two groups of registers) 01:42:02 ais523 : yes but the ones that are proven turing complete are quite a bit larger no? :D 01:42:03 oerjan: hmm, the complexity here is that the number of registers changes over time? 01:42:06 mad: yep 01:42:51 ais523: yes 01:43:18 one thing that would be cool is a turing complete function that gives a rational number if it "halts" and an irrational if it runs forever 01:43:20 that makes quite a change to how you program a minskyalike! 01:43:27 and there were more cases than i wanted to do by hand 01:44:06 and doesn't have an explicit loop, and to get the "loop" you have to compute it with increasing precision 01:44:46 mad: haha, I like that 01:44:58 but even if it is rational, you can't in general prove it's rational 01:45:26 or maybe something that is either positive or negative 01:45:56 but if it's non halting the error range covers 0 forever 01:46:51 that'd work 01:48:08 -!- p34k has quit. 01:51:12 Wiki's article on https://en.wikipedia.org/wiki/Deterministic_finite_automaton starts very morbidly 01:55:05 `? hppavilion[1] 01:55:07 hppavilion[1] se describe en las notas al pie. ¿Porqué no los dos? Nadie lo sabe. 01:55:46 what is "he'll burn in hell for calling Wikipedia "Wiki"" in spanish twh 01:55:46 -!- Phantom__Hoover has quit (Read error: Connection reset by peer). 01:57:11 oerjan: Wiki is a fun abbreviation. It's not like I'm confusing it with anything. 01:57:21 oerjan: It's not like I said "Wikia" 01:57:36 it's not an abbreviation it's a noun hth 01:58:06 oerjan: I've heard the British call it Wiki 01:58:31 oerjan: Of course it's a noun. Abbreviations and nouns are not mutually exclusive 01:58:38 "the Wiki", or "Wiki", without context, refers to c2 IIRC 01:58:43 or maybe some other early wiki 01:58:49 clearly it doesn't in this case 01:58:50 not Wikipedia, though, it came later 01:59:10 well, MeatballWiki? 01:59:21 Machina is going nicely :) 01:59:45 I plan to allow it to do GUI xD 02:00:37 hppavilion[1]: i shall take inspiration for how to punish the british from http://www.girlgeniusonline.com/comic.php?date=20060306 hth 02:02:04 Something lingering, with boiling oil in it, I fancy. 02:02:27 shachaf: link? 02:02:38 http://diamond.boisestate.edu/gas/mikado/webopera/mk207d.html hth 02:06:47 oerjan: would have preferred i,i at the beginning wthh 02:06:50 would you 02:30:57 -!- ais523 has quit. 02:31:07 -!- ais523 has joined. 02:51:57 -!- XorSwap has quit (Quit: Leaving). 02:59:42 -!- heroux has quit (Ping timeout: 255 seconds). 03:00:19 -!- heroux has joined. 03:19:42 -!- MDude has changed nick to MDream. 03:27:08 -!- lleu has quit (Read error: Connection reset by peer). 03:33:17 -!- hppavilion[1] has quit (Ping timeout: 276 seconds). 03:34:43 -!- copumpkin has joined. 03:45:33 -!- hppavilion[1] has joined. 04:17:01 -!- Elsa has changed nick to lolcat. 04:37:21 -!- mauris has quit (Ping timeout: 255 seconds). 04:59:38 -!- ais523 has quit. 05:08:10 -!- andrew has joined. 05:55:54 -!- hppavilion[1] has quit (Ping timeout: 256 seconds). 05:59:02 -!- andrew has quit (Ping timeout: 272 seconds). 06:02:11 did scott aaronson break his blog styling 06:02:28 -!- catern has joined. 06:04:24 `welcome catern 06:04:35 catern: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: . (For the other kind of esoterica, try #esoteric on EFnet or DALnet.) 06:04:43 this is a good channel 06:05:52 -!- andrew has joined. 06:06:00 sure is 06:08:22 i guess it must be on purpose, i don't think it had commenter icons before. but it's lost the comment numbers which everyone used to refer to each other, that's going to be confusing. (not that it wasn't before whenever the numbers shifted for whatever reason.) 06:08:49 -!- copumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…). 06:46:57 -!- infinitymaster has joined. 06:50:09 -!- ben_ has joined. 06:50:34 -!- ben_ has left. 06:51:08 -!- b_jonas has joined. 06:53:13 -!- infinitymaster has quit (Quit: Leaving...). 07:01:56 -!- b_jonas has quit (Ping timeout: 276 seconds). 07:11:11 -!- hppavilion[1] has joined. 07:24:38 -!- b_jonas has joined. 07:28:45 -!- jaboja has joined. 07:36:01 -!- mroman has joined. 07:36:41 fnird 07:46:11 Nom. fnǫrðr Acc. fnǫrð Dat. fnirði Gen. fnarðar 07:46:42 Are you declining icelandic 07:47:02 no, old norse hth 07:47:59 Taneb: may i offer you some latin 07:49:21 shachaf: go on 07:49:36 offer the latin 07:49:46 Taneb: would you like some latin 07:50:03 Nom. FNOR Gen. FNORDIS Dat. FNORDI Acc. FNOR Abl. FNORDE Voc. FNOR 07:52:46 -!- andrew has quit (Ping timeout: 240 seconds). 07:53:21 https://arin.ga/pbjqXt/raw found some random bf code, then decided to change a couple of things in my interpreter and now the generated code is optimal 07:53:27 -!- andrew has joined. 07:54:14 "optimal" 07:54:19 hey :( 07:54:22 it's not? 07:54:33 *mumble* *mumble* kolmogorov complexity *mumble* 07:54:39 but :( 07:54:58 I don't think it makes sense to say that the generated code is optimal 07:55:03 ok 07:55:11 A sophisticated enough compiler could evaluate things at compile-time 07:55:21 well but you have to stop at some point 07:55:30 also it's undecidable to know when it is 07:55:35 ok ok 07:55:36 Yup 07:55:41 One would have to be conservative 07:55:56 the output looks reasonable enough though 07:56:02 yay 07:56:22 apart from, y'know, compiling brainfuck to bash? first time I see that 07:57:00 why not 07:57:49 i think it's fast enough to compete with badly written interpreters in any other language 07:57:58 that looks like a simple balanced bf loop. there _are_ some compilers that turn that into simple arithmetic. 07:58:21 oerjan: there are no loops in the generated code 07:58:27 oh 07:58:46 CARRY ON, THEN 07:58:50 :D 08:01:44 oh, nothing wrong with it, just a rather interesting combination of implemetation language and technique :P 08:03:38 i should patent it and sell it for a billion dollars 08:06:40 is there a programming language that relies on the structure of recursively subdivided (by horizontal or vertical lines) rectangles? 08:12:10 i dunno but that reminds me of https://esolangs.org/wiki/Memfractal 08:13:16 which i once spent some time trying to see if i could do computation with 08:15:04 oerjan: to be exact, I'm thinking about a programming language which code is either an (CJK) ideograph or an ideograph description sequence that has a recursive rectangular structure 08:15:47 [wiki] [[Memfractal]] https://esolangs.org/w/index.php?diff=46148&oldid=20662 * Oerjan * (+41) cat 08:15:48 Piet is similar in the regard that it has a block of colors and has a defined transition between them, but less structured. 08:36:57 -!- hppavilion[1] has quit (Ping timeout: 265 seconds). 08:42:12 hm. 08:42:13 tables suck 08:44:04 memfractal looks pretty hard 08:44:09 i like it 08:44:52 tables are naturally horizontal structures 08:44:58 while phones are naturally vertical thingies 08:47:31 where's the starting point of a memfractal program" 08:47:34 ? 08:48:25 weirdly enough my phone displays font-size: 1.125em SMALLER than regular text 08:48:26 wtf 08:52:30 it doesn't properly zoom probably 08:57:11 -!- FreeFull has quit (Quit: BBL). 08:57:29 myname: hm it doesn't say, although it's "trivial" to reroute. i was going to say it's symmetric but X isn't entirely. 08:57:59 being symmetrical may be a hard cutoff in terms of computational power 08:58:08 and trivially rerouting the like 08:58:19 wat 08:58:31 don't you think so? 08:59:06 if the code has to be symmetrical i can't do something like "right side of a box is true, left side is false" 08:59:17 no, the code doesn't have to be symmetric 08:59:32 the _language_ nearly is, except for X. 09:00:00 well it is symmetric by 180 degree rotation, and all except X by 90. 09:00:13 (you need to switch / and \ for the latter) 09:00:17 the language is symmetric, yeah 09:00:31 but you still need to define where to enter in some way 09:00:36 these mobile phones webbased online emulators suck as well 09:00:42 some of them just embed an ifram 09:00:44 *iframe 09:00:44 wtf 09:00:54 well yes, i'm just saying it doesn't matter which edge you choose for that. 09:00:56 that's total bullshit. 09:01:03 indeed 09:01:29 @tell zzo38 please specify the starting point of memfractal 09:01:29 Consider it noted. 09:02:39 although in my opinion it's not up to me to fix displaying wide tables for smartphones 09:02:46 oh hm i think when rotating 90 degrees you can replace X by X surrounded by *'s 09:03:02 because that's the phone's browser's job, at least it should be. 09:03:06 so you don't need more complicated rerouting 09:04:01 just a simple char -> block replacement 09:04:25 oerjan: the problem is, that each + basically loses information at that point, doesn't it? 09:06:04 http://api.browsershots.org/png/original/56/560d8044d232ba413157d5d3fae54212.png <- lynx needs some fixing too. 09:06:31 It doesn't even try to align table cells correctly? and there's no space between

and 
 which looks wrong.
09:06:44  myname: well each recursive copy has its own bit, as it says
09:06:59  oh wait. no tables are fine.
09:07:07  but the 
 annoys me :(
09:07:43  oerjan: yeah, but if you don't look exactly where you put your X, you may have a problem with keeping the information, don't you?
09:08:06  myname: i mean you replace an X by an X surrounded on all sides by *s
09:08:17  so there is no bit change in total
09:08:41  you may need to expand the grid to fit, of course
09:08:48  ah
09:08:53  that may be right
09:09:24  hmm
09:09:35  something like I/O would be nice
09:09:52  otherwise you have this "memory is your output"-thingie
09:28:58 -!- rifter has quit (Ping timeout: 256 seconds).
09:33:05 -!- lolcat has quit (Ping timeout: 260 seconds).
09:34:07 -!- rifter has joined.
09:39:06  http://mroman.ch/exps/1.html too bad html can't auto generate references :(
09:42:16  also why people have these "to the top" "to bottom" links that scroll with the page (probably position: fixed)
09:42:28  that's what browser keyboard shortcuts/mouse gestures are for
09:43:18  mroman: "to the content" and "to/from the footnote" I lke
09:43:37  position: fixed usually sucks because it tends to overlap with the content if implemented poorly
09:43:58  for example if it's on the left and fixed and you assume there's about 100pixels space on the left before content
09:44:06  (let's say you use a margin-left: 10%)
09:44:11  that 10% is way smaller on smartphones
09:44:21  and the navigation div now overlaps the content
09:44:41  because the margin of the content div is now smaller than 100pixels
09:45:20  Taneb: yes, but these links should be placed at the top imo
09:45:52  and footnotes links are placed within the content so that's not an issue anyway
09:46:14  Yes, ideally the "to the content" should be the first thing on the page
09:46:39  although I think jumps to anchors should be the browser history's job
09:47:19  so that when you jump to some other place in the content you can easily jump back
09:48:08  because making backlinks from footnotes is in my opinion somewhat against the spirit of HTML :D
09:48:20  (my idealized version of HTML :))
09:49:04  also there's no distinction between id's used for jump targets
09:49:05  *ids
09:49:10  and ids only used for CSS
09:49:20  otherwise browsers could display a document structure on the left for example
09:49:50  but since people use ids for all sorts of scripting/styling stuff you'd just probably clutter it
09:50:10  it's time for HTML6
09:50:13  the *REAL* HTML
09:50:22  the one used for documents, not web applications :D
09:50:41 -!- bender| has joined.
09:51:20  What'll you use for web apps
09:51:32  HTML5
09:51:33  :)
09:52:35 -!- bender| has quit (Changing host).
09:52:35 -!- bender| has joined.
09:52:38 -!- bender| has changed nick to bender.
09:54:18  and HTML6 definitely would ignore all javascript :D
09:55:16  don't mind, at that point CSS4 will get Turing-completeness.
09:56:05  and be probably restricted to CSS2.1
09:56:20  or a restricted subset of CSS3
09:58:09  At this rate epub is basically HTML+related technologies for documents
09:58:49  well HTML is a good base for lots of things
09:59:23  people now doing UI with HTML
09:59:33  and HMTL probably was never supposed to be used for that :D
09:59:36  *HTML
10:01:22 -!- oerjan has quit (Quit: leaving).
10:06:51 -!- lolcat has joined.
10:17:13 -!- mysanthrop has joined.
10:19:38 -!- myname has quit (Ping timeout: 276 seconds).
10:25:38 -!- mysanthrop has changed nick to myname.
10:34:50 -!- rifter has quit (Quit: Leaving).
10:35:06 -!- rifter has joined.
10:47:42 -!- rifter has quit (Quit: Leaving).
10:48:09 -!- jaboja has quit (Ping timeout: 255 seconds).
10:50:43 -!- rifter has joined.
10:54:41 -!- lolcat has quit (Ping timeout: 246 seconds).
11:04:25 -!- andrew has quit (Remote host closed the connection).
11:14:35 -!- bender has quit (Ping timeout: 260 seconds).
11:25:43 <\oren\> "肉片が飛び散っている" -> "Cuts of meat flew and were scattered [like flower petals]" WTF I had no idea the writers of Asahi Shimbun could be so brutal.
11:28:22 -!- Welo has joined.
11:30:36 -!- boily has joined.
11:31:01 <\oren\> hiboily!
11:31:16 <\oren\> bohighly!
11:33:59 <\oren\> It should be possible to design a programming language in such a way that, like YAML, its format is very flexible, allowing both python-style indentation blocks and C style {} blocks
11:35:21 <\oren\> CSS iirc is already at least a push-down automaton
11:37:30 <\oren\> I want to write a memfractal implementation
12:04:14 -!- bender has joined.
12:04:49  he\\oren\!
12:05:05  good one
12:05:33  \oren\: like Haskell? 
12:06:01  mynamello, b_jhellonas.
12:14:35 -!- boily has quit (Quit: TURNOVER CHICKEN).
12:24:56 -!- MDream has changed nick to MDude.
12:30:50 -!- J_Arcane has quit (Ping timeout: 276 seconds).
12:34:24 -!- J_Arcane has joined.
12:38:58  \oren\: and begin ... end blocks
12:39:06  my improved bf interpreter can execute mandelbrot.b in only 2h42m31s!!!
12:39:56 -!- J_Arcane has quit (Ping timeout: 256 seconds).
12:39:58  hm
12:40:25  is there a benchmark program that terminates in a reasonable amount of time?
12:40:26  like
12:40:31  somewhere within a few minutes?
12:42:13  hanoi.b takes less than 50s
12:46:52  pick any
12:48:18 -!- J_Arcane has joined.
12:48:41  mroman: what do you want to benchmark?
12:49:47  almost three hours for mandelbrot.b...
12:49:51  but then again, it /is/ bash :P
12:50:11  it's a lot faster than it used to be
12:50:26  and a lot faster than any other bash interpreter
12:51:29  b_jonas: bf interpreters/compilers
12:51:31  whatuver
12:51:54 -!- J_Arcane_ has joined.
12:52:50  oh, bf.
12:53:32 -!- J_Arcane has quit (Ping timeout: 256 seconds).
12:53:34 -!- J_Arcane_ has changed nick to J_Arcane.
13:07:35 -!- jaboja has joined.
13:13:42 -!- idris-bot has joined.
13:15:29 -!- Sprocklem_ has joined.
13:15:46 -!- Sprocklem has quit (Ping timeout: 276 seconds).
13:42:31 -!- kline has quit (Changing host).
13:42:31 -!- kline has joined.
13:43:14 -!- mauris has joined.
13:46:21 -!- j-bot has joined.
13:47:15 -!- J_Arcane has quit (Ping timeout: 265 seconds).
14:22:39 -!- ais523 has joined.
14:24:18 -!- lolcat has joined.
14:47:23 -!- lleu has joined.
14:47:55 -!- bender has quit (Ping timeout: 240 seconds).
14:52:20 -!- TieSoul has joined.
14:55:52 -!- J_Arcane has joined.
15:17:57 -!- spiette has joined.
15:18:13  brooonfack
15:18:14  :)
15:18:18  new esolang
15:49:37 -!- Phantom_Hoover has joined.
15:53:51   [ (5,5137,4095)
15:53:51   > (5,5137,4094)
15:53:51   + (5,5137,4094)
15:53:52  pff
15:53:54  that explains a lot
16:07:21 -!- Lord_of_Life has quit (Excess Flood).
16:09:36 -!- Lord_of_Life has joined.
16:17:10 -!- jaboja has quit (Ping timeout: 272 seconds).
16:24:25 -!- nortti has changed nick to squark.
16:24:37 -!- squark has changed nick to nortti.
16:28:11 -!- jaboja has joined.
17:03:55 -!- mroman has quit (Quit: Lost terminal).
17:09:28 -!- TieSoul has changed nick to OpieOP.
17:09:34 -!- OpieOP has changed nick to TieSoul.
17:24:07  [wiki] [[Special:Log/newusers]] create  * Electrodude512 *  New user account
17:25:49  [wiki] [[RSSB]]  https://esolangs.org/w/index.php?diff=46149&oldid=31329 * Electrodude512 * (+68) Added my RSSB interpreter to External Resources
17:28:38 -!- bb010g has quit (Quit: Connection closed for inactivity).
17:32:48 -!- jaboja64 has joined.
17:36:18 -!- jaboja has quit (Ping timeout: 256 seconds).
17:50:23 -!- mauris_ has joined.
17:52:30 -!- mauris has quit (Ping timeout: 255 seconds).
17:54:47  That's so handy: in github, if you've got a commit page of the form  https://github.com/account/repo/commit/sha  you can just append .patch to get it as a patch.
17:55:06  [wiki] [[Talk:SPLEMIT21]] N https://esolangs.org/w/index.php?oldid=46150 * 72.10.123.177 * (+112) Created page with "This is just a copy of HQ9+...~~~~"
17:55:29  I don't understand why there's no "view patch" link in the UI for that. They have the "Raw" view for files, after all.
18:00:06 -!- jaboja64 has quit (Ping timeout: 256 seconds).
18:01:09  `wisdom
18:01:23  mapole/A mapole is a thwackamacallit built from maple according to Canadian standards. The army version includes a spork, a corkscrew and a moose whistle. A regulatory mapole measures 6' by 12 kg, ±0.5 inHg.
18:03:36  `? psi
18:03:37  psi? ¯\(°​_o)/¯
18:04:24  hmm... pound per square inch, an ancient greek unit of pressure
18:05:51  (unfortunately, the "pound per square inch" part is real)
18:08:20 -!- jaboja64 has joined.
18:33:33 -!- ais523 has quit.
18:34:33 -!- bb010g has joined.
18:44:09  [wiki] [[Befunge]]  https://esolangs.org/w/index.php?diff=46151&oldid=45240 * 72.10.123.177 * (+2) /* Hello, world! */
18:44:24  [wiki] [[Befunge]]  https://esolangs.org/w/index.php?diff=46152&oldid=46151 * 72.10.123.177 * (+1) /* Hello, world! */
18:46:11  [wiki] [[Hello, world!]]  https://esolangs.org/w/index.php?diff=46153&oldid=44844 * 72.10.123.177 * (+202) 
18:59:22 -!- FreeFull has joined.
19:18:46 -!- asdasdasdasdasd has joined.
19:19:22 -!- asdasdasdasdasd has quit (Client Quit).
19:22:33  What, a CR instead of a LF? 
19:22:36  That's just bizarre.
19:23:14  (Re the Befunge edits, they changed the old   "!dlroW ,olleH">:#,_@   to   94+"!dlroW ,olleH">:#,_@   instead of the common 55+ or 25* that you normally see.)
19:23:54  Also I'm not that sure about both words being capitalized either.
19:25:24 * APic grins manically.
19:27:44 -!- hppavilion[1] has joined.
19:33:20 -!- gde33 has left.
19:37:53 -!- J_Arcane has quit (Ping timeout: 276 seconds).
19:47:47 -!- J_Arcane has joined.
20:03:12  The union of the set s multiplied by l and t
20:03:44  Using math to make slurs is fun :)I
20:03:48  I'm a bad person :)
20:08:54  `quote SNOWMAN
20:08:54  No output.
20:08:54  what1
20:08:57  what!
20:09:03  whose haiku was that
20:10:36  mauris_: Was it you?
20:10:46  mine!
20:11:04  MAHJONG TILE AUTUMN / HIRAGANA LETTER YA / SNOWMAN WITHOUT SNOW.
20:11:21  can you /nick mauris so i can quotify that
20:11:25  A Minsky machine... except instead of integer registers, the registers are sets with the according operations changed
20:11:38 -!- mauris_ has changed nick to mauris.
20:11:41  One of the operations follows an alternate state transition if the set is empty
20:11:49  wait, is the period canonical?
20:12:02  nah
20:12:18  so what's the canonical version
20:12:26  ok this time for quotableness:
20:12:27  MAHJONG TILE AUTUMN / HIRAGANA LETTER YA / SNOWMAN WITHOUT SNOW
20:12:42  `addquote  MAHJONG TILE AUTUMN / HIRAGANA LETTER YA / SNOWMAN WITHOUT SNOW
20:12:44  1260)  MAHJONG TILE AUTUMN / HIRAGANA LETTER YA / SNOWMAN WITHOUT SNOW
20:12:47  we need more unicode poetry
20:12:52  i made a limerick too
20:13:14  so did i
20:13:19  What was yours?
20:13:38  `quote prose
20:13:39  1136)  A Swede who was in #esoteric / Thought his rhymes were a little generic. / "I might use, in my prose, / ꙮs, / But my poetry's alphanumeric."
20:14:05  HEXAGRAM FOR THE CREATIVE HEAVEN / MATHEMATICAL BOLD DIGIT SEVEN / KANGXI RADICAL WHITE / VERTICAL TRAFFIC LIGHT / NEGATIVE CIRCLED NUMBER ELEVEN
20:14:43  Oh, right.
20:16:23 -!- Lord_of_Life has quit (Ping timeout: 264 seconds).
20:47:42  A programming language
20:47:51  Where the only way to accomplish anything is through debugging
20:49:12  it's called c
20:51:51  myname: No, using debugging is how you figure out how to do somethign
20:52:07  ah, c++ with boost, then?
20:52:19  myname: What I'm getting at is a language that requires debugging to actually /program/, even if you are a programming genius
20:55:36 * int-e used to write small assembly programs in debug.com (later debug.exe)
20:58:10 -!- p34k has joined.
20:59:34 -!- Lord_of_Life has joined.
21:00:46  mauris: those are nice poems
21:01:35  `? ꙮ
21:01:36  ​ꙮ is the official Unicode character of #esoteric.
21:01:49  I forget what it's called..
21:01:52  `unidecode ꙮ
21:01:54  ​[U+A66E CYRILLIC LETTER MULTIOCULAR O]
21:01:58  oh, right.
21:02:59  how can you pronounce my limerick without knowing what that letter is called
21:03:33 -!- TieSoul has quit (Remote host closed the connection).
21:17:10 -!- Lord_of_Life has quit (Ping timeout: 250 seconds).
21:17:29  That was why I looked it up.
21:28:38 -!- bb010g has quit (Quit: Connection closed for inactivity).
21:35:36 -!- hppavilion[1] has quit (Ping timeout: 265 seconds).
21:43:00  FireFly: Now you must write a Unicode poem.
21:51:40 -!- p34k has quit.
21:51:56 -!- p34k has joined.
21:53:38 -!- Lord_of_Life has joined.
21:58:25 -!- p34k has quit.
21:58:38 -!- p34k has joined.
21:58:56 -!- p34k has quit (Client Quit).
21:59:06 -!- Lord_of_Life has quit (Ping timeout: 255 seconds).
21:59:28 -!- p34k has joined.
21:59:29 -!- Welo has quit (Quit: Leaving).
22:05:59 -!- J_Arcane_ has joined.
22:07:30 -!- J_Arcane has quit (Ping timeout: 265 seconds).
22:07:39 -!- J_Arcane_ has changed nick to J_Arcane.
22:08:20 -!- hppavilion[1] has joined.
22:10:30 -!- lolcat has changed nick to user.
22:17:39 -!- bb010g has joined.
22:27:41 -!- Sprocklem_ has quit (Ping timeout: 246 seconds).
22:29:08 -!- noob_prodigy_ has joined.
22:59:09 -!- Veltas has joined.
23:00:23  I've looked on Google and it's hard to find material on Brainfuck and I can't figure it out myself: How does one go about /copying/ (as opposed to moving) one cell's contents into another cell?
23:01:48  noob_prodigy_: you move the cell to two other cells, then move one of them back to the original cell
23:02:28  ahh that makes sense, thanks
23:02:48  I have the same question about x86 and registers. There's only a move instruction, no copy instruction.
23:03:38 -!- J_Arcane_ has joined.
23:03:52  shachaf: for x86, you zero the other register, then add the value from the first one. move instructions are rarely useful, and they have fewer encodings than arithmetic instructions.
23:04:07  :)
23:04:19 -!- hppavilion[1] has quit (Ping timeout: 245 seconds).
23:04:58 -!- J_Arcane has quit (Ping timeout: 256 seconds).
23:05:03 -!- J_Arcane_ has changed nick to J_Arcane.
23:06:10  The x86 add instruction is LEA, right?
23:08:06  shachaf: there's more than one add instructions. these days you have XADD and stuff like that too. 
23:11:21  FireFly: I'm surprised you didn't know about ꙮ already
23:12:28  I did, I had just forgotten its name
23:12:38  I don't use it too often
23:12:43  why not?
23:12:57  olsner uses it in his prose
23:13:40  yeah, but my poetry's alphanumeric
23:14:03  To be fair, so is multiocular o.
23:14:22  how odd, I haven't realized before
23:37:12 -!- hppavilion[1] has joined.
23:39:22 -!- Veltas has quit (Quit: Veltas).
23:42:11 -!- mauris has quit (Ping timeout: 264 seconds).
23:43:02 -!- p34k has quit.
23:44:05 -!- jaboja64 has quit (Remote host closed the connection).
23:45:39 -!- Lord_of_Life has joined.
23:47:36 -!- Lord_of_Life has quit (Excess Flood).