Timeline for Create a programming language that only appears to be unusable
Current License: CC BY-SA 3.0
50 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 30, 2020 at 7:03 | answer | added | user92069 | timeline score: 3 | |
| Jan 6, 2018 at 17:24 | comment | added | l4m2 |
If the solution program is too long to fit into the answer, you must post a program that generates it. Why no outlink
|
|
| Jan 6, 2018 at 17:23 | comment | added | l4m2 |
The interpreter must not interpret a language which was published before this challenge. Whynot
|
|
| Apr 13, 2017 at 12:39 | history | edited | CommunityBot |
replaced http://codegolf.stackexchange.com/ with https://codegolf.stackexchange.com/
|
|
| Apr 1, 2016 at 6:20 | answer | added | user47018 | timeline score: 2 | |
| Dec 23, 2015 at 9:35 | vote | accept | feersum | ||
| Nov 14, 2015 at 8:29 | comment | added | feersum |
@ChristianIrwan All numbers are positive integers.
|
|
| Nov 14, 2015 at 8:15 | comment | added | Xwtek | Is the input guaranteed not to contains zero (at decimal representation)? | |
| Nov 13, 2015 at 16:25 | comment | added | user15259 | I think it has been eight days since the last edit of this question. Looks like Dennis’ Changeling is the winner! | |
| Nov 8, 2015 at 3:08 | answer | added | cardboard_box | timeline score: 10 | |
| Nov 6, 2015 at 13:45 | answer | added | Martin Ender | timeline score: 30 | |
| Nov 1, 2015 at 16:47 | answer | added | BMac | timeline score: 8 | |
| Nov 1, 2015 at 5:47 | answer | added | DLosc | timeline score: 15 | |
| Nov 1, 2015 at 3:07 | history | edited | feersum | CC BY-SA 3.0 |
added 66 characters in body
|
| Nov 1, 2015 at 0:22 | comment | added | feersum | @Dennis No, it doesn't mean that. | |
| Oct 31, 2015 at 16:02 | comment | added | Dennis | The cop who becomes safe with the highest score, and a positive score, wins this question. The wording suggests that votes after becoming safe do not count. Is that intentional? | |
| Oct 31, 2015 at 12:58 | comment | added | Sanchises | I nerd-sniped myself with this challenge. I created a programming language and then spent hours programming the task to see if the language could even work only to find out that it actually was unusable. | |
| Oct 31, 2015 at 10:14 | answer | added | DLosc | timeline score: 6 | |
| Oct 30, 2015 at 18:45 | answer | added | user15259 | timeline score: 9 | |
| Oct 30, 2015 at 16:03 | answer | added | MegaTom | timeline score: 5 | |
| Oct 29, 2015 at 23:09 | answer | added | kirbyfan64sos | timeline score: 7 | |
| Oct 29, 2015 at 17:53 | comment | added | feersum | @BMac No. | |
| Oct 29, 2015 at 17:50 | comment | added | BMac | Are the robber solutions required to execute in under an hour? | |
| Oct 29, 2015 at 16:05 | history | edited | Martin Ender | CC BY-SA 3.0 |
deleted 1 character in body
|
| Oct 29, 2015 at 15:20 | answer | added | Zgarb | timeline score: 20 | |
| Oct 29, 2015 at 11:32 | answer | added | Sam Cappleman-Lynes | timeline score: 14 | |
| Oct 29, 2015 at 5:31 | answer | added | Dennis | timeline score: 26 | |
| Oct 28, 2015 at 17:49 | comment | added | Martin Ender | @Luminous Apparently nothing at all. | |
| Oct 28, 2015 at 17:28 | comment | added | Luminous | What's so unique about 0x1936206392306? | |
| Oct 28, 2015 at 16:19 | comment | added | kirbyfan64sos | You should put a leaderboard to track how much longer an answer needs until it's safe. | |
| Oct 28, 2015 at 16:18 | answer | added | kirbyfan64sos | timeline score: 10 | |
| Oct 28, 2015 at 12:38 | history | edited | Martin Ender |
edited tags
|
|
| Oct 28, 2015 at 3:15 | answer | added | Liam | timeline score: 35 | |
| Oct 27, 2015 at 16:22 | comment | added | mbomb007 | @kirbyfan64sos Output will be judged by then number of 1s printed before the program halts. Other characters are ignored. | |
| Oct 27, 2015 at 16:16 | comment | added | kirbyfan64sos |
I don't get the is and us in the second example output...
|
|
| Oct 27, 2015 at 12:55 | comment | added | feersum | @bmarks That's not necessary. | |
| Oct 27, 2015 at 12:54 | comment | added | bmarks | Must it satisfy the criteria of a programming language? meta.codegolf.stackexchange.com/a/2073/30076 | |
| Oct 27, 2015 at 11:47 | history | edited | feersum | CC BY-SA 3.0 |
added 65 characters in body
|
| Oct 27, 2015 at 8:14 | comment | added | feersum | @Loovjo up to you. | |
| Oct 27, 2015 at 7:50 | comment | added | xenia | @feersum But should we try? | |
| Oct 27, 2015 at 7:49 | comment | added | feersum | @Loovjo It's ok if it's not. | |
| Oct 27, 2015 at 7:33 | comment | added | xenia | Should we try to make the language Turing-complete? | |
| Oct 26, 2015 at 16:32 | comment | added | feersum | @Loovjo That doesn't hurt anything, as long as it functions normally without them. | |
| Oct 26, 2015 at 16:17 | comment | added | xenia |
Can the interpreter take additional arguments? (Such as -debug)
|
|
| Oct 26, 2015 at 14:25 | history | tweeted | twitter.com/StackCodeGolf/status/658650613333544960 | ||
| Oct 26, 2015 at 14:08 | comment | added | feersum | @muddyfish Yes, the interpreter should be the content of the cop answer. | |
| Oct 26, 2015 at 14:06 | comment | added | Blue | You don't explicitly state this but am I right in assuming that the cop actually has to write and post the interpreter in their answer? | |
| Oct 26, 2015 at 13:14 | history | edited | Martin Ender | CC BY-SA 3.0 |
deleted 2 characters in body
|
| Oct 26, 2015 at 12:34 | history | edited | feersum | CC BY-SA 3.0 |
added 167 characters in body
|
| Oct 26, 2015 at 12:22 | history | asked | feersum | CC BY-SA 3.0 |