Timeline for Does solving mathematical equations with Cellular Automata structures means it is universal?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 13, 2016 at 14:11 | comment | added | Hendrik Jan | universality = Turing completeness, the property of a computational device to perform all computable functions, as defined by the Turing machine or equivalent notions. | |
| Jul 12, 2016 at 13:31 | comment | added | Marek |
I am very curious about this universality concept, could you please provide some reference? I would appreciate some more formal definition.
|
|
| Sep 21, 2015 at 21:11 | comment | added | Hendrik Jan | Thanks for your suggestions. I hope my statements are more understandable now. | |
| Sep 21, 2015 at 21:09 | history | edited | Hendrik Jan | CC BY-SA 3.0 |
following suggestions in the comments
|
| Sep 21, 2015 at 15:30 | comment | added | D.W.♦ | I edited the answer to include David Richerby's caveat. I hope that was OK. One thing: I am having a hard time parsing/understanding the sentence "The question whether..." -- can you rephrase? | |
| Sep 21, 2015 at 15:30 | history | edited | D.W.♦ | CC BY-SA 3.0 |
added 178 characters in body; added 54 characters in body
|
| Sep 21, 2015 at 14:50 | comment | added | David Richerby | I would caution that the examples in the question don't suggest that the CA can solve arbitrary Diophantine equations. | |
| Sep 21, 2015 at 13:57 | history | answered | Hendrik Jan | CC BY-SA 3.0 |