Can everything be computed? - On the Solvability Complexity Index and Towers of Algorithms (original) (raw)
Related papers
On the Solvability Complexity Index Hierarchy and Towers of Algorithms
2015
1997
Limitations to algorithm solvability: Galois methods and models of computation
Proceedings of the fifth ACM symposium on Symbolic and algebraic computation - SYMSAC '86, 1986
Discrete Mathematics and Applications, 1992
On the Complexity of Numerical Analysis
Electronic Colloquium on Computational Complexity, 2005
Lecture Notes on Computational Complexity
Fixed Points in Spectral Complexity
1992
Computing in algebraic systems : (preprint)
1980
Bulletin of the American Mathematical Society, 1989
A survey of techniques in applied computational complexity
Journal of Computational and Applied Mathematics, 1975
2019
2012
Computing partial information out of intractable: Powers of algebraic numbers as an example
Journal of Number Theory, 2010
Chapman & Hall/CRC Applied Algorithms and Data Structures series, 1998
Abstract Some Results in Computational Complexity
2008
Computing in Algebraic Systems
Recursion Theory, its Generalisations and Applications
Future Research Directions in Computer Science
An Overview of the Theory of Computational Complexity
Journal of the ACM, 1971
Complexity theory on real numbers and functions
Lecture Notes in Computer Science, 1982
Complexity and Real Computation: A Manifesto
International Journal of Bifurcation and Chaos, 1996
Steve Smale, Michael Shub, Lenore Blum
Foundations of Computer Science, …, 1988
Complexity issues in computing spectra, pseudospectra and resolvents
Banach Center Publications, 2017
Mathematical Analysis and the Mathematics of Computation
Springer eBooks, 2016
The Hardness of Polynomial Equation Solving
Foundations of Computational Mathematics, 2003
A Survey on the Complexity of Solving Algebraic Systems
International Mathematical Forum, 2010
Data Structures and Polynomial Equation Solving
Real Computation and Complexity Dagstuhl Seminar
Characterizing Polynomial Time Computability of Rational and Real Functions
Proc. of the 5th International Workshop on De- velopments in Computational Models 2009, 2009
Complexity and Real Computation
1998
Fundamentals of Computation Theory
Lecture Notes in Computer Science, 2005
Saturation and stability in the theory of computation over the reals
Annals of Pure and Applied Logic, 1999