Timeline for Are there primes p, q such that p^4+1 = 2q^2 ?
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 15, 2010 at 6:19 | comment | added | Junkie | This is only semi-true. The outer code of SIntegralPoints in Magma can be viewed easily. As Felipe Voloch says in part, this lists the algorithm. Low-level functions (eg. Height) cannot be seen, though "open" is technically true as you can decompile. From the philosophy of science, no system is used with confidence, and only independent verification can be partially satisfactory. We still have at least two chip manufacturers, so hardware independence is possible. For using software, too many packages throw eggs into a large basket (like GMP), and so I see a scarcity of true independence often. | |
| May 14, 2010 at 14:59 | comment | added | Felipe Voloch | Negative's point is a valid one, but I think Kevin's answer points to the fact that there is a standard algorithm to solve these kinds of problems. Maybe it is also implemented in other packages. | |
| May 14, 2010 at 13:39 | comment | added | teil | How can Magma be used with confidence, their code is not open. | |
| May 14, 2010 at 12:25 | history | answered | Kevin Buzzard | CC BY-SA 2.5 |