New Computational Paradigms: Changing Conceptions of What is Computable
@inproceedings{Cooper2007NewCP, title={New Computational Paradigms: Changing Conceptions of What is Computable}, author={S. B. Cooper and Benedikt Lwe and A. Sorbi}, year={2007} }
In recent years, classical computability has expanded beyond its original scope to address issues related to computability and complexity in algebra, analysis, and physics. The deep interconnection between "computation" and "proof" has originated much of the most significant work in constructive mathematics and mathematical logic of the last 70 years. Moreover, the increasingly compelling necessity to deal with computability in the real world (such as computing on continuous data, biological… CONTINUE READING
Figures, Tables, and Topics from this paper
100 Citations
Algebraic Characterizations of Complexity-Theoretic Classes of Real Functions
- Mathematics, Computer Science
- Int. J. Unconv. Comput.
- 2011
- 5
- PDF
Significance of Models of Computation, from Turing Model to Natural Computation
- Computer Science
- Minds and Machines
- 2011
- 59
- PDF
Turing oracle machines, online computing, and three displacements in computability theory
- Computer Science
- Ann. Pure Appl. Log.
- 2009
- 64
- PDF
Practical Intractability: A Critique of the Hypercomputation Movement
- Computer Science, Mathematics
- Minds and Machines
- 2013
- 4
- PDF
Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer
- Computer Science
- TAMC
- 2013
- 5
- PDF
Computability, Complexity and Programming with Ordinary Differential Equations (Invited Talk)
- Mathematics, Computer Science
- STACS
- 2020
- PDF
Turing Test , Chinese Room Argument , Symbol Grounding Problem . Meanings in Artificial Agents
- 2012
- 4
- PDF
NATURAL COMPUTING/UNCONVENTIONAL COMPUTING AND ITS PHILOSOPHICAL SIGNIFICANCE
- Sociology, Computer Science
- 2012
- 4
- PDF
References
SHOWING 1-10 OF 216 REFERENCES
A new conceptual framework for analog computation
- Mathematics, Computer Science
- Theor. Comput. Sci.
- 2007
- 11
- PDF
Non-Turing Computers and Non-Turing Computability
- Mathematics
- PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association
- 1994
- 128
- Highly Influential
- PDF
Complexity Theory of Real Functions
- Mathematics, Computer Science
- Progress in Theoretical Computer Science
- 1991
- 516