- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Algorithms and the mathematical foundations of computer science
Notre Dame Journal of Formal Logic (forthcoming)
Abstract
This article has no associated abstract. (fix it)Author's Profile
My notes
Similar books and articles
Algorithms in modern mathematics and computer science: proceedings, Urgench, Uzbek SSR, September 16-22, 1979.A. P. Ershov & Donald Ervin Knuth (eds.) - 1981 - New York: Springer Verlag.
Selected papers on design of algorithms.Donald Ervin Knuth - 2010 - Stanford, Calif.: Center for the Study of Language and Information.
Track 2-Languages and Algorithms-Session 4-Algorithms-Parallelization Algorithms for Three-Body Interactions in Molecular Dynamics Simulation. [REVIEW]Jianhui Zhou Li & Richard J. Sadus - 2006 - In O. Stock & M. Schaerf (eds.), Lecture Notes in Computer Science. Springer Verlag. pp. 374-382.
Algorithms for quantum computation: Discrete logarithms and factoring.P. Shor - 1994 - Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science:124-134.
Stochastic algorithms: foundations and applications: third international symposium, SAGA 2005, Moscow, Russia, October 20-22, 2005: proceedings.O. B. Lupanov (ed.) - 2005 - New York: Springer.
Evolutionary Algorithms and Their Applications-Multiobjective Design Optimization of Electrostatic Rotary Microactuators Using Evolutionary Algorithms.Paolo Di Barba & Slawomir Wiak - 2006 - In O. Stock & M. Schaerf (eds.), Lecture Notes in Computer Science. Springer Verlag. pp. 344-353.
The Reliability of Randomized Algorithms.D. Fallis - 2000 - British Journal for the Philosophy of Science 51 (2):255-271.
Hardness assumptions in the foundations of theoretical computer science.Jan Krajíček - 2005 - Archive for Mathematical Logic 44 (6):667-675.
Face recognition algorithms and the other‐race effect: computational mechanisms for a developmental contact hypothesis.Nicholas Furl, P. Jonathon Phillips & Alice J. O'Toole - 2002 - Cognitive Science 26 (6):797-815.
Analytics
Added to PP
2013-12-20
Downloads
0
6 months
0
2013-12-20
Downloads
0
6 months
0
Historical graph of downloads
Sorry, there are not enough data points to plot this chart.
Author's Profile
Citations of this work
The dependence of computability on numerical notations.Ethan Brauer - 2021 - Synthese 198 (11):10485-10511.
Epistemic Modality and Hyperintensionality in Mathematics.Timothy Bowen - 2017 - Dissertation, Arché, University of St Andrews
Universality, Invariance, and the Foundations of Computational Complexity in the light of the Quantum Computer.Michael Cuffaro - 2018 - In Hansson Sven Ove (ed.), Technology and Mathematics: Philosophical and Historical Investigations. Cham, Switzerland: Springer Verlag. pp. 253-282.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6d9b7f7c4c-tstkh uwo