Timeline for Aren't "oracle machines" unsound concepts? [closed]
Current License: CC BY-SA 2.5
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 9, 2015 at 17:21 | history | closed |
Qiaochu Yuan Andrés E. Caicedo Johannes Hahn Boris Bukh S. Carnahan♦ |
Not suitable for this site | |
| Aug 9, 2015 at 8:26 | review | Close votes | |||
| Aug 9, 2015 at 17:28 | |||||
| Aug 9, 2015 at 8:08 | history | protected | Qiaochu Yuan | ||
| Aug 9, 2015 at 6:42 | answer | added | Thomas Benjamin | timeline score: 1 | |
| Mar 6, 2013 at 18:03 | comment | added | vzn | have always felt there might be some possible logical contradictions that can ensue from "not careful use" ala contradictions that were found in the foundations of calculus long ago. | |
| Jul 23, 2010 at 19:18 | vote | accept | Tom Crockett | ||
| Jul 23, 2010 at 11:20 | answer | added | Amit Kumar Gupta | timeline score: 3 | |
| Jul 23, 2010 at 10:07 | answer | added | Stefan Geschke | timeline score: 17 | |
| Jul 23, 2010 at 8:45 | answer | added | Recursion Theory | timeline score: 1 | |
| Jul 23, 2010 at 8:06 | answer | added | Marcos Villagra | timeline score: 0 | |
| Jul 23, 2010 at 5:36 | comment | added | Tom Crockett | Ah, thank you. That's the elementary error I was looking for. | |
| Jul 23, 2010 at 5:35 | comment | added | Qiaochu Yuan | If O can solve the halting problem for M, then M is a "normal" machine which doesn't have access to O. | |
| Jul 23, 2010 at 5:34 | answer | added | BlueRaja | timeline score: 3 | |
| Jul 23, 2010 at 5:27 | history | edited | Tom Crockett | CC BY-SA 2.5 |
added 7 characters in body
|
| Jul 23, 2010 at 5:20 | history | asked | Tom Crockett | CC BY-SA 2.5 |