How about, we make a predefined list of medals ranked by hardness. The submitted program takes a string as an argument and outputs an int, on the restriction that the outputs for the medals should follow the predefined ranking.
If the only thing on the list is "iron is stronger than gold", then any string->int program is valid if it gives a greater output for iron than gold.
Let g₁, ..., g₁₂ denote the basic moves of the Rubik isocahedron. A surprising result of Conway states that the group generated by gᵢ ∗ gⱼ⁻¹ is the simple “sporadic” group M12.
If anyone has a chance, I'd like some second opinions on whether or not this sandbox post would be a dupe of the related challenge (linked in the post)
Oh my gosh. I was writing a real query and almost aliased my subquery as something very inappropriate
FROM
(
SELECT ne.Name, gr.Name as GroupName, oid.Name as OidName
FROM [dbo].[NetworkElement] AS ne
JOIN [dbo].[Group] AS gr ON gr.Id = ne.GroupId
JOIN [dbo].[Oid] AS oid ON oid.Id = gr.Oid
) AS
I'm not sure what I meant by "real query". I guess I meant "the kind of query you write at work, and not for fun", but who writes queries for fun?
In computational complexity theory, the complexity class ELEMENTARY of elementary recursive functions is the union of the classes
The name was coined by László Kalmár, in the context of recursive functions and undecidability; most problems in it are far from elementary. Some natural recursive problems lie outside ELEMENTARY, and are thus NONELEMENTARY. Most notably, there are primitive recursive problems that are not in ELEMENTARY. We know
LOWER-ELEMENTARY EXPTIME ELEMENTARY PR R
Whereas ELEMENTARY contains bounded applications of exponentiation (for example, ), PR allows more general hyper...
In computational complexity theory, L (also known as LSPACE or DLOGSPACE) is the complexity class containing decision problems that can be solved by a deterministic Turing machine using a logarithmic amount of memory space. Logarithmic space is sufficient to hold a constant number of pointers into the input and a logarithmic number of boolean flags, and many basic logspace algorithms use the memory in this way.
== Complete problems and logical characterization ==
Every non-trivial problem in L is complete under log-space reductions, so weaker reductions are required to identify meaningful notions...