Timeline for Does there exist a general theory of "arithmetic complexity"/"arithmetic height"?
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 9, 2010 at 1:29 | comment | added | Steve Huntsman | PSLQ is usually "better" than LLL. mathworld.wolfram.com/PSLQAlgorithm.html | |
| Mar 9, 2010 at 0:33 | comment | added | Sam Derbyshire | This works quite fine on a case by case basis, but (and I don't think I made this clear enough, sorry for the confusion) I was mostly interested in more general aspects. Something like Dirichlet's approximation Theorem is closer to what I'm thinking of; it starts to show how numbers of low arithmetic complexity are far apart (in terms of complexity). | |
| Mar 9, 2010 at 0:27 | comment | added | Joel David Hamkins | This is just the same as Kolmogorov complexity, but you are restricting the "programs" to have a special type. | |
| Mar 9, 2010 at 0:15 | history | answered | Kevin Buzzard | CC BY-SA 2.5 |