Timeline for Clear, complete, proof that a language is Turing Compete?
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 12, 2013 at 3:01 | review | Community Evaluations | |||
| Nov 19, 2013 at 3:01 | |||||
| Sep 30, 2013 at 15:20 | history | tweeted | twitter.com/#!/StackCompSci/status/384699271205113856 | ||
| Sep 30, 2013 at 15:07 | comment | added | vzn | RC its more about showing basic "design patterns" exist or can be implemented in the language that combined are turing complete. loops, conditionals, subroutines, etcetera... | |
| Sep 30, 2013 at 15:07 | comment | added | vzn | see also what makes a language turing complete, programmers.se | |
| Sep 30, 2013 at 15:04 | comment | added | vzn | @andrej try this one. close enough? XSLT Version 2.0 is Turing-Complete: A Purely Transformation Based Proof. maybe just eat your vegetables :p | |
| Sep 30, 2013 at 14:45 | comment | added | Andrej Bauer | I'll eat my hat if you can find a peer reviewed paper which has a detailed proof that HTML5+CSS, or SQL, or PHP are Turing complete. | |
| Sep 30, 2013 at 14:19 | comment | added | Dan D. | But there are papers that do that. Consider Quasi-delay-insensitive circuits are Turing-complete which has a proof by construction. | |
| Sep 30, 2013 at 12:49 | comment | added | Andrej Bauer | No expert is going to write such a paper because it would be pointless. | |
| Sep 30, 2013 at 12:25 | answer | added | Wandering Logic | timeline score: 3 | |
| Sep 30, 2013 at 12:17 | answer | added | Vor | timeline score: 12 | |
| Sep 30, 2013 at 11:35 | history | asked | Roger Costello | CC BY-SA 3.0 |