Add to ORKGWe analyze whether Church-Turing thesis can be applied to mathematical and physical systems. We find the factors that allow to a class of systems to reach a Turing or a super-Turing computational power. We illustrate our general statements by some more concrete theorems on hybrid and stochastic systems
The conventional wisdom presented in most computability books and historical papers is that there we...
'Computationalism' is a relatively vague term used to describe attempts to apply Turing's model of c...
In the search for a precise definition of the notion of effective calculability, Turing’s computabil...
Church thesis and its variants say roughly that all reasonable models of computation do not have mor...
DoctoralIn this talk I will review the positions of Church and Post on computability, contrast them ...
Two aspects of the physical side of the Church-Turing thesis are discussed. The first issue is a var...
This paper considers whether computational formalisms beyond the Church Turing Thesis (CTT) could be...
Turing Machine is one of the earliest device in programming to describe or interpret a model for alg...
In the 1930s, Turing suggested his abstract model for a practical computer, hypothetically visualizi...
The importance of algorithms is now recognized in all mathematical sciences, thanks to the developm...
There are various equivalent formulations of the Church-Turing thesis. A common one is that every ef...
Various computational paradigms inspired to models of physical and biological systems are being vigo...
Abstract. Are analog models of computations more powerful than classical models of computations? Fro...
Wegner and Eberbach[Weg04b] have argued that there are fundamental limitations to Turing Machines a...
This Turing Year has been the occasion for lively debates about the nature of computing. Are we on t...
The conventional wisdom presented in most computability books and historical papers is that there we...
'Computationalism' is a relatively vague term used to describe attempts to apply Turing's model of c...
In the search for a precise definition of the notion of effective calculability, Turing’s computabil...
Church thesis and its variants say roughly that all reasonable models of computation do not have mor...
DoctoralIn this talk I will review the positions of Church and Post on computability, contrast them ...
Two aspects of the physical side of the Church-Turing thesis are discussed. The first issue is a var...
This paper considers whether computational formalisms beyond the Church Turing Thesis (CTT) could be...
Turing Machine is one of the earliest device in programming to describe or interpret a model for alg...
In the 1930s, Turing suggested his abstract model for a practical computer, hypothetically visualizi...
The importance of algorithms is now recognized in all mathematical sciences, thanks to the developm...
There are various equivalent formulations of the Church-Turing thesis. A common one is that every ef...
Various computational paradigms inspired to models of physical and biological systems are being vigo...
Abstract. Are analog models of computations more powerful than classical models of computations? Fro...
Wegner and Eberbach[Weg04b] have argued that there are fundamental limitations to Turing Machines a...
This Turing Year has been the occasion for lively debates about the nature of computing. Are we on t...
The conventional wisdom presented in most computability books and historical papers is that there we...
'Computationalism' is a relatively vague term used to describe attempts to apply Turing's model of c...
In the search for a precise definition of the notion of effective calculability, Turing’s computabil...