Timeline for Can hypercomputation compute all kinds of incomputable numbers/functions/problems…etc?
Current License: CC BY-SA 4.0
7 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Aug 7, 2018 at 13:22 | comment | added | Reinstate Monica | I suppose if your hypercomputational device can invalidate mathematical logic it can solve Russel's Paradox, the halting problem, etc. But in that universe how can we reason about anything? | |
Aug 7, 2018 at 13:18 | comment | added | bautzeman | @Solomonoff'sSecret That's what I'm asking. With oracles you can't do that. But is there any other type of hypercomputational device that could do that? | |
Aug 7, 2018 at 1:41 | answer | added | Aryeh | timeline score: 2 | |
Aug 6, 2018 at 14:26 | comment | added | Reinstate Monica | Russel's paradox shows that a certain definition is inconsistent with itself and thus doesn't yield a set, given universally accepted axioms. How would "hypercomputation" resolve that contradiction, even with a "universal oracle" that can "answer any question"? | |
Aug 6, 2018 at 13:33 | history | migrated | from cstheory.stackexchange.com (revisions) | ||
Aug 6, 2018 at 2:14 | answer | added | Bjørn Kjos-Hanssen | timeline score: 4 | |
Aug 6, 2018 at 1:21 | history | asked | bautzeman | CC BY-SA 4.0 |