Timeline for Rulings on machine limits
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:03 | history | edited | CommunityBot |
Commonmark migration
|
|
| Oct 5, 2014 at 2:30 | comment | added | John Dvorak | Another classic: TSP: find the shortest route through 10 cities? Sure, just enumerate all paths. Shortest route through 30 cities? Let me learn how branch&bound works, or maaaybe a* the visited-set space will suffice. Route through 21474 cities? I'd throw a closest-first at it, and perhaps add random restart or 2-opt (crossing elimination) if the time constraints allow. Add a kD tree to speed up if necessary. | |
| Oct 5, 2014 at 2:25 | comment | added | John Dvorak | My example: "find the sum of digits in the decimal expression of 2^n". Then n=21474 is way over the top for a naive implementation using 32-bit arithmetic (or even 64-bit arithmetic) but it works just fine for n=30. E | |
| Oct 3, 2014 at 15:35 | comment | added | Peter Taylor | There's no realistic way that we can come up with some generic default limits which work for everything. And IMO we should push people to specify their questions properly (which includes specifying the range of input which needs to be handled, and ideally including test cases which cover all the corners of that range) rather than try to cover for them. (Before anyone else says anything: I don't see this as quite the same as standard loopholes). | |
| Oct 3, 2014 at 14:18 | history | answered | undergroundmonorail | CC BY-SA 3.0 |