Re: Tarski’s Indefinability of Truth—I don’t get this one. Solomonoff Induction estimates probabilities of bitstring sequences—but it’s uncomputable—and the best we can do is finite approximations—which of course have limitations and will be able to be improved upon—just as Tarski’s “Indefinability of Truth” says.
Re: Argument via Berry’s Paradox—but the description of x includes P—which could be complex. So the description of x is not short—if you are not given P.
Re: Tarski’s Indefinability of Truth—I don’t get this one. Solomonoff Induction estimates probabilities of bitstring sequences—but it’s uncomputable—and the best we can do is finite approximations—which of course have limitations and will be able to be improved upon—just as Tarski’s “Indefinability of Truth” says.
Re: Argument via Berry’s Paradox—but the description of x includes P—which could be complex. So the description of x is not short—if you are not given P.