Piccinini's Usability Constraint states that physical processes must have ``physically constructible manifestation[s]" to be included in epistemically useful models of physical computation. But to determine what physical processes can be implemented on physical systems (as parts of computations), we must already know what physical processes can be implemented on physical systems (as parts of processes for constructing computing systems). We need additional assumptions about what qualifies as a building process. Piccinini implicitly assumes a classical computational understanding of executable processes, but this is an assumption imposed on physical theories and may artificially limit our picture of epistemically useful physical computation
International audienceA model of hypercomputation can compute at least one function not computable b...
Wegner and Eberbach[Weg04b] have argued that there are fundamental limitations to Turing Machines a...
The concept of a physical realization of a computational system is one of the key notions of both fu...
Although the formalizations of computability provided in the 1930s have proven to be equivalent, two...
The relationship between abstract formal procedures and the activities of actual physical systems ha...
International audienceThe purpose of this talk is to single out some physical assumptions that commo...
Abstract In this chapter, we show how the questions of what is computable and what is feasibly compu...
Approaching limitations of digital computing technologies have spurred research in neuromorphic and ...
In this paper, we show how the questions of what is computable and what is feasibly computable can b...
Abstract In this chapter, we show how the questions of what is computable and what is feasibly compu...
In the search for a precise definition of the notion of effective calculability, Turing’s computabil...
Computing is a high-level process of a physical system. Recent interest in non-standard computing sy...
Do physical processes compute? And what is a computation? These questions have gained a revival of i...
AbstractWhen we are concerned with the logical form of a computation and its formal properties, then...
International audienceA model of hypercomputation can compute at least one function not computable b...
Wegner and Eberbach[Weg04b] have argued that there are fundamental limitations to Turing Machines a...
The concept of a physical realization of a computational system is one of the key notions of both fu...
Although the formalizations of computability provided in the 1930s have proven to be equivalent, two...
The relationship between abstract formal procedures and the activities of actual physical systems ha...
International audienceThe purpose of this talk is to single out some physical assumptions that commo...
Abstract In this chapter, we show how the questions of what is computable and what is feasibly compu...
Approaching limitations of digital computing technologies have spurred research in neuromorphic and ...
In this paper, we show how the questions of what is computable and what is feasibly computable can b...
Abstract In this chapter, we show how the questions of what is computable and what is feasibly compu...
In the search for a precise definition of the notion of effective calculability, Turing’s computabil...
Computing is a high-level process of a physical system. Recent interest in non-standard computing sy...
Do physical processes compute? And what is a computation? These questions have gained a revival of i...
AbstractWhen we are concerned with the logical form of a computation and its formal properties, then...
International audienceA model of hypercomputation can compute at least one function not computable b...
Wegner and Eberbach[Weg04b] have argued that there are fundamental limitations to Turing Machines a...
The concept of a physical realization of a computational system is one of the key notions of both fu...