70 search results - page 2 / 14 » Functional Encryption for Turing Machines |
CSL
2005
Springer
13 years 10 months ago
2005
Springer
We study computability on sequence spaces, as they are used in functional analysis. It is known that non-separable normed spaces cannot be admissibly represented on Turing machines...
IGPL
2006
13 years 5 months ago
2006
Since 1996, some models of recursive functions over the real numbers have been analyzed by several researchers. It could be expected that they exhibit a computational power much g...
CIE
2007
Springer
13 years 11 months ago
2007
Springer
The conventional wisdom presented in most computability books and historical papers is that there were several researchers in the early 1930’s working on various precise defini...
COCO
2007
Springer
13 years 11 months ago
2007
Springer
The NP machine hypothesis posits the existence of an ǫ > 0 and a nondeterministic polynomial-time Turing machine M which accepts the language 0∗ but for which no determinist...
BIRTHDAY
2008
Springer
13 years 7 months ago
2008
Springer
The Church-Turing Thesis has been the subject of many variations and interpretations over the years. Specifically, there are versions that refer only to functions over the natural ...