Timeline for Why are functional languages Turing complete?
Current License: CC BY-SA 3.0
16 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jul 30, 2018 at 17:38 | comment | added | Sophie Swett | @Abdul Well, the problem is the word "defined". If you say that "functional languages are defined as Turing complete", you're saying that either the definition of "functional language" or the definition of "Turing complete" states that functional languages are Turing complete. As a matter of fact, neither definition says that. | |
Sep 16, 2016 at 11:21 | comment | added | Honinbo Shusaku | @AndrejBauer Thank you for the title edit, but I'm curious as to why it's (defined as Turning Complete) wrong? Is it because it's an adjective? Would described be a better word than define? | |
Jul 4, 2016 at 11:11 | history | edited | Andrej Bauer | CC BY-SA 3.0 |
Change non-sensical title.
|
Jul 4, 2016 at 11:11 | comment | added | Andrej Bauer | It is just so wrong to say "defined to be Turing complete". Can we please change the title? | |
Jul 13, 2015 at 18:33 | vote | accept | Honinbo Shusaku | ||
Jul 13, 2015 at 17:39 | history | edited | Honinbo Shusaku | CC BY-SA 3.0 |
Clarified one of the questions
|
Jul 11, 2015 at 18:36 | answer | added | Peter Taylor | timeline score: 8 | |
Jul 11, 2015 at 17:52 | answer | added | vzn | timeline score: 1 | |
Jul 10, 2015 at 19:54 | comment | added | Joey Eremondi |
Not an answer, but you mentioned that not all versions of the lambda calculus are Turing Complete. The Simply Typed Lambda Calculus, and the stronger versions of Coq and Agda based on termination checking, are not Turing Complete (because they have decidable halting problems). Strongly-typed languages like Haskell and SML get around this by allowing arbitrary recursion with a fixpoint combinator, a term with type (a -> a) -> a .
|
|
Jul 10, 2015 at 19:32 | history | tweeted | twitter.com/#!/StackCompSci/status/619589992885690368 | ||
Jul 10, 2015 at 16:19 | answer | added | babou | timeline score: 29 | |
Jul 10, 2015 at 16:04 | answer | added | David Richerby | timeline score: 12 | |
Jul 10, 2015 at 15:37 | vote | accept | Honinbo Shusaku | ||
Jul 13, 2015 at 18:33 | |||||
Jul 10, 2015 at 15:26 | answer | added | Yuval Filmus | timeline score: 24 | |
Jul 10, 2015 at 14:56 | review | First posts | |||
Jul 10, 2015 at 16:04 | |||||
Jul 10, 2015 at 14:52 | history | asked | Honinbo Shusaku | CC BY-SA 3.0 |