« first day (90 days earlier)      last day (4353 days later) » 

4:18 AM
0
Q: Breaking CAPTCHAs: what is the state of the art?

natemaI've already posted this question on stackoverflow but that place is more specificly for question about programming, then here I am. I've attended a Machine Learning course and, seeing some nice application about image recognition, I wonder what kind of stuff is used in recognizing what is writ...

0
Q: Rewritten: Resolution complexity versus a constrained SAT algorithm

ShyPersonEDITS: Condition C is totally rewritten; the "isoclausal" concept is gone. The question overall is a bit more restricted. Let me know if there are still problems in the exposition. Thanks We have the result that propositional resolution requires exponential time. The resolution result uses the p...

 
 
7 hours later…
11:26 AM
This question of mine in math.SE is about enumerating some integers. I don't think it would belong to cs.SE, but ... would it?
 
It's scary what kind of demographic data they (claim to) have, but overall our stats on quantcast are interesting: http://www.quantcast.com/cs.stackexchange.com
(They don't get those who block their Javascript like me, but still.)
3
@jmad I think that is spot-on TCS. Maybe you need some deep/pure maths, so I'm not sure you'll get better answers on cs.SE. If you don't get a good answers on math.SE, flag for migration to us; math mods usually comply. You can flag immediately, of course, if you so desire.
 
11:44 AM
@Raphael ok, I will at least wait a little bit. But a complete answer on cs.SE seems way more likely than on math.SE. Hope we will manage to keep it that way.
Very scary data indeed. Wow, how do they get this about grad school..
(also, javascript may not be necessary, but I don't know how they measure half of their criteria)
 
12:03 PM
@Raphael: also, I think I need deep math magic, so I will leave it on math.SE as long as reasonable, even though it would probably be better for me in cs.SE since cs.SE folks know math.
 
12:17 PM
@jmad Annual income concerns me more. They track you around the web; figuring out that your name is on some university website as "phd student" is not that hard.
@jmad Your call. There are also some folks with good TCS skills on math.SE, so might very well get a good answer -- if you can live with the inevitably mathy style.
 
I thought that figuring what your name is is hard, but I am probably too naive. About the annual income, I call BS.
 
In other news: Yay, we won! @janoma's question -- our most successful question to date -- steamrolled the algorithms contest on Programmers!
 
(And I can live with the mathy style.)
 
@jmad People login with their FB accounts, use their full names, use email, ... Keep in mint that quantstat can probably correlate lots of data about you.
Maybe that's how they estimate income, too: they see what you look at.
 
 
5 hours later…
5:36 PM
0
Q: Automata that recognizes permuation of 3 symbols and empty string

user465292This is Automata theory homework question. I need to create DFA machine that meets the following criteria: Alphabet ={ a, b, c} Machine contains empty string and strings of length that is a multiple of three, with every block of three containing one a, one b and one c. So far, I came up with ...

 
6:03 PM
1
Q: Can joins be parallelized?

XodarapSuppose we want to join two relations on a predicate. Is this in NC? I realize that a proof of it not being in NC would amount to a proof that $P\not=NC$, so I'd accept evidence of it being an open problem as an answer. I'm interested in the general case as well as specific cases (e.g. perhaps ...

 
 
2 hours later…
7:57 PM
0
Q: Turing Recognisable => enumerable

T. KileyI get the proof of going from an enumerator to a Turing Machine (keep running enumerator and see if it matches input) but I don't see how the other way works. According to my notes and the book (Intro to the Theory of Computation - Sipser), to get Turing enumerator from a Turing machine, we basi...

 

« first day (90 days earlier)      last day (4353 days later) »