#apache #archlinux #asterisk #centos #debian #gentoo #haskell #kde #kubuntu #lisp #math #mysql #perl #python #ruby-lang #rubyonrails #suse #ubuntu #vim #wikipedia 0 1 2 3 4 5 6 7 8 9
Top Prev 5370 5371 5372 5373 5374 5375 5376 5377 5378 5379 5380 5381 5382 5383 5384 5385 5386 5387 5388 Next
#math
<futurist> assuming that each colum is a proper list (the pattern i started might not work)
<futurist> then i zig zag on it
<futurist> and the resulting set is a superset of the valid closed terms
<Olathe> Yes, but then you have (a, a, something) is the only change.
<Olathe> Nothing with (a, b, something), for instance.
<futurist> hmm?
<Olathe> You only change the last item in each tuple.
<futurist> yeah i said the pattern i started in each column might not work.. but there is some pattern that would
<futurist> i guess you would have encoded the tuple using power of prime encoding?
<futurist> i think you almost started to do that
<Olathe> You could do it that way, too.
<Olathe> It would remove the need to store the length.
<Olathe> Simpler in concept, too.
<futurist> store the length of what, the tuple?
<Olathe> Yep.
<Olathe> Otherwise, you wouldn't know when the interleaving wrapped around to the first element again.
<futurist> i still don't know what 'interleaving' means, :p
<futurist> is the zig-zag 'interleaving'?
<Olathe> If you have [1, 2, 3], it is, in binary [1, 10, 11]
<Olathe> So, you take the least significant bits [1, 0, 1] and put them together: 101.
<Olathe> Then, you take the next least significant bits and put them in front of the first three: 011101.
<Olathe> And so on.
<Olathe> To undo it, you need to know there are three elements in the vector.
<futurist> ah
<futurist> but i never encoded into binary at all ??
<Olathe> You can do it with decimal, too.
<Olathe> [37, 11, 24] -> 312714
<futurist> oh, i thought you meant i needed to 'store the length' with my weird zig-zag approacha bove..
<Olathe> Oh, no.
<futurist> so when interleaving, where would you store the length?
<Olathe> You'd put it on the end.
<Olathe> Let's say the length was 2600, you'd put 02161010 at the end.
<Olathe> So, you can do mod 100, see if it's greater than ten. If so, you have more to go.
<Olathe> It can be done more efficiently, though.
<Olathe> >= 10
<Olathe> [37, 11, 24] -> 31271403
<futurist> heh i'm not that good with my binary conversions ;-)
<Olathe> That's just decimal.
<futurist> 2600, you'd put 02161010
<futurist> " "
<futurist> err
<futurist> oh
<futurist> um
<Olathe> Yep, the 0 means start, the 1 means in the middle.
<futurist> ah
<futurist> thanks for all your help! now i'd better get back to learning the proof of the compactness theorem :p
<Olathe> You're welcome.
<Capso> No traffic?
<jonaskoelker> traffic!
<jonaskoelker> can't min-cost flow networks with balance constraints be reduced to circulation networks, by introducing a new node "the board"?
Previous Page Next Page