personal/nunosempere.com
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

fix: typo

Browse Source
This commit is contained in:
NunoSempere 2023-03-02 00:04:10 -06:00
parent 4086ec8671
commit 0a79797a3e
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
blog/2023/03/01/computable-solomoff/.src/main.tex
View File

@ -63,7 +63,7 @@ To fix this, in step 2, we can require that there be not only one Turing machine
Interestingly, that scheme also suggests that there is a tradeoff between arriving at the correct hypothesis as fast as possible—in which case we would just implement the first scheme at full speed—and producing accurate probabilities—in which case it seems like we would use the modification just outlined. Interestingly, that scheme also suggests that there is a tradeoff between arriving at the correct hypothesis as fast as possible—in which case we would just implement the first scheme at full speed—and producing accurate probabilities—in which case it seems like we would use the modification just outlined.
\sectionHow many \section{A downside}
Note that a downside of the procedures outlined above is that at the point we arrive at the correct hypothesis, we don't know that this is the case. Note that a downside of the procedures outlined above is that at the point we arrive at the correct hypothesis, we don't know that this is the case.
\section{An distracting epicycle: dealing with Turing machines that take too long or do not halt.} \section{An distracting epicycle: dealing with Turing machines that take too long or do not halt.}