Sorry to keep bragging about badges, I just had to show off this screenshot that proves it is possible to beat the PPCG overlord Martin Büttner in a rep/badge count. Even if it never happens again, it has been done this day. (Love you Martin, no hard feelings ;) )
@MartinBüttner Go get 10k on Rat Race now so we're tied as usual :P
I've been hacking away at adding the first adverbs to inca3, rank and curry/compose. It compiles, but I need to read it carefully with a fresh brain.
Which I do not, at present, have.
:/
:)
The second week of the show is going well. Turnout was a little light last night, but better tonight.
The show has numerous permutations depending upon audience voting, but most of the audiences have made the same choices. :)
Somehow tonight, we massaged the results to get something different. Which of course, meant playing a piece of music that we've rehearsed less than everything else. So that was exciting, (almost) sight-reading, live.
Most of the audiences have voted Bazzard (the Manservant) as the Undercover Detective, and Rosa (the young fiancée) as the Murderer. Can't really blame them, though. The guy playing Bazzard is very charismatic and fun to watch, and girl murderers are sexy.
Plus, she has the prettiest song; so it's fun to see her do the "evil" song, too.
Tonight, we got Rosa as the detective, and the Vicar as the murderer. That was fun. His whole motive falls apart and he's left just looking like a homicidal idiot. The actor plays that well. :)
aha. I knew something was missing. I still need to add the adverb handler in the parse table. I think that's keep till tomorrow. Now for some tv.
Signs you should commit: vi tells you you have too many +n commands.
so you say, but each gold badge you take, it is preventing others to take one .
say for example, populist.
:P
If I were TRA I, I would have blocked you from using stack exchange as you give unfair competition to other users (just as they are trying to do with WhatsApp here)
This is a MathJax-related issue. Here are some very short snippets that reproduce the bug, which appears to occur whenever multiple dollar signs are placed in a single code block:
$foo
$bar
$baz
and
$
foo
bar
baz
$
Note that the original source of this answer does not in...
2^0+1*5
code-golf kolmogorov-complexity number-theory
Background
This puzzle is a variation on the four fours puzzle (itself the topic of a past question). Like that puzzle, the aim is to find mathematical expressions for different whole numbers, using only four digits and certain mathemati...
2005 - Prelude
Prelude is a very fun language, whose source code consists of several "voices" which are executed in parallel and which I really enjoy solving problems in. It is meant to be the ASCII representation of its sister language Fugue, which actually takes .midi files as its source code ...
sooo... I think I should get sandbox posts for prelude metagolf ready... I'm thinking it'll be two parts... first, the simple one: given a number of voices and an integer, find the shortest way to get that integer onto any stack. second, the harder one: given a string, generate a program printing it, a short as possible. I think this will be plain metagolf.
I might add a maximum number of voices to the second one as well.
the tricky thing is defining optimality for the first task: columns? non-space characters? all characters minus trailing spaces?
Today I found something weird with stack snippets...
I found it in this question:Interpreting Fish (no, not that Fish)
It was in my answer: http://codegolf.stackexchange.com/a/48686/14732
Basically, R(r+'(?=[>,]|$)','g') is being converted to R('^'+r+'+01943df1-b949-454b-b253-e39f9f31ca1e)','g...
Bijective N -> Z x Z function
or
Generate a pair of integers from a non-negative one
code-golf math numbers function?
You should write a program or function which takes a non-negative integer N as input and outputs or returns two integers (negative, zero or positive) X and Y.
Integers are me...
any notes before posting?
mainly regarding the title / function tag / bolded question
We've had MathJax support for 3 days now. While it makes our maths challenges look neat, it has also created two problems:
Some search results are messed up.
Indentation of code blocks and Stack Snippets are messed up.
Especially the latter is a fairly big deal around here. So far, only a few...
Note: We might also be able to get away with changing the delimiter instead (ex. using \$foo\$ instead of $foo$, and similarly \$$ instead of $$), which would give us MathJax and unbroken code blocks for the most part (how often are you going to have \$ happen twice in one code block?). The only reason I'm not posting this as an answer is that I still haven't Done the Science™ on a site with \$ as their delimiter to make sure that this would actually fix the problem. — Doorknob ♦14 secs ago
Keep MathJax, but change the delimiters
From my comment:
Note: We might also be able to get away with changing the delimiter instead (ex. using \$foo\$ instead of $foo$, and similarly \$$ instead of $$), which would give us MathJax and unbroken code blocks for the most part (how often are yo...
Good Afternoon, The south gate has been struck by lightening and is not opening. We are working to correct this issue. Please use the North Gate while we work on this. If you have any questions please contact us 555-555-5555.
Various challenges require the programmer to return “either a truthy or falsy value.” While it is clear that “truthy” and “falsy” refer to values that can be interpreted as boolean “true” and “false,” it would be great if someone could specify what values exactly qualify as “truthy” and what do q...
@Optimizer Sometimes... I've edited a few links to the interpreter that got chewed up by the post parser. I won't argue that chat has issues, though :P
I think it mainly depends on if you do them chat-style []() or post style, with numbered links.
Tolkien Gateway says:
Tolkien came up with the title under deadline pressure and later expressed dissatisfaction with it. In letters and one sketch he considered several possible sets of towers, including Minas Tirith and the Barad-dûr, and even the possibility of leaving the matter ambiguous...
In mathematics, a normal number is a real number whose infinite sequence of digits in every base b is distributed uniformly in the sense that each of the b digit values has the same natural density 1/b, also all possible b2 pairs of digits are equally likely with density b−2, all b3 triplets of digits equally likely with density b−3, etc.
Intuitively this means that no digit, or combination of digits, occurs more frequently than any other, and this is true whether the number is written in base 10, binary, or any other base. A normal number can be thought of as an infinite sequence of coin flips...
A programmers wife is having a baby. When the baby is born, the doctor hands the baby to the programmer to announce the gender. The wife says, "Is it a boy or a girl?" The programmer responds, "True."
If it's language specific, just use a tag for that language. For example, there's a [brainfuck] tag, a [java] tag, etc. If the question says "you can use only esoteric languages", I'm not sure it's well thought out.
When posting an HTTPS url like https://stackoverflow.com/..., it does not onebox in chat.
For example: http://chat.stackexchange.com/transcript/message/12317079#12317079
@rcrmn I think the number of functions from N to N is already uncountably infinite, but I may be mixing this up. you can definitely build uncountable infinities from countable things though... like the set of all (finite) integer sequences
I learned that the set of all one-to-one mappings of $\mathbb{N}$ onto $\mathbb{N}$ has cardinality $|\mathbb{R}|$.
What about surjective functions and bijective functions?
take the N -> Z bijective functions where each function is encoded as a real number R: always take the next number with smallest absolute value on the left or right based on r's binary digits
The proof that I have in mind is as follows -
$\text{Gal }(\overline{\mathbb Q}/\mathbb Q)$ is a proper uncountable subgroup of the group of permutations on countably many symbols, hence the latter is uncountable. .
But it needs a lot of jargon from topology and algebra. Is there a neat proof ...
@MartinBüttner If the top voted answer to Do we really want LaTeX/MathJax (right now)? turns out to not be possible (see Chris's comment about what can and cannot be done), then suddenly the voting on that question does not make sense. Some may have skipped voting for their second favorite choice under the false impression that the top voted choice was actually a choice.
When I talk about Meta here, I mean any meta but this one.
I understand the Idea behind "Your vote is now locked in unless this answer is edited". However, I don't think this reason applies to meta sites and have some reasons why I think votes on meta sites shouldn't get locked:
Opinions change...
I've found many questions here regarding this 'feature' and many answers explaining how it works, but none showing any 'philosophical' concept behind it. i.e., why is it here? Is it helping to make site better?
For example, just now I made a downvote, retracted it to think a bit more, left a com...
Why am I not allowed to change my vote after some period of time? There are times when I go back to things I voted on, and decide they didn't deserve that specific vote. (I get wiser as I grow older)
KotHs are usually only active for a while, because the author has to actively test the submissions which they are usually not willing to do forever. so answering old KotHs usually is often a bit pointless. I'd just look at the most recent ones by sorting the tag page for king-of-the-hill by newest and see if any of them are still active.
@ASCIIThenANSI If you want to compete with yourself, you can download the source from either of my KotH's and play with them. Granted, your submission won't get much visibility.
@ASCIIThenANSI leave a comment on the question and ask the OP if the challenge is still open or not (and if not ask them to state this in the question)
@JoeZ. It's used for mainly the same reasons, to appear "better" or something. Art houses and "fancy" neighborhoods like it especially: google.com/maps/search/centre+atlanta/…
This is a MathJax-related issue. Here are some very short snippets that reproduce the bug, which appears to occur whenever multiple dollar signs are placed in a single code block:
$foo
$bar
$baz
and
$
foo
bar
baz
$
Note that the original source of this answer does not in...
2^0+1*5
code-golf kolmogorov-complexity number-theory
Background
This puzzle is a variation on the four fours puzzle (itself the topic of a past question). Like that puzzle, the aim is to find mathematical expressions for different whole numbers, using only four digits and certain mathemati...
Today I found something weird with stack snippets...
I found it in this question:Interpreting Fish (no, not that Fish)
It was in my answer: http://codegolf.stackexchange.com/a/48686/14732
Basically, R(r+'(?=[>,]|$)','g') is being converted to R('^'+r+'+01943df1-b949-454b-b253-e39f9f31ca1e)','g...
Bijective N -> Z x Z function
or
Generate a pair of integers from a non-negative one
code-golf math numbers function?
You should write a program or function which takes a non-negative integer N as input and outputs or returns two integers (negative, zero or positive) X and Y.
Integers are me...
Tolkien Gateway says:
Tolkien came up with the title under deadline pressure and later expressed dissatisfaction with it. In letters and one sketch he considered several possible sets of towers, including Minas Tirith and the Barad-dûr, and even the possibility of leaving the matter ambiguous...
![[audience looks around] 'What just happened?' 'There must be some context we're missing.'](http://imgs.xkcd.com/comics/formal_languages.png "[audience looks around] 'What just happened?' 'There must be some context we're missing.'")
When posting an HTTPS url like https://stackoverflow.com/..., it does not onebox in chat.
For example: http://chat.stackexchange.com/transcript/message/12317079#12317079
I learned that the set of all one-to-one mappings of $\mathbb{N}$ onto $\mathbb{N}$ has cardinality $|\mathbb{R}|$.
What about surjective functions and bijective functions?
The proof that I have in mind is as follows -
$\text{Gal }(\overline{\mathbb Q}/\mathbb Q)$ is a proper uncountable subgroup of the group of permutations on countably many symbols, hence the latter is uncountable. .
But it needs a lot of jargon from topology and algebra. Is there a neat proof ...
Why am I not allowed to change my vote after some period of time? There are times when I go back to things I voted on, and decide they didn't deserve that specific vote. (I get wiser as I grow older)
