- By Considering Fuzzy Time, P=BPP (P*=BPP*).Farzad Didehvar - manuscriptdetails
- Fuzzy Time, From Paradox to Paradox.Farzad Didehvar - manuscriptdetails
- A Contradiction and P=NP Problem.Farzad Didehvar - manuscriptdetails
- A Theory Explains Deep Learning.Kenneth Kijun Lee & Chase Kihwan Lee - details
- Explaining Experience In Nature: The Foundations Of Logic And Apprehension.Steven Ericsson-Zenith - forthcoming - Institute for Advanced Science & Engineering.details
- A Virtual Solution to the Frame Problem.Jonathan A. Waskan - forthcoming - Proceedings of the First IEEE-RAS International Conference on Humanoid Robots.details
- Computational Logic. Vol. 1: Classical Deductive Computing with Classical Logic. 2nd Ed.Luis M. Augusto - 2022 - London: College Publications.details
- Self-Referential Theories.Samuel A. Alexander - 2020 - Journal of Symbolic Logic 85 (4):1687-1716.details
- Weaker Variants of Infinite Time Turing Machines.Matteo Bianchetti - 2020 - Archive for Mathematical Logic 59 (3-4):335-365.details
- Reseña de ' Los Límites Exteriores de la Razón '(The Outer Limits of Reason) por Noson Yanofsky 403p (2013) (revision revisada 2019).Michael Richard Starks - 2019 - In Delirios Utópicos Suicidas en el Siglo 21 La filosofía, la naturaleza humana y el colapso de la civilización Artículos y reseñas 2006-2019 4a Edición. Las Vegas, NV USA: Reality Press. pp. 283-298.details
- The Significance of the Curry-Howard Isomorphism.Richard Zach - 2019 - In Gabriele M. Mras, Paul Weingartner & Bernhard Ritter (eds.), Philosophy of Logic and Mathematics. Proceedings of the 41st International Ludwig Wittgenstein Symposium. Berlin: De Gruyter. pp. 313-326.details
- Lexicographic Multi-Objective Linear Programming Using Grossone Methodology: Theory and Algorithm.Marco Cococcioni, Massimo Pappalardo & Yaroslav Sergeyev - 2018 - Applied Mathematics and Computation 318:298-311.details
- Data Storage, Security And Techniques In Cloud Computing.R. Dinesh Arpitha & Shobha R. Sai - 2018 - International Journal of Research and Analytical Reviews 5 (4).details
- On Two Notions of Computation in Transparent Intensional Logic.Ivo Pezlar - 2018 - Axiomathes 29 (2):189-205.details
- Simple or Complex Bodies? Trade-Offs in Exploiting Body Morphology for Control.Matej Hoffmann & Vincent C. Müller - 2017 - In Gordana Dodig-Crnkovic & Raffaela Giovagnoli (eds.), Representation of Reality: Humans, Other Living Organisms and Intelligent Machines. Berlin: Springer. pp. 335-345.details
- The Social in the Platform Trap: Why a Microscopic System Focus Limits the Prospect of Social Machines.Markus Luczak-Roesch & Ramine Tinati - 2017 - Discover Society 40.details
- Lógicas multivalentes. Uma introdução matemática e computacional.Luis M. Augusto - 2016 - Dissertation, Universidade Abertadetails
- A Universal Socio-Technical Computing Machine.Markus Luczak-Roesch, Ramine Tinati, Saud Aljaloud, Wendy Hall & Nigel Shadbolt - 2016 - In International Conference on Web Engineering.details
- Socio-Technical Computation.Markus Luczak-Roesch, Ramine Tinati, Kieron O'Hara & Nigel Shadbolt - 2015 - In Proceedings of the 18th ACM Conference Companion on Computer Supported Cooperative Work & Social Computing.details
- Some Jump-Like Operations in Β-Recursion Theory.Colin G. Bailey - 2013 - Journal of Symbolic Logic 78 (1):57-71.details
- From the Closed Classical Algorithmic Universe to an Open World of Algorithmic Constellations.Mark Burgin & Gordana Dodig-Crnkovic - 2013 - In Gordana Dodig-Crnkovic Raffaela Giovagnoli (ed.), Computing Nature. pp. 241--253.details
- On the Mosaic Method for Many-Dimensional Modal Logics: A Case Study Combining Tense and Modal Operators. [REVIEW]Carlos Caleiro, Luca Viganò & Marco Volpe - 2013 - Logica Universalis 7 (1):33-69.details
- The Church-Turing ‘Thesis’ as a Special Corollary of Gödel’s Completeness Theorem.Saul A. Kripke - 2013 - In B. J. Copeland, C. Posy & O. Shagrir (eds.), Computability: Turing, Gödel, Church, and Beyond. MIT Press.details
- Single-Tape and Multi-Tape Turing Machines Through the Lens of the Grossone Methodology.Yaroslav Sergeyev & Alfredo Garro - 2013 - Journal of Supercomputing 65 (2):645-663.details
- Reasoning About Truth in First-Order Logic.Claes Strannegård, Fredrik Engström, Abdul Rahim Nizamani & Lance Rips - 2013 - Journal of Logic, Language and Information 22 (1):115-137.details
- What is an Algorithm.Yuri Gurevich - 2012 - Lecture Notes in Computer Science.details
- Intractability and the Use of Heuristics in Psychological Explanations.Iris Rooij, Cory Wright & Todd Wareham - 2012 - Synthese 187 (2):471-487.details
- Aspectos psico-bio-socio-culturales del lenguaje natural humano.Dante Roberto Salatino (ed.) - 2012 - Desktop Publishing Amazon.details
- Introduction to Mathematical Logic.Micha? Walicki - 2012 - World Scientific.details
- Higher Order Numerical Differentiation on the Infinity Computer.Yaroslav Sergeyev - 2011 - Optimization Letters 5 (4):575-585.details
- Numerical Computations and Mathematical Modelling with Infinite and Infinitesimal Numbers.Yaroslav Sergeyev - 2009 - Journal of Applied Mathematics and Computing 29:177-195.details
- What a Course on Philosophy of Computing is Not.Vincent C. Müller - 2008 - APA Newsletter on Philosophy and Computers 8 (1):36-38.details
- Jump Operator and Yates Degrees.Guohua Wu - 2006 - Journal of Symbolic Logic 71 (1):252 - 264.details
- A Guarded Fragment for Abstract State Machines.Antje Nowack - 2005 - Journal of Logic, Language and Information 14 (3):345-368.details
- On the Induction Schema for Decidable Predicates.Lev D. Beklemishev - 2003 - Journal of Symbolic Logic 68 (1):17-34.details
- Proving Consistency of Equational Theories in Bounded Arithmetic.Arnold Beckmann† - 2002 - Journal of Symbolic Logic 67 (1):279-296.details
- Modal Logic: Graph. Darst.Patrick Blackburn, Maarten de Rijke & Yde Venema - 2002 - Cambridge University Press.details
- Strong Normalization of a Symmetric Lambda Calculus for Second-Order Classical Logic.Yoriyuki Yamagata - 2002 - Archive for Mathematical Logic 41 (1):91-99.details
- Computability and Complexity: From a Programming Perspective Vol. 21.N. D. Jones - 1997 - MIT Press.details
- Storage Operators and Directed Lambda-Calculus.René David & Karim Nour - 1995 - Journal of Symbolic Logic 60 (4):1054-1086.details
- John von Neumann and the Origins of Modern Computing by William Aspray. [REVIEW]Michael Mahoney - 1993 - Isis 84:408-409.details
- First Order Logic with Empty Structures.Mohamed A. Amer - 1989 - Studia Logica 48 (2):169 - 177.details
- Papers of John von Neumann on Computing and Computer Theory by John von Neumann; William Aspray; Arthur Burks. [REVIEW]David Allison - 1987 - Isis 78:603-603.details
- The Metatheory of the Classical Propositional Calculus is Not Axiomatizable.Ian Mason - 1985 - Journal of Symbolic Logic 50 (2):451-457.details
- Discontinuities of Provably Correct Operators on the Provably Recursive Real Numbers.William J. Collins & Paul Young - 1983 - Journal of Symbolic Logic 48 (4):913-920.details
- Effective Coloration.Dwight R. Bean - 1976 - Journal of Symbolic Logic 41 (2):469-480.details
- The Unprovability in Intuitionistic Formal Systems of the Continuity of Effective Operations on the Reals.Michael Beeson - 1976 - Journal of Symbolic Logic 41 (1):18-24.details
- On the Recursive Unsolvability of the Provability of the Deduction Theorem in Partial Propositional Calculi.D. Bollman & M. Tapia - 1972 - Notre Dame Journal of Formal Logic 13 (1):124-128.details
- Computational Speed-Up by Effective Operators.Albert R. Meyer & Patrick C. Fischer - 1972 - Journal of Symbolic Logic 37 (1):55-68.details
- P≠NP, By Accepting to Make a Shift in the Theory (Time as a Fuzzy Concept) The Structure of a Theory (TC*, Theory of Computation Based on Fuzzy Time).Farzad Didehvar - manuscriptdetails
|
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
|
|