Is K(x|y) uncomputable for infinite x, y pairs or only for fixed y, infinite x?
Li and Vitanyi don’t formally state the uncomputability theorem for K(x|y). Most online discussion seems to take the first version, but surely when you have infinite pairs x, y st x = M(y), M computable, the minimal program for M is a finite constant and so computable. Am I missing something?
"Discovery of Galileo’s long-lost letter shows he edited his heretical ideas to fool the Inquisition"
"The War Over Supercooled Water"
"Most worryingly, Google appears to be scooping up information about people who use incognito mode in their browsers – which most people think makes their activities invisible from Google." #privacy #security #surveillance
Graphic CC BY-SA Sean O'Brien
Westlaw is like Wikipedia in that it can lead down some fun rabbitholes. For example, thirty-year-old attorney discipline cases from Kentucky:
"Conceding that former Judge Wood... did call Mr. Jerrigan a 'profane and provocative' name, it is my belief that the action taken by Mr. Jerrigan--viz., kicking Judge Wood in the groin--was not justified...."
Kentucky Bar Ass'n v. Jerrigan, 737 S.W.2d 693, 694 (Ky 1987) (Stephens, C.J., dissenting)
What rules about KATEX is that (unlike mathjax) it's fast enough to be interactive
Computer science grad student interested in complex systems, data visualization, history and art. Painting.
Scholar Social is a microblogging platform for researchers, grad students, librarians, archivists, undergrads, academically inclined high schoolers, educators of all levels, journal editors, research assistants, professors, administrators—anyone involved in academia who is willing to engage with others respectfully.