70 search results - page 7 / 14 » Functional Encryption for Turing Machines |
ICDT
1999
ACM
15 years 1 months ago
1999
ACM
Abstract. In this paper we present a new approach for studying aggregations in the context of database query languages. Starting from a broad de nition of aggregate function, we ad...
CCA
2005
Springer
15 years 3 months ago
2005
Springer
A function f is continuous iff the pre-image f −1[V ] of any open setV is open again. Dual to this topological7 property, f is called open iff the image f [U] of any open set U ...
APLAS
2004
ACM
15 years 3 months ago
2004
ACM
Abstract. More than being just a tool for expressing algorithms, a welldesigned programming language allows the user to express her ideas efficiently. The design choices however e...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. It is well-known that Abstract State Machines (ASMs) can simulate “stepby-step” any type of machines (Turing machines, RAMs, etc.). We aim to overcome two facts: 1) s...
CSR
2007
Springer
15 years 3 months ago
2007
Springer
t) Yuri Gurevich Microsoft Research The talk reflects recent joint work with Nachum Dershowitz [4]. In 1936, Church suggested that the recursive functions, which had been defined...