Sponsored by the Partnership for Academic Competition Excellence (Twitter: @PACENSC)
https://hsquizbowl.org/forums/
The answer line should definitely include other answers like "logic expressions" or "logic circuits", since these are also common terms for the same thing in this context.Silverman wrote:Right, but you're not simplifying the connectives themselves, you're simplifying the expression as a whole. That's like saying "conjunctions" when the question wants "sentences" (in a natural language sense).Inifinite Jest wrote:Boolean operators are equivalent to logical connectives
I agree that there were a number of missing alternate answers. I also have doubts about whether "Booleans" should be an acceptable answer. I have only ever seen "Booleans" refer to individual variables, and not entire expressions.otsasonr wrote:The answer line should definitely include other answers like "logic expressions" or "logic circuits", since these are also common terms for the same thing in this context.Silverman wrote:Right, but you're not simplifying the connectives themselves, you're simplifying the expression as a whole. That's like saying "conjunctions" when the question wants "sentences" (in a natural language sense).Inifinite Jest wrote:Boolean operators are equivalent to logical connectives
No, you're wrong. In particular, all of these algorithms only work if the logic expressions are Boolean logic expressions. For example, you cannot simplify them using any of these methods if they are fuzzy logic expressions. Perhaps answers are promptable, but certainly not acceptable.The answer line should definitely include other answers like "logic expressions" or "logic circuits", since these are also common terms for the same thing in this context.
Oh, of course, there's definitely not a commonly used convention that unless otherwise specified, logic refers to ordinary two-valued logic. That would be ridiculous, and is definitely not something that anyone who has actually ever worked with digital logic knows.Ike wrote:Sorry I've been away from this for a while.
No, you're wrong. In particular, all of these algorithms only work if the logic expressions are Boolean logic expressions. For example, you cannot simplify them using any of these methods if they are fuzzy logic expressions. Perhaps answers are promptable, but certainly not acceptable.The answer line should definitely include other answers like "logic expressions" or "logic circuits", since these are also common terms for the same thing in this context.
Again, all of these examples are using the set of logic expressions that coincides with the set of valid Boolean functions. I think you understand that the set of all possible logical expressions is a superset of the set of all Boolean functions -- you can't accept that answer, (I've updated the prompt line to include a prompt on "logical expressions). While I'm a little sympathetic to the idea that you may be in a discipline where the shorthand means that "logic" means "two-valued logic", you must indicate in some way that this is either "0-1 logic" or "Boolean logic" since contra your posts, it is perfectly "ordinary" to use polyvalent logics.otsasonr wrote:Oh, of course, there's definitely not a commonly used convention that unless otherwise specified, logic refers to ordinary two-valued logic. That would be ridiculous, and is definitely not something that anyone who has actually ever worked with digital logic knows.Ike wrote:Sorry I've been away from this for a while.
No, you're wrong. In particular, all of these algorithms only work if the logic expressions are Boolean logic expressions. For example, you cannot simplify them using any of these methods if they are fuzzy logic expressions. Perhaps answers are promptable, but certainly not acceptable.The answer line should definitely include other answers like "logic expressions" or "logic circuits", since these are also common terms for the same thing in this context.
It is certainly not so common that I was able to find a set of course notes using that convention in 5 seconds. Or another one (here they are referred to as logic functions). Or maybe even a textbook [1].
References
[1] R. F. Tinder. Engineering Digital Design. San Diego, CA. Academic Press, 2000
khannate wrote:Could I see the tossups on primes and variance please? I'll also add that I was frustrated by the tangrams tossup as well, since they don't seem to have any importance other than being a cute puzzle, and aren't really something you would hear about while learning math.
EFT Packet 1 wrote: 6. The bootstrap method was devised as an improvement to the jackknife method for estimating this quantity for a sample. Bartlett’s test may be used to determine if a number of samples are from populations with equal values of this quantity, a condition known as homoscedasticity. For the geometric distribution, this quantity is equal to [read slowly] “one minus p over p squared.” If a continuous distribution lacks an (*) expected value, then it also lacks a value for this quantity; that is because this quantity is defined as the square of the expected value minus the expected value squared. This quantity, which is the second moment of a distribution, is equal to the square of the standard deviation. For 10 points, name this quantity that measures the amount of spread in a data sample.
ANSWER: variance [prompt on homoscedasticity until read]
EFT Packet 4 wrote: 14. Samuel Yates coined the term “titanic” for examples of these values that are written in the form of 10 to the power 999 plus n, with the smallest n being equal to 7. These values raised to “p minus 1 divided by 2” are congruent to the Legendre symbol of these values over p mod p according to Euler’s criterion. A topological proof about these numbers was given by Hillel Furstenberg. Eisenstein integers with this property are (*) irreducible. Perfect numbers have a one-to-one correspondence with a class of these numbers named for the Frenchman Mersenne. An unproven conjecture states that the number of these with a gap of “two” is infinite. Euclid showed that there are infinitely many of these numbers. For 10 points, name these non-composite numbers which are only divisible by themselves and one.
ANSWER: primes [accept any answer mentioning primes]
I think the lead in to this tossup could afford to at least include a phrase like "most commonly used to estimate this quantity," since bootstrapping and jackknifing can both be used to approximate a bunch of things that aren't the variance. In particular, I buzzed on that clue because I knew what bootstrapping was, but then couldn't figure out what to answer with. (There's also a very minor mistake in that the variance is actually the second central moment, and not necessarily the second moment, but I doubt that'll throw anyone off.)EFT Packet 1 wrote: 6. The bootstrap method was devised as an improvement to the jackknife method for estimating this quantity for a sample. Bartlett’s test may be used to determine if a number of samples are from populations with equal values of this quantity, a condition known as homoscedasticity. For the geometric distribution, this quantity is equal to [read slowly] “one minus p over p squared.” If a continuous distribution lacks an (*) expected value, then it also lacks a value for this quantity; that is because this quantity is defined as the square of the expected value minus the expected value squared. This quantity, which is the second moment of a distribution, is equal to the square of the standard deviation. For 10 points, name this quantity that measures the amount of spread in a data sample.
ANSWER: variance [prompt on homoscedasticity until read]
I think the usage of the variable "p" makes the second line of this tossup a little transparent, and I heard that a few other people also felt this way. There's also a small error near the end: there's a one-to-one correspondence between Mersenne primes and even perfect numbers, but I don't think it's known whether odd perfect numbers even exist.EFT Packet 4 wrote: 14. Samuel Yates coined the term “titanic” for examples of these values that are written in the form of 10 to the power 999 plus n, with the smallest n being equal to 7. These values raised to “p minus 1 divided by 2” are congruent to the Legendre symbol of these values over p mod p according to Euler’s criterion. A topological proof about these numbers was given by Hillel Furstenberg. Eisenstein integers with this property are (*) irreducible. Perfect numbers have a one-to-one correspondence with a class of these numbers named for the Frenchman Mersenne. An unproven conjecture states that the number of these with a gap of “two” is infinite. Euclid showed that there are infinitely many of these numbers. For 10 points, name these non-composite numbers which are only divisible by themselves and one.
ANSWER: primes [accept any answer mentioning primes]
Most importantly: in the first part there's a typo "between hydrogen and water" which should read "between hydrogen and oxygen". That should be fixed if this set is being played elsewhere.Packet 8, Bonus 5 wrote:An early precursor to these devices was sketched by William Grove and soaked various metal plates in sulfuric acid. For 10 points each:
[10] Name these devices which utilize the reaction between hydrogen and water to generate energy while leaving just water as a byproduct.
ANSWER: hydrogen _fuel cells_
[10] The viability of fuel cells is considered dubious considering that hydrogen and oxygen are typically obtained from this process of splitting water with a current, which requires more energy than the fuel cell will produce.
ANSWER: _electrolysis_
[10] A common fuel cell variant uses one of these structures to separate the anode and the cathode. When hydrogen is split at the anode, electrons flow through a circuit to generate current while the remaining particles diffuse through this structure.
ANSWER: _proton exchange membrane_ [or polymer electrolyte membrane; accept PEM] <Chem, AW>
This is a bit of a stretch -- did you (anyone) neg this with Szemeredi/integers as a result? Furstenberg's proof of the primes is a cool trick and pretty well-known among math enthusiasts as a fun topological argument. It seems weird to assume this clue was pointing to Szemeredi's theorem when they said "topologically" as opposed to "with ergodic theory" (and if you look at his proof, it's not really topological morally; just because he's an ergodic theorist doesn't mean you'd use the word "topologically" to describe each of his proofs...). This seems like a prime example of a clue where, especially at game speed, if you actually knew what was going on, you'd buzz on it correctly, and if you didn't, you wouldn't even be baited into a neg.Amizda Calyx wrote:Furstenberg is an ergodic theorist and has therefore proved lots of things topologically (literally most of the things he's done)...for example, Szemeredi's theorem (Rutgers!), which would be a topological proof about integers.