This category needs an editor. We encourage you to help if you are qualified.
Volunteer, or read more about what this involves.
Related categories

458 found
Order:
1 — 50 / 458
  1. Fuzzy Time, From Paradox to Paradox.Farzad Didehvar - manuscript
    Although Fuzzy logic and Fuzzy Mathematics is a widespread subject and there is a vast literature about it, yet the use of Fuzzy issues like Fuzzy sets and Fuzzy numbers was relatively rare in time concept. This could be seen in the Fuzzy time series. In addition, some attempts are done in fuzzing Turing Machines but seemingly there is no need to fuzzy time. Throughout this article, we try to change this picture and show why it is helpful to consider (...)
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  2. Is Classical Mathematics Appropriate for Theory of Computation?Farzad Didehvar - manuscript
    Throughout this paper, we are trying to show how and why our Mathematical frame-work seems inappropriate to solve problems in Theory of Computation. More exactly, the concept of turning back in time in paradoxes causes inconsistency in modeling of the concept of Time in some semantic situations. As we see in the first chapter, by introducing a version of “Unexpected Hanging Paradox”,first we attempt to open a new explanation for some paradoxes. In the second step, by applying this paradox, it (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  3. A Contradiction and P=NP Problem.Farzad Didehvar - manuscript
    Here, by introducing a version of “Unexpected hanging paradox” first we try to open a new way and a new explanation for paradoxes, similar to liar paradox. Also, we will show that we have a semantic situation which no syntactical logical system could support it. Finally, we propose a claim in Theory of Computation about the consistency of this Theory. One of the major claim is:Theory of Computation and Classical Logic leads us to a contradiction.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  4. Halting Problem Undecidability and Infinitely Nested Simulation.P. Olcott - manuscript
    The halting theorem counter-examples present infinitely nested simulation (non-halting) behavior to every simulating halt decider. The pathological self-reference of the conventional halting problem proof counter-examples is overcome. The halt status of these examples is correctly determined. A simulating halt decider remains in pure simulation mode until after it determines that its input will never reach its final state. This eliminates the conventional feedback loop where the behavior of the halt decider effects the behavior of its input.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  5. Randomness is Unpredictability.Jon Williamson - manuscript
  6. Computability and the Symmetric Difference Operator.Uri Andrews, Peter M. Gerdes, Steffen Lempp, Joseph S. Miller & Noah D. Schweber - forthcoming - Logic Journal of the IGPL.
    Combinatorial operations on sets are almost never well defined on Turing degrees, a fact so obvious that counterexamples are worth exhibiting. The case we focus on is the symmetric-difference operator; there are pairs of degrees for which the symmetric-difference operation is well defined. Some examples can be extracted from the literature, e.g. from the existence of nonzero degrees with strong minimal covers. We focus on the case of incomparable r.e. degrees for which the symmetric-difference operation is well defined.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  7. Evolutionary Scenarios for the Emergence of Recursion.Lluís Barceló-Coblijn - forthcoming - Theoria Et Historia Scientiarum 9:171-199.
    Remove from this list  
     
    Export citation  
     
    Bookmark   3 citations  
  8. Algorithmic Randomness and Measures of Complexity.George Barmpalias - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
    We survey recent advances on the interface between computability theory and algorithmic randomness, with special attention on measures of relative complexity. We focus on (weak) reducibilities that measure (a) the initial segment complexity of reals and (b) the power of reals to compress strings, when they are used as oracles. The results are put into context and several connections are made with various central issues in modern algorithmic randomness and computability.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  9. Strengthening Weak Emergence.Nora Berenstain - forthcoming - Erkenntnis:1-18.
    Bedau's influential (1997) account analyzes weak emergence in terms of the non-derivability of a system’s macrostates from its microstates except by simulation. I offer an improved version of Bedau’s account of weak emergence in light of insights from information theory. Non-derivability alone does not guarantee that a system’s macrostates are weakly emergent. Rather, it is non-derivability plus the algorithmic compressibility of the system’s macrostates that makes them weakly emergent. I argue that the resulting information-theoretic picture provides a metaphysical account of (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  10. Taming Koepke's Zoo II: Register Machines.Merlin Carl - forthcoming - Annals of Pure and Applied Logic:103041.
  11. Computability: Gödel, Turing, Church, and Beyond.B. J. Copeland, C. Posy & O. Shagrir (eds.) - forthcoming - MIT Press.
  12. Relationships Between Computability‐Theoretic Properties of Problems.Rod Downey, Noam Greenberg, Matthew Harrison‐Trainor, Ludovic Patey & Dan Turetsky - forthcoming - Journal of Symbolic Logic:1-26.
  13. Explaining Experience In Nature: The Foundations Of Logic And Apprehension.Steven Ericsson-Zenith - forthcoming - Institute for Advanced Science & Engineering.
    At its core this book is concerned with logic and computation with respect to the mathematical characterization of sentient biophysical structure and its behavior. -/- Three related theories are presented: The first of these provides an explanation of how sentient individuals come to be in the world. The second describes how these individuals operate. And the third proposes a method for reasoning about the behavior of individuals in groups. -/- These theories are based upon a new explanation of experience in (...)
    Remove from this list  
    Translate
     
     
    Export citation  
     
    Bookmark  
  14. Reviewed Work(S): Lowness Properties and Randomness. Advances in Mathematics, Vol. 197 by André Nies; Lowness for the Class of Schnorr Random Reals. SIAM Journal on Computing, Vol. 35 by Bjørn Kjos-Hanssen; André Nies; Frank Stephan; Lowness for Kurtz Randomness. The Journal of Symbolic Logic, Vol. 74 by Noam Greenberg; Joseph S. Miller; Randomness and Lowness Notions Via Open Covers. Annals of Pure and Applied Logic, Vol. 163 by Laurent Bienvenu; Joseph S. Miller; Relativizations of Randomness and Genericity Notions. The Bulletin of the London Mathematical Society, Vol. 43 by Johanna N. Y. Franklin; Frank Stephan; Liang Yu; Randomness Notions and Partial Relativization. Israel Journal of Mathematics, Vol. 191 by George Barmpalias; Joseph S. Miller; André Nies. [REVIEW]Johanna N. Y. Franklin - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
    Review by: Johanna N. Y. Franklin The Bulletin of Symbolic Logic, Volume 19, Issue 1, Page 115-118, March 2013.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  15. Computability as a Physical Modality.Tamara Horowitz - forthcoming - Unpublished Ms Held in the Casimir Lewy Library, Cambridge.
    Remove from this list  
    Translate
     
     
    Export citation  
     
    Bookmark  
  16. Expression de la Recursion Primitive Dans le Calcul-XK.J. Ladriere - forthcoming - Logique Et Analyse.
    Remove from this list  
    Translate
     
     
    Export citation  
     
    Bookmark  
  17. Conference on Computability, Complexity and Randomness: Isaac Newton Institute, Cambridge, Uk July 2-6, 2012.Elvira Mayordomo & Wolfgang Merkle - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
    Elvira Mayordomo and Wolfgang Merkle The Bulletin of Symbolic Logic, Volume 19, Issue 1, Page 135-136, March 2013.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  18. Intrinsic Smallness.Justin Miller - forthcoming - Journal of Symbolic Logic:1-21.
    Recent work in computability theory has focused on various notions of asymptotic computability, which capture the idea of a set being “almost computable.” One potentially upsetting result is that all four notions of asymptotic computability admit “almost computable” sets in every Turing degree via coding tricks, contradicting the notion that “almost computable” sets should be computationally close to the computable sets. In response, Astor introduced the notion of intrinsic density: a set has defined intrinsic density if its image under any (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  19. Computability of Diagrammatic Theories for Normative Positions.Matteo Pascucci & Giovanni Sileno - forthcoming - In Proceedings of JURIX 2021: 34th International Conference on Legal Knowledge and Information Systems.
    Normative positions are sometimes illustrated in diagrams, in particular in didactic contexts. Traditional examples are the Aristotelian polygons of opposition for deontic modalities (squares, triangles, hexagons, etc.), and the Hohfeldian squares for obligative and potestative concepts. Proceeding along previous work, we show that Hohfeld’s framework can be used as a basis for developing several Aristotelian polygons and more complex diagrams. Then, we illustrate how logical theories of increasing strength can be built based on these diagrams, and how those theories enable (...)
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  20. Variations on Determinacy And.Ramez L. Sami - forthcoming - Journal of Symbolic Logic:1-10.
  21. Computability and the game of cops and robbers on graphs.Rachel D. Stahl - forthcoming - Archive for Mathematical Logic:1-25.
    Several results about the game of cops and robbers on infinite graphs are analyzed from the perspective of computability theory. Computable robber-win graphs are constructed with the property that no computable robber strategy is a winning strategy, and such that for an arbitrary computable ordinal \, any winning strategy has complexity at least \}\). Symmetrically, computable cop-win graphs are constructed with the property that no computable cop strategy is a winning strategy. Locally finite infinite trees and graphs are explored. The (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  22. A Note on the Learning-Theoretic Characterizations of Randomness and Convergence.Tomasz Steifer - forthcoming - Review of Symbolic Logic:1-15.
    Recently, a connection has been established between two branches of computability theory, namely between algorithmic randomness and algorithmic learning theory. Learning-theoretical characterizations of several notions of randomness were discovered. We study such characterizations based on the asymptotic density of positive answers. In particular, this note provides a new learning-theoretic definition of weak 2-randomness, solving the problem posed by (Zaffora Blando, Rev. Symb. Log. 2019). The note also highlights the close connection between these characterizations and the problem of convergence on random (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  23. Complexity of Syntactical Tree Fragments of Independence-Friendly Logic.Fausto Barbero - 2021 - Annals of Pure and Applied Logic 172 (1):102859.
    A dichotomy result of Sevenster (2014) [29] completely classified the quantifier prefixes of regular Independence-Friendly (IF) logic according to the patterns of quantifier dependence they contain. On one hand, prefixes that contain “Henkin” or “signalling” patterns were shown to characterize fragments of IF logic that capture NP-complete problems; all the remaining prefixes were shown instead to be essentially first-order. In the present paper we develop the machinery which is needed in order to extend the results of Sevenster to non-prenex, regular (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  24. Completion of Choice.Vasco Brattka & Guido Gherardi - 2021 - Annals of Pure and Applied Logic 172 (3):102914.
    We systematically study the completion of choice problems in the Weihrauch lattice. Choice problems play a pivotal rôle in Weihrauch complexity. For one, they can be used as landmarks that characterize important equivalences classes in the Weihrauch lattice. On the other hand, choice problems also characterize several natural classes of computable problems, such as finite mind change computable problems, non-deterministically computable problems, Las Vegas computable problems and effectively Borel measurable functions. The closure operator of completion generates the concept of total (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  25. Incompleteness and the Halting Problem.Cristian S. Calude - 2021 - Studia Logica 109 (5):1159-1169.
    We present an abstract framework in which we give simple proofs for Gödel’s First and Second Incompleteness Theorems and obtain, as consequences, Davis’, Chaitin’s and Kritchman-Raz’s Theorems.
    Remove from this list   Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  26. Connecting with Computability. CiE 2021. Lecture Notes in Computer Science, Vol 12813.L. De Mol, A. Weiermann, F. Manea & D. Fernández-Duque (eds.) - 2021
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  27. Connecting with Computability. Proceedings of Computability in Europe.Liesbeth De Mol, Andreas Weiermann, Florin Manea & David Fernández-Duque (eds.) - 2021
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  28. Computable Irrational Numbers with Representations of Surprising Complexity.Ivan Georgiev, Lars Kristiansen & Frank Stephan - 2021 - Annals of Pure and Applied Logic 172 (2):102893.
  29. Computable Analogs of Cardinal Characteristics: Prediction and Rearrangement.Iván Ongay-Valverde & Paul Tveite - 2021 - Annals of Pure and Applied Logic 172 (1):102872.
    There has recently been work by multiple groups in extracting the properties associated with cardinal invariants of the continuum and translating these properties into similar analogous combinatorial properties of computational oracles. Each property yields a highness notion in the Turing degrees. In this paper we study the highness notions that result from the translation of the evasion number and its dual, the prediction number, as well as two versions of the rearrangement number. When translated appropriately, these yield four new highness (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  30. The Characterization of Weihrauch Reducibility in Systems Containing.Patrick Uftring - 2021 - Journal of Symbolic Logic 86 (1):224-261.
    We characterize Weihrauch reducibility in $ \operatorname {\mathrm {E-PA^{\omega }}} + \operatorname {\mathrm {QF-AC^{0,0}}}$ and all systems containing it by the provability in a linear variant of the same calculus using modifications of Gödel’s Dialectica interpretation that incorporate ideas from linear logic, nonstandard arithmetic, higher-order computability, and phase semantics.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  31. Weaker variants of infinite time Turing machines.Matteo Bianchetti - 2020 - Archive for Mathematical Logic 59 (3-4):335-365.
    Infinite time Turing machines represent a model of computability that extends the operations of Turing machines to transfinite ordinal time by defining the content of each cell at limit steps to be the lim sup of the sequences of previous contents of that cell. In this paper, we study a computational model obtained by replacing the lim sup rule with an ‘eventually constant’ rule: at each limit step, the value of each cell is defined if and only if the content (...)
    Remove from this list   Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  32. Computability, Orders, and Solvable Groups.Arman Darbinyan - 2020 - Journal of Symbolic Logic 85 (4):1588-1598.
    The main objective of this paper is the following two results. There exists a computable bi-orderable group that does not have a computable bi-ordering; there exists a bi-orderable, two-generated computably presented solvable group with undecidable word problem. Both of the groups can be found among two-generated solvable groups of derived length $3$. [a]nswers a question posed by Downey and Kurtz; answers a question posed by Bludov and Glass in Kourovka Notebook.One of the technical tools used to obtain the main results (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  33. Computable Linear Orders and Products.Andrey N. Frolov, Steffen Lempp, Keng Meng Ng & Guohua Wu - 2020 - Journal of Symbolic Logic 85 (2):605-623.
    We characterize the linear order types $\tau $ with the property that given any countable linear order $\mathcal {L}$, $\tau \cdot \mathcal {L}$ is a computable linear order iff $\mathcal {L}$ is a computable linear order, as exactly the finite nonempty order types.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  34. Cupping and Jump Classes in the Computably Enumerable Degrees.Noam Greenberg, Keng Meng Ng & Guohua Wu - 2020 - Journal of Symbolic Logic 85 (4):1499-1545.
    We show that there is a cuppable c.e. degree, all of whose cupping partners are high. In particular, not all cuppable degrees are ${\operatorname {\mathrm {low}}}_3$-cuppable, or indeed ${\operatorname {\mathrm {low}}}_n$ cuppable for any n, refuting a conjecture by Li. On the other hand, we show that one cannot improve highness to superhighness. We also show that the ${\operatorname {\mathrm {low}}}_2$-cuppable degrees coincide with the array computable-cuppable degrees, giving a full understanding of the latter class.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  35. Computability of Polish Spaces Up to Homeomorphism.Matthew Harrison-Trainor, Alexander Melnikov & Keng Meng Ng - 2020 - Journal of Symbolic Logic 85 (4):1664-1686.
    We study computable Polish spaces and Polish groups up to homeomorphism. We prove a natural effective analogy of Stone duality, and we also develop an effective definability technique which works up to homeomorphism. As an application, we show that there is a $\Delta ^0_2$ Polish space not homeomorphic to a computable one. We apply our techniques to build, for any computable ordinal $\alpha $, an effectively closed set not homeomorphic to any $0^{}$-computable Polish space; this answers a question of Nies. (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  36. A Minimal Pair in the Generic Degrees.Denis R. Hirschfeldt - 2020 - Journal of Symbolic Logic 85 (1):531-537.
    We show that there is a minimal pair in the nonuniform generic degrees, and hence also in the uniform generic degrees. This fact contrasts with Igusa’s result that there are no minimal pairs for relative generic computability and answers a basic structural question mentioned in several papers in the area.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  37. Term-Space Semantics of Typed Lambda Calculus.Ryo Kashima, Naosuke Matsuda & Takao Yuyama - 2020 - Notre Dame Journal of Formal Logic 61 (4):591-600.
    Barendregt gave a sound semantics of the simple type assignment system λ → by generalizing Tait’s proof of the strong normalization theorem. In this paper, we aim to extend the semantics so that the completeness theorem holds.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  38. Pincherle's Theorem in Reverse Mathematics and Computability Theory.Dag Normann & Sam Sanders - 2020 - Annals of Pure and Applied Logic 171 (5):102788.
    We study the logical and computational properties of basic theorems of uncountable mathematics, in particular Pincherle's theorem, published in 1882. This theorem states that a locally bounded function is bounded on certain domains, i.e. one of the first ‘local-to-global’ principles. It is well-known that such principles in analysis are intimately connected to (open-cover) compactness, but we nonetheless exhibit fundamental differences between compactness and Pincherle's theorem. For instance, the main question of Reverse Mathematics, namely which set existence axioms are necessary to (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  39. Computability in Partial Combinatory Algebras.Sebastiaan A. Terwijn - 2020 - Bulletin of Symbolic Logic 26 (3-4):224-240.
    We prove a number of elementary facts about computability in partial combinatory algebras. We disprove a suggestion made by Kreisel about using Friedberg numberings to construct extensional pca’s. We then discuss separability and elements without total extensions. We relate this to Ershov’s notion of precompleteness, and we show that precomplete numberings are not 1–1 in general.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  40. Hilbert's 10th Problem for Solutions in a Subring of Q.Agnieszka Peszek & Apoloniusz Tyszka - 2019 - Scientific Annals of Computer Science 29 (1):101-111.
    Yuri Matiyasevich's theorem states that the set of all Diophantine equations which have a solution in non-negative integers is not recursive. Craig Smoryński's theorem states that the set of all Diophantine equations which have at most finitely many solutions in non-negative integers is not recursively enumerable. Let R be a subring of Q with or without 1. By H_{10}(R), we denote the problem of whether there exists an algorithm which for any given Diophantine equation with integer coefficients, can decide whether (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  41. Review of 'The Outer Limits of Reason' by Noson Yanofsky 403p (2013) (Review Revised 2019).Michael Starks - 2019 - In Suicidal Utopian Delusions in the 21st Century -- Philosophy, Human Nature and the Collapse of Civilization -- Articles and Reviews 2006-2019 4th Edition Michael Starks. Las Vegas, NV USA: Reality Press. pp. 299-316.
    I give a detailed review of 'The Outer Limits of Reason' by Noson Yanofsky from a unified perspective of Wittgenstein and evolutionary psychology. I indicate that the difficulty with such issues as paradox in language and math, incompleteness, undecidability, computability, the brain and the universe as computers etc., all arise from the failure to look carefully at our use of language in the appropriate context and hence the failure to separate issues of scientific fact from issues of how language works. (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  42. Wolpert, Chaitin e Wittgenstein em impossibilidade, incompletude, o paradoxo do mentiroso, o teísmo, os limites da computação, um princípio de incerteza mecânica não quântica e o universo como computador — o teorema final na teoria da máquina de Turing (revisado 2019).Michael Richard Starks - 2019 - In Delírios Utópicos Suicidas no Século XXI Filosofia, Natureza Humana e o Colapso da Civilization- Artigos e Comentários 2006-2019 5ª edição. Las Vegas, NV USA: Reality Press. pp. 183-187.
    Eu li muitas discussões recentes sobre os limites da computação e do universo como computador, na esperança de encontrar alguns comentários sobre o trabalho surpreendente do físico polimatemático e teórico da decisão David Wolpert, mas não encontrei uma única citação e assim que eu apresento este muito breve Resumo. Wolpert provou alguma impossibilidade impressionante ou teoremas da incompletude (1992 a 2008-Veja arxiv dot org) nos limites à inferência (computação) que são tão gerais que são independentes do dispositivo que faz a (...)
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  43. Counterpossibles in Science: The Case of Relative Computability.Matthias Jenny - 2018 - Noûs 52 (3):530-560.
    I develop a theory of counterfactuals about relative computability, i.e. counterfactuals such as 'If the validity problem were algorithmically decidable, then the halting problem would also be algorithmically decidable,' which is true, and 'If the validity problem were algorithmically decidable, then arithmetical truth would also be algorithmically decidable,' which is false. These counterfactuals are counterpossibles, i.e. they have metaphysically impossible antecedents. They thus pose a challenge to the orthodoxy about counterfactuals, which would treat them as uniformly true. What’s more, I (...)
    Remove from this list   Direct download (8 more)  
     
    Export citation  
     
    Bookmark   23 citations  
  44. On the Question of Whether the Mind Can Be Mechanized, I: From Gödel to Penrose.Peter Koellner - 2018 - Journal of Philosophy 115 (7):337-360.
    In this paper I address the question of whether the incompleteness theorems imply that “the mind cannot be mechanized,” where this is understood in the specific sense that “the mathematical outputs of the idealized human mind do not coincide with the mathematical outputs of any idealized finite machine.” Gödel argued that his incompleteness theorems implied a weaker, disjunctive conclusion to the effect that either “the mind cannot be mechanized” or “mathematical truth outstrips the idealized human mind.” Others, most notably, Lucas (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  45. The Changing Practices of Proof in Mathematics: Gilles Dowek: Computation, Proof, Machine. Cambridge: Cambridge University Press, 2015. Translation of Les Métamorphoses du Calcul, Paris: Le Pommier, 2007. Translation From the French by Pierre Guillot and Marion Roman, $124.00HB, $40.99PB.Andrew Arana - 2017 - Metascience 26 (1):131-135.
    Review of Dowek, Gilles, Computation, Proof, Machine, Cambridge University Press, Cambridge, 2015. Translation of Les Métamorphoses du calcul, Le Pommier, Paris, 2007. Translation from the French by Pierre Guillot and Marion Roman.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  46. Computable Axiomatizability of Elementary Classes.Peter Sinclair - 2016 - Mathematical Logic Quarterly 62 (1-2):46-51.
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  47. Predicatively Computable Functions on Sets.Toshiyasu Arai - 2015 - Archive for Mathematical Logic 54 (3-4):471-485.
    Inspired from a joint work by A. Beckmann, S. Buss and S. Friedman, we propose a class of set-theoretic functions, predicatively computable set functions. Each function in this class is polynomial time computable when we restrict to finite binary strings.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  48. Review of Computability: Turing, Gödel, Church, and Beyond. [REVIEW]Andrew Arana - 2015 - Notre Dame Philosophical Reviews 3 (20).
  49. How-Possibly Explanations in (Quantum) Computer Science.Michael E. Cuffaro - 2015 - Philosophy of Science 82 (5):737-748.
    A primary goal of quantum computer science is to find an explanation for the fact that quantum computers are more powerful than classical computers. In this paper I argue that to answer this question is to compare algorithmic processes of various kinds and to describe the possibility spaces associated with these processes. By doing this, we explain how it is possible for one process to outperform its rival. Further, in this and similar examples little is gained in subsequently asking a (...)
    Remove from this list   Direct download (8 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  50. Erratum To: Limit Computable Integer Parts.Paola D’Aquino, Julia Knight & Karen Lange - 2015 - Archive for Mathematical Logic 54 (3-4):487-489.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 458