Omnimaga
Calculator Community => TI Calculators => Topic started by: bb010g on May 04, 2014, 08:53:11 pm
-
After reading though the wonder paper Pessimal Algorithms and Simplexity Analysis (http://www.cs.uiuc.edu/class/fa05/cs473ug/resources/pessimal-algorithms.pdf), I thought of a wonderful idea: a reluctant quadratic solver! I'm not very good at these things, though, so I decided to bring it out to the Omnimaga community for everyone to have a go.
Goal: Make a quadratic solver.
Constraints:
· The program must always be progressing towards the goal.
Points are awarded for:
· Inefficiency
· Novelty
· Precision
· Style
· Humor
· Choice of language
Said points will be awarded per user, with a running count in the main topic. Users are free to improve any algorithm, and will get points for the improvement accordingly. Programs can be interactive or non-interactive, but the user interaction shouldn't cause repetition.
(Note: This doesn't have to be for a language on a TI calc, but I couln't think of a better place to put it. If a mod knows where this would fit better, feel free to move it.)
Points:
Coming soon!
-
Sounds fun. Can it also be obfuscated?
-
Shouldn't this go to humors and jokes? :P
-
You can obfuscate if you want, but the main goal is inefficiency.
-
DJ I don't think so. It's a nice programming challenge.
Does using a 0.0000001Hz CPU count ? :P
-
Sounds like a fun little quadratic solver :P