11321 search results - page 2 / 2265 » Improvements to Turing's method |
121
click to vote
IJBC
2007
15 years 4 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...
122
click to vote
CIE
2007
Springer
15 years 10 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...
203
click to vote
IALP
2010
14 years 11 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...
128
click to vote
MFCS
2004
Springer
15 years 9 months 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 ...
137
click to vote
HAPTICS
2010
IEEE
15 years 9 months 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...