00:15:04 [wiki] [[Tables]] M https://esolangs.org/w/index.php?diff=53238&oldid=53220 * HereToAnnoy * (+85) Spec consistency 00:48:31 -!- Lymia has quit (Ping timeout: 252 seconds). 00:50:28 -!- Lymia has joined. 00:57:19 -!- Lymia has quit (Ping timeout: 252 seconds). 01:02:11 -!- Lymia has joined. 01:16:31 -!- augur has joined. 01:21:15 -!- doesthiswork has joined. 02:16:15 -!- Phantom_Hoover has quit (Remote host closed the connection). 02:44:32 -!- boily has quit (Quit: SOLVED CHICKEN). 02:59:17 -!- jaboja has quit (Remote host closed the connection). 03:00:31 -!- sleffy has joined. 03:11:13 -!- sleffy has quit (Ping timeout: 248 seconds). 03:15:18 -!- ais523 has quit (Quit: quit). 04:26:48 -!- sleffy has joined. 05:08:28 What is the following theorem called: Any category that has more than one object has N+1 or more monads if N is the number of final objects that that category has. 05:14:00 Why would that have a name? 05:14:45 Aren't the theorems supposed to have a name? 05:18:24 you could write a paper 05:18:29 and then it could be called Theorem 3.4 05:21:37 O, yes, I suppose that is possible. But, such number is local to that document, so the global name will be named by prefixing the document number too, then, I suppose. 05:21:53 But, I didn't write a paper, so none of that is applicable. 05:22:19 it's definitely been done 05:22:25 "see Theorem 8.4 in [3]" 05:22:42 Is it a theorem or a lemma? 05:41:42 it's probably a lemma. 05:42:59 or a series of lemmata for each value of N 05:43:43 nah. not distinct enough to list separately 05:53:35 Now I tried making the implementation of X resource manager in Haskell. I do not have Haskell on this computer, and also have not made any programming in Haskell for some time, so, I don't know if it is correct, or even if it will compile, or if it is good. However, it is: http://sprunge.us/hEbZ 06:09:24 I can't believe I'm saying this but I'm using fractran as a scripting language for a game. 06:12:50 it involves moving resources around and wiring up a really stupid simple register machine to my game objects is actually a terribly simple way of managing resources and externally managed flags. 06:20:09 What game is that? Although, I suppose yes it can have a use. 06:22:45 got a little weird mashup between pokemon, tamagotchi and zelda 1 going right now. 06:23:02 and it features little creatures that you control that have a few things. 06:23:53 an element/type, a resource meter, and a single ability. their ability is context sensitive to the area they're in (they move and live on a tile-based grid). 06:24:46 the gimmick is that you can take care of them and control them. you take care of them by raising them in your "zoo" and you can take a few of them out into a wider world to do different things like scavenge for resources. 06:25:59 each critter can only contain one type of resource, and that corresponds to the element they are. so water elementals can store water. earth can store earth. plants can store plants/seeds. 06:26:25 exposing the internal state of them + whatever tiles they're near via registers seems like a good idea. 06:26:29 that way you can write rules like.. 06:27:24 I suppose I understand how you mean now, although I don't know what registers they are. 06:27:42 Direction: North, Background: Water, BackgroundState: 25, ResourceLevel: 5 -> Background: Ice, BackgroundState: 0 06:27:42 -!- zzo38 has left. 06:27:45 -!- zzo38 has joined. 06:28:31 that rule reads "if you're facing north, and the tile north of you has a type of water, and the state of that tile is 25 (think water level), and your internal resource level is 5, turn it to ice and set its background state to 0." 06:28:37 though really it'd be... 06:28:51 Type: Water, Direction: North, Background: Water, BackgroundState: 25, ResourceLevel: 5 -> Background: Ice, BackgroundState: 0 06:28:59 or Type: Ice or what have you. 06:29:53 actually ice would be better. Type1: Cold, Type2: Water -> Result: Ice. all of the symbolic names like water, north, cold, ice, etc. would be mapped to actual numbers. 06:31:59 That isn't quite Fractran, although I can see how such a thing could be done in Fractran, if you add a second rule to restore the state, I suppose (unless you are doing it differently) 06:32:55 fractran simulates a register machine underneath it. 3/2 is really r1(1) -> r2(1). 06:33:57 Yes, I know that, although if it isn't in lowest terms then it won't work and you will need to add another "trigger" onto it, so that it will work. 06:34:45 so you could encode that rule via mapping each of the registers like Type, Direction, Background, BackgroundState, ResourceLevel, etc. onto a prime number. when your critter uses his ability, the engine runs through the rule list after setting the registers for things like Type, Direction, etc. 06:37:40 Yes, although still it look it won't work in Fractran unless you then add a "guard", or if Direction:North is given its own prime number, or whatever. 06:37:53 well, Direction is a register, North is a value. 06:38:38 so if Direction is register 1, and North is, say, value 1, then the encoding for the state of that register is 2^1. 06:39:07 Yes, I know that. 06:41:30 -!- Cale has quit (Quit: Leaving). 06:55:04 -!- Cale has joined. 07:10:07 Looking from the esolang wiki Fractran article, I found the Stack Overflow code golf. They have the following JavaScript implementation: function(n,p,q,i,c){i=0;while(q=p[i],c=n*q[0],(c%q[1]?++i:(n=c/q[1],i=0)) This is my shorter version: (n,p,c)=>{while(p.some(([x,y])=>(c=n*x)%y?0:n=c/y));return n} 07:10:36 Can you shorten it any more? 07:11:52 (The function is given two arguments: The first is the input number, and the second is the list of fractions, where each fraction is a list with the numerator and denominator.) 07:16:34 nope, I'd say that's pretty well reduced. 07:17:46 Maybe they used an older version of JavaScript which does not have the stuff that I have used. 07:18:51 more than likely. ES5 and ES6 and all that. 07:19:35 -!- sleffy has quit (Ping timeout: 240 seconds). 07:19:57 -!- doesthiswork has quit (Quit: Leaving.). 07:24:35 -!- augur has quit (Remote host closed the connection). 07:25:08 -!- augur has joined. 07:29:21 -!- augur has quit (Ping timeout: 240 seconds). 07:37:57 I have shortened it more: (n,p)=>{while(p.some(([x,y])=>n*x%y?0:n=n*x/y));return n} 07:38:08 zzo38: ah, I see what you mean. if North is 3, South is 1, and I'm checking for South, the rule would match if I'm facing North. 07:38:11 (Writing n*=x/y doesn't work, due to rounding errors.) 07:39:32 I'm assuming that I could modify that trivially to include a guard that says "only this EXACT quantity." 07:39:43 that's not hard. 07:39:46 Yes, that is what I mentioned. 07:40:10 so yeah, not quite fractran but damn close. you could emulate that behavior by setting some more flag registers but I'd rather just add to the syntax. :P 07:41:33 Yes, that is OK. 07:48:39 -!- MrBismuth has joined. 07:51:28 -!- MrBusiness has quit (Ping timeout: 252 seconds). 07:51:28 -!- MrBusiness3 has quit (Ping timeout: 252 seconds). 07:51:59 -!- MrBusiness3 has joined. 07:56:11 [wiki] [[Talk:Fractran]] https://esolangs.org/w/index.php?diff=53239&oldid=21317 * Zzo38 * (+511) 08:15:15 [wiki] [[Talk:Fractran]] https://esolangs.org/w/index.php?diff=53240&oldid=53239 * Zzo38 * (-3) 08:17:21 Even more shortened now: (n,p,f=_=>p.some(([x,y])=>n*x%y?0:n=n*x/y)?f():n)=>f() 08:45:48 But it doesn't have big integer arithmetic. 08:45:54 So presumably it only works for toy programs. 08:56:39 .oO(Non-toy FRACTRAN programs...) 09:06:10 Yes, that much is correct. 09:16:45 (Although, the original version also had the same problem.) 09:17:01 -!- lezsakdomi has joined. 09:48:22 -!- imode has quit (Ping timeout: 264 seconds). 11:35:21 [wiki] [[Esolang:Sandbox]] https://esolangs.org/w/index.php?diff=53241&oldid=53210 * Rdebath * (+1882) 11:36:21 [wiki] [[Feather]] https://esolangs.org/w/index.php?diff=53242&oldid=53236 * Rdebath * (-7) Remove debris from ``` tag 11:40:11 -!- erkin has joined. 11:55:41 [wiki] [[Esolang:Sandbox]] https://esolangs.org/w/index.php?diff=53243&oldid=53241 * Rdebath * (+3) Mmmm green screen 12:03:38 -!- Phantom_Hoover has joined. 12:03:38 -!- Phantom_Hoover has quit (Changing host). 12:03:38 -!- Phantom_Hoover has joined. 12:07:45 -!- atslash has quit (Ping timeout: 248 seconds). 12:08:12 -!- atslash has joined. 12:23:29 [wiki] [[BrainCube]] M https://esolangs.org/w/index.php?diff=53244&oldid=53123 * Rdebath * (-39) Formatting 12:25:47 -!- augur has joined. 12:29:59 -!- augur has quit (Ping timeout: 255 seconds). 12:31:13 -!- jaboja has joined. 12:32:20 [wiki] [[Super Stack!/superstack.ml]] M https://esolangs.org/w/index.php?diff=53245&oldid=34738 * Rdebath * (-23) Formatting 12:47:10 I'm programming the quantom computer on C++ 12:47:18 It has been a while since I've dealt with pointers 12:55:27 I don't even remember how to instantiate an array in C++ 12:55:36 new State[n] isn't the way! 12:56:53 Does C++ still use malloc, I forget 13:05:57 -!- FreeFull has quit (Ping timeout: 240 seconds). 13:06:47 -!- FreeFull has joined. 13:30:01 -!- FreeFull has quit (Ping timeout: 240 seconds). 13:53:33 -!- boily has joined. 13:53:57 why c++? 13:57:57 because male models. 13:57:59 Slereah: C++ has an abstraction called allocators; the standard one may (and should, really) be using malloc 14:00:18 (should, because I think that effort on optimizing variable-sized allocation should be spent on improving malloc.) Shiny: https://www.phoronix.com/scan.php?page=news_item&px=glibc-malloc-thread-cache 14:02:11 should, also, do prevent silly things like https://www.zerotier.com/blog/2017-05-05-theleak.shtml 14:02:18 s/do/to/ 14:13:07 -!- jaboja has quit (Ping timeout: 260 seconds). 14:17:14 Why not C++* 14:17:38 I'm mostly using it because I want to be able to do arithmetics on quantum states so I need to overload arithmetics and logical operators 14:18:06 Rather than do some awkward Add(State1, State2 14:55:48 c++ is one of the worst languages i know 14:59:04 it is 14:59:11 But I coded it lots 14:59:16 so it is mostly fine 15:01:24 @karma c 15:01:24 c has a karma of 2 15:01:28 c-- 15:01:30 c-- 15:01:49 @karma c/c 15:01:49 c/c has a karma of 1892 15:02:17 How is Karma rated 15:03:05 @karma c 15:03:05 c has a karma of 2 15:03:25 @karma- c 15:03:25 c's karma lowered to 1. 15:03:28 @karma- c 15:03:28 c's karma lowered to 0. 15:03:29 :P 15:03:35 Oh no 15:03:37 You monster 15:03:38 C++ 15:03:41 @karma C 15:03:41 C has a karma of 0 15:03:43 @karma+ c 15:03:43 c's karma raised to 1. 15:03:46 (I like C) 15:07:39 there was a time when C++ lowered the speaker's karma, but I think that hack is gone. 15:08:25 @karma Slereah 15:08:25 You have a karma of 1 15:08:27 Phew 15:08:57 @karma int-e 15:08:57 int-e has a karma of 11 15:09:15 @karma myname 15:09:15 myname has a karma of 1 15:09:55 @karma blah 15:09:55 blah has a karma of 31337 15:10:07 and then there are stupid people who have nothing better to do than this 15:10:23 Or are they geniuses 15:10:38 doubtful 15:11:26 -!- jaboja has joined. 15:12:36 @karma boily 15:12:36 You have a karma of 108 15:12:48 ah! I'm still at 108 ^^ 15:13:06 -!- boily has quit (Quit: DICTIONARY CHICKEN). 15:49:13 -!- FreeFull has joined. 16:02:01 -!- jaboja has quit (Ping timeout: 255 seconds). 16:02:22 -!- jaboja has joined. 16:07:18 -!- doesthiswork has joined. 16:15:23 -!- sleffy has joined. 16:25:07 -!- LKoen has joined. 16:41:56 -!- augur has joined. 16:48:06 -!- augur has quit (Remote host closed the connection). 16:57:19 -!- jaboja has quit (Remote host closed the connection). 17:04:52 [wiki] [[Special:Log/newusers]] create * AAAAAAAA * New user account 17:04:55 -!- jaboja has joined. 17:08:24 AAAAAAAARGH! 17:09:13 [wiki] [[Esolang:Introduce yourself]] https://esolangs.org/w/index.php?diff=53246&oldid=53231 * AAAAAAAA * (+212) 17:18:42 [wiki] [[Popular problem]] https://esolangs.org/w/index.php?diff=53247&oldid=41270 * AAAAAAAA * (+199) 17:33:47 -!- iovoid has joined. 17:33:47 -!- iovoid has quit (Changing host). 17:33:47 -!- iovoid has joined. 18:25:07 -!- nitin59 has joined. 18:25:50 -!- nitin59 has quit. 18:26:06 -!- nitin59 has joined. 18:37:28 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds). 18:38:51 anyone tried this ... esolang lovers might like this... -> https://www.nevercompletedgame.com/ 18:39:22 -!- sleffy has quit (Ping timeout: 264 seconds). 18:42:24 -!- sleffy has joined. 18:45:30 -!- Phantom_Hoover has joined. 18:47:04 i don't 19:11:28 -!- sleffy has quit (Ping timeout: 240 seconds). 19:13:22 way too US centric anyway 19:13:48 that's true... 19:21:54 the first maybe 20 were kind of nice, but then it got more and more obscure. I cheated my way to 32 but what's the point. 19:22:35 -!- AnotherTest has joined. 19:23:15 And even before that, I used google. I didn't recognize 4.6692, for example. I recognized the taxicab number but that wasn't an acceptable answer. 19:26:42 -!- imode has joined. 19:27:18 The hell is question 15 19:27:31 The sequences are missing 4, 2 and 8 19:27:38 But beyond that 19:27:40 Not a clue 19:27:56 Slereah: that's your answer right there. 19:28:05 What is 19:28:12 428 19:28:19 Oh, that's what they expect? 19:28:26 I thought I was to find the next in the sequence 19:30:12 i don't like puzzles that are hard because you don't get told what to do 19:30:29 yeah it's a bit shit 19:30:38 A lot of those questions have plenty of possible answers 19:31:11 also, zachtronics new game is awesome 19:31:55 One of them is just 1729 = 1^3 + 12^3 = 9^3 + 10^3 19:32:09 The answer is neither taxicab number or Hardyâ€“Ramanujan number 19:32:36 or variations on those 19:34:01 yes the game is not straight forward... it has multiple answers.. even website has one comment about the game... :P 19:34:22 yeah it is not very fun 19:34:37 Like old adventure games where you had to read the mind of the developpers to guess solutions 19:35:09 Is the empty set a Grothendieck universe 19:35:37 Is using that universe equivalent to just saying small sets don't exist 19:36:05 It is vacuously true, yes 19:36:38 And the next smallest universe is the one that I am used to using I think, containing the natural numbers 19:37:01 Or... no 19:37:01 It is just N yeah 19:37:22 Is {{}} a universe? 19:37:32 I like natural numbers 19:37:45 {{}} doesn't contain the power set of {} 19:37:49 these games are no fun if playing alone... if people come and play then it might be some fun.. like the people on /sci/ blog they played together and finished it... 19:38:02 Slereah, you're right 19:38:12 I'm going to decree that game as no fun in the first place 19:38:16 They're bad puzzles 19:38:38 just an FYI the game has almost all answers somewhere on their blog... so don't waste too much time on these puzzles... 19:51:32 -!- copumpkin has quit (Ping timeout: 255 seconds). 20:05:31 -!- LKoen has quit (Remote host closed the connection). 20:06:52 -!- nitin59 has quit. 20:15:34 myname: opus magnum? 20:15:53 zeah 20:22:36 Slereah: yeah narrowing down the right idea to the expected answer is tiresome 20:24:21 myname: hmm, is it like the magnum opus challenge on a hexgrid? 20:28:23 it's like those old timey text adventure game 20:28:31 Where you have to guess the correct verb 20:38:33 -!- copumpkin has joined. 21:37:37 -!- augur has joined. 21:41:02 -!- dingbat has quit (Quit: Connection closed for inactivity). 21:41:41 -!- augur has quit (Ping timeout: 240 seconds). 21:41:43 -!- erkin has quit (Quit: Ouch! Got SIGABRT, dying...). 21:56:10 -!- augur has joined. 22:30:41 -!- AnotherTest has quit (Ping timeout: 248 seconds). 22:35:22 -!- Slereah__ has joined. 22:36:58 -!- Slereah has quit (Ping timeout: 252 seconds). 22:51:42 -!- augur has quit (Ping timeout: 260 seconds). 23:04:28 -!- augur has joined. 23:19:52 -!- Cale has quit (Ping timeout: 252 seconds). 23:20:30 -!- Cale has joined. 23:21:38 -!- Phantom_Hoover has quit (Ping timeout: 246 seconds). 23:57:08 -!- fungot has quit (Ping timeout: 240 seconds). ```