00:00:51 `? fowl 00:00:52 fowl? ¯\(°​_o)/¯ 00:02:47 fowl: I wrote “They are a sneaky kind of chicken.” in your section header. 00:18:14 `quote `quote 00:18:15 307) `quote django ​352) django is named after a person? thought it would be a giraffe or something thankfully only one \ 308) `quote django ​352) django is named after a person? thought it would be a giraffe or something \ 407) `quote django 00:23:16 `quote laukaa 00:23:17 819) fungot: what's your view on angels and other otherworldly beings? olsner: well i'm mentioning theoretical image to be dumped in rain forests of laukaa. 00:23:52 -!- nisstyre has quit (Quit: WeeChat 0.4.3). 00:24:16 -!- nisstyre has joined. 00:28:17 -!- edwardk has quit (Quit: Computer has gone to sleep.). 00:32:16 -!- mhi^ has quit (Quit: Lost terminal). 00:32:52 -!- yorick has quit (Remote host closed the connection). 00:33:45 -!- tromp has joined. 00:56:14 -!- Phantom_Hoover has quit (Ping timeout: 258 seconds). 00:56:50 -!- tromp has quit (Remote host closed the connection). 01:05:15 -!- shikhout has quit (Remote host closed the connection). 01:14:42 -!- boily has quit (Quit: SIDE CHICKEN). 01:14:45 -!- metasepia has quit (Remote host closed the connection). 01:27:58 -!- aloril has quit (Ping timeout: 240 seconds). 01:42:07 -!- aloril has joined. 02:02:11 -!- Phantom_Hoover has joined. 02:28:18 -!- edwardk has joined. 02:34:30 -!- edwardk has quit (Quit: Computer has gone to sleep.). 02:35:45 no, blunt, that is not a good way to convince humans not to do something. 02:36:41 blaze it? 02:36:56 wat 02:37:42 NO RELATION 02:38:31 (this is freefall btw) 02:47:07 -!- edwardk has joined. 02:47:27 -!- oerjan has quit (Quit: Nity). 02:49:00 -!- ^v has quit (Quit: http://i.imgur.com/Akc6r.gif). 02:57:26 -!- ^v has joined. 03:03:33 -!- Phantom_Hoover has quit (Remote host closed the connection). 03:20:48 -!- edwardk has quit (Quit: Computer has gone to sleep.). 03:36:57 -!- john3213 has joined. 03:42:00 -!- john3213 has left. 04:18:47 -!- tromp has joined. 04:18:51 -!- tromp has quit (Remote host closed the connection). 04:44:08 -!- Sorella has quit (Quit: It is tiem!). 05:07:29 -!- hk3380 has quit (Ping timeout: 264 seconds). 05:11:30 -!- Guest49187 has joined. 05:12:25 -!- Guest49187 has left. 05:12:29 -!- Guest49187 has joined. 05:12:35 -!- Guest49187 has left. 05:40:45 -!- MDude has changed nick to MDream. 05:42:29 -!- password2 has joined. 05:44:45 -!- adu has joined. 06:00:19 -!- hk3380 has joined. 06:25:24 -!- adu has quit (Quit: adu). 06:28:05 -!- edwardk has joined. 06:36:18 -!- ^v has quit (Quit: http://i.imgur.com/Akc6r.gif). 06:45:10 -!- ^v has joined. 06:49:28 -!- ^v has quit (Client Quit). 06:52:06 -!- idris-bot has quit (Quit: Terminated). 06:56:53 Is there a fast way to find a,b for u*a + v*b + ab = z? 06:57:43 given what? 06:58:04 mroman: a*b? 06:58:32 Bike: given that a != 0 and b != 0 06:58:41 i mean, which of u,v,z 06:58:49 given u,v and z 06:59:12 well, it is equivalent to `(u+a)*(v+b) = z + u*v`, so it is really a factorization problem? 06:59:24 and u != 0 and v != 0 06:59:34 and z != 0 for that matter :) 07:01:19 so there's no way to solve it over the integer 07:01:23 i.e. like diophantines? 07:01:35 if it's a factorization problem then the answer is probably no. 07:02:03 I don't know 07:02:39 well it's diophantine but also linear, so probably not impossible 07:03:33 um, i think so anyway. 07:06:16 well, if you can solve it efficiently you might also be able to solve factorization efficiently ;) 07:07:55 -!- idris-bot has joined. 07:08:04 would it help if a = b? 07:08:23 i.e. u*a + v*a + a^2 = z 07:08:26 oh wait 07:08:31 that's a quadratic equation? 07:08:41 yeah, i guess it's not linear anyway. 07:08:59 but hey! that pretty fucking constrains the solutions 07:09:12 :D 07:11:55 too much of a constraint 07:12:34 mroman, indeed; a^2 + (u+v)a - z = 0, so rational root theorem gives that `a` can only be one of +/- 1/z' where z divides z'. 07:12:56 ah 07:13:01 +/- z', sorry 07:13:19 so it is a factorization problem again! 07:13:45 hooray 07:15:47 but a easier one than the original 07:15:51 that was the point actually 07:17:01 yes, i suppose square root is easier to compute 07:17:24 mroman: just out of curiosity, what's the context of that problem? 07:17:27 -!- conehead has quit (Quit: Computer has gone to sleep). 07:18:30 Bike: not the square root 07:19:04 lifthrasiir: prime factorization 07:19:19 product of two primes 07:19:28 semiprime factorization? 07:20:17 `pbflist 07:20:18 pbflist: shachaf Sgeo quintopia ion 07:20:27 should've signed up for deluxe 07:21:29 lifthrasiir: yep 07:23:17 but it also works for regular numbers too 07:27:59 it's a silly thing though 07:28:27 the closer together factors are the easier it is to factorize the number 07:29:00 pretty much obvious 07:32:19 lifthrasiir: I was just looking for some really easy to implement factorization method that is faster than O(sqrt(n)) and doesn't require a table or large amounts of memory 07:35:01 mroman: how large is your input range? 07:37:33 0..2^64 currently 07:38:28 is this like, an instruction for your isa 07:39:06 -!- shikhin has joined. 07:39:16 isa? 07:39:28 something like http://stackoverflow.com/a/2274520 ? 07:39:31 instruction set 07:39:34 -!- shikhin has changed nick to Guest8266. 07:39:51 Bike: yeah :) 07:40:52 well, rho doesn't need a table, it seems 07:41:04 -!- Guest8266 has quit (Client Quit). 07:41:14 nondeterministic, tho 07:41:22 -!- shikhout has joined. 07:41:29 that's the problem 07:41:42 oh, i remember reading about brent's cycle thing before... 07:42:19 http://codepad.org/5sFOZjZB <- that's essentially it 07:42:24 -!- shikhout has changed nick to foofoo. 07:42:26 u and v are guesses of two factors 07:42:37 i.e ceil(sqrt(n)) 07:42:39 -!- foofoo has changed nick to shikhout. 07:42:48 and depending on how good you guessed the faster it is 07:43:09 it also does a trial division "on-the-side" 07:43:18 for numbers ilke 11*17*607*353*... 07:43:37 which would take much more time by just adjusting the guess because there's a really small factor in it 07:44:21 -!- shikhout has changed nick to shikhin. 07:46:42 seems like an odd thing to put as an instruction, too. "even polynomial evaluation would make more sense to me" 08:02:26 -!- Tritonio has joined. 08:15:09 -!- password2 has quit (Ping timeout: 265 seconds). 08:20:23 -!- augur has quit (Ping timeout: 252 seconds). 08:24:29 Good morning" 08:25:55 "Morning". 08:26:54 -!- MindlessDrone has joined. 08:28:34 -!- Bike has quit (Ping timeout: 240 seconds). 08:34:29 -!- MindlessDrone has quit (Ping timeout: 264 seconds). 08:36:14 -!- augur has joined. 08:45:06 -!- nooodl has joined. 08:45:29 -!- Patashu has joined. 08:49:14 -!- nooodl has quit (Ping timeout: 240 seconds). 08:49:15 -!- MindlessDrone has joined. 09:34:19 Hello. 09:36:32 -!- Tritonio has quit (Ping timeout: 255 seconds). 09:36:40 Hi, syndrome 09:45:36 -!- edwardk has quit (Quit: Computer has gone to sleep.). 09:51:13 -!- Patashu_ has joined. 09:51:13 -!- Patashu has quit (Disconnected by services). 09:53:55 @ask Bike like horner? 09:53:55 Consider it noted. 10:33:18 -!- Phantom_Hoover has joined. 10:40:33 one possible constraint would be u = v 10:40:39 leading to (a + b)*u + a*b = z 10:40:49 which is probably not easier to solve 10:46:37 -!- Phantom__Hoover has joined. 10:49:59 -!- Phantom_Hoover has quit (Ping timeout: 252 seconds). 10:55:30 I should ask int-e to export gcdExtInteger so lambdabot can factor numbers 10:58:29 read that as "godExtInteger" and got mildly confused 10:59:16 fungot ex integer 10:59:16 Jafet: and, i've learned! i'll just move back here and never speak again in the next story. it's like david, and we never will! what's to be gained the ability to look back and be aghast at all the animals we kill and eat us probably! if not, we can make the cutest cards ever for a series of puns. 10:59:51 how do I check what style is fungot currently using? 10:59:51 nortti: t-rex, i don't know a few dollars! you're on! it only claims that there, chocochops have a different chemical makeup, but taste and never gets old and is everyone's favorite, without a little placard beneath that, " you must punch! i love drinking delicious punch, probably because of how it's so delicious because i like to keep my friends and status in society, i am, a little! 11:00:24 ^style 11:00:24 Available: agora alice c64 ct darwin discworld enron europarl ff7 fisher fungot homestuck ic irc iwcs jargon lovecraft nethack oots pa qwantz* sms speeches ss wp youtube 11:00:29 ah 11:01:28 Isn't it weird that a small corpus makes better fungot 11:01:28 Jafet: as a man concerned, t-rex, that going shopping was your default activity? 11:01:58 ^style darwin 11:01:58 Selected style: darwin (Books by Charles Darwin -- you know, that evilution guy) 11:03:51 fungot can now select words naturally. 11:03:52 Jafet: hon. john collier, for/ long- styled form,/ tubes were larger in every dimension. " 3? 3. falconer, that/ plants must have been a little timid in publishing their belief on this head: prof. fnord in. 11:04:21 "plants must have been a little timid in publishing their belief on this head" 11:04:44 also, where does the "fnord" come from? 11:05:18 Shy as a violet 11:05:44 `quote fnord fnord fnord 11:05:44 1183) fungot has not done me any harm yet int-e: no niinku pl niinku fnord niinku fnord fnord fnord 11:05:58 ;D 11:08:15 I wonder what choice word charlie had that was worthy of fnording out 11:11:24 -!- KingOfKarlsruhe has joined. 11:13:54 [wiki] [[Talk:Brainfuck]] http://esolangs.org/w/index.php?diff=39558&oldid=39557 * Maxdefolsch * (+444) /* My optimizing interpreter again */ 11:36:31 -!- shikhout has joined. 11:36:59 -!- yorick has joined. 11:39:36 -!- shikhin has quit (Ping timeout: 265 seconds). 11:43:04 -!- boily has joined. 11:53:43 > [[x|y<-[1..n],y `mod` x == 0]|n<-[1..10]] 11:53:45 Ambiguous occurrence ‘x’ 11:53:45 It could refer to either ‘L.x’, defined at L.hs:150:1 11:53:45 or ‘Debug.SimpleReflect.Vars.x’, 11:53:45 imported from ‘Debug.SimpleReflect’ at L.hs:110:1-26 11:53:45 (and originally defined in ‘simple-reflect-0.3.2:De... 11:53:54 aha 11:54:13 > [[x|y<-[1..n],y `mod` x == 0]|x<-[1..10]] 11:54:14 [*Exception: not an integer: n 11:54:27 > [[x|y<-[1..x],y `mod` x == 0]|x<-[1..10]] 11:54:28 [[1],[2],[3],[4],[5],[6],[7],[8],[9],[10]] 11:54:30 last try 11:54:43 damn 11:54:49 > [[x|y<-[1..x],x `mod` y == 0]|x<-[1..10]] 11:54:51 [[1],[2,2],[3,3],[4,4,4],[5,5],[6,6,6,6],[7,7],[8,8,8,8],[9,9,9],[10,10,10,10]] 11:55:00 *hide* 11:55:13 > [[y|y<-[1..x],x `mod` y == 0]|x<-[1..10]] 11:55:15 [[1],[1,2],[1,3],[1,2,4],[1,5],[1,2,3,6],[1,7],[1,2,4,8],[1,3,9],[1,2,5,10]] 11:55:28 I officially won the record for most errors in a single line of code :D 11:59:02 Hmm, there's no Zelda fungot. 11:59:03 MDream: charles island. but it has not turned out far more crooked and confused than it is, however, were strongly affected;/ first having all/ tentacles but thirty-six inflected; after 6 hrs. surrounding fluid just tinged pink; they were then left in water for 24 hrs. 11:59:54 -!- MDream has changed nick to MDude. 12:00:12 That does not sound like a good time to have tentacles. 12:00:33 Might be even worse for boned limbs, though. 12:04:27 tentacle conjugation is ever so complex. 12:20:40 -!- Sgeo has quit (Read error: Connection reset by peer). 12:29:27 -!- rodgort has quit (Quit: ERC Version 5.3 (IRC client for Emacs)). 12:31:38 -!- impomatic has quit (Ping timeout: 240 seconds). 12:32:05 -!- boily has quit (Quit: WeeChat 0.4.2). 12:33:07 -!- rodgort has joined. 12:36:37 -!- shikhout has changed nick to shikhin. 12:47:41 -!- aloril has quit (Ping timeout: 252 seconds). 12:54:16 -!- aloril has joined. 12:55:41 -!- Sorella has joined. 12:57:04 -!- tromp has joined. 12:57:39 -!- tromp has quit (Remote host closed the connection). 12:58:34 -!- edwardk has joined. 13:23:35 -!- Phantom___Hoover has joined. 13:25:14 -!- Phantom__Hoover has quit (Ping timeout: 240 seconds). 13:26:56 -!- Patashu_ has quit (Ping timeout: 255 seconds). 13:27:17 -!- augur has quit (Ping timeout: 264 seconds). 13:28:01 -!- Phantom___Hoover has quit (Ping timeout: 252 seconds). 13:30:28 -!- augur has joined. 13:32:24 -!- oerjan has joined. 13:34:48 7 13:37:11 no octopus? 13:38:08 octopi don't send spam. this is one of the many ways in which they are superior to humans. 13:39:13 this is only because they haven't figured out how to use keyboards yet 13:39:35 just you wait, one day octopodes will be the most pernicious senders of spam on the planet 13:39:40 We jsut need to give them some that are water-resistant. 13:40:12 (the last message before oerjan's "7" was something about tentacle conjugation, whatever that is.) 13:40:14 not only are they greedy, they have no compassion 13:41:27 Would probably hlep to let them live longer than three years, since they'll spend a big chunk of that just growing up from tiny hatchlings and, then they need to learn how to read. 13:41:53 That second comma should be one word to the left. 13:43:47 they only live three years: another one of the many ways in which they are superior to humans 13:45:58 People who know more about C, someone in another channel is asking whether "*(u8_t *)ADDRESS_LITERAL_MACRO[64]" is valid 13:54:56 I'm pretty sure that sort of depends on what ADDRESS_LITERAL_MACRO expands to, or is. 13:56:39 (Guessing from the name, probably not.) 13:57:21 The precedence goes *(u8_t *)(ADDRESS_LITERAL_MACRO[64]) anyway, so if it is something you can stick [64] after, then it's at least syntactically sensible. 13:58:25 i'd imagine the precedence, too, depends on what it expands to. 13:58:36 Taneb: it is something along the lines of 0x0450 being a hex representation of a memory address on a peice of hardware 14:00:47 -!- augur has quit (Quit: Leaving...). 14:02:36 If it expands to an integer constant, then that's not okay. 14:02:51 (And I was about to come back to mention what oerjan said.) 14:04:31 perhaps (*(u8_t *)ADDRESS_LITERAL_MACRO)[64] 14:04:40 -!- KingOfKarlsruhe has quit (Quit: Leaving.). 14:04:50 That doesn't really make sense either, unless u8_t is a pointer type. 14:05:07 Plain *(u8_t *)ADDRESS_LITERAL_MACRO would be quite reasonable, and ((u8_t *)ADDRESS_LITERAL_MACRO)[64] wouldn't be too bizarre either, but that's about it. 14:05:47 The type of (*(u8_t *)ADDRESS_LITERAL_MACRO) is u8_t (not u8_t *), and it doesn't *sound* like something you can [64], but of course it *could* be. 14:06:07 I need to run now. -> 14:06:14 Bye! 14:10:06 -!- impomatic has joined. 14:18:56 -!- hk3380 has quit (Ping timeout: 258 seconds). 14:21:39 -!- sign has quit (Ping timeout: 252 seconds). 14:24:15 -!- Bike has joined. 14:37:48 @tell fizzie Ajsdf says thanks 14:37:48 Consider it noted. 14:43:00 [wiki] [[Talk:Brainfuck]] http://esolangs.org/w/index.php?diff=39559&oldid=39558 * Oerjan * (+170) /* My optimizing interpreter again */ binaries 14:45:35 [wiki] [[PHL 1.0]] M http://esolangs.org/w/index.php?diff=39560&oldid=39554 * Oerjan * (+20) /* Examples */ links 14:46:28 [wiki] [[PHL 1.0]] M http://esolangs.org/w/index.php?diff=39561&oldid=39560 * Oerjan * (+4) /* Computational class */ another link 14:49:34 -!- nooodl has joined. 14:57:05 -!- sign has joined. 14:59:50 -!- sign has quit (Changing host). 14:59:50 -!- sign has joined. 15:11:49 -!- augur has joined. 15:15:54 hm. 15:16:10 I hope this isn't just a coincidence 15:17:51 -!- edwardk_ has joined. 15:18:33 -!- hk3380 has joined. 15:19:07 -!- edwardk has quit (Ping timeout: 240 seconds). 15:23:47 -!- FreeFull has joined. 15:24:15 mroman, ? 15:25:07 -!- augur has quit (Ping timeout: 240 seconds). 15:26:17 Taneb: (q + a)*(r + a) = b 15:26:30 I'm trying to find q and r, so that the above equation holds 15:28:45 "factorization" hth 15:30:12 this conversation makes the uncomputability of diophantines make a lot more sense 15:30:53 mroman: yes, like horner. i was thinking of the perennial "lol CISC" instruction. http://uranium.vaxpower.org/~isildur/vax/week.html 15:33:31 mroman, So... (q + 1) * (r = 1) = b/a? 15:34:25 What do you know about all the values? 15:36:37 they are all positive integers 15:37:55 * oerjan fails Taneb in algebra 15:41:20 * oerjan swats Taneb for responding with insufficient horror -----### 15:41:26 you should learn from boily 15:42:16 sorry, *not responding with sufficient 15:42:51 -!- augur has joined. 15:44:18 * oerjan fails himself in grammar 15:44:23 AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA 15:47:34 I think no matter how many A's you give yourself, it won't become a failing grade. 15:48:15 flailing grade 15:48:16 * oerjan fails himself in grading 15:48:17 oerjan, aaaaaah what did I do 15:48:21 FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF 15:48:51 Taneb: i'm pretty sure (q + 1) * (r = 1) = b/a is not equivalent to (q + a)*(r + a) = b 15:49:17 Well, the = was a type 15:49:19 *typo 15:49:22 It should be + 15:49:32 Oh dear god you are right 15:49:35 What am I 15:49:41 Some kind of monster evidently 15:49:57 thank you for relieving of the need to say so, Taneb 15:50:00 *me 15:50:10 * oerjan fails himself in grammar again 15:50:38 i seem to be out of capital letters 15:50:44 please don't relieve yourself on the channel?! 15:50:59 english is a horrible language. 15:51:04 int-e: okay 15:52:06 -!- oerjan has quit (Quit: RRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR). 15:58:02 mroman, if they're all positive integers, q > 1 16:01:27 q and r are both always > 1 16:01:42 b too for that matter 16:08:46 -!- Phantom_Hoover has joined. 16:13:24 -!- Bike has quit (Ping timeout: 252 seconds). 16:15:12 -!- Bike has joined. 16:17:45 `olist (952) 16:17:47 olist (952): shachaf oerjan Sgeo FireFly boily nortti 16:18:16 vielen dank, shachaf 16:20:47 -!- mhi^ has joined. 16:24:33 -!- conehead has joined. 16:33:59 -!- kmc has joined. 16:34:09 This is odd 16:34:22 The IP address of a website I wanted to visit is gone from DNS 16:36:24 google's rubik's cube is made using CSS transforms 16:38:50 -!- boily has joined. 16:39:46 Not surprising 16:40:07 Dammit, I can't find anything on the internet indicating why the website is not accessible 16:40:24 Other than that it seems that other people are also searching for why it isn't accessible 16:40:45 I was wondering if it was WebGL, but I guess that's still not so widely supported 16:43:49 I find physical rubik's cubes much easier to solve than computerised ones 16:48:05 how do i rotate the cube? 16:49:09 you click in the emptiness and drag. 16:56:16 boily: this sounds like a philosophy of life 16:59:58 I prefer to ride a bike through the Lanes of Nothingness, under the Shade of the Void Trees. 17:03:02 [wiki] [[0(nop^)]] N http://esolangs.org/w/index.php?oldid=39562 * John Misciagno * (+1261) Created page with "'''0(nop^)''' is a stack-based esoteric programming language with numeric function names. == Operators == '''+''', '''-''', '''*''', '''/''', '''%''', '''<''', '''>''', and ..." 17:05:24 interesting fishy etymology → http://en.wikipedia.org/wiki/Abudefduf 17:08:14 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39563&oldid=39562 * John Misciagno * (+95) 17:09:43 -!- conehead has quit (Quit: Computer has gone to sleep). 17:10:06 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39564&oldid=39563 * John Misciagno * (-25) 17:11:18 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39565&oldid=39564 * John Misciagno * (-38) 17:14:18 -!- password2 has joined. 17:14:51 -!- conehead has joined. 17:21:48 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39566&oldid=39565 * John Misciagno * (-31) 17:25:49 -!- conehead has quit (Quit: Computer has gone to sleep). 17:26:23 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39567&oldid=39566 * John Misciagno * (+68) 17:28:51 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39568&oldid=39567 * John Misciagno * (-8) 17:29:27 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39569&oldid=39568 * John Misciagno * (+16) 17:29:58 -!- conehead has joined. 17:38:44 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39570&oldid=39569 * John Misciagno * (+2) 17:40:16 -!- shikhin has quit (Ping timeout: 240 seconds). 17:42:14 -!- shikhin has joined. 17:43:50 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39571&oldid=39570 * John Misciagno * (+31) 17:49:59 Is the only way to recurse / loop in 0(nop^) via ( ) and ^? 17:50:17 -!- Slereah has joined. 17:52:16 -!- Slereah_ has quit (Ping timeout: 276 seconds). 17:55:42 -!- Manu has joined. 17:55:54 Hello 17:56:06 -!- Manu has changed nick to Guest58936. 17:56:15 -!- Guest58936 has changed nick to Cyragia. 17:56:20 anyone online ? 17:56:27 if you really don't like java but have to write something for jvm, which language would you choose? 17:56:29 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39572&oldid=39571 * John Misciagno * (+250) 17:57:02 Cyragia: quite a few of us, yes. first time on #esoteric? 17:57:07 yes 17:57:12 myname: clojure. 17:57:55 Cyragia: what brings you here? which esolangs do you like? are you working on some? do you like your steak rare, medium or well-done? 17:58:23 boily: i was told clojure software takes pretty long to start 17:58:36 interst. FALSE. yes. well-done. 17:58:44 *interest 17:58:46 :p 17:59:10 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39573&oldid=39572 * John Misciagno * (+21) 17:59:24 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39574&oldid=39573 * John Misciagno * (+1) 17:59:37 myname: I wouldn't know, but afaik clojure is the most active and interesting non-java jvm language out there. do you have performance needs? 18:00:25 I'm making my first language/compiler, heavily influenced by FALSE and alike 18:00:25 Cyragia: good choice; have your taken a look at betterave? (shameless self-plug). care to give more details? you heretic! 18:00:47 boily: well, i am targeting android, so... yes 18:01:45 oh. hm. eeeeeh... you could go the phonegap way, but last time I checked documentation was scarce and not quite up to date. 18:02:45 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39575&oldid=39574 * John Misciagno * (-36) 18:02:52 boily: people recommended libgdx which looks somewhat usable 18:03:11 i know about phonegap, but tbh i do hate javascript, too 18:03:14 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39576&oldid=39575 * John Misciagno * (+0) 18:04:59 boily: betterave looks, cool. But I'm making something stack-based 18:05:54 * nortti notices a trend of stack based langs in recent times 18:06:07 stacks are cool! 18:06:27 I aslo noticed there are a lot of stack based esolangs, but barely any 'normal' languages 18:06:57 that's because they aren't really practical 18:07:03 well, there is a forth but it is borderline esolang 18:07:04 at least purely stack based 18:07:12 then Joe, which look interesting 18:07:17 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39577&oldid=39576 * John Misciagno * (+58) 18:08:21 I'm trying to desing something that's as easy as possible to write a compiler for, yet relatively useable and pretty low-level 18:08:38 yeah, in that case stacks just make sense (tm) 18:09:28 My goal is to be able to compile every expression on it's own, in one pass preferably 18:11:08 -!- MoALTz has joined. 18:11:58 I'm a bit stuck on how to do variables 18:12:05 stack 18:12:34 you mean allocate mem on stack, or just push/pop ? 18:12:35 boily: have you lost all your creativity? there have been no new vegetables on the wiki in a long time 18:13:08 Cyragia: allocate mem on stack 18:13:43 the allocation isn't really the problem, i could just add a data section to my elf file 18:14:22 quintopia: I'm background-cogitating on my next one. I still need a way to make it evil. *pouring rain* *thunder* *lightning* *hth* 18:14:36 then what's the problem? 18:14:50 boily: what non-evilness have you got 18:15:06 the problem is, either i put code and data in a single section and just put the variable wherever it is defined (at compile-time), but that's a bit messy 18:15:18 https://bitbucket.org/mroman_/emulathor/src/fc48fe22fdade5777099eea372e5f06e2b4d2b2b/src/compiler/rlang.y?at=master <- it's crappy code but it's a working one-pass compiler 18:15:20 -!- heroux has quit (Ping timeout: 245 seconds). 18:15:24 speaking of forth, I remember reading a long tutorial a while ago. it was a text file à la RFC, and had nice ascii diagrams. but I can't find it :( 18:15:54 the easiest thing to do for a one-pass is to compile everything the same way imo 18:16:04 i.e use push/pop even if it's not necessary 18:16:08 Factor and Retro are pretty much stack based and appear to be popular. 18:16:10 -!- heroux has joined. 18:16:13 that way you don't need register allocation or anything like that 18:16:19 quintopia: splitting the tokens and merging the parts together in a haphazard way. I want to make the whole thing aperiodic tiling. 18:16:27 I could just give some mem region to the programmer and use something like defines to convert names into addresses 18:16:31 Cyragia: have you seen Mouse? If you like FALSE, you'll probably like Mouse. 18:16:39 no, I'll check it out 18:17:15 ah 18:17:27 Cyragia: address resolution is your problem? 18:17:43 boily: one day you should make a metalanguage called "vegetale". instead of a scoping system, it just has "scoping" where you can define how scoping works. instead of a type system, it just has "typesystem" which lets you define your own type system. best language ever. 18:17:45 are you compiling to asm? 18:17:52 yes 18:17:54 oh 18:18:02 then the assembler can do the adress resolution :D 18:18:07 straight to an x86 elf file 18:18:11 oh 18:18:13 ok 18:18:17 so no assembler :) 18:18:39 quintopia: Légume! 18:19:17 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39578&oldid=39577 * John Misciagno * (+8) 18:19:36 om nom nop 18:19:59 Cyragia: Depending on how high-level your language should be you could just give the programmer some memory that is addressable by index 18:20:04 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39579&oldid=39578 * John Misciagno * (+1) 18:20:11 yeah, i guess i'll do that 18:20:14 i.e pushloc index and poploc index 18:20:27 and just #defines or smth for names 18:20:32 which is essentialy mem[index] = pop(); and push(mem[index]); 18:20:43 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39580&oldid=39579 * John Misciagno * (-1) /* Hello, world! */ 18:21:21 I already have : and ; for store and load 18:21:32 so my variable would just be pointers anyway 18:22:00 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39581&oldid=39580 * John Misciagno * (-4) /* Hello world! */ 18:24:03 my current writeup of my language: http://pastebin.com/WNjpDgYr 18:24:31 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39582&oldid=39581 * John Misciagno * (+0) /* Hello world! */ 18:24:48 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39583&oldid=39582 * John Misciagno * (+6) 18:27:13 mroman: but when i'd just give the programmer a chunk of memory it'd probably be allocated somewhere around here: 0x08048000. so you can't just use 0, 1, 2, ... as addresses 18:34:38 -!- MindlessDrone has quit (Ping timeout: 240 seconds). 18:40:48 why not? 18:41:02 you have to adjust for sizeof of course 18:41:17 and you can use an offset 18:41:19 what's the problem? 18:41:21 indeed 18:41:36 mov ebx, [mem] 18:41:42 mov eax, [ebx+ecx] 18:41:43 but i also want it to be able to read any regular memory address 18:41:48 something like that I guess 18:41:53 so i can do low-level trickery 18:42:00 hm 18:42:02 mov ebx, mem actually 18:42:10 depending on what assembler syntax you're used to :D 18:42:40 like: push 0x08048123 (dereference) voila! 18:43:59 or i could add the offset to the define and when you puch a regular address it would behave normally 18:44:35 best of both worlds :) 18:44:56 or you just let the programmer use low-level adresses 18:45:05 i.e he has to know where his mem stuff is 18:45:17 hm. no 18:45:24 that would be the easiest 18:45:29 yeah 18:45:39 but how do you tell him where it is? 18:45:52 but if the offset is something like 0x080484218 it get's quite complicated 18:45:56 i mean you could add a command that pushes the offset to the local memory to the stack 18:45:56 it could be fixed 18:46:04 where are the finns 18:46:09 so he can calculate positions of stuff himself 18:46:15 quintopia: in finland? 18:46:25 are you a finn nortti 18:46:28 yes 18:46:37 I'd rather resolve it at compile-time 18:46:46 nortti: what is Topi usually short for 18:47:09 I do not think it is an acronym 18:47:14 it's a name 18:47:22 yes, it is a man's name 18:47:28 what's it short for 18:47:34 nothing? 18:47:40 that's a full name? 18:47:43 yes 18:47:49 huh 18:48:17 -!- hk3380 has quit (Ping timeout: 264 seconds). 18:49:30 -!- realzies has quit (Ping timeout: 245 seconds). 18:50:32 -!- hk3380 has joined. 18:50:41 -!- MindlessDrone has joined. 18:54:54 mroman: I'll use the equivalent of: #define varname 0x20 (with the offset added at compile-time) 19:03:14 -!- realzies has joined. 19:13:32 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39584&oldid=39583 * John Misciagno * (+92) 19:15:32 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39585&oldid=39584 * John Misciagno * (+35) 19:18:04 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39586&oldid=39585 * John Misciagno * (+43) 19:19:16 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39587&oldid=39586 * John Misciagno * (+5) 19:26:34 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds). 19:31:13 -!- MindlessDrone has quit (Quit: MindlessDrone). 19:32:50 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39588&oldid=39587 * John Misciagno * (+4) 19:34:27 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39589&oldid=39588 * John Misciagno * (+3) 19:39:49 -!- MDude has quit (Ping timeout: 252 seconds). 19:42:39 -!- Phantom_Hoover has joined. 19:46:48 -!- Cyragia has quit (Ping timeout: 240 seconds). 19:48:44 A few new players have entered the Core War Tournament so if you fancy having a go not everyone you'll be up against will be a pro :-) 19:51:42 -!- nycs has joined. 19:53:15 -!- hogeyui has quit (Ping timeout: 245 seconds). 19:53:20 -!- mhi^ has quit (Quit: Lost terminal). 19:53:38 -!- hogeyui has joined. 19:53:38 -!- Gracenotes_ has quit (Ping timeout: 240 seconds). 19:53:58 -!- boily has quit (Ping timeout: 240 seconds). 19:54:23 -!- boily has joined. 19:54:30 -!- `^_^v has quit (Ping timeout: 245 seconds). 19:54:38 -!- tromp__ has joined. 19:54:55 -!- tromp_ has quit (Ping timeout: 245 seconds). 19:55:36 -!- Gracenotes has joined. 19:55:55 -!- aloril has quit (Ping timeout: 240 seconds). 19:58:28 -!- edwardk_ has quit (Quit: Computer has gone to sleep.). 20:11:34 -!- hk3380 has quit (Ping timeout: 240 seconds). 20:12:17 -!- mhi^ has joined. 20:14:36 -!- nycs has changed nick to `^_^v. 20:14:55 -!- password2 has quit (Read error: Connection reset by peer). 20:17:10 -!- hk3380 has joined. 20:21:46 -!- Sorella has quit (Ping timeout: 276 seconds). 20:21:50 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39590&oldid=39589 * John Misciagno * (+59) 20:22:01 that edit spam 20:24:01 -!- aloril has joined. 20:24:47 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39591&oldid=39590 * John Misciagno * (+1) 20:33:36 impomatic: what tournament? 20:34:09 is there an eso hill? 20:37:20 mroman: Core War. You can enter by email. Tournament takes place at the computer museum in Cambridge, U.K. http://corewar.co.uk/spring2014.htm 20:37:48 nice https://firstlook.org/theintercept/article/2014/05/19/data-pirates-caribbean-nsa-recording-every-cell-phone-call-bahamas/ 20:40:45 -!- boily has quit (Quit: INCOMING CHICKEN). 20:42:14 mroman: eso hill would be http://esolangs.org/wiki/BF_Joust 20:42:22 !bfjoust shortsword (>++>--)*2(>)*6([-[+]]>)*20 20:43:11 No egobot? 20:45:04 -!- mhi^ has quit (Ping timeout: 240 seconds). 20:45:32 "Entries can be up to 25 instructions" 20:45:36 hm. ok.... 20:46:43 "Completely changing the program's behaviour or swapping / adding extra components for each core size is not allowed." 20:46:47 why not 20:46:50 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39592&oldid=39591 * John Misciagno * (+26) 20:46:51 if someone can do that in just 25 instructions 20:47:02 -!- mhi^ has joined. 20:47:12 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39593&oldid=39592 * John Misciagno * (+0) 20:47:23 so 20:47:34 I can't switch to a different algo if CORESIZE > 800? 20:47:46 that seems like an odd restriction 20:47:56 but ok 20:48:00 I'll submit an imp then :D 20:48:13 Everybody should at least submit an imp 20:48:24 mroman: the same program has to do well in each coresize. Otherwise it might as well be a tournament with three rounds! 20:48:41 yeah "the same program" 20:48:53 but why forbid if(coresize > 800) jump foo kinda stuff? 20:49:19 It's forbidden because you could just enter three completely different programs: 20:49:24 for CORESIZE == 800 20:49:27 program1 20:49:30 rof 20:49:36 for CORESIZE==8000 20:49:39 program2 20:49:40 impomatic: yeah 20:49:42 etc 20:49:47 but you're still limited to 25 instructions *TOTAL* 20:49:59 so that only leaves 25/4 instructions per "sub"-program 20:50:07 hm 25/3 actually 20:50:20 minus the overhead for the switch 20:51:36 I have two programs on the most active hill which are only 9 instructions. :-) http://www.koth.org/lcgi-bin/current.pl?hill94nop 20:53:14 so 20:53:17 you're "inversed"? 20:53:28 No, John M. 20:53:41 ah 20:54:30 well 20:54:42 I guess I should at least submit some two stage bomber 20:55:01 my vampire.red is much longer than 25 instructions and I know it sucks 20:55:15 Oneshots are easy to program. Just a scan loop (e.g. scan add #step, pointer / jmz.f scan, @pointer) followed by a clear (sequential wipe of memory starting whatever the scan found) 20:55:25 mroman: You wrote a vampire? 20:55:38 impomatic: years ago, yes 20:55:51 Is it published? 20:57:32 I think i submitted it to some koth.org hill 20:57:38 but it performed badly 20:57:49 :-( 20:57:58 mostly probably because it was too long and too slow for a vampire 20:58:05 Vampires have had trouble getting on the hills for years. 20:58:44 I laid carpets of jmps into a SPL0 loop 20:58:57 SPL0 + mem clear 20:59:10 However, a few new tricks have got the back on the hill again over the last few months. 20:59:14 so the idea was to trick opponents to jump into my mem clear loop plus slowing them with the spl 0 21:00:22 I assume you have a DAT wipe after you've finished bombing? 21:00:44 yeah 21:01:01 but I didn't know about fancy ><{} prefixes at that time 21:01:19 I didn't know you could copy stuff around and also increment stuff in a single instruction 21:02:04 my replicator wasn't much successful too :( 21:02:10 That makes a big difference to the score. 21:03:10 24th is pretty soon though 21:03:19 -!- Patashu has joined. 21:03:39 but shouldn't take more than an hour to write a bomber :D 21:04:02 I just add an imp as a backup strategy 21:04:09 after bombing transform to imp :) 21:04:49 Modern replicators normally run several parallel processes in code similar to paper spl somewhere, 0 / mov >paper, }paper ; all processes run the spl to split to the new copy. Then the run the mov to make the new copy. 21:04:52 I don't know what you usually do after bombing? 21:04:54 bombing again? 21:05:02 with a different offset probably 21:05:21 I was just planning to throw spl 0 bombs with a bug offset 21:05:34 and then make another bomb run with a slightly smaller offset 21:05:41 then make a full mem clear 21:05:42 then imp 21:05:43 :D 21:05:47 *big offset 21:06:06 After bombing (or scanning), clear memory. 21:06:15 spl 0 with big offset should catch replicators pretty well I think 21:06:28 depending on how big they are and how fast they reproduce 21:08:01 A good 4 instruction clear is d-clear, SPL #0 / CLEAR MOV BMB, >POINTER / DJN.F CLEAR, >POINTER / BMB DAT 3-POINTER (where pointer is a few instructions before the clear) 21:23:54 -!- Patashu has quit (Ping timeout: 240 seconds). 21:35:41 -!- oerjan has joined. 21:38:55 16 21:39:24 hm i'm not sure i like this apparent exponential spam growth 21:41:25 fg 21:41:28 oops. 21:42:22 improve your life: HISTIGNORE='fg*' 21:42:47 -!- Sorella has joined. 21:43:32 i don't think i've used fg much... 21:44:00 actually i guess i'd more likely have used %, the times i needed to 21:44:21 whoa 21:46:26 ah they're simply synonyms 21:47:29 or rather, the fg in fg %... is optional 21:47:39 shachaf: did you know that rustc's parser is about 5,000 lines of hand-written Rust code? 21:47:46 no grammar or anything 21:48:18 no 21:48:28 but that explains why they're not keeping the grammar in the manual up to date 21:48:44 kmc: sounds a little brittle. isn't rust powerful enough you could make parser combinators? 21:49:44 yeah, I think there is a plan to fix this 21:53:58 `olist (952) <-- how did that sneak in just after i checked myself... 21:54:37 oerjan: is it just me or are olist updates p. far apart these days 21:54:43 shachaf: indeed 21:56:17 you click in the emptiness and drag. <-- ooh 21:57:44 oh you don't have to drag, you can just click 22:02:04 then Joe, which look interesting <-- itym Joy 22:06:25 boily: have you lost all your creativity? there have been no new vegetables on the wiki in a long time <-- wait betterave is a french vegetable? 22:14:55 -!- nooodl_ has joined. 22:18:14 -!- nooodl has quit (Ping timeout: 240 seconds). 22:22:59 -!- hk3380 has quit (Ping timeout: 252 seconds). 22:23:07 -!- Sgeo has joined. 22:48:34 someone ought to perhaps tell john misciagno about the preview button. 23:01:51 -!- Sorella has quit (Ping timeout: 252 seconds). 23:03:31 -!- nooodl_ has quit (Ping timeout: 265 seconds). 23:15:56 -!- hk3380 has joined. 23:17:11 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39594&oldid=39593 * John Misciagno * (+5) 23:27:14 [wiki] [[Language list]] http://esolangs.org/w/index.php?diff=39595&oldid=39552 * John Misciagno * (+14) 23:30:52 -!- mhi^ has quit (Quit: Lost terminal). 23:32:45 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39596&oldid=39594 * John Misciagno * (-15) 23:33:13 hm, the google rubiks cube kind of runs like shit in firefox 23:36:43 -!- shikhout has joined. 23:39:38 -!- shikhin has quit (Ping timeout: 240 seconds). 23:42:30 -!- MoALTz_ has joined. 23:44:42 kmc, the controls are fantastically awkward even if it works properly, just save yourself the pain 23:45:07 -!- MoALTz has quit (Ping timeout: 252 seconds). 23:49:04 okay 23:52:40 -!- tertu has quit (Ping timeout: 240 seconds). 23:53:33 -!- tromp has joined. 23:56:36 [wiki] [[0(nop^)]] http://esolangs.org/w/index.php?diff=39597&oldid=39596 * John Misciagno * (+15)