Timeline for Turing Completeness of System Which Randomly Fails to Complete Calculations
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 28, 2016 at 0:25 | vote | accept | nosyarg | ||
| Jun 27, 2016 at 9:21 | history | edited | David Richerby | CC BY-SA 3.0 |
Damnit, Alan Turing deserves a capital letter.
|
| Jun 27, 2016 at 7:46 | comment | added | Peter Leupold | Computability speaks about functions which assign to every input one output. So you would have to explain which is the function computed here. This seems to be difficult, because the very essence of your idea is that every input is assigned to several outputs - just the opposite of the definition of a function... | |
| Jun 27, 2016 at 6:52 | answer | added | Vaekor | timeline score: -1 | |
| Jun 27, 2016 at 6:41 | comment | added | Raphael | Depends on your definition, I guess; you'd have to explicitly deal with probabilities (which are not a part of normale Turing machines) and tell us what the output of such a machine is, formally. | |
| Jun 27, 2016 at 6:40 | history | edited | Raphael |
edited tags
|
|
| Jun 27, 2016 at 1:11 | review | First posts | |||
| Jun 27, 2016 at 9:21 | |||||
| Jun 27, 2016 at 1:09 | history | asked | nosyarg | CC BY-SA 3.0 |