« first day (1322 days earlier)      last day (3514 days later) » 
00:00 - 16:0016:00 - 00:00

4:04 PM
Sounds like what Tom Lehrer said about Dr Gall and animal husbandry. But I think this is somewhat off-topic for a PPCG chatroom.
 
I have no idea how this started
oh, Rainbolt's CEO
 
@Rainbolt was talking about tips again ;)
 
4:30 PM
"chromatic" is such a nice word
 
@MartinBüttner I saw your sandbox post
@MartinBüttner I worked for a long time on the chromatic number of the plane (sphere/hyperbolic disc)
 
it's actually posted now
@EricTressler how is colouring of a continuum even defined? o.O
 
@MartinBüttner assign a color to each real number. it's a valid map
@MartinBüttner the gap in comprehension, if you aren't familiar with the chromatic number of the plane problem, is that two points are connected iff they're distance 1 apart
 
but how are real numbers neighbours?
oh okay
and the chromatic number is actually finite?
 
yes
it's between 4 and 7, inclusive
 
4:35 PM
(I almost would have posted that question with two words missing o.O)
that's crazy :D
 
yeah; it was a stupid problem to spend my time on in grad school, it's too hard
 
feel free to spend your time on my code golf now ;)
 
but it turns out that you can interpret all kinds of combinatorial problems as hypergraph coloring problems
I may; I don't think I've ever coded the algorithm to color a simple graph
but I guess 16 was deliberately chosen to allow for brute force
 
yes
actually you can't brute force a complete graph with 16 vertices I think (ignoring the fact that it's a trivial case)
or say a graph with 16 vertices and chi = 15
 
well, depending on your definition of "brute"
you can greedily color a k-clique
 
4:39 PM
that's why I said only the test cases have to be completed in a reasonable amount of time. and I think all of those should be doable with a very naive brute force
 
that probably saves you enough to do the rest as naively as possible
I'm not sure if you can greedily color an odd cycle WLOG instead
@MartinBüttner maybe you should change your problem so that there are no odd cycles, to make these easier to compute
 
actually I added those intentionally (if you're referring e.g. to the 5-vertex ring?)
 
@MartinBüttner the last comment was a joke; if there are no odd cycles, the graph's bipartite
But I was referring to that. It's clear that you can color a clique WLOG and reduce the time it takes to brute-force the rest; I was just wondering out loud whether the same can be said of any odd cycle.
ah, no
of course not
but maybe if the induced subgraph is a cycle (there are no other edges among the vertices in the cycle), then you can
 
I don't think I'm following any more (my graph theory terminology is a bit rusty)... but I need to head off for now. later!
 
okay, later
I also have to go, but tonight I'll have copious free time, and I'll give this a shot. I have no right not to have programmed this before, anyway.
 
4:47 PM
@EricTressler I'm still not sure that would work if there's more than one odd cycle.
 
4:58 PM
@PeterTaylor you're thinking what I was thinking before, probably. Say I color a large odd cycle greedily {1,2,1,2,...,1,2,3}, and there are other odd cycles attached that somehow force my coloring to be inconsistent... I can't think of a counterexample off the top of my head, though
 
5:16 PM
weekend!
 
5:37 PM
Hi guys. I think this question (softwarerecs.stackexchange.com/q/11423/6834) from the Software Recommendation website would make a nice code golf challenge after some rewording. I'd like to know your opinions about it. The program would take two text files as input, a passage file, and a whitelist file. It should output the repeated words in the passage file except those provided in the whitelist file. I appreciate your feedback
 
5:50 PM
@Geobits looks like I'll have to crank your divisor up to 11 :/
I feel bad about my laptop now :D
 
Yea, I was wondering how high it would need to go :(
You're comparing it against my desktop with plenty of resources, though, so don't fel bad about your laptop :)
 
oh yeah, regarding your assumption for the chromatic number, I meant to specify that there are no loops
 
Good, I was hoping I wouldn't have to add in bounds-checking code
I also assume there won't be an edge from 5 to 6 in a 3 vertex graph :D
 
okay, but just because you asked so nicely :P
@Geobits divisor 11: 27817255 Total matches, got to j=94906265
 
hmm, lost 5k from div7, not too bad
 
6:24 PM
would you guys count that as "preprocessing the input"? codegolf.stackexchange.com/a/37727/8478
what I had in mind with "any convenient format" was rather, flat list, nested list, string, string with convenient delimiters
@PeterTaylor does 2468 seem reasonable for your False Positives submission?
 
Your laptop must be better than my desktop!
 
don't run Geobits' solution then! :D
 
@MartinBüttner I would
 
okay, I was just about to comment on it
okay, if I can get feersum's submission to compile some time soon, I'll add a leaderboard to the False Positives
 
6:39 PM
hi
 
hi
 
this again...
 
heh
 
lol hi
 
6:50 PM
in my circles we say hu
 
I am now advertising codegolf.stackexchange.com/questions/37620/… . Please give it a go and let me know if there is anything unclear
 
7:06 PM
@user2179021 Have you ever thought that maybe there are ways to make a challenge popular without advertising?
I can teach you, but I have to charge.
2
 
7:19 PM
I ninja changed the title of one question on Board and Card Games just so that I could close another question as a duplicate of that one. It's all about appearances.
Sooner or later all of my gloating about my mischievous activity on B&CG will come back to haunt me
 
you mean if the sock puppet account of a B&CG mod finds his in here?
 
Crap. You figured out my plan of surreptitiously gaining enough rep to close all your questions by becoming an active member of the community there ><
 
or that
 
@Rainbolt thanks:)
did someone comment and then deltee it?
 
Every day I deltee. What of it?
@MartinBüttner Pat Ludwig could never conceal his presence. It's too huge!
 
7:26 PM
Is he the only mod?
 
Ire and Curses chimes in every now and then. Everything he has ever said seems to go over very well with pretty much everyone. Kind of like our own CJY
There's a few community mods that chime in occasionally
They are only active on meta though
 
like dmckee?
And gnibbler?
(actually I don't think I've ever seen gnibbler anywhere since I've come to PPCG)
 
Hi. Where can I ask for advice about posting a challenge?
 
Here seems fine
What advice do you need?
 
I asked earlier in this conversation, but no one was online at the time. Here is my message:
"Hi guys. I think this question (softwarerecs.stackexchange.com/q/11423/6834) from the Software Recommendation website would make a nice code golf challenge after some rewording. I'd like to know your opinions about it. The program would take two text files as input, a passage file, and a whitelist file. It should output the repeated words in the passage file except those provided in the whitelist file. I appreciate your feedback"
 
7:44 PM
It doesn't sound bad in general. I'd look around to make sure there isn't something similar first, but I don't recall anything off the top of my head. If you're looking for specifics and want the opinion of more than just the people in chat, post a spec to the sandbox on meta to get more eyes on it.
 
I tried the Sandbox, but it needs at least 1000 reputation to participate if I understand correctly
 
it needs 5
the 1000 is just to edit the main post
I think I'll remove that again, it's apparently misleading
@Wrz see my last 3 message ^
 
No. It's clear now when I read it again. My bad
 
to rollback or not to rollback?
 
I thought about rewording it earlier when I noticed your edit, but I couldn't think of anything better once I had the edit page open :P
 
7:48 PM
k
 
42
Q: Why do I only breathe out of one nostril?

Dgrin91I was just sitting with my hand next to my nose and I realized that air was only coming out of the right nostril. Why is that? I would think I would use both, it seems much more efficient. Have I always only been breathing out of my right nostril?

 
has that guy never had a cold? o.O
 
I thought the same until I read the answers. Apparently you do it all the time :o
 
no
that's not what I meant
I'd think one would notice that when you have cold that your nose often cycles between open and blocked although the cold isn't getting any worse or better.
(and I think I never assumed that would be linked to having a cold)
anyway yes, if you close one nostril breathing will be as easy as before. if you close the other it will be harder.
 
Oh, I've noticed it on many occasions, but only really noticed when congested (cold or allergies). I assumed it was a side effect of that, or at least related.
As in, your body dealing with the congestion, not for the reasons given there.
 
7:56 PM
right
 
no, i read about it years ago. it definitely happens all the time. it's like the Game, it's something I regret knowing about :|
 
@EricTressler why? it's amazing! especially the fact that you can affect to some degree by lying on one side. knowing that can make a blocked nose much more bearable.
 
i guess it's just something that i notice when i think about it, and it distracts me slightly. not as bad as tinnitus, though.
 
8:24 PM
Who woulda thunk that we have penis tissue in our noses
 
9:17 PM
o.O
1
Q: Why do I breathe out of BOTH nostrils?

paperhurtsAfter reading the question why do I only breathe out of one nostril I realized that breathing out of both isn't common. I have always breathed out of both, and when I get a stuffy nose, or a runny nose, it's on both sides. If only one side is stuffed, I'll just lay on my side a bit to even it out...

 
My coworker was reviewing my code and I mentioned, "We don't need to declare this culture inside of this loop so I moved it outside. We only need one Culture." He responded, "That's pretty radical thinking."
 
I wonder if anyone would catch it if I did something like Culture supreme = new Culture("de");
And where the heck does de come from? Martin, do you know?
 
Is the latter a serious question?
 
Ummm... normally when people ask me that, the correct answer is no. scurries off to Google harder
 
9:32 PM
Deutschland
 
Ah, right
 
no just wasn't sure whether that was referring to your code snippet or the country code in general
 
I think I may have heard that term once in my entire life, while watching Eurotrip
 
lol
still haven't watched that (only Road Trip)
 
Have you seen Misfits?
 
9:33 PM
no
 
I don't imagine people who actually live in the UK would find the accent as funny as americans do
 
some people find Texan accents funny :P
 
Is Monty Python popular in the UK?
 
hell yeah
 
It has a cult following here
 
9:35 PM
they just did some sort of revival show a couple of months ago
 
I've been to their Broadway show (Broadway is the place to watch live performances in the US)
It was titled "Spamalot". I got to shake hands with John Cleese
 
Write, actor, and tall person
 
yeah I heard it about it, but never went
 
Anyone else excited that Heroes is returning next year?
 
10:03 PM
I was watching the Flying Circus a couple of nights ago when I couldn't sleep
they're literally the only non-software DVDs I own
 
0
A: Sandbox for Proposed Challenges

TimmyFinding repeated words in a pessage This challenge is inspired by a question on the Software Recommendations website. Write a program that outputs the repeated words in a passage on a paragraph by paragraph basis. The program should take two text files as input: pessage: contains the paragr...

 
what's the "correct" solution to that, add the words to a hash table and then add them to a set if they're already in the hash table?
 
@MartinBüttner re: this comment codegolf.stackexchange.com/questions/37707/…
how are you deriving that?
 
@DigitalTrauma I miscounted that actually
should be a little more
I'll explain in about half an hour, need to dash
 
10:33 PM
@DigitalTrauma okay, my idea was that there are only 19 numbers below 1k which are eban numbers. and every group of 3 digits needs to be an eban number, and we combine them independently
so that's 19 numbers below 1k, 19^2 numbers below 1M, 19^3 numbers below 1G and so on
but I forgot that they any of them could also be zero (except all of them being zero)
so it's actually just 20^5-1
which is 3199999
which tells me there's a different solution to this: convert n to base 20. map each digit to a group of three digits
sick, I think this would be really short in CJam or something
now let me learn CJam
 
10:50 PM
Yep
thats what I figured too
I added another program to my answer that basically does the same thing
 
I added a Mathematica version in the meantime
now trying to grasp some basic CJam
 
Yes - I +1ed it ;-)
 
okay, I've got the basic code down. it's 74 bytes due to the digit lookup, but I can probably shorten that with byte encoding
46!
edited the post
sweet :)
off to bed
see you!
 
00:00 - 16:0016:00 - 00:00

« first day (1322 days earlier)      last day (3514 days later) »