We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
I have been active in SIGCHI since 1983, serving on the Executive Committee and many conference and program committees. After editing ACM TOCHI for six years, I explored the histo...