Timeline for Does solving mathematical equations with Cellular Automata structures means it is universal?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 21, 2015 at 13:57 | answer | added | Hendrik Jan | timeline score: 4 | |
| Sep 21, 2015 at 13:48 | history | edited | David Richerby |
edited tags
|
|
| Sep 21, 2015 at 13:48 | comment | added | David Richerby | You need to give a precise definition of what equations you can solve. Three examples isn't nearly enough. However, your examples suggest that it can only solve equations of the form $x^a=b$ for constants $a$ and $b$. I don't see any reason why being able to calculate the $a$th root of $b$ would indicate Turing completeness. | |
| S Sep 21, 2015 at 13:45 | history | suggested | abc | CC BY-SA 3.0 |
Explaining more examples.
|
| Sep 21, 2015 at 13:24 | review | Suggested edits | |||
| S Sep 21, 2015 at 13:45 | |||||
| Sep 21, 2015 at 10:21 | comment | added | David Richerby | Hello! At the very least, you need to give a precise definition of what equations you can solve. A single example isn't nearly enough. | |
| Sep 21, 2015 at 9:48 | review | Close votes | |||
| Sep 22, 2015 at 11:38 | |||||
| Sep 21, 2015 at 8:48 | review | First posts | |||
| Sep 21, 2015 at 9:30 | |||||
| Sep 21, 2015 at 8:47 | history | asked | Abdulrhman Elnekiti | CC BY-SA 3.0 |