- Strict Finitism's Unrequited Love for Computational Complexity.Noel Arteche - manuscriptdetails
- Computational Complexity in the Philosophy of Mind: Unconventional Methods to Solve the Problem of Logical Omniscience.Safal Aryal - 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
- Is Classical Mathematics Appropriate for Theory of Computation?Farzad Didehvar - manuscriptdetails
- Strengthening Weak Emergence.Nora Berenstain - forthcoming - Erkenntnis:1-18.details
- When is Psychology Research Useful in Artificial Intelligence? A Case for Reducing Computational Complexity in Problem Solving.Sébastien Hélie & Zygmunt Pizlo - forthcoming - Wiley: Topics in Cognitive Science.details
- 1 Complexity of Computational Problems.D. B. Shmoys & E. Tardos - forthcoming - Complexity.details
- Computational Complexity Explains Neural Differences in Quantifier Verification.Heming Strømholt Bremnes, Jakub Szymanik & Giosuè Baggio - 2022 - Cognition 223:105013.details
- The Computational Complexity of Module Socles.Huishan Wu - 2022 - Annals of Pure and Applied Logic 173 (5):103089.details
- Sizing Up Free Will: The Scale of Compatibilism.Stuart Doyle - 2021 - Journal of Mind and Behavior 42 (3 & 4):271-289.details
- Recursive Axiomatisations From Separation Properties.Rob Egrot - 2021 - Journal of Symbolic Logic 86 (3):1228-1258.details
- Computable Irrational Numbers with Representations of Surprising Complexity.Ivan Georgiev, Lars Kristiansen & Frank Stephan - 2021 - Annals of Pure and Applied Logic 172 (2):102893.details
- Computability of Diagrammatic Theories for Normative Positions.Matteo Pascucci & Giovanni Sileno - 2021 - In Erich Schweighofer (ed.), Proceedings of JURIX 2021: 34th International Conference on Legal Knowledge and Information Systems. IOS Press. pp. 171-180.details
- The Canonical Pairs of Bounded Depth Frege Systems.Pavel Pudlák - 2021 - Annals of Pure and Applied Logic 172 (2):102892.details
- Computational Complexity for Bounded Distributive Lattices with Negation.Dmitry Shkatov & C. J. Van Alten - 2021 - Annals of Pure and Applied Logic 172 (7):102962.details
- The Key to Complexity.Ilexa Yardley - 2021 - Https://Medium.Com/the-Circular-Theory/.details
- Proof Theory for Positive Logic with Weak Negation.Marta Bílková & Almudena Colacito - 2020 - Studia Logica 108 (4):649-686.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
- 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
- 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 D. 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
- 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
|
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
|
|