Timeline for Can a non-deterministic machine merge its branches?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 11, 2020 at 14:37 | vote | accept | DeeDee | ||
| Jun 11, 2020 at 18:07 | |||||
| Jun 11, 2020 at 14:35 | vote | accept | DeeDee | ||
| Jun 11, 2020 at 14:37 | |||||
| Jun 11, 2020 at 14:33 | vote | accept | DeeDee | ||
| Jun 11, 2020 at 14:34 | |||||
| Jun 11, 2020 at 14:33 | vote | accept | DeeDee | ||
| Jun 11, 2020 at 14:33 | |||||
| Jun 11, 2020 at 11:02 | history | edited | Tom | CC BY-SA 4.0 |
seperate paragraphs
|
| Jun 11, 2020 at 4:39 | comment | added | Aaron Rotenberg | @DeeDee A parallel machine with exponentially many processors and polynomial time and space per processor effectively gives you "communicating branches". To my knowledge, there isn't a standard name for such a machine that is shorter than what I just wrote. | |
| Jun 11, 2020 at 2:35 | comment | added | DeeDee | makes sense, but i cant accept because don't know if correct. Is there another commonly studied / known / named model of comp that lets the branches interact? | |
| Jun 11, 2020 at 1:45 | history | answered | Tom | CC BY-SA 4.0 |