Timeline for Showcase of Languages
Current License: CC BY-SA 3.0
20 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 21, 2015 at 12:29 | comment | added | Drathier | how can you solve the halting problem? I'm guessing it has something to do with using an infinite (number of infinite) program? | |
| Jan 19, 2015 at 16:23 | comment | added | Phil Frost | @proudhaskeller I'm pretty sure I've got something wrong, but I'm out of time for this. I've made it community wiki -- if you want to give it a shot feel free. | |
| Jan 19, 2015 at 16:23 | history | made wiki | Post Made Community Wiki by Phil Frost | ||
| Jan 19, 2015 at 15:47 | comment | added | proud haskeller | @PhilFrost Sure. | |
| Jan 19, 2015 at 15:46 | comment | added | Phil Frost | @proudhaskeller I'll give it a try if you promise to check my work. | |
| Jan 19, 2015 at 15:42 | history | edited | Phil Frost | CC BY-SA 3.0 |
length 8
|
| Jan 19, 2015 at 15:32 | comment | added | proud haskeller | I think you should evaluate all of the programs to the lambda equivalent. Im a bit curious what would the last one be... Also, the first one reduces to the identity function. | |
| Jan 19, 2015 at 15:27 | comment | added | Phil Frost |
@proudhaskeller Yes, but combinatory logic requires an infinite set of variables and parenthesis in its syntax. Jot has neither: 1 and 0 are the only characters in the language.
|
|
| Jan 19, 2015 at 15:24 | history | edited | Phil Frost | CC BY-SA 3.0 |
length 5
|
| Jan 19, 2015 at 15:21 | comment | added | Optimizer | You said so for upvote number 4. But here we are looking at a "random number you just generated" | |
| Jan 19, 2015 at 15:19 | comment | added | Phil Frost | @Optimizer with 5 votes I can give the next step in the Turing completeness proof. | |
| Jan 19, 2015 at 15:18 | comment | added | Optimizer | I don't see why this should continue getting more upvotes. You are simply going to generate random binary numbers of increasing length :| | |
| Jan 19, 2015 at 15:16 | history | edited | Phil Frost | CC BY-SA 3.0 |
length 4
|
| Jan 19, 2015 at 15:09 | history | edited | Phil Frost | CC BY-SA 3.0 |
length 3
|
| Jan 19, 2015 at 15:03 | history | edited | Phil Frost | CC BY-SA 3.0 |
length 3
|
| Jan 19, 2015 at 15:02 | comment | added | proud haskeller | @PhilFrost There are single combinators which are turing complete by themselves. | |
| Jan 19, 2015 at 14:22 | comment | added | Phil Frost | @JanDvorak working on it...it's been so long since I researched this thing that I forgot all of it :) | |
| Jan 19, 2015 at 14:20 | comment | added | John Dvorak | Two upvotes given. Now define the language. | |
| Jan 19, 2015 at 14:12 | review | First posts | |||
| Jan 19, 2015 at 14:12 | |||||
| Jan 19, 2015 at 14:11 | history | answered | Phil Frost | CC BY-SA 3.0 |