Re:Ask HN: 2 karma minimum to lock out spam bots
by jrnkntl on Friday April 24, 2009 @07:47AM
(#577330)
Some basic Erlang questions are fine with me ;)
Re:Ask HN: 2 karma minimum to lock out spam bots
by dhimes on Friday April 24, 2009 @07:26AM
(#577315)
We'd have to agree on how to write II + II
We could ask for a basic derivative (for example, of a polynomial), or the value of 'x' in a simple algebraic equation x+5 = 2x + 10
Re:Ask HN: 2 karma minimum to lock out spam bots
by cperciva on Friday April 24, 2009 @08:25AM
(#577369)
Problems like that are far too easy for computer programs to solve. Clearly the right solution here is to present new users with a set of Turing machines and ask them which of the specified machines halt.
This would probably be very effective at limiting the growth rate of HN, too.
Re:Ask HN: 2 karma minimum to lock out spam bots
by dhimes on Friday April 24, 2009 @09:10AM
(#577425)
I've never written a bot. I thought perhaps that the process of parsing instructions (we could put more than one variable in the equation), then writing code to solve, might be more effort than it's worth to them. Especially if we're doing something that is somewhat unique so their reward would only be one page. However, phildawes is apparently implying that once the bots have parsed the problem and know what to solve for they could go to a page that implements Mathematica and submit the problem to be solved, therefore saving the time required to write problem-solving code. I didn't realize they worked like that.
Re:Ask HN: 2 karma minimum to lock out spam bots
by rythie on Friday April 24, 2009 @09:57AM
(#577491)
agreed, computers are good at solving math problems or running Turing machines (since they are them). You would be better off with a turing test (http://en.wikipedia.org/wiki/Turing_test) that only a human can answer - and if any does get a computer to solve it you get them to start a company because they have solved a fundamental computing problem.
Re:Ask HN: 2 karma minimum to lock out spam bots
by cperciva on Friday April 24, 2009 @11:23AM
(#577607)
Computers are good at simulating Turing machines. Computers aren't good at determining whether Turing machines halt; in fact, it is impossible for a computer to determine in the general case whether a Turing machine will halt.
Re:Ask HN: 2 karma minimum to lock out spam bots
by rythie on Friday April 24, 2009 @12:09PM
(#577680)
Fair enough, though it might have the effect of not letting humans in either ;-)
Re:Ask HN: 2 karma minimum to lock out spam bots
by phildawes on Friday April 24, 2009 @07:49AM
(#577332)
Cool - a challenge bots can't hope to beat. Oh wait... http://72.3.253.76/webMathematica3/quickmath/page.jsp?s1=equ...
eg, what's LV + IV? Answer has to be given in latin numerals, too.