Timeline for Smallest possible universal combinator
Current License: CC BY-SA 4.0
17 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 23, 2023 at 19:23 | answer | added | John Tromp | timeline score: 7 | |
| Oct 11, 2022 at 6:34 | comment | added | user76284 | @JoshuaHerman Here, size = abstractions + applications. | |
| Jan 2, 2021 at 6:31 | comment | added | user76284 | @PeterTaylor Craig's theorem implies that any universal combinator must be improper. | |
| Oct 20, 2019 at 23:24 | history | edited | user76284 | CC BY-SA 4.0 |
added 62 characters in body
|
| Nov 16, 2017 at 10:47 | comment | added | Peter Taylor |
How strictly are you defining "combinator"? Does it have to be of the form λx*.E where E is abstraction-free?
|
|
| Nov 15, 2017 at 8:57 | comment | added | Emil Jeřábek | Your recent edit rather sounds like a (partial) answer. | |
| Nov 15, 2017 at 4:47 | history | edited | user76284 | CC BY-SA 3.0 |
added 74 characters in body
|
| Aug 10, 2017 at 18:48 | comment | added | Noam Zeilberger | Since 6 + 2 = 8 < 11, this makes me wonder whether {S,K} is the smallest basis of combinators measured by total size? | |
| Aug 9, 2017 at 19:49 | history | edited | user76284 | CC BY-SA 3.0 |
added 100 characters in body
|
| Jul 23, 2015 at 16:25 | history | edited | user76284 | CC BY-SA 3.0 |
edited body
|
| Jul 6, 2015 at 14:56 | answer | added | cody | timeline score: 10 | |
| Jul 6, 2015 at 10:49 | comment | added | Joshua Herman | What is your definition of size? Can you write it as a function? | |
| Jul 6, 2015 at 0:26 | answer | added | Joshua Herman | timeline score: 8 | |
| Jul 2, 2015 at 16:12 | comment | added | Andrej Bauer | Maybe this is of interest: wolframscience.com/nksonline/page-1123a-text?firstview=1 | |
| Jul 2, 2015 at 4:05 | history | tweeted | twitter.com/#!/StackCSTheory/status/616457587425431552 | ||
| Jul 1, 2015 at 19:26 | review | First posts | |||
| Jul 2, 2015 at 7:56 | |||||
| Jul 1, 2015 at 19:23 | history | asked | user76284 | CC BY-SA 3.0 |