In this paper, we show how the questions of what is computable and what is feasibly computable can be viewed from the viewpoint of physics: what is computable within the current physics? what is computable if we assume -- as many physicists do -- that no final physical theory is possible? what is computable if we consider data processing, i.e., computations based on physical inputs? Our physics-based analysis of these questions leads to some unexpected answers, both positive and negative. For example, we show that under the no-physical-theory-is-perfect assumption, almost all problems are feasibly solvable -- but not all of them
: This paper proves that one can not build a computer which can, for any physical system, take the s...
Do physical processes compute? And what is a computation? These questions have gained a revival of i...
Abstract. Do physical processes compute? And what is a computation? These questions have gained a re...
Abstract In this chapter, we show how the questions of what is computable and what is feasibly compu...
Abstract In this chapter, we show how the questions of what is computable and what is feasibly compu...
In this paper, the issues of computability and constructivity in the mathematics of physics are disc...
International audienceThe purpose of this talk is to single out some physical assumptions that commo...
Most of our knowledge about a physical world comes from physical induction: if a hypothesis is confi...
Although the formalizations of computability provided in the 1930s have proven to be equivalent, two...
In recent years, classical computability has expanded beyond its original scope to address issues re...
Computability has its origins in Logic within the framework formed along the original path laid down...
Why do we need a formalization of the notion of algorithm or effective computation? In order to show...
Piccinini's Usability Constraint states that physical processes must have ``physically constructible...
Should the impossibility results of theoretical computer science be of concern to physics
: This paper proves that one can not build a computer which can, for any physical system, take the s...
Do physical processes compute? And what is a computation? These questions have gained a revival of i...
Abstract. Do physical processes compute? And what is a computation? These questions have gained a re...
Abstract In this chapter, we show how the questions of what is computable and what is feasibly compu...
Abstract In this chapter, we show how the questions of what is computable and what is feasibly compu...
In this paper, the issues of computability and constructivity in the mathematics of physics are disc...
International audienceThe purpose of this talk is to single out some physical assumptions that commo...
Most of our knowledge about a physical world comes from physical induction: if a hypothesis is confi...
Although the formalizations of computability provided in the 1930s have proven to be equivalent, two...
In recent years, classical computability has expanded beyond its original scope to address issues re...
Computability has its origins in Logic within the framework formed along the original path laid down...
Why do we need a formalization of the notion of algorithm or effective computation? In order to show...
Piccinini's Usability Constraint states that physical processes must have ``physically constructible...
Should the impossibility results of theoretical computer science be of concern to physics
: This paper proves that one can not build a computer which can, for any physical system, take the s...
Do physical processes compute? And what is a computation? These questions have gained a revival of i...
Abstract. Do physical processes compute? And what is a computation? These questions have gained a re...