Sciweavers

1054 search results - page 7 / 211
» A Formalization of the Turing Test
Sort
View
TCS
2011
14 years 5 months ago
Computational processes, observers and Turing incompleteness
We propose a formal definition of Wolfram’s notion of computational process based on iterated transducers together with a weak observer, a model of computation that captures so...
Klaus Sutner
ENTCS
2006
112views more  ENTCS 2006»
14 years 10 months ago
Modeling Web Applications by the Multiple Levels of Integrity Policy
We propose a formal method to validate the reliability of a web application, by modeling interactions among its constituent objects. Modeling exploits the recent "Multiple Le...
Gianluca Amato, Massimo Coppola, Stefania Gnesi, F...
FCS
2006
14 years 11 months ago
The Church-Turing-Deutsch Principle in Quantum Computation
This paper is based on the idea that the Church-Turing-Deutsch (CTD) principle can play a very fundamental role in Physics similar to those of conservation laws in the constructio...
P. Prashant
BIRTHDAY
2008
Springer
15 years 3 days ago
The Church-Turing Thesis over Arbitrary Domains
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 ...
Udi Boker, Nachum Dershowitz
ENTCS
2006
136views more  ENTCS 2006»
14 years 10 months ago
Classically-controlled Quantum Computation
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...
Simon Perdrix, Philippe Jorrand