Timeline for Shortest code that raises a SIGSEGV
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot | Commonmark migration | |
| Apr 13, 2017 at 12:39 | history | edited | CommunityBot | replaced http://codegolf.stackexchange.com/ with https://codegolf.stackexchange.com/ | |
| Dec 23, 2016 at 1:40 | history | edited | NO_BOOT_DEVICE | CC BY-SA 3.0 | updated formatting very slightly |
| Dec 23, 2016 at 1:38 | comment | added | Dennis | @SeeRhino The Pyth interpreter sets the recursion limit to 100,000. At least on TIO, that's enough for a segfault. | |
| Dec 23, 2016 at 1:35 | comment | added | NoOneIsHere | @Dennis IDEone | |
| Dec 23, 2016 at 1:32 | review | Late answers | |||
| Dec 23, 2016 at 1:36 | |||||
| Dec 23, 2016 at 1:30 | comment | added | Dennis | See here. j squares the base and calls itself recursively until the base is at least as large as the number. Since the base is 0, that never happens. With a sufficienly high recursion limit, you get a segfault. | |
| Dec 23, 2016 at 1:24 | comment | added | NoOneIsHere | Figured something out! From browsing Pyth's source, I found that this code does j on 1 and 0, which tries to convert 1 into base 0. Why that segfaults, I have no idea... | |
| Dec 23, 2016 at 1:16 | review | First posts | |||
| Dec 23, 2016 at 1:24 | |||||
| Dec 23, 2016 at 1:14 | history | answered | NO_BOOT_DEVICE | CC BY-SA 3.0 |