25600+ entries in 0.017s
mircea_popescu: trinque> mod6: seems like a valuable thing to have, local corp << a recurrent observation.
mircea_popescu: yeah. you can sell all your shit that's out of amortization at half price, become huge. well, "huge", south america huge.
mircea_popescu: mod6 conceivably (besides ip registration thing, which how's it going ?) might also get vendor status ? open a little shop of actual stuff in uruguay ?
mircea_popescu: considering how much lisp i read... possibly not even then!
mircea_popescu shall proceed to coffee with diana_coman in a few, but thereafter will be back, so no worries.
mircea_popescu: specifically, how do i pick among alternatives 1. "all stacks with odd index, left, all stacks with even index, right" and 2. "all stacks under 75 or over 125 left, all stacks within 75 to 125, right" ?
☟︎ mircea_popescu: suppose i have stacks of 10k each with qualities from 50 to 150. average q is 100. now, how do i split these 100 stacks into two subsets ?
mircea_popescu: 2. you split the starting set into two sub sets by the criteria ? and without splitting stacks ?
mircea_popescu: so 1. calculate q so that n q + m (q+1) = S (the sum of the count-quality products for the entire starting set)
mircea_popescu: collective personage best personage, nobody has authority top say "this wasn't said".
mircea_popescu: BingoBoingo good god, are they now gonna do a bunchga herp derp about how important the moron is and how irreplaceable the scrapping ?
mircea_popescu: (holy shit think about it, state information ~for projects~)
mircea_popescu: "Solution (.Sln) File - msdn.microsoft.com The new home for Visual Studio documentation is Visual Studio 2017 Documentation on docs.microsoft.com. The latest version of this topic can be found at Solution (.Sln) File. A solution is a structure for organizing projects in Visual Studio. The solution maintains the state information for projects ..."
mircea_popescu: anyway, i expect the "hard" case would revolve around powers of two, so i'm guessing checkermark pairings probably deliver the hardest case (for current pairwise mixing). say in 8 bit : 85 items q170, 146 items q 73, 219 items q109 and so on.
mircea_popescu: the ~other~ good approach is 1. calculate average quality as a real ; 2. calculate the integer piles of consecutive qualities this reduces to (you'll never get an irrational value through 1, which in itself is a very itneresting lemma) ; 3. try all pile pairs in some (random ?) order for producing either of the two expected qualities.
☟︎ mircea_popescu: so far, the correct approach seems to be : 1. select the outlier piles (highest q, lowest q). 2. mix the smaller of the two with such a fraction of the larger of the two as can be done. 3. repeat. if 2 fails, move inwardly on the pair list.
mircea_popescu: next you split the 100 into the 991 and 992 groups and you're done.
mircea_popescu: next you split the 100 into the 991 and 992 groups and you're done.
mircea_popescu: Mocky : mix 1q1 with 99q 1001. new set is now 100q1k, 100q991, 1q 1001. then mix 1q1001 with 9q991. new set is 100q1k, 91q991, 10q992.
mircea_popescu: i recall this being a topic at c1, and me going "oh, there'll be bots"
mircea_popescu: didn't thickasthieves get carpal ? or am i conflating stories ?
mircea_popescu: me too! i used to not really be able to do so much, but nowadays...
mircea_popescu: it's mockybot these days tho. he finally released one that works, i've been mining with it all week.
mircea_popescu: you'll never make the tops, but then again not everyone does.
mircea_popescu wipes tear from eye, brought forth by how eulora will entertain even the blackhearted heretics who won't "play" it. it is a tear of joyous schadenfreunde.
mircea_popescu: BingoBoingo i love the pretense that dumb whale has "a life".
mircea_popescu: im right, im right. there's a reason we're using "two stacks of diff parities" as stop condition.
mircea_popescu: 3 or more piles of diff q are always miscible further.
mircea_popescu: there can't be inmiscible more-than-two-not-same-q piles.
mircea_popescu: one obvious strategy : make q1 piles of everything, then min-max them, sorta like bubble sort.
mircea_popescu: now mind you, we have no proof that this is correct approach. maybe by strewning out piles you get better results in the end.
mircea_popescu: put x% of stack a in stack b === mix stack b with portion of a and place the result where stack b stood before.
mircea_popescu: the thing is : if you mix portions of both stacks you gain ~nothing.
mircea_popescu: this function is neither derivable nor even continuous. can call it eulora mix function or w/e.
mircea_popescu: seems to me that EXACTLY like in the original case of the diophantine approach to "just how many primes are there" we've in fact drawn a conical here in a multi-dimesional space.
mircea_popescu: numerically : (0..100], (0..80], 17, 19. 1 * 17 + 5 * 19 modulo (1+5) = 4.
mircea_popescu: consider the intervals of N (0...a], (0...b]. for two arbitrary values from N, p, q. the sum of the series-product in the ring modulo-sum is ~sometimes~ 0.
mircea_popescu: though our constraint is narrower than "not admit factors", but if you do the whole thing in modulo-ai+bi...
mircea_popescu: asciilifeform specifically via diophantine : if a and b is a natural interval then a*p + b * q (p, q arbitrary constants) will not admit factors ever so often (when they sum to a prime)
mircea_popescu: closed form is closed form, fuck you and mz. heuristics tied together to the same pole.