Timeline for What is the probability a random Turing machine is isomorphic to a DFA?
Current License: CC BY-SA 2.5
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 5 at 7:28 | comment | added | agemO | The only correct understanding I see for this question is "Given a random string (produced by a random TM), how far is its Solomonoff TM probability from its Solomonoff DFA one?" | |
| Apr 5 at 7:20 | comment | added | agemO | "I suppose we are not looking at finite observation data" but Solomonoff induction and Kolmogorov complexity are about finite observation data. | |
| Jun 12, 2021 at 20:56 | history | edited | Joel David Hamkins |
edited tags
|
|
| Aug 24, 2010 at 0:00 | answer | added | Joel David Hamkins | timeline score: 17 | |
| Aug 18, 2010 at 19:16 | comment | added | Bjørn Kjos-Hanssen | @Joel: I suppose we are not looking at finite observation data, but rather observing what has transpired at time $\omega$ (infinity). @Robin: It should be non-zero because there is at least one DFA. | |
| Aug 18, 2010 at 14:55 | vote | accept | Mikola | ||
| Aug 18, 2010 at 6:29 | answer | added | Bjørn Kjos-Hanssen | timeline score: 6 | |
| Aug 18, 2010 at 4:21 | comment | added | Robin Kothari | Do you know if the probability is non-zero? | |
| Aug 18, 2010 at 0:09 | comment | added | Joel David Hamkins | Could you make the question more precise? Since any finite observation data is of course the language accepted by a DFA, I'm confused about what you are asking. | |
| Aug 17, 2010 at 23:53 | history | asked | Mikola | CC BY-SA 2.5 |