70 search results - page 1 / 14 » Functional Encryption for Turing Machines |
STACS
1999
Springer
13 years 9 months ago
1999
Springer
The paper gives a logical characterisation of the class NTIME(n) of problems that can be solved on a nondeterministic Turing machine in linear time. It is shown that a set L of str...
COLT
1992
Springer
13 years 9 months ago
1992
Springer
This paper deals with finite size networks which consist of interconnections of synchronously evolving processors. Each processor updates its state by applying a "sigmoidal&q...
CIE
2007
Springer
13 years 11 months ago
2007
Springer
The intuition guiding the de…nition of computation has shifted over time, a process that is re‡ected in the changing formulations of the Church-Turing thesis. The theory of co...
FSS
2008
13 years 4 months ago
2008
We work with fuzzy Turing machines (FTMs) and we study the relationship between this computational model and classical recursion concepts such as computable functions, recursively...
ECCC
2000
13 years 4 months ago
2000
Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated input tape are considered. We investigate the classes of languages acceptable by s...