150 reputation
13
bio website
location
age
visits member for 3 years, 11 months
seen Jun 10 at 15:39

profile for blunders on Stack Exchange, a network of free, community-driven Q&A sites


Apr
4
awarded  Tumbleweed
Jan
31
revised Using forced perspective to estimate the distance or size of an object
deleted 68 characters in body
Jan
31
accepted Using forced perspective to estimate the distance or size of an object
Jan
31
revised Using forced perspective to estimate the distance or size of an object
added 27 characters in body
Jan
31
revised Using forced perspective to estimate the distance or size of an object
edited title
Jan
31
revised Using forced perspective to estimate the distance or size of an object
added 2 characters in body
Jan
31
asked Using forced perspective to estimate the distance or size of an object
Dec
7
awarded  Benefactor
Dec
7
accepted Method of Modeling Problem Complexity
Dec
2
comment Method of Modeling Problem Complexity
Given your background in software and mathematics, do you have any additional thought on how one might created a stable measure of a mathematical problems complexity? User474632 suggestion to use runtime appears to be unstable, for a proof of this see source-of-ruby-benchmark-irregularites. Again, thanks for the info!
Dec
2
comment Method of Modeling Problem Complexity
+1 @Thomas Klimpel: Agree, good point.
Dec
2
comment Method of Modeling Problem Complexity
Here's a better proof of the runtime stability issue, benchmark irregularites.
Dec
2
comment Method of Modeling Problem Complexity
clearly creating code is beyond the scope of the question, but the concept of runtime seems unstable as a measure of complexity. Any thoughts? Again, thanks!
Dec
2
comment Method of Modeling Problem Complexity
+1 @user474632: I went forward with modeling complexity based on runtime and appears based on my research to be a deadend; reason being I believe that runtime is effected by more than just the code run, and the environment impacts the code's runtime. Here's the code I used, which when run twice return different runtimes for the same problems "1+1"-vs-"1x2".
Dec
2
comment Method of Modeling Problem Complexity
+1 user474632: I'd thought about using runtime performance as a measure, but seems so brute force, and wanted to make sure I understood at least at a high-level that the approach would male sense. Findings that you explained make perfect sense, thanks for adding that!
Dec
2
comment Method of Modeling Problem Complexity
+1 @Thomas Klimpel: Yes, I'd wondered about the flow, thanks. Does this method seem related, or no, Cyclomatic Complexity.
Dec
1
comment Method of Modeling Problem Complexity
+1 @user474632: Yes, all true. The goal is not to create optimized execution plans, but to take a problem as is and assign it a complexity rating. Took a look at why Furer's algorithm for multiplication beats versions based on the Chinese Remainder Theorem, and it was way over my head. Guess the best answer for me would be an open-source software that was able to read problems formatted in a standard markup, for example MathML, and assign them a score; also guess either that's flawed, or does not exist.
Dec
1
comment Method of Modeling Problem Complexity
+1 @user474632: Thanks, your answer lead me to find this Computational complexity of mathematical operations - that said, looking for more of a complete way to take a set of problems and rank their complexity. Again, thanks and if you're still the best answer I'll award you the extra 50 points and select you as the answer. Cheers!
Dec
1
awarded  Promoter
Nov
29
asked Method of Modeling Problem Complexity