2440 search results - page 132 / 488 » Data-Intensive Question Answering |
IJCAI
1993
15 years 3 months ago
1993
We consider the question of whether or not a successful attempt to simulate human (rational) thought on a computer can contribute to our understanding of the mind, including perha...
59
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We prove in this paper that there exists some infinitary rational relations which are 0 3-complete Borel sets and some others which are 0 3-complete. These results give a...
102
click to vote
JUCS
2002
15 years 2 months ago
2002
: Let b 2 be an integer. A real number is called simply normal to base b if in its representation to base b every digit appears with the same asymptotic frequency. We answer the f...
101
Voted
MST
2007
15 years 2 months ago
2007
We construct a finite language L such that the largest language commuting with L is not recursively enumerable. This gives a negative answer to the question raised by Conway in 1...
123
Voted
CAV
2005
Springer
15 years 8 months ago
2005
Springer
Recent work on weighted-pushdown systems shows how to generalize interprocedural-dataflow analysis to answer “stack-qualified queries”, which answer the question “what data...