You are not logged in.
Phrakture should be disqualified for being god.
Dusty
Offline
Phrakture should be disqualified for being god.
.oO Komodo Dave Oo.
Offline
Phrakture should be disqualified for being god.
Please place your donation in the basket - it's at the feet of the golden idol to your left.
Offline
rofl!
.oO Komodo Dave Oo.
Offline
I wonder if we can make phrakture vanish in a puff of logic?
Offline
I wonder if we can make phrakture vanish in a puff of logic?
We need to find a code equivalent of a paradox... or get him to write a self-printing program in assembler
.oO Komodo Dave Oo.
Offline
Phrak, get working on the Travelling Salesperson Problem, or something!
Offline
Phrak, get working on the Travelling Salesperson Problem, or something!
Yeah, let's implement the Hungarian method next month!
Offline
So, besides phrakture, how many people are preparing a submission for this month?
Offline
Phrak, get working on the Travelling Salesperson Problem, or something!
that's not a really difficult problem..... I saw a neat swarm algorithm to solve it. Don't remember it though.
I think phrakture really needs to solve the halting problem though, that would make my life a lot easier.
Dusty
Offline
So, besides phrakture, how many people are preparing a submission for this month?
well, technically, phrakture's submitting as multiple personalities....
phrakture-haskell, phrakture-javascript, phrakture-C++.....
Dusty
Offline
So, besides phrakture, how many people are preparing a submission for this month?
/me raises hand
Offline
phrakture-haskell
haskell fails - there are no string functions, strings are treated as lists, and can only be compare item by item, so it'd be a bunch of nested loops with backtracking and all that - I gave up fast
Offline
In the meantime, I've been preparing an FTP repo. If you want the user credentials, please PM me and I'll give you the data required for uploading. Please upload your submission in either .tar.gz or .tar.bz2.
The public r/o repo can be reaced @ http://arch.jeugdvakantiewerk.nl.
Offline
that's not a really difficult problem..... I saw a neat swarm algorithm to solve it. Don't remember it though.
Sorry, when I think TSP I think proving whether it can be solved in polynomial time or not. There's no shortage of algorithms, including the intuitive O(n!) brute-force approach.
Offline
I'm working on a submission.
Writing stories for a machine.
Offline
Today's the deadline, right?
Here's my submission: http://arch.jeugdvakantiewerk.nl/200601/perlsed.gz.
P.S Don't shoot me, I'm a newbie
Offline
yes, today is the deadline.
should we start a new thread for the judging?
Offline
Please submit your entry. Please note: I'm not the judge here! The community will vote via a poll for their favorite submission from each category.
Offline
OOH, exciting, exciting!
I didn't do an entry this move... lame I know, but I'm too busy with college stuff atm to learn python... next month should be better though. Still, I'm looking forwarding to voting
Keep 'em coming folks
.oO Komodo Dave Oo.
Offline
I didn't do one either
But, b/c this is the first months competition and everyone is still getting used to this, I'll accept the entries upto midnight EST(GMT-5:00). Once this time passes, I'll create a poll of all entries, everyone can start voting.
Offline
I never finished mine. Having to deal with a p.o.s. condo association/trip to seattle/and my car being broken into .
Writing stories for a machine.
Offline
bla bla bla trip to Seattle bla bla bla
Where do you live near Seattle?
Offline
I don't, I live in FL. My sister lives there, so I went up to visit.
Writing stories for a machine.
Offline
five minutes remaining...
Offline