This may just be a temporary glitch, but this post appears to have had its content replaced with that of Mundane Magic.
klkblake
Karma: 95
I knew Kolmogorov complexity was used in Solomonoff induction, and I was under the impression that using Universal Turing Machines was an arbitrary choice.
I’m confused about Kolmogorov complexity. From what I understand, it is usually expressed in terms of Universal Turing Machines, but can be expressed in any Turing-complete language, with no difference in the resulting ordering of programs. Why is this? Surely a language that had, say, natural language parsing as a primitive operation would have a very different complexity ordering than a Universal Turing Machine?
^W means Control-W, which is the ASCII code for “delete previous word”.
This is fascinating. I’m rather surprised that people seem to be able to actually see their tulpa after a while. I do worry about the ethical implications though—with what we see with split brain patients, it seems plausible that a tulpa may actually be a separate person. Indeed, if this is true, and the tulpa’s memories aren’t being confabulated on the spot, it would suggest that the host would lose the use of the part of their brain that is running the tulpa, decreasing their intelligence. Which is a pity, because I really want to try this, but I don’t want to risk permanently decreasing my intelligence.