1. Suggestion for 2.5 release
Robert C,
how about setting up another Euphoria coding contest to roughly
coincide with the 2.5 release. This could be used to "showcase"
any new 2.5 features etc...
--
Derek Parnell
Melbourne, Australia
2. Re: Suggestion for 2.5 release
Derek Parnell wrote:
> Robert C,
> how about setting up another Euphoria coding contest to roughly
> coincide with the 2.5 release. This could be used to "showcase"
> any new 2.5 features etc...
Maybe just after the official release.
It's not that easy to come up with a good problem.
It can't be too easy, or too hard. It has to be
interesting. There has to be an objective way to
judge the winner. The algorithm can't
be readily obtainable by searching the Web. etc.
Regards,
Rob Craig
Rapid Deployment Software
http://www.RapidEuphoria.com
3. Re: Suggestion for 2.5 release
Robert Craig wrote:
>
> Derek Parnell wrote:
> > Robert C,
> > how about setting up another Euphoria coding contest to roughly
> > coincide with the 2.5 release. This could be used to "showcase"
> > any new 2.5 features etc...
>
> Maybe just after the official release.
>
> It's not that easy to come up with a good problem.
> It can't be too easy, or too hard. It has to be
> interesting. There has to be an objective way to
> judge the winner. The algorithm can't
> be readily obtainable by searching the Web. etc.
>
> Regards,
> Rob Craig
> Rapid Deployment Software
> <a href="http://www.RapidEuphoria.com">http://www.RapidEuphoria.com</a>
>
Perhaps the competition should be in two parts:
Part 1) Suggest a challenging problem
Then select the best problem(s)
Part 2) Provide the best solutions to the best problems
Bunjo
4. Re: Suggestion for 2.5 release
A.C.Harper wrote:
>
> Robert Craig wrote:
> >
> > Derek Parnell wrote:
> > > Robert C,
> > > how about setting up another Euphoria coding contest to roughly
> > > coincide with the 2.5 release. This could be used to "showcase"
> > > any new 2.5 features etc...
> >
> > Maybe just after the official release.
> >
> > It's not that easy to come up with a good problem.
> > It can't be too easy, or too hard. It has to be
> > interesting. There has to be an objective way to
> > judge the winner. The algorithm can't
> > be readily obtainable by searching the Web. etc.
> >
> > Regards,
> > Rob Craig
> > Rapid Deployment Software
> > <a href="http://www.RapidEuphoria.com">http://www.RapidEuphoria.com</a>
> >
>
> Perhaps the competition should be in two parts:
>
> Part 1) Suggest a challenging problem
>
> Then select the best problem(s)
>
> Part 2) Provide the best solutions to the best problems
>
> Bunjo
>
How 'bout a contest to see who can make the best, fastest, most secure
encryption algorithm. It must be new - not a euphoria adaption on some
previously made algorithm
5. Re: Suggestion for 2.5 release
Emlyn Merlyn wrote:
> How 'bout a contest to see who can make the best, fastest, most secure
> encryption algorithm. It must be new - not a euphoria adaption on some
> previously made algorithm
Just one problem: How would the security af an encryption algo be
measured? I mean, most people aren't encryption specialists, so
we would probably have to get one.
Regards, Alexander Toresson
Shhh! Be vewy quiet! I'm hunting wuntime ewwows!
6. Re: Suggestion for 2.5 release
Alexander Toresson wrote:
>
> Emlyn Merlyn wrote:
> > How 'bout a contest to see who can make the best, fastest, most secure
> > encryption algorithm. It must be new - not a euphoria adaption on some
> > previously made algorithm
>
> Just one problem: How would the security af an encryption algo be
> measured? I mean, most people aren't encryption specialists, so
> we would probably have to get one.
>
> Regards, Alexander Toresson
>
> Shhh! Be vewy quiet! I'm hunting wuntime ewwows!
>
I already know who would probably win. If my memory serves me right, I
believe I once heard Derek say he works a lot with cryptography at his job.
Phil
7. Re: Suggestion for 2.5 release
Philip Deets wrote:
>
> Alexander Toresson wrote:
> >
> > Emlyn Merlyn wrote:
> > > How 'bout a contest to see who can make the best, fastest, most secure
> > > encryption algorithm. It must be new - not a euphoria adaption on some
> > > previously made algorithm
> >
> > Just one problem: How would the security af an encryption algo be
> > measured? I mean, most people aren't encryption specialists, so
> > we would probably have to get one.
> >
> > Regards, Alexander Toresson
> >
> > Shhh! Be vewy quiet! I'm hunting wuntime ewwows!
> >
>
> I already know who would probably win.
Not so sure about that!
Anyhow, I have a policy not to offically enter RDS competetions.
--
Derek Parnell
Melbourne, Australia
8. Re: Suggestion for 2.5 release
Derek Parnell wrote:
> Anyhow, I have a policy not to offically enter RDS competetions.
Why is that? :)
-=ck
"Programming in a state of EUPHORIA."
http://www.cklester.com/euphoria/
9. Re: Suggestion for 2.5 release
cklester wrote:
>
> Derek Parnell wrote:
>
> > Anyhow, I have a policy not to offically enter RDS competetions.
>
> Why is that? :)
A number of reasons really, and they include ...
I don't have a desire to compete or win.
Like a lot of other people here, I'm not a beginner so I might have an
unfair advantage over some people.
I don't have a lot of spare time.
But I might unoffically send some code to Robert, just to help him
get a feel for the "quality" of the tasks he sets. And if I remember
correctly, I did rather well with a couple of the problems in the
last competetion, though my results are never to be published.
--
Derek Parnell
Melbourne, Australia
