Sciweavers

13784 search results - page 158 / 2757
» On Computing Functions with Uncertainty
Sort
View
CORR
2008
Springer
70views Education» more  CORR 2008»
13 years 9 months ago
Every Computably Enumerable Random Real Is Provably Computably Enumerable Random
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 ...
Cristian S. Calude, Nicholas J. Hay
CHI
2005
ACM
14 years 9 months ago
Why CHI fragmented
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...
Jonathan Grudin