11321 search results - page 2 / 2265 » Improvements to Turing's method |
IJBC
2007
13 years 7 months ago
2007
A Chaitin Omega number is the halting probability of a universal prefix-free Turing machine. Every Omega number is simultaneously computably enumerable (the limit of a computable...
CIE
2007
Springer
14 years 1 months ago
2007
Springer
We study Post’s Problem for the ordinal register machines defined in [6], showing that its general solution is positive, but that any set of ordinals solving it must be unbounde...
IALP
2010
13 years 2 months ago
2010
The hierarchical Pitman-Yor process-based smoothing method applied to language model was proposed by Goldwater and by Teh; the performance of this smoothing method is shown compara...
MFCS
2004
Springer
14 years 22 days ago
2004
Springer
We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...
HAPTICS
2010
IEEE
14 years 14 days ago
2010
IEEE
In the Turing test, a computer model is deemed to “think intelligently” if it can generate answers that are not distinguishable from those of a human. This test is limited to t...