70 search results - page 3 / 14 » Functional Encryption for Turing Machines |
99
Voted
ENTCS
2006
14 years 11 months ago
2006
It is reasonable to assume that quantum computations take place under the control of the classical world. For modelling this standard situation, we introduce a Classically-control...
CATS
2006
15 years 15 days ago
2006
The busy beaver is an example of a function which is not computable. It is based on a particular class of Turing machines, and is defined as the largest number of 1's that ca...
90
Voted
HAPTICS
2010
IEEE
15 years 4 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...
257
click to vote
Book
Very well organized and easy to follow book. The table of content can be downloaded from the attachment section below.
EXTREME
2004
ACM
15 years 4 months ago
2004
ACM
The World Wide Web Consortium recommends both XSLT and XQuery as query languages for XML documents. XSLT, originally designed to transform XML into XSL-FO, is nowadays a fully gro...