39 karma · joined August 13, 2021
And also I think there is a small typo at the end of second to last paragraph. "At the same time we have the category of groups, for example, which contains the category of monoids as a subcategory, as all monoids are groups etc.". The roles of monoids and groups are actually reversed - all groups are monoids, but not all monoids are groups.
Oh and also when you recognize your design to be something from ct its probably quality. Shit code cant be described with simple math (simple as in all math is simple, not as in math that is easy to understand).
Edit: HE scheme (lwe) works on individual bits. Meaning there are only two plaintexts (0,1). Each has exponentially many ciphertexts, only one chosen at random. They also share ciphertext space, meaning each ciphertext could be either encrypted zero or one.
Stockfish: 3585 Elo
"Elo suggested scaling ratings so that a difference of 200 rating points in chess would mean that the stronger player has an expected score (which basically is an expected average score) of approximately 0.75, and the USCF initially aimed for an average club player to have a rating of 1500."
I guess that means that Magnus has expected score of roughly 0.25^((3585 - 2864)/200) = 0.00675 against Stockfish 15, which is basically 1 in 200 games?
So chess being a win for one side is equivalent to starting position being zugzwang for the other side.
It's obvious now, but so interesting to me, I never thought about it that way! Thanks for taking time for explaining yourself.
Does this strategy necessarily leads to provably losing position?
So until proven otherwise it's still possible that its theoretical win for white, theoretical draw or theoretical win for black as i understand it.
"..the algorithm evaluated candidate equations in terms of how well they could compress a data set. A random smattering of points, for example, can’t be compressed at all; you need to know the position of every dot. But if 1,000 dots fall along a straight line, they can be compressed into just two numbers (the line’s slope and height). The degree of compression, the couple found, gave a unique and unassailable way to compare candidate equations."