00:00:28 -!- pikhq has quit (Read error: Connection reset by peer). 00:03:45 -!- pikhq has joined. 00:04:24 -!- pikhq has quit (Read error: Connection reset by peer). 00:05:04 apparently mkPolar 1 is also known as cis 00:05:21 yes 00:05:27 "cos + i sin" 00:05:51 im pissed off about this cyclotomics 00:06:01 yeah i know, i meant it was a defined haskell function 00:07:07 hm 00:07:23 -!- FireFly has quit (Quit: Leaving). 00:08:04 z^5 = 1 and not z = 1 means z^4 + z^3 + z^2 + z + 1 = 0 fwiw 00:08:25 i suppose that's one of the results, but it also is simply polynomial division 00:08:49 well 00:08:52 z^4 + z^3 + z^2 + z = -1 00:09:29 but we should be able to extract two sequences, x1 = z^4 + z^2, x2 = z^3 + z (say) such that x1+x2=-1 & x1*x2 = 00:09:35 -!- BeholdMyGlory has quit (Remote host closed the connection). 00:10:13 ah 00:10:25 it doesn't seem to be true though :( 00:10:49 well z and z^4 are also conjugate, so z+z^2 and z^4+z^3 are conjugate 00:11:06 and multiplying conjugates at least gives a positive real 00:11:20 2.6180339887498945 00:11:36 (that is 1+phi, which is not rational) 00:11:58 so I'm a bit lost now as for what I should do 00:12:03 another option would be z+z^3 and z^4+z^2 00:12:16 well that gives 0.38196601125010515 00:12:30 which is 1/2.6180339887498945 00:13:29 -!- pikhq has joined. 00:13:49 well i don't know this stuff, anyway 00:16:04 cyclotomic polys are easy 00:16:05 jeez 00:17:51 !hs let w = exp (2*pi*sqrt(-1)*(1/17)) :: Complex Double in (sum \$ map (w^) [3,10,5,11,14,7,12,6])*(sum \$ map (w^) [9,13,15,16,8,4,2,1]) 00:17:55 !haskell let w = exp (2*pi*sqrt(-1)*(1/17)) :: Complex Double in (sum \$ map (w^) [3,10,5,11,14,7,12,6])*(sum \$ map (w^) [9,13,15,16,8,4,2,1]) 00:17:59 `haskell let w = exp (2*pi*sqrt(-1)*(1/17)) :: Complex Double in (sum \$ map (w^) [3,10,5,11,14,7,12,6])*(sum \$ map (w^) [9,13,15,16,8,4,2,1]) 00:18:02 egobot is not here 00:18:42 (-4.0) :+ (-5.06434096082401e-016) :: Complex Double 00:20:10 you may try privmsg'ing lambdabot. prepend with "> " 00:20:23 *Galois Data.Complex> multiplicativeGroupGenerator 52 00:20:23 *Galois Data.Complex> map(\i->2^i`mod`5)[1..4][2,4,3,1] 00:20:23 *Galois Data.Complex> let w = exp (2*pi*sqrt(-1)*(1/5)) :: Complex Double in (sum \$ map (w^) [2,3])*(sum \$ map (w^) [4,1]) 00:20:26 (-0.9999999999999999) :+ 6.861555643110582e-17 00:20:38 i guess that won't show up here 00:20:53 multiplicativeGroupGenerator 5 = 2 00:21:13 orbit of 2 in multiplicative Z/5Z = [2,4,3,1] 00:21:22 hm 00:21:33 so the periods (w^2+w^3)(w^4+w) = -1 00:21:34 3 is also a generator, i should think 00:21:37 but I thought I did this...... 00:21:45 I just pick the first generator 00:22:33 as i said, exp (2*pi*sqrt(-1)*(1/5)) = cis (2*pi/5) 00:22:56 I don\t understand what I had wrong before 00:23:17 This mouse still feels too weird 00:23:33 well we didn't try that splitting 00:23:34 Also, changing the speed of the thing also changes the speed of the trackpad 00:23:39 (w+w^4)*(w^3+w^4) <------- augh!!! 00:23:41 im so stupid 00:25:31 * Sgeo switches back to his wired mouse 00:26:28 fax: i was trying to suggest things that were conjugates of each other, if the product was supposed to be negative no wonder that didn't work :D 00:26:51 oerjan, but you are right -- they are conjugates 00:27:12 um no 00:27:23 if they were conjugates their product would be positive 00:27:42 (w^2+w^3) and (w^4+w), that is 00:27:49 oh right I see 00:28:23 so there's a 'fast' way to calculate the value of (w^2+w^3)*(w^4+w) 00:28:31 but it's really confusind and complicaetd ;D 00:29:03 exactly the right kind of thing for a computer program, you'd think 00:29:46 I am trying to program this algorithm but it is really a lot harder than anything I have worked on before 00:29:53 well I guess that is the wrong way to put it 00:29:59 What if you tried it imperatively? 00:30:01 >.> 00:34:26 -!- coppro has quit (Ping timeout: 260 seconds). 00:40:17 this... appears to only work for fermat primes 00:40:27 but that is not good because there are other primes 00:42:28 oh? what goes wrong for 7, say? 00:42:48 well give me 10 mins I will try p = 7 on paper 00:43:17 {1,2,3,4,5,6} lessee 00:43:37 {2,4,1} nope 00:44:00 [3,2,6,4,5,1] 00:44:05 that's the orbit of 3 00:44:07 {3,2,6, 00:44:13 i was _getting_ there :D 00:44:15 :P 00:44:16 sorry 00:45:10 so do you take (w^3+z^2+w^6)*(w^4+w^5+w^1) ? 00:45:19 or would, if it worked 00:46:11 how did i get that z there 00:46:23 http://www.pasteit4me.com/312001 00:47:01 -!- ais523 has quit (Remote host closed the connection). 00:47:52 huh, so [3,6,5] and [2,4,1], or [3,4] and [6,1] 00:48:36 [3,4], [2,5] and [6,1] 00:48:45 so the thing splits into 2*3 or 3*x 00:48:47 so the thing splits into 2*3 or 3*2 *** 00:48:52 oh any two? 00:49:12 er wait 00:49:17 you multiplied all three 00:49:27 yeah 00:49:37 in general if we have an orbit that covers the whole group [a,b,c,d...] 00:50:07 it seems like you can share it out (one for me, one for you, one for him, one for me, ...) into sets which (obviously sum to -1) and multiply to make a rational number 00:50:21 but why they multiply to make a rational..... I have no idea 00:50:28 oh you are taking all the cosets of a subgroup? 00:50:38 hmm 00:50:43 yes I guess they are cosets aren't they 00:50:54 the group is Z/pZ by the way (multiplicative) 00:51:10 (I don'tknow if I neglected to say that earlier) 00:51:31 i understood that much 00:51:42 although i wouldn't call that Z/pZ... 00:52:04 wikipedia used a superscript X 00:53:03 hm since the multiplicative group is cyclic, i guess all subgroups are cyclic too so given by a single element 00:53:26 oerjan, ooh that explains why you can keep doing it! 00:54:34 it's a bit usesless to know that y1+y2+y3 = -1 & y1*y2*y3 = 1 00:54:36 you can't solve this equation 00:54:47 in fact if this is the case you don't need to find a primitive root at all, unless you want to classify everything 00:54:56 hmmm 00:55:00 p-1 is always even 00:55:11 (p > 2) 00:57:08 OMG BLUE BUBBLEGUM JONES 00:57:21 also, fax! :D 00:57:24 * augur glomps fax 00:57:28 hey augur :))) 00:57:40 i had an idea for a fun little challenge 00:57:46 the universe thing? 00:57:51 yeah did i mention it to you? 00:58:00 ive been modelling simple universes 00:58:08 what is a universe ? 00:59:11 ok so in this context, a universe is some topology, some number of particles that inhabit that topology (or some properties over that topology, take your pick), and some number of rules that govern the physics of those particles in that topology 00:59:59 augur WOLFRAM?? 01:00:10 no. 01:00:19 this sounds like cellular automata 01:00:24 im sure you could model (some) of these universes as CAs 01:00:28 except on arbitrary topology 01:00:31 but the physics dont have to be defined CAly 01:00:36 oh there are non-CA rule sets? 01:00:38 like how 01:00:44 well you could do so if you wanted. 01:01:21 just as an example, imagine you had an infinite discrete universe with a particle occupying one position in the universe 01:01:46 you could say that it has a constant velocity in some direction and so forth 01:01:53 im sure you could also define a CA for this tho 01:06:12 so do you know the setup of the game? 01:07:39 I guess so 01:07:42 it sounds very difficult 01:08:09 it is rather, i think 01:08:15 just to reiterate, the game goes like this 01:08:44 i secretly design a (simple) universe. then i provide to you the causal graph of the universe 01:08:52 oerjan, btw -- x1 = z^3+z^6+z^5 ; x2 = z^2+z^4+z^1 gives x1 = -1/2-sqrt(-7/4) ; x2 = -1/2+sqrt(-7/4) 01:08:53 and you have to determine the design i used. 01:09:11 augur, the causal graph is a picture ? 01:09:25 augur I want to try this but I am not likely to win 01:10:08 the causal graph is basically just a directed graph, where each node is one of the possible configurations of the universe, and each directed arc connects a configuration to a "successor" confiuguration 01:10:17 so the problem is, I know that z^3+z^6+z^5 = -1/2-sqrt(-7/4) -- but that doesn't help me find any expression for z^3 or whatever 01:10:22 ie the configuration the universe would be in after running the physics one time unit forward 01:11:27 you could imagine a universe with a single point in it, and that point has a single property Energy that is one of the integers, and the "physics" is such that Energy increases by one every time step 01:11:51 well z^3 is a 7th root of unity, i don't know whether they can be expressed with real roots 01:12:13 so the causal graph of this universe is basically 0 -> 1 -> 2 -> 3 -> ... where each state corresponds to one of the configurations {(point, energy)} of the universe 01:12:24 does this make sense, fax? 01:12:46 vaugely :) 01:13:00 or imagine you have a universe that is a string of text 01:13:04 of length 3 01:13:23 with say 1 of 26 "particles" (letters) in each position 01:13:34 "aaa", "aab", ... 01:13:35 oerjan, well there is a theorem that every root of unity can be expressed in radicals (from Gauss) 01:13:39 these are the configurations of this universe 01:13:53 fax: oh 01:13:55 oerjan, but I am completely failing to see how it works for non-fermat primes 01:14:02 then theres some physics that says each "configuration" is followed by, lets say, the "next" string 01:14:13 or god only knows what the universe is, right 01:14:22 augur yeah I get that it just seems if you can choose any rule you want that it's impossible to figure it out 01:14:33 well let me give you a very simple one :) 01:14:37 ok 01:14:42 here is a simple causal graph: 1 -> 1 01:16:05 this is the simplest universe i can think of 01:16:30 that sucks 01:16:31 :/ 01:16:39 idiot universe 01:16:41 cmon, think of what kinds of universes this could be :) 01:16:49 what is the universe and the physics 01:16:59 actually its a whole class of universes, but 01:17:01 the universe is {1} and the physics is I 01:17:35 basically, yeah. the universe is a 1x1 universe with no particles (or 1 particle) and no physical laws that change anything. 01:17:51 alternatively it could be seen as any universe with no particles an no physical laws that change anything 01:18:05 heres the next simplest one i can think of 01:18:08 1 -> 1, 2 -> 2 01:18:24 the universe is {1,2} and the physics is I 01:18:28 ? 01:18:37 well, what do you mean bye {1,2}? 01:18:40 idk 01:18:47 the 1 and 2 that i used are just names for configurations 01:18:47 What do you mean, BYE! {1,2} 01:18:51 it's just the nodes of a graph 01:18:55 there are no edges yet 01:18:56 (Sorry, couldn't help myself) 01:19:10 but the nodes in the graphs are not the universe 01:19:25 the universe is a topology plus a physics that this graph describes 01:20:14 the universe envisioned is as follows: 01:20:30 a 1x2 universe with one particle (which can be in either location) and no physics 01:20:54 or, a 1x1 universe with one particle (which can be pointing in either one of two directions) and no physics 01:21:12 no, it's a particle which can be either red or blue! 01:21:17 the configurations for the former are: [o| ] and [ |o] 01:21:23 oerjan, :) 01:21:33 and for the latter: [<] and [>] lets say. 01:22:43 heres another universe thats similar: 1 -> 1, 2 -> 2, 3 -> 3, 4 -> 4 01:24:34 im sure you can imagine what this is 01:24:58 yes, it's a 1x2 universe with two particles *ducks* 01:25:04 nope :) 01:25:14 unless you hve some physics in there 01:25:24 well no physics 01:25:29 nothing changes 01:25:30 then definitely not 01:25:38 because that universe would be [o|o] 01:25:44 and would have only one state 01:25:55 making its causal graph the same as the first universe: 1 -> 1 01:25:56 you didn't say particles couldn't be in the same position 01:26:07 ahhaaa good thinking oerjan :) 01:26:12 then yes, you're right 01:26:15 it could be that universe 01:26:42 anyway i predict the number of possibilities will become hopelessly large, fast 01:26:49 or it could be a 1x1 universe with a particle that faces one of four directions, or two particles that face one of two directions, or, ... 01:26:58 well, the number of possibilities might 01:27:08 but im not looking for _my_ solution, just _a_ solution 01:27:28 so heres another universe thats kind of interesting 01:27:33 "faces directions" sounds similar to momentum. 01:27:47 :) 01:28:09 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 1; 7 -> 1; 8 -> 4 01:28:15 * Sgeo wants to use Haskell for everything 01:29:07 ill even be generous and tell you the physical makeup of the universe 01:29:13 1x2, one particle. 01:30:07 well we have 2^3 states, so one bit could correspond to position of particle 01:30:30 ok :) 01:30:42 thats a truism, ofcourse 01:30:52 because, modulo anything else, the particle can be in exactly two positions 01:31:03 so the universe has at least 2*n configurations 01:31:06 well it means the particle can have 4 inner states in each position 01:31:13 ok 01:31:27 you're veeeery close 01:31:33 -!- Oranjer has left (?). 01:31:41 now just figure out what the physics is :) 01:31:46 it could point in each of four directions 01:31:54 true. 01:32:44 hm... 01:33:01 i make it a rule that the particle is _always_ changing position, each step 01:33:06 ok 01:33:50 so 1,3,5 and 8 correspond to the same position, 2,4,6,7 to the other 01:34:02 ok 01:34:30 now we can say that 7 and 8 are both pointing down 01:34:35 ok 01:36:20 btw, when you interpreted 1x2, did you interpret that to be 1 high or 1 across? 01:36:38 the particle always rotates its pointing direction each step, but skipping the down direction 01:37:02 i believe this gives the required graph 01:37:15 1 high 01:37:19 ok 01:37:25 thats what i intended :p 01:37:42 er what's what you intended 01:37:59 1 high 01:38:37 1 and 4 point left, 2 and 5 up, and 3 and 6 right 01:38:45 and rotation is clockwise 01:39:04 ok 01:40:27 thatll do it :) 01:41:26 now let me do one thing to my universe: expand the size to 2x2 now. the causal graph is as follows: 01:41:41 this analysis was made somewhat easier by the fact it contained two aspects that did not interfere with each other 01:42:00 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7 -> 8 -> 1; 9 -> 10 -> 1; 11 -> 12 -> 3; 13 -> 14 -> 5; 15 -> 16 -> 7 01:42:17 identical physics, one particle, just in 2x2 not 1x2 01:42:34 what do you mean by identical physics? 01:42:39 that is, not the physics oyu just devised, but the physics that i had in mind. 01:42:44 ah 01:42:49 as before. 01:42:57 so this universe and the previous one are different _only in size_ 01:43:02 now we have 4 positions rather than 2 01:43:07 we do. 01:43:32 and there are still 4 inner states possible 01:43:39 indeed. 01:43:49 assuming those can be selected independently 01:43:53 -!- coppro has joined. 01:44:21 well they can, but the physics constraints which configurations are possible as next configurations. 01:44:51 for all of this you can assume that all properties of particles are independent of their position 01:45:44 -!- mibygl has joined. 01:45:54 -!- pikhq has quit (Read error: Connection reset by peer). 01:51:21 -!- Oranjer has joined. 01:51:48 this time there are 8 non-repeating states, while there were only 2 the last time 01:52:17 you mean states which, once left, are never again reached? 01:52:18 yes. 01:52:46 ill give you an even better hint 01:52:56 if you think of the particle as a robot instead, the physics makes more sense. 01:53:44 which means doubling the positions did not just add an extra irrelevent bit, it has to interfere with stuff 01:53:53 nope. :) 01:53:55 *irrelevant 01:54:12 otherwise, there would be only 4 non-repeating states 01:54:14 there is no constraint on the configurations that the particle can appear in 01:54:40 the particle can be found in each of the four positions in each of the four states. 01:54:46 i mean the new bit and the old ones have to have physical interaction 01:55:24 let me know if you want more hints 01:55:40 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7 -> 8 -> 1; 9 -> 10 -> 1; 11 -> 12 -> 3; 13 -> 14 -> 5; 15 -> 16 -> 7 01:55:52 yep :) 01:57:01 there is still room for one bit aspect that does nothing but flip each turn (in fact this is clearer here since you numbered things to alternate odd/even turns) 01:57:25 remember, im not using your physics but mine. so you cant assume its doing what yours did :) 01:57:30 -!- pikhq has joined. 01:57:49 want another hint? 01:57:52 no, but i _am_ assuming i have to come up with something that fits the previous one as well 01:58:11 otherwise this would be easy 01:58:14 :) 01:58:31 hint: its not always changing position, nor internal state, during each time step. 01:58:46 but it *is* at least changing one of them 01:58:59 um the last point is obviouas 01:59:02 *-a 01:59:13 just making sure that it was :P 02:00:52 hm... 02:02:01 i think i've got it, just checking 02:02:37 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 1; 7 -> 1; 8 -> 4 02:02:51 what about it 02:03:00 just checking it gives the same 02:04:48 ok 02:05:57 each step, _if_ the particle is pointing toward another reachable position, it moves there. otherwise it rotates clockwise. this fits both universes. 02:06:07 bingo. :) 02:07:10 yay 02:07:58 now figure out the structure of this universe, given those physics, and 1 particle: 02:08:29 hm this is turning out more interesting than i expected :P 02:08:48 1 -> 2 -> 1; 3 -> 4 -> 3; 5 -> 6 -> 5; 7 -> 8 -> 7; 9 -> 10 -> 1; 11 -> 12 -> 2; 13 -> 14 -> 3; 15 -> 16 -> 4 02:09:07 so tell me the geometry of the universe. 02:09:08 the same physics? ok. 02:09:46 you can already figure it must be a universe with 4 positions. but what are their arrangement, and is there more to the geometry than just that. 02:10:25 there is at least some toroidal stuff going on 02:10:44 that's the only way you could flip between two states with those physics 02:11:33 wait four positions... 02:11:44 oh wait yes 02:20:42 so I'm a bit disappointed 02:20:57 I thought this program would be able to derive solution for the cubic equation and stuff like that 02:21:03 but it seems like you have to hard code all that in :[ 02:21:12 (in the roots of unity subroutine) 02:21:24 (unless I am [hopefully] missing something) 02:25:41 no ideas yet, oerjan? :) 02:25:53 augur: the universe is 2x2, with the left edge and right edge wrapping to each other. one (but not the only) assignment of states to positions is: 02:25:56 1/6/10/15 2/5/12/13 02:25:58 4/7/9/16 3/8/11/14 02:26:07 :) 02:26:09 bingo. 02:27:13 -!- adam_d has quit (Ping timeout: 265 seconds). 02:28:13 you might want to look at larger universes, and see if there are any parallels between them when you wrap one dimension 02:28:36 or see if there are parallels between when you wrap one dimension and when you wrap a second 02:29:10 oerjan, if you enjoy this, i can try to put up a site with a bunch of these 02:29:44 for the first, there would be 2*n final cycles where n is the number of rows 02:29:58 one for each going left, the other right 02:30:13 and each of length m 02:30:43 right 02:31:04 and each of those cycles would have m incoming paths of length n 02:31:14 well, half of them would 02:31:30 there are 2*m*n cycles 02:32:03 um no 02:32:09 there are actually 2*n cycles 02:32:16 you were right the first time 02:32:33 um s/cycles/states in cycles/ 02:32:56 actually, only the top and bottom rows would have incoming paths 02:33:05 right yes, sorry :) 02:33:19 m*n each 02:33:50 now are there any salient relationships between the unwrapped universe and the wrapped universe? 02:34:12 n to each of the m states in the cycle 02:35:10 well the downwards and upward paths still exist in both 02:35:45 the unwrapped universe has only one cycle, along the border 02:36:30 true 02:36:37 with 2*(m+n) states in it 02:36:42 look at the state graphs 02:36:51 keeping the state labels the same in both 02:37:49 no idea 02:38:40 try it and see ;) 02:38:55 well, everything _not_ approaching a border is of course the same 02:39:11 edges, that is 02:39:17 you mean everything that _is_ approaching a border 02:39:23 well, half the borders 02:39:26 because half the borders remain 02:40:05 by approaching i mean being next to, about to collide with it or pass through 02:40:32 and yeah only the changed borders 02:40:48 -!- Gracenotes has quit (Quit: Leaving). 02:40:53 -!- samosa has joined. 02:40:58 hm 02:41:06 Hello 02:41:19 Im new. 02:41:21 * augur eats samosa 02:41:26 What is this channel for? 02:41:30 :o 02:41:43 augur: conclusion, only 2*n edges are actually removed and 2*n added 02:41:49 :) 02:41:51 esoteric programming languages 02:42:02 ooh 02:42:20 ?? 02:42:23 -__- 02:42:36 lulz, i mean what does esoteric mean? 02:43:17 in this case it means weird and often useless 02:43:22 Esoteric, (adj.): unusual and not well-known. 02:43:47 i see 02:44:40 ^bf >+++++++++[<++++++++>-]<.>+++++++[<++++>-]<+.+++++++..+++.>>>++++++++[<++++>-]<.>>>++++++++++[<+++++++++>-]<---.<<<<.+++.------.--------.>>+. 02:44:40 Hello World! 02:45:35 also frequently unreadable 02:45:48 Can fungot do ///? 02:45:48 mibygl: you don't know what is correct?) not declared in this scope points to *here*" ( or newline). 02:46:07 not that i know of 02:46:34 unfortunately a couple of our bots are missing, including the one with most esolangs in it 02:46:57 on the other hand, fungot is _written_ in one (and implements two others) 02:46:58 oerjan: please note how carefully i used capitalization, rather than against mine except for locative-object ( which makes no sense 02:47:37 Can I ask fungot what languages e implements? 02:47:38 mibygl: and the best, mmh. 02:47:43 mibygl: um, someone claimed you were == uorygl, is this correct? 02:47:48 ^help 02:47:48 ^ ```; ^def ; ^show [command]; lang=bf/ul, code=text/str:N; ^str 0-9 get/set/add [text]; ^style [style]; ^bool 02:47:52 Correct. 02:48:08 If I were not uorygl, I would be impersonating uorygl, which is not a nice thing to do. 02:48:24 So fungot only implements two languages? Bah. 02:48:24 mibygl: eh what? 02:48:27 so oerjan, did you want me to put up one of those sites? 02:48:48 you mean having the same last 3 letters is impersonating? 02:48:58 If those letters are "ygl", yes. 02:49:27 On another network, instead of uorygl/mibygl, I'm Warrigal/Mibbigal. That's also an impersonation sort of thing. 02:49:54 augur: i don't think i'll be spending a lot of time on it, honestly. but who knows. 02:50:04 aww ok. 02:50:26 what if i offered a cash prize for a theory of how to infer properties of the universe from the properties of the causal graph? 02:50:27 :p 02:50:48 mibygl: you have to note that fungot implements those languages _in_ befunge 02:50:49 oerjan:, so i'd like to keep the secret weapon secret!" if you eval what magic outputs in javascript, but there would be 02:51:09 Grr, I want a ///bot. 02:51:23 (it does not expose befunge itself to others than fizzie, presumably for security reasons) 02:53:22 hm fungot does have definable commands though 02:53:22 oerjan: which wasn't that fnord at all 02:53:30 ^show 02:53:30 echo reverb rev rot13 rev2 fib wc ul cho choo pow2 source help hw srmlebac uenlsbcmra scramble unscramble 02:53:34 -!- sshc has joined. 02:53:49 mibygl: just write a /// interpreter in brainfuck and you'll be all set ;D 02:54:52 Gregor: your bots are missed 02:55:21 -!- pikhq has quit (Read error: Connection reset by peer). 02:55:44 I wish I could figure out what keeps happening to 'em. 02:55:50 -!- HackEgo has joined. 02:55:51 -!- EgoBot has joined. 02:56:38 mibygl: did you see me mention itflabijtslwi in response to your comment about /// and input? 02:57:25 !slashes /*/\/.\\0\/,\\,0,\\,1\/\/.\\1\/,\\,1,\\,0\/\/,\\,\/.\//********/.//.0 02:57:31 0110100110010110100101100110100110010110011010010110100110010110100101100110100101101001100101100110100110010110100101100110100110010110011010010110100110010110011010011001011010010110011010010110100110010110100101100110100110010110011010010110100110010110 02:59:57 I don't know. 03:00:07 -!- sshc has quit (Quit: leaving). 03:01:54 !slashes /!/@@@@//@/####//#/\$\$\$\$//\$/ nom/om! 03:01:55 om nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom nom 03:02:09 *itflabtijtslwi 03:02:28 Now I want to do /// busy beaver stuff. 03:02:46 Try to write the program of length N with the longest finite output. 03:02:52 heh 03:03:34 Call that length ?(N). 03:03:42 * mibygl ponders when ?(N) is first larger than N. 03:04:37 Let's see, /x/yyy/xxx is 10 long and outputs 9, /x/yyyy/xxx is 11 long and outputs 12. 03:05:04 -!- coppro has quit (Ping timeout: 246 seconds). 03:05:47 By using that trick a bunch of times, as I did in that om nom nom thing, you can achieve nearly exponential growth. 03:05:58 seems hard to do something fancier in that short span 03:06:16 Mmkay, what's the best you can do in 80 characters? 03:06:38 -!- pikhq has joined. 03:07:55 Here's a simple attempt: /0/1111//1/2222//2/3333//3/4444//4/5555//5/6666//6/77777//7/88888//8/99999/00000 03:08:31 I think it outputs 2,560,000 characters. 03:08:47 -!- pikhq has quit (Read error: Connection reset by peer). 03:08:49 !slashes /@/\/*\\*\/+\\+\/\/+\\+\/*\\*\\*\\*\//@@@@@@@@** 03:08:49 ************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************ 03:09:51 It would be nice if we had a Slashes unescaper. 03:11:14 So the result of that substitution is /*\*/+\+//+\+/*\*\*\*/? 03:11:36 something like that 03:14:09 anyway as you can see it doubles the number of **'s 03:14:27 So, /@/\/*\\*\/+\\+\/\/+\\+\/*\\*\\*\\*\// has 38 characters, right? 03:14:42 -!- fax has quit (Quit: Lost terminal). 03:14:43 if you say so :D 03:15:16 If you just plopped two in, you'd have four characters to spare... 03:15:35 what? 03:15:43 If you use that twice. 03:15:50 oh right 03:16:06 which should give you something 2^2^n 03:16:29 Using two probably doesn't help at all. 03:17:28 -!- pikhq has joined. 03:18:42 -!- pikhq has quit (Read error: Connection reset by peer). 03:19:11 !slashes /@/\/*\\*\/+\\+\/\/+\\+\/*\\*\\*\\*\//@/*/\/-\\-\/+\\+\/\/+\\+\/-\\-\\-\\-\//**++ 03:19:56 oh wait 03:20:12 !slashes /@/\/*\\*\/+\\+\/\/+\\+\/*\\*\\*\\*\//@/*/\/-\\-\/+\\+\/\/+\\+\/-\\-\\-\\-\//**-- 03:20:12 -------------------------------- 03:20:25 !slashes /@/\/*\\*\/+\\+\/\/+\\+\/*\\*\\*\\*\//@@/*/\/-\\-\/+\\+\/\/+\\+\/-\\-\\-\\-\//**-- 03:20:26 ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ 03:20:48 oh we're already beyond 80 03:22:06 hm... 03:22:47 !slashes /@/\/*\\*\/+\\+\/\/+\\+\/*\\*\\*\//@@/*/\/-\\-\/+\\+\/\/+\\+\/-\\-\\-\//**-- 03:22:47 --------- 03:22:59 !slashes /@/\/*\\*\/+\\+\/\/+\\+\/*\\*\\*\//@@@/*/\/-\\-\/+\\+\/\/+\\+\/-\\-\\-\//**-- 03:22:59 ------------------- 03:23:25 !slashes /@/\/*\\*\/+\\+\/\/+\\+\/*\\*\\*\//@@@@/*/\/-\\-\/+\\+\/\/+\\+\/-\\-\\-\//**-- 03:23:25 --------------------------------------------------------------- 03:23:27 Um, I'd think that the second replacement would replace * with yet anther replacer. 03:23:54 what? 03:24:00 Replace @ with * and * with something else in it. 03:24:26 The first one will generate a bunch of *s; the second one will turn each * into a doubler. 03:24:44 Oh, I see that you're doing something like that already. 03:25:02 Uh, put some spaces in there so I see what's going on. 03:25:27 !slashes /@/\/*\\*\/+\\+\/\/+\\+\/*\\*\\*\// @@@@ /*/\/-\\-\/+\\+\/\/+\\+\/-\\-\\-\// ** -- 03:25:28 --------------------------------------------------------------- 03:25:49 Brilliant. 03:26:10 i reduced to 3 to keep it below 80 chars 03:26:28 Oh, that actually is what I was looking for. 03:27:05 unfortunately, that causes it to take some more time to get up to speed 03:27:12 Why doesn't that first output a bunch of *? 03:27:20 !slashes /@/\/*\\*\/+\\+\/\/+\\+\/*\\*\\*\//@@@@/*/\/-\\-\/+\\+\/\/+\\+\/-\\-\\-\//**---- 03:27:20 --------------------------------------------------------------------------------------------------------------------------------------------- 03:27:24 er wait 03:27:32 !slashes /@/\/*\\*\/+\\+\/\/+\\+\/*\\*\\*\//@@@@@@/*/\/-\\-\/+\\+\/\/+\\+\/-\\-\\-\//**-- 03:27:43 Since the first /@/\/... just makes the @s into *s, doesn't it? 03:28:00 that must have been fairly big because it doesn't print anything XD 03:28:07 !slashes /@/\/*\\*\/+\\+\/\/+\\+\/*\\*\\*\//@@@@@/*/\/-\\-\/+\\+\/\/+\\+\/-\\-\\-\//**-- 03:28:07 ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ 03:28:42 um no, it turns the @'s into * 3/2-icaters 03:28:59 -!- pikhq has joined. 03:29:08 Mmkay. 03:29:55 So, have you beat the one that uses only one 38er yet? 03:30:10 -!- pikhq has quit (Read error: Connection reset by peer). 03:30:33 well, i _hope_ the thing with 6 @'s above failed to respond because it got really big 03:31:19 Calculate how many it makes! 03:31:45 the 3/2 thing makes that a little awkward :D 03:33:44 -!- pikhq has joined. 03:34:02 !haskell let m3h n = 3*d + r where (d,r) = n `quotRem` 2 in iterate m3h 2 !! 5 03:34:13 13 03:34:38 !haskell let m3h n = 3*d + r where (d,r) = n `quotRem` 2 in iterate m3h 2 !! 6 03:34:40 19 03:34:54 What does that mean? 03:35:22 -!- pikhq has quit (Read error: Connection reset by peer). 03:35:32 it means the 5 @'s produce 13 *'s and the 6 @'s produce 19 *'s 03:35:49 !haskell let m3h n = 3*d + r where (d,r) = n `quotRem` 2 in iterate m3h 2 !! 1 03:35:51 3 03:36:21 !haskell let m3h n = 3*d + r where (d,r) = n `quotRem` 2 in map (iterate m3h 2 !!) [13,19] 03:36:23 [316,3597] 03:37:16 !haskell 6*80-9 03:37:18 471 03:37:53 um wait that makes no sense 03:38:37 If 19 is all you get, then this is worthless. 03:39:06 the @@@@@ one above printed more than 316 -'s, something is wrong 03:40:01 !haskell let m3h n = 3*d + r where (d,r) = n `quotRem` 2 in map (iterate m3h 2 !!) [1..19] 03:40:03 [3,4,6,9,13,19,28,42,63,94,141,211,316,474,711,1066,1599,2398,3597] 03:41:07 !slashes /@/\/*\\*\/+\\+\/\/+\\+\/*\\*\\*\//@@@@@** 03:41:07 ************* 03:41:21 !slashes /@/\/*\\*\/+\\+\/\/+\\+\/*\\*\\*\//@@@@@@** 03:41:22 ******************* 03:43:09 0123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789 03:43:24 (just checking if my terminal is really 80 wide 03:43:25 ) 03:44:31 !slashes /@/\/*\\*\/+\\+\/\/+\\+\/*\\*\\*\//@@@@@/*/\/-\\-\/+\\+\/\/+\\+\/-\\-\\-\//**-- 03:44:32 ---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 03:45:27 what the... 03:45:35 that is _not_ what egobot printed the last time 03:46:24 it had about another line. perhaps that 3597 long one previous caused a bug... 03:46:56 it never printed anything, after all. 03:47:45 anyway 3597 is worthless, as you say, we hadn't even filled in with @'s from the single substitution one 03:49:03 !slashes /@/\/*\\*\/+\\+\/\/+\\+\/*\\*\\*\\*\//@@@@@@@@@@@** 03:49:25 that should be 4096, although it seems to stall egobot again 03:49:33 !slashes Boo! 03:49:33 ************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************ 03:51:10 !slashes /-**/*-/---**************** 03:51:10 **--- 03:51:44 hm wait that can be reversed :D 03:52:10 Ooh, it can! 03:52:10 !slashes /-*/**-/--------* 03:52:10 ****************************************************************************************************************************************************************************************************************************************************************-------- 03:52:29 And you can do that lots of times. 03:52:37 _now_ we're kicking :D 03:52:44 Getting something like 2^^14 of them. 03:53:45 !slashes /-*/**-//*-/--*/--* 03:53:51 oh wait 03:53:59 !slashes Boo! 03:54:00 Boo! 03:54:14 !slashes /-*/**-//*-/--\*/--* 03:54:14 --------------------------------**** 03:55:13 !slashes /@/\/-*\/**-\/\/*-\/--\\*\//@-* 03:55:14 ----** 03:55:52 !slashes /@/\/-\\*\/**\\-\/\/*\\-\/--\\*\//@-* 03:55:52 ----** 03:55:58 !slashes /@/\/-\\*\/**\\-\/\/*\\-\/--\\*\//@@-* 03:56:04 -!- Alex3012 has joined. 03:56:10 !slashes Boo! 03:56:11 Boo! 03:56:23 apparently too much to hope for 03:57:38 !slashes /-*/**-//*-/--\*//-\*/**\-/--* 03:57:47 !slashes Boo! 03:57:48 Boo! 03:58:31 !slashes /-*/**-/----** 03:58:32 ********************************---- 03:58:50 now why didn't the previous one print the same... 04:00:00 i escaped every relevant *- boundary inside the substitutions that i can see... 04:00:01 What are we hoping for that's too much? 04:00:47 Quick question about the BSD license: What do I put for "Organization", given that it's myself? 04:00:55 to be able to copy substitutions into @'s, and then apply them to pass - and * doubling past each other four times... 04:00:59 -!- pikhq has joined. 04:01:24 ?? 04:01:28 "No, completely chaotic" 04:01:34 Your name. 04:01:34 lol 04:01:47 "Neither the name of the Sgeo" 04:02:04 Last time I put an organization into an Organization box, it credited all my work to that organization. 04:02:24 !slashes /-*/**-//*-/--\*/--* 04:02:25 --------------------------------**** 04:02:29 What's the MIT license like? 04:02:50 !slashes /-*/**-//*-/--\*/-* 04:02:51 ----** 04:03:01 I like it 04:03:06 !slashes /-*/**-//*-/--\*//-\*/**\-/-* 04:03:07 ********************************---- 04:03:26 that was better. and one more iteration would kill it XD 04:04:41 which means two @'s is too much to hope for again. hm... 04:09:15 -* => **- => ----** => 32*, 4- => 4*2^32-, 32* => 32*2^(4*2^32)*, 4*2^32- => ... 04:10:29 * Sgeo wonders if codepad.org is an inappropriate way to distribute this code 04:14:08 http://codepad.org/wd8oGuUT 04:14:11 Such a mess :/ 04:17:43 What is that code? 04:20:59 Python mapping of a C API 04:24:09 http://forums.activeworlds.com/showthread.php?p=124425#post124425 04:32:31 !slashes /*1/11*//*\*/*//1*/*1+//1+/+1/*****1 04:32:44 !slashes Boo! 04:32:44 Boo! 04:32:57 !slashes /*1/11*//*\*/*//1*/*\1+//1+/+1/*****1 04:32:58 *++++++++++++++++++++++++++++++++11111111111111111111111111111111 04:41:24 !slashes /(1/11(//(\(/(//1(/(\1+//1+/+1//)/+//+1111111111/1+//11/2//21/3//22/4//41/5//42/6//61/7//44/8//81/9//++/+0+//+///(//(((((1) 04:41:25 000000000000000000000000000000023 04:44:23 !slashes /(1/11(//(\(/(//1(/(\1+//1+/+1//)/+//+1111111111/1+//11/2//21/3//22/4//41/5//42/6//61/7//44/8//81/9//(+/(//++/+0+//+///(//(((((1) 04:44:23 23 04:45:39 !slashes /(1/11(//(\(/(//1(/(\1+//1+/+1//)/+//+1111111111/1+//11/2//21/3//22/4//41/5//42/6//61/7//44/8//81/9//(+/(//++/+0+//+///(//(((((((1) 04:45:39 2 04:46:41 !slashes /(1/11(//(\(/(//1(/(\1+//1+/+1//)/+//+1111111111/1+/(((((((1) 04:46:42 (++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++11+ 04:49:28 !slashes /(1/11(//(\(/(//1(/(\1+//1+/+1//)/+/(((((((1) 04:49:29 (++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++11111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111+ 04:50:15 !slashes /(1/11(//(\(/(//1(/(\1+//1+/+1//)/+//+1111111111/1\+//11/2//21/3//22/4//41/5//42/6//61/7//44/8//81/9//(+/(//++/+0+//+///(//(((((((1) 04:50:15 128 04:50:32 -!- Gracenotes has joined. 04:51:59 !slashes /(1/11(//(\(/(//1(/(\1+//1+/+1//)/+//+1111111111/1\+//11/2//21/3//22/4//41/5//42/6//61/7//44/8//81/9//(+/(//++/+0+//+///(//(11111) 04:51:59 10 04:52:42 !slashes /(1/11(//(\(/(//1(/(\1+//1+/+1//)/+//+1111111111/1\+//11/2//21/3//22/4//41/5//42/6//61/7//44/8//81/9//(+/(//++/+0+//+///(//((((((((((1) 04:52:48 1024 05:01:01 -!- Oranjer has left (?). 05:04:17 -!- sshc has joined. 05:04:22 -!- sshc has quit (Changing host). 05:04:22 -!- sshc has joined. 05:04:27 Hey, you got it to output 1024. 05:04:41 -!- adu has joined. 05:07:45 !slashes /(1/11(//(\(/(//1(/(\1+//1+/+1//)/+//+111111111111/1\+//11/2//21/3//22/4//41/5//42/6//61/7//44/8//81/9//(+/(//++/+0+//+///(//((((((((((1) 05:07:52 4314 05:07:58 !slashes /(1/11(//(\(/(//1(/(\1+//1+/+1//)/+//+11111111111/1\+//11/2//21/3//22/4//41/5//42/6//61/7//44/8//81/9//(+/(//++/+0+//+///(//((((((((((1) 05:08:04 8231 05:08:07 !slashes /(1/11(//(\(/(//1(/(\1+//1+/+1//)/+//+111111111/1\+//11/2//21/3//22/4//41/5//42/6//61/7//44/8//81/9//(+/(//++/+0+//+///(//((((((((((1) 05:08:10 !slashes /(1/11(//(\(/(//1(/(\1+//1+/+1//)/+//+11111111/1\+//11/2//21/3//22/4//41/5//42/6//61/7//44/8//81/9//(+/(//++/+0+//+///(//((((((((((1) 05:08:12 !slashes /(1/11(//(\(/(//1(/(\1+//1+/+1//)/+//+1111111/1\+//11/2//21/3//22/4//41/5//42/6//61/7//44/8//81/9//(+/(//++/+0+//+///(//((((((((((1) 05:08:15 132343 05:08:18 2000 05:08:20 2662 05:08:24 !slashes /(1/11(//(\(/(//1(/(\1+//1+/+1//)/+//+111111/1\+//11/2//21/3//22/4//41/5//42/6//61/7//44/8//81/9//(+/(//++/+0+//+///(//((((((((((1) 05:08:26 !slashes /(1/11(//(\(/(//1(/(\1+//1+/+1//)/+//+11111/1\+//11/2//21/3//22/4//41/5//42/6//61/7//44/8//81/9//(+/(//++/+0+//+///(//((((((((((1) 05:08:31 !slashes /(1/11(//(\(/(//1(/(\1+//1+/+1//)/+//+1111/1\+//11/2//21/3//22/4//41/5//42/6//61/7//44/8//81/9//(+/(//++/+0+//+///(//((((((((((1) 05:08:31 4424 05:08:33 13044 05:08:37 100000 05:08:40 I must say, this function doesn't make much sense. 05:08:51 what? 05:09:15 This is what I get for trying to understand things without analyzing them. 05:09:36 well what you are doing is changing the output base 05:10:42 !haskell import Data.Char; import Numeric; main = print [showIntAtBase n intToDigit 1024 | n <- [2..10]] 05:10:57 !haskell import Data.Char; import Numeric; main = print [showIntAtBase n intToDigit 1024 "" | n <- [2..10]] 05:11:00 ["10000000000","1101221","100000","13044","4424","2662","2000","1357","1024"] 05:11:21 * Sgeo is confused 05:11:55 well the parts from 2000 and down, at least 05:13:00 !haskell import Data.Char; import Numeric; main = print [showIntAtBase n intToDigit 1024 "" | n <- [2..12]] 05:13:02 ["10000000000","1101221","100000","13044","4424","2662","2000","1357","1024","851","714"] 05:14:12 oh! 05:14:46 i need to reorder a bit 05:15:20 !slashes /(1/11(//(\(/(//1(/(\1+//1+/+1//)/+//+1111111111/1\+//11/2//21/3//22/4//41/5//42/6//61/7//44/8//81/9//(+/(//++/+0+//+///(//(111) 05:15:21 6 05:15:59 !slashes /(1/11(//(\(/(//1(/(\1+//1+/+1//)/+//+1111111111/1\+//11/2//21/3//22/4//41/5//42/6//61/7//44/8//81/9//(+/(//++/+0+//+///(//(((111111111) 05:15:59 432 05:16:39 -!- Copyleftist has joined. 05:17:13 -!- Copyleftist has quit (Client Quit). 05:17:41 !slashes /(1/11(//(\(/(//1(/(\1+//1+/+1//)/+//+1111111111/1\+//11/2//21/3//22/4//23/5//42/6//25/7//44/8//45/9//(+/(//++/+0+//+///(//(((111111111) 05:17:41 432 05:18:25 -!- Copyleftist has joined. 05:18:26 !slashes /(1/11(//(\(/(//1(/(\1+//1+/+1//)/+//+1111111111/1\+//11/2//21/3//22/4//23/5//42/6//25/7//44/8//45/9//(+/(//++/+0+//+///(//(((((((1) 05:18:26 128 05:18:40 !slashes /(1/11(//(\(/(//1(/(\1+//1+/+1//)/+//+1111111111/1\+//11/2//21/3//22/4//23/5//42/6//25/7//44/8//45/9//(+/(//++/+0+//+///(//(((((1) 05:18:40 32 05:18:51 !slashes /(1/11(//(\(/(//1(/(\1+//1+/+1//)/+//+1111111111/1\+//11/2//21/3//22/4//23/5//42/6//25/7//44/8//45/9//(+/(//++/+0+//+///(//((((((((1) 05:18:51 256 05:18:55 !slashes /(1/11(//(\(/(//1(/(\1+//1+/+1//)/+//+1111111111/1\+//11/2//21/3//22/4//23/5//42/6//25/7//44/8//45/9//(+/(//++/+0+//+///(//(((((((((1) 05:18:56 512 05:19:48 !slashes /(1/11(//(\(/(//1(/(\1+//1+/+1//)/+//+1111111111/1\+//11/2//21/3//22/4//23/5//42/6//25/7//44/8//45/9//(+/(//++/+0+//+///(//(((((111) 05:19:48 96 05:20:23 !slashes /(1/11(//(\(/(//1(/(\1+//1+/+1//)/+//+1111111111/1\+//11/2//21/3//22/4//23/5//42/6//25/7//44/8//45/9//(+/(//++/+0+//+///(//111() 05:20:23 3 05:21:08 !slashes /(1/11(//(\(/(//1(/(\1+//1+/+1//)/+//+1111111111/1\+//11/2//21/3//22/4//23/5//42/6//25/7//44/8//45/9//(+/(//++/+0+//+///(//111() 1111() 11111() 111111() 1111111() 11111111() 111111111() 05:21:08 3 4 5 6 43 8 9 05:21:21 -!- Copyleftist has quit (Client Quit). 05:21:30 !slashes /(1/11(//(\(/(//1(/(\1+//1+/+1//)/+//+1111111111/1\+//11/2//21/3//22/4//23/5//42/6//43/7//44/8//45/9//(+/(//++/+0+//+///(//111() 1111() 11111() 111111() 1111111() 11111111() 111111111() 05:21:31 3 4 5 6 7 8 9 05:27:07 !slashes /(1/11(//(\(/(//1(/(\1+//1+/+1//)/+//+111111111111/1\+//11/2//21/3//22/4//23/5//42/6//43/7//44/8//45/9//46/A//47/B//84/C//85/D//86/E//87/F//(+/(//++/+0+//+///(//1() (1) 1(1) ((1) 1((1) (1(1) 1(1(1) (((1) 1(((1) (1((1) 1(1((1) ((1(1)) 1((1(1)) (1(1(1)) 1(1(1(1)) ((((1) 05:27:07 1 2 3 4 5 6 7 8 9 A B 100 110 120 130 14 05:27:39 !slashes /(1/11(//(\(/(//1(/(\1+//1+/+1//)/+//+1111111111111111/1\+//11/2//21/3//22/4//23/5//42/6//43/7//44/8//45/9//46/A//47/B//84/C//85/D//86/E//87/F//(+/(//++/+0+//+///(//1() (1) 1(1) ((1) 1((1) (1(1) 1(1(1) (((1) 1(((1) (1((1) 1(1((1) ((1(1)) 1((1(1)) (1(1(1)) 1(1(1(1)) ((((1) 05:27:40 1 2 3 4 5 6 7 8 9 A B C0 D0 E0 F0 10 05:27:59 huh 05:28:37 oh 05:28:53 !slashes /(1/11(//(\(/(//1(/(\1+//1+/+1//)/+//+1111111111111111/1\+//11/2//21/3//22/4//23/5//42/6//43/7//44/8//45/9//46/A//47/B//84/C//85/D//86/E//87/F//(+/(//++/+0+//+///(//1() (1) 1(1) ((1) 1((1) (1(1) 1(1(1) (((1) 1(((1) (1((1) 1(1((1) ((1(1) 1((1(1) (1(1(1) 1(1(1(1) ((((1) 05:28:53 1 2 3 4 5 6 7 8 9 A B C D E F 10 05:29:08 hi 05:29:39 hi 05:29:43 how are you 05:30:43 well i should be going to bed but instead i'm apparently doing number display in /// :) 05:32:06 (aka slashes) 05:33:52 i see 05:33:58 i'm writing an arbitrary-precision lib 05:34:16 which i will use to write a serialization lib 05:34:28 which i will use to write a scripting language 05:34:48 which i will use to write simulation software 05:34:57 which i will use to write artificial intelligence 05:35:05 which i will use to take over the world !!! 05:35:20 dammit i was going to joke how this would end :D 05:35:24 lol 05:35:49 you missed "write an operating system" in there, though 05:36:00 no, i don't need to write an os 05:36:10 that's where the AI comes in 05:36:14 ah. 05:36:21 it will write all the drivers for me 05:36:51 it will crawl the web for documents about all devices ever made 05:37:25 it will also reverse engineer Win32 drivers as well 05:37:38 it will do everyone's homework 05:37:54 um... that's not a good thing? 05:38:07 huh? 05:38:10 which part? 05:38:15 doing everyone's homework 05:38:17 oh 05:38:20 ya i was jk 05:38:43 that would be like, some kinda VIP service 05:39:28 oerjan: what would you have AI do for you? 05:41:42 tricky 06:06:02 -!- oerjan has quit (Quit: Good night). 06:06:24 -!- mibygl has quit (Ping timeout: 252 seconds). 06:17:44 -!- samosa has quit (Quit: samosa). 06:53:09 -!- kar8nga has joined. 07:11:55 -!- jcp has quit (Quit: I will do anything (almost) for a new router.). 07:24:03 -!- MizardX has quit (Ping timeout: 276 seconds). 07:35:48 -!- adu has quit (Quit: adu). 07:43:44 -!- kar8nga has quit (Remote host closed the connection). 07:44:46 -!- kar8nga has joined. 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:02:23 lifthrasiir: PyFunge bug: if ; is the first character in a file, it doesn't work properly 08:16:58 -!- kar8nga has quit (Remote host closed the connection). 08:28:00 -!- kar8nga has joined. 08:40:47 -!- cheater2 has quit (Ping timeout: 258 seconds). 08:54:19 -!- kar8nga has quit (Remote host closed the connection). 09:21:56 -!- MigoMipo has joined. 09:36:14 Deewiant, interesting bug 09:43:01 -!- charlls has quit (Ping timeout: 264 seconds). 09:50:50 Deewiant, a bit hard to test with mycology though I imagine? 10:00:05 -!- cheater2 has joined. 10:03:19 -!- tombom has joined. 10:49:48 -!- adam_d has joined. 10:50:35 -!- Tritonio_GR has joined. 11:29:16 -!- BeholdMyGlory has joined. 11:29:19 -!- BeholdMyGlory has quit (Changing host). 11:29:19 -!- BeholdMyGlory has joined. 11:39:15 -!- alise has joined. 11:43:45 hail 11:53:21 -!- olsner_ has joined. 12:18:50 alise, hi 12:18:54 Hi. 12:19:20 also I found out why I was unable to use some 802.11n networks. Wrong reg domain setting. 12:19:41 (that issue confused me for months) 12:20:28 dear diary 12:20:35 (it was on "world" setting, which is defined as the subset of channels allowed everywhere) 12:20:49 alise, wrong window :P 12:20:57 not quite 12:22:14 what were you going to tell it then? 12:22:47 Actually I was being a jerk to you 12:22:51 :P 12:23:56 I shouldn't be surprised 12:41:18 Now where is coppro? 12:48:52 -!- cheater2 has quit (Read error: Connection reset by peer). 12:49:45 -!- cheater2 has joined. 13:01:03 bbl for the rest of the day 13:01:08 (out of town, no internet) 13:06:08 -!- tombom has quit (Quit: Leaving). 13:08:27 -!- olsner_ has quit (Quit: olsner_). 13:35:38 fpqrsuvtu 13:38:52 Oh, dear; an unwinnable game of robotfindskitten. 14:09:09 AnMaster: Well yes, I'd need a separate file but I won't bother with that for a bug that only shows up in one interpreter 14:20:32 -!- MigoMipo has quit (Remote host closed the connection). 14:25:31 -!- oklopol has joined. 14:38:03 -!- alise has quit (Ping timeout: 258 seconds). 14:52:52 My rfk86 is a bit prone to unwinnables, because the screen is smaller than is typical, but I think I generate the same amount of NKIs. 15:00:30 -!- olsner_ has joined. 15:56:35 -!- mibygl has joined. 16:33:36 -!- olsner_ has quit (Quit: olsner_). 16:43:19 -!- jcp has joined. 16:46:36 -!- BeholdMyGlory has quit (Remote host closed the connection). 17:22:52 -!- Gracenotes has quit (Remote host closed the connection). 18:04:22 -!- adam_d has quit (Ping timeout: 265 seconds). 18:05:02 -!- adam_d has joined. 18:10:35 -!- MizardX has joined. 18:21:18 * Sgeo will try walking outside a bit today 18:22:02 -!- FireFly has joined. 18:59:58 Oh, dear; an unwinnable game of robotfindskitten. <-- is that possible!? 19:00:34 fizzie, NKI? 19:03:04 also I need to figure out how to make ubuntu call iw reg set SV on boot... 19:05:08 err SE of course 19:05:09 not SV 19:06:38 problem is that it needs to be done before the wlan interface goes up, otherwise it won't take effect for some reason 19:06:45 so thus rc.local won't work 19:17:40 -!- fax has joined. 19:29:54 -!- MigoMipo has joined. 19:51:50 -!- alise has joined. 19:52:49 Hello, hello, hello, hello! 19:53:26 Hellote. 19:54:33 11:00:34 fizzie, NKI? 19:54:33 non-kitten items 19:54:35 10:59:58 Oh, dear; an unwinnable game of robotfindskitten. <-- is that possible!? 19:54:38 Apparently in the flash version. 19:54:58 alise 19:54:58 alise 19:55:04 alise, I thought the kitten was always generated, but I guess I was wrong 19:55:30 I am not using my laptop!; I am using the ole' desktop. Not the iMac. 19:55:41 Is a semicolon after an exclamation mark /really/ valid? I mean, honestly. 19:56:13 It ought to be. 19:56:38 -!- coppro has joined. 19:57:25 alise, perfectly, ! is logical not, and ; is "skip to next ; in path" 19:57:45 Your wittosity is unmatched, surely. 19:57:49 In this world. Universe! 20:00:34 -!- BeholdMyGlory has joined. 20:04:07 AnMaster: In rfk86, at least, the kitten is always generated, but it may be unreachable. 20:04:15 xD 20:14:41 gtg 20:14:43 -!- alise has quit (Remote host closed the connection). 20:22:55 fizzie, heh? 20:22:57 -!- adam_d_ has joined. 20:23:01 fizzie, does that even make sense? 20:25:59 -!- adam_d has quit (Ping timeout: 265 seconds). 20:31:38 where is alise 20:31:39 fffffffffffffffff 20:44:47 AnMaster: Sure. You can't move diagonally in rfk86, so if you have an object that is surrounded by 4 other objects (in the corner, 2 other objects is enough), you can't ever touch that object. If it happens to be the kitten, you are out of luck. 20:47:42 (You can move diagonally in the official robotfindskitten, but that just means you need more stuff to block the kitten totally.) 20:49:33 And, after all, robot must touch items to determine if they are kitten or not. 20:51:58 fizzie, true 20:52:23 fizzie, I never seen an unreachable object in the "official" one 20:54:48 If you hve a large terminal, it's pretty unlikely. But it's still possible. 20:55:19 With a 20x5 terminal window (where you only get 20x2 cells of grid) it happens more often than not. 20:56:31 And if you make a small enough terminal window, robotfindskitten ends up in an infinite 100%-CPU loop; probably it's trying to place objects randomly and not finding any free slots. 20:58:44 lol 20:59:18 i remember when i was 8 and had that bug 20:59:24 in a prog 21:09:32 fizzie, hm terminal is 180x41 according stty size 21:12:15 -!- augur has quit (Ping timeout: 268 seconds). 21:23:26 -!- mibygl has quit (Ping timeout: 252 seconds). 21:42:15 -!- hiato has joined. 21:42:42 -!- MizardX has quit (Ping timeout: 276 seconds). 21:42:44 -!- hiato has changed nick to sheep. 21:42:55 -!- sheep has changed nick to hiato. 21:43:05 -!- augur has joined. 21:45:14 -!- hiato has left (?). 22:05:35 -!- MizardX has joined. 22:20:49 -!- isthac has joined. 22:22:52 * isthac is no entirely satisfied with his nick, wanted something that sounded like it was straight out of lovecraft's work 22:23:46 -!- isthac has changed nick to hiato. 22:27:59 And you stuck with it for so long, too. 22:30:51 I know, having withdrawel symptoms as we epeak, but my newly hired councellor says i'll get through it 22:38:34 -!- hiato has left (?). 22:41:11 Huh. 22:41:17 .za is to South Africa as .ch is to Switzerland. 22:41:26 In that it's not actually short for any /official/ name. 22:41:27 Weird. 22:42:20 Weird. 22:43:09 Though, .za would have at least made since if the TLDs were done in '65. :P 22:43:51 (.za is an abbreviation of Zuid-Afrika, Dutch for South Africa. Dutch was an official language there before '65.) 22:49:10 You'd have to go back a bit farther for .ch 22:49:27 Confoederatio Helvetica. 22:49:56 Which actually makes a *little* bit of sense. That's apparently minted on Swiss coins... 22:51:08 Hah. .su exists. 22:51:18 (TLD for the Soviet Union) 22:52:40 There's someone with the email address n@ai 22:53:08 I'd like to see someone with the address root@. 22:53:34 HE ADMINISTERS THE ENTIRE NET 22:53:52 Well, DNS 22:54:05 ENTIRE. NET. 22:54:36 THE TUBERWEBS 22:54:42 YES 22:55:44 rebooting, kernel upgrade 22:58:02 DNS TLDs are fairly ridiculous. 22:58:16 .cat is a gTLD. 22:58:23 It is reserved for sites in Catalan. 22:58:34 -!- AnMaster has quit (Read error: Connection reset by peer). 22:58:57 (a somewhat obscure Romance language) 23:00:26 -!- AnMaster has joined. 23:01:37 sometimes i like to pretend pikhq never googles anything but actually just happens to know everything 23:02:10 Hah. 23:02:17 I <3 me Wikipedias. 23:03:21 * pikhq googles "omniscience" 23:04:03 * Sgeo once tried to make a mathematical proof that no omniscient beings existed 23:04:29 there's this wp page about one of our professors that says he studies math and something like alien abductions. i almost asked him about this, but luckily found out that the wp page had actually confused two professors with the same name before 23:04:33 Sgeo: Under what axioms? 23:04:54 * Sgeo didn't QUITE grasp that Turing machines didn't take/need to take input/output, and that not being computable by a turing machine != not knowable 23:05:05 Hah. 23:05:43 Yeah, a UTM is a machine that can compute any algorithm, not a magic machine that does everything. :P 23:05:53 (that's a UTM + magic oracle) 23:06:13 Hmm. Magic oracle? Me want. 23:15:40 -!- oerjan has joined. 23:28:57 -!- oerjan has quit (Quit: Reboot). 23:31:23 -!- oerjan has joined. 23:34:51 Is hiato's "newly hired councellor" some sort of sneak-dig at the ehird of many names? 23:35:27 why isn't alise back 23:44:10 -!- Oranjer has joined. 23:53:08 grrrrrr 23:56:24 Sgeo: the input and output of a TM are the tape 23:59:24 -!- FireFly has quit (Quit: Leaving). ```