Hahahahahahahaha
Oh.. you were serious.
Well, the fact that you're reading this means GitHub hasn't taken the repo down yet... so I guess things are still going pretty well?Show HN: XKCD-inspired StackSort
71–80 of 210 posts
Re: Show HN: XKCD-inspired StackSort
#72Re: Show HN: XKCD-inspired StackSort
#73Damn, if I only had the time to write this... |-(
Re: Show HN: XKCD-inspired StackSort
#74If you give it about 30 seconds it works eventually, this is beautiful. I had a good laugh. Edit: It makes me want to do something crazy like setup a tool chain that cobbles whole programs together with trial and error like this. Throw enough resources at it maybe it will be faster and cheaper than your avg. developer. It will be an unmaintainable mess as if you used Brainfuck or Perl. But it will run, by god, it wil…
It's called Choice Words (https://github.com/fdb/choicewords) It can generate poems but also generative designs (see the README).
Re: Show HN: XKCD-inspired StackSort
#75Re: Show HN: XKCD-inspired StackSort
#76Wow.. beautiful! I know this is only for fun, but it can start something bigger. Basically, given an input and output we could search for an algorithm that works. It reminds me a talk that PG gave in which he states people making bots to optimize code and then an intelligent compiler could be done. It sounded very futuristic, but maybe it is not that futuristic after all...
Genetic programming; type that into google scholar and look at the late-80s and early-90s papers.
However, GP is more like an oriented random search where the space of search is really big. Here the space is somehow filtered by humans, where each hypothesis had been generated by a human and not by a machine. It would be interesting if the machine could evolve those solutions that are not quite but close to be the proper one :)
Re: Show HN: XKCD-inspired StackSort
#77Earlier quoted context omitted.
I attempt to block anything that does DOM manipulation, uses Backbone or underscore, uses "Date()" (since it's probably a benchmark and those are slow), and a few others.
Can you also write code to detect whether a program will run forever for a given input? ducks
EDIT: Ah, I missed the joke.. what I meant was that I looked for a way to stop the JS if it ran for more then a second.
Re: Show HN: XKCD-inspired StackSort
#78Earlier quoted context omitted.
Can you also write code to detect whether a program will run forever for a given input? ducks
I looked for a way, but turns out it's not possible with JS. Browsers will stop infinite loops after a few seconds, though. EDIT: Ah, I missed the joke.. what I meant was that I looked for a way to stop the JS if it ran for more then a second.
>In computability theory, the halting problem ... is equivalent to the problem of deciding, given a program and an input, whether the program will eventually halt when run with that input, or will run forever. Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program-input pairs cannot exist.
Re: Show HN: XKCD-inspired StackSort
#79Re: Show HN: XKCD-inspired StackSort
#80Earlier quoted context omitted.
In theory, sure. However, I only use answers posted before the comic was released to avoid this very problem :)
Are you taking edits into account?
Code:
var common_url = '&pagesize=100&order=desc&site=stackoverflow&todate=1363473554';
SO /questions api: todate – Unix timestamp of the maximum creation date on a returned item