- Is Classical Mathematics Appropriate for Theory of Computation?Farzad Didehvar - manuscriptdetails
- A Contradiction and P=NP Problem.Farzad Didehvar - manuscriptdetails
- By Considering Fuzzy Time, P=BPP (P*=BPP*).Farzad Didehvar - manuscriptdetails
- Fuzzy Time, From Paradox to Paradox.Farzad Didehvar - manuscriptdetails
- Strengthening Weak Emergence.Nora Berenstain - forthcoming - Erkenntnis:1-18.details
- 1 Complexity of Computational Problems.D. B. Shmoys & E. Tardos - forthcoming - Complexity.details
- Proof Theory for Positive Logic with Weak Negation.Marta Bílková & Almudena Colacito - 2020 - Studia Logica 108 (4):649-686.details
- A Mathematical Model of Quantum Computer by Both Arithmetic and Set Theory.Vasil Penchev - 2020 - Information Theory and Research eJournal 1 (15):1-13.details
- Representation and Reality by Language: How to Make a Home Quantum Computer?Vasil Penchev - 2020 - Philosophy of Science eJournal (Elsevier: SSRN) 13 (34):1-14.details
- Two Strategies to Infinity: Completeness and Incompleteness. The Completeness of Quantum Mechanics.Vasil Penchev - 2020 - High Performance Computing eJournal 12 (11):1-8.details
- Integrated Information Theory as a Conplexity Science Approach to Consciousness.L. H. Favela - 2019 - Journal of Consciousness Studies 26 (1-2):21-47.details
- Proof Compression and NP Versus PSPACE.L. Gordeev & E. H. Haeusler - 2019 - Studia Logica 107 (1):53-83.details
- Quantum Computing.Amit Hagar & Michael Cuffaro - 2019 - Stanford Encyclopedia of Philosophy.details
- Universality, Invariance, and the Foundations of Computational Complexity in the Light of the Quantum Computer.Michael Cuffaro - 2018 - In Sven Hansson (ed.), Technology and Mathematics: Philosophical and Historical Investigations. Springer. pp. 253-282.details
- Rational Analysis, Intractability, and the Prospects of ‘as If’-Explanations.Iris van Rooij, Cory Wright, Johan Kwisthout & Todd Wareham - 2018 - Synthese 195 (2):491-510.details
- On the Significance of the Gottesman–Knill Theorem.Michael E. Cuffaro - 2017 - British Journal for the Philosophy of Science 68 (1):91-121.details
- Incompleteness in the Finite Domain.Pavel Pudlák - 2017 - Bulletin of Symbolic Logic 23 (4):405-441.details
- Human-Human Stigmergy.Ted Lewis & Leslie Marsh - 2016 - Cognitive Systems Research 38 (June):1-60.details
- Membrane Fission: A Computational Complexity Perspective.Luis F. Macías-Ramos, Bosheng Song, Luis Valencia-Cabrera, Linqiang Pan & Mario J. Pérez-jiménez - 2016 - Complexity 21 (6):321-334.details
- The Unexplained Intellect: Complexity, Time, and the Metaphysics of Embodied Thought.Christopher Mole - 2016 - Routledge.details
- Solomonoff Prediction and Occam’s Razor.Tom F. Sterkenburg - 2016 - Philosophy of Science 83 (4):459-479.details
- Quantifiers and Cognition: Logical and Computational Perspectives.Jakub Szymanik - 2016 - Springer.details
- How-Possibly Explanations in (Quantum) Computer Science.Michael E. Cuffaro - 2015 - Philosophy of Science 82 (5):737-748.details
- Visions de la complexité. Le démon de Laplace dans tous ses états.Guillaume Deffuant, Arnaud Banos, David Chavalarias, Cyrille Bertelle, Nicolas Brodu, Annick Lesne, Jean-Pierre Müller, Édith Perrier, Franck Varenne & Pablo Jensen - 2015 - Natures Sciences Sociétés 23 (1):42-53.details
- Counting Steps: A Finitist Interpretation of Objective Probability in Physics.Amit Hagar & Giuseppe Sergioli - 2015 - Epistemologia 37 (2):262-275.details
- Отвъд машината на Тюринг: квантовият компютър.Vasil Penchev - 2014 - Sofia: BAS: ISSK (IPS).details
- Why Philosophers Should Care About Computational Complexity.Scott Aaronson - 2013 - Computability: Turing, Gödel, Church, and Beyond:261--328.details
- The Semimeasure Property of Algorithmic Probability -- “Feature‘ or “Bug‘?Douglas Campbell - 2013 - In David L. Dowe (ed.), Algorithmic Probability and Friends: Bayesian Prediction and Artificial Intelligence. Springer Berlin Heidelberg. pp. 79--90.details
- Remarks on Computational Complexity: Response to Abels.Norbert Hornstein - 2013 - Mind and Language 28 (4):430-434.details
- Computational Complexity Reduction and Interpretability Improvement of Distance-Based Decision Trees.Marcin Blachnik & Mirosław Kordos - 2012 - In Emilio Corchado, Vaclav Snasel, Ajith Abraham, Michał Woźniak, Manuel Grana & Sung-Bae Cho (eds.), Hybrid Artificial Intelligent Systems. Springer. pp. 288--297.details
- Complexity of Judgment Aggregation.Ulle Endriss, Umberto Grandi & Daniele Porello - 2012 - Journal of Artificial Intelligence Research 45:481--514.details
- Semantic Bounds for Everyday Language.Marcin Mostowski & Jakub Szymanik - 2012 - Semiotica 2012 (188):363-372.details
- Intractability and the Use of Heuristics in Psychological Explanations.Iris Rooij, Cory Wright & Todd Wareham - 2012 - Synthese 187 (2):471-487.details
- The Complexity of Industrial Ecosystems: Classification and Computational Modelling.James S. Baldwin - 2011 - In Peter Allen, Steve Maguire & Bill McKelvey (eds.), The Sage Handbook of Complexity and Management. Sage Publications. pp. 299.details
- On theTractability of Comparing Informational Structures.Cédric Dégremont, Lena Kurzen & Jakub Szymanik - 2011 - In J. van Eijck & R. Verbrugge (eds.), Proceedings of the Workshop 'Reasoning about other minds: Logical and cognitive perspectives.details
- Characterizing Definability of Second-Order Generalized Quantifiers.Juha Kontinen & Jakub Szymanik - 2011 - In L. Beklemishev & R. de Queiroz (eds.), Proceedings of the 18th Workshop on Logic, Language, Information and Computation, Lecture Notes in Artificial Intelligence 6642. Springer.details
- Thoughts on Complexity and Computational Models.Michael J. Prietula - 2011 - In Peter Allen, Steve Maguire & Bill McKelvey (eds.), The Sage Handbook of Complexity and Management. Sage Publications. pp. 93--110.details
- Contribution of Working Memory in the Parity and Proportional Judgments.Jakub Szymanik & Marcin Zajenkowski - 2011 - Belgian Journal of Linguistics 25:189-206.details
- A Computational Approach to Quantifiers as an Explanation for Some Language Impairments in Schizophrenia.Marcin Zajenkowski, Rafał Styła & Jakub Szymanik - 2011 - Journal of Communication Disorder 44:2011.details
- Sense and Proof.Carlo Penco & Daniele Porello - 2010 - In M. D'agostino, G. Giorello, F. Laudisa, T. Pievani & C. Sinigaglia (eds.), New Essays in Logic and Philosophy of Science,. College Publicationss.details
- Computational Complexity of Polyadic Lifts of Generalized Quantifiers in Natural Language.Jakub Szymanik - 2010 - Linguistics and Philosophy 33 (3):215-250.details
- Comprehension of Simple Quantifiers: Empirical Evaluation of a Computational Model.Jakub Szymanik & Marcin Zajenkowski - 2010 - Cognitive Science 34 (3):521-532.details
- Polynomial Local Search in the Polynomial Hierarchy and Witnessing in Fragments of Bounded Arithmetic.Arnold Beckmann & Samuel R. Buss - 2009 - Journal of Mathematical Logic 9 (1):103-138.details
- Lecture Notes on Artificial Intelligence 5422, Logic, Language, and Computation 7th International Tbilisi Symposium on Logic, Language, and Computation. [REVIEW]Peter Bosch, David Gabelaia & Jérôme Lang (eds.) - 2009 - Springer.details
- Hybrid Elections Broaden Complexity‐Theoretic Resistance to Control.Edith Hemaspaandra, Lane A. Hemaspaandra & Jörg Rothe - 2009 - Mathematical Logic Quarterly 55 (4):397-424.details
- Ockham’s Razor and Reasoning About Information Flow.Mehrnoosh Sadrzadeh - 2009 - Synthese 167 (2):391 - 408.details
- Quantifiers in TIME and SPACE. Computational Complexity of Generalized Quantifiers in Natural Language.Jakub Szymanik - 2009 - Dissertation, University of Amsterdamdetails
- The Computational Complexity of Quantified Reciprocals.Jakub Szymanik - 2009 - In Peter Bosch, David Gabelaia & Jérôme Lang (eds.), Lecture Notes on Artificial Intelligence 5422, Logic, Language, and Computation 7th International Tbilisi Symposium on Logic, Language, and Computation. Springer.details
- Understanding Quantifiers in Language.Jakub Szymanik & Marcin Zajenkowski - 2009 - In N. A. Taatgen & H. van Rijn (eds.), Proceedings of the 31st Annual Conference of the Cognitive Science Society.details
- Improving Methodology of Quantifier Comprehension Experiments.Jakub Szymanik & Marcin Zajenkowski - 2009 - Neuropsychologia 47 (12):2682--2683.details
Nothing in this category. Everyone can categorize entries. Please help if you have the expertise.
|
Off-campus access
Using PhilPapers from home?
Create an account to enable off-campus access through your institution's proxy server.
Monitor this page
Be alerted of all new items appearing on this page. Choose how you want to monitor it:
Email
|
RSS feed
|
|