We are improving our search experience. To check which content you have full access to, or for advanced search, go back to the old search.

Search

Please fill in this field.
Filters applied:
Mathematics

Search Results

Showing 1-20 of 3,302 results

  1. Computability Theory

    Computability theory is the mathematical theory of algorithms, which explores the power and limitations of computation. Classical computability...
    Valentina Harizanov, Keshav Srinivasan, Dario Verta in Handbook of the History and Philosophy of Mathematical Practice
    Reference work entry 2024

  2. Computability Theory

    Computability theory is the mathematical theory of algorithms, which explores the power and limitations of computation. Classical computability...
    Valentina Harizanov, Keshav Srinivasan, Dario Verta in Handbook of the History and Philosophy of Mathematical Practice
    Living reference work entry 2023

  3. The Non-normal Abyss in Kleene’s Computability Theory

    Kleene’s computability theory based on his S1-S9 computation schemes constitutes a model for computing with objects of any finite type and extends...
    Sam Sanders in Unity of Logic and Computation
    Conference paper 2023

  4. Decomposability and Computability

    We present a new construction of indecomposable type 0 Abelian groups of rank 2. The new construction is used to study degree spectra of such groups....

    B. Khoussainov, A. G. Melnikov in Algebra and Logic
    Article 01 May 2022

  5. Computability Models over Categories and Presheaves

    Generalising slightly the notions of a strict computability model and of a simulation between them, which were elaborated by Longley and Normann...
    Iosif Petrakis in Logical Foundations of Computer Science
    Conference paper 2022

  6. Turing Computability: Structural Theory

    In this work, we review results of the last years related to the development of the structural theory of n -c.e. Turing degrees for n > 1. We also...

    M. M. Arslanov, M. M. Yamaleev in Journal of Mathematical Sciences
    Article 28 May 2021

  7. Symmetry for Transfinite Computability

    Finite Turing computation has a fundamental symmetry between inputs, outputs, programs, time, and storage space. Standard models of transfinite...
    Lorenzo Galeotti, Ethan S. Lewis, Benedikt Löwe in Unity of Logic and Computation
    Conference paper 2023

  8. Quantum First-Order Logics that Capture Logarithmic-Time/Space Quantum Computability

    We introduce a quantum analogue of classical first-order logic (FO) and develop a theory of quantum first-order logic (QFO) as a basis of the...
    Tomoyuki Yamakami in Twenty Years of Theoretical and Practical Synergies
    Conference paper 2024

  9. Parametric Church’s Thesis: Synthetic Computability Without Choice

    In synthetic computability, pioneered by Richman, Bridges, and Bauer, one develops computability theory without an explicit model of computation....
    Yannick Forster in Logical Foundations of Computer Science
    Conference paper 2022

  10. Computability and the game of cops and robbers on graphs

    Several results about the game of cops and robbers on infinite graphs are analyzed from the perspective of computability theory. Computable...

    Rachel D. Stahl in Archive for Mathematical Logic
    Article 24 September 2021

  11. Computability and Universal Determinability of Negatively Representable Models

    Abstract

    It has been established that a negative representable model is computable if and only if its standard enrichment with constants is...

    R. N. Dadazhanov in Russian Mathematics
    Article 01 October 2022

  13. Revolutions and Revelations in Computability 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11–15, 2022, Proceedings

    This book constitutes the proceedings of the 18th Conference on Computability in Europe, CiE 2022, in Swansea, UK, in July 2022.

     

    The 19 full papers...

    Ulrich Berger, Johanna N. Y. Franklin, ... Arno Pauly in Lecture Notes in Computer Science
    Conference proceedings 2022

  14. Characterizations of ITBM-Computability. II

    We consider different characterizations of computability by means of infinite time Blum–Shub–Smale machines (ITBM) via specific functions on sets and...

    P. Koepke, A. S. Morozov in Algebra and Logic
    Article 01 March 2021

  15. Computability in Harmonic Analysis

    Ilia Binder, Adi Glucksam, ... Michael Yampolsky in Foundations of Computational Mathematics
    Article 09 July 2021

  16. Asymptotic Density and Computability

    We prove that a set is bi-immune if and only if its images under computable permutations are not generically computable or effectively densely...

    I. I. Batyrshin in Russian Mathematics
    Article 01 October 2021

  17. Bad oracles in higher computability and randomness

    Many constructions in computability theory rely on “time tricks”. In the higher setting, relativising to some oracles shows the necessity of these....

    Laurent Bienvenu, Noam Greenberg, Benoit Monin in Israel Journal of Mathematics
    Article 15 January 2021

  18. Irrational-Based Computability of Functions

    We investigate a sort of a unifying theory of computability of real functions, continuous or discontinuous, called here “irrational-based” (IB-)...
    Mariko Yasugi, Yoshiki Tsujii, Takakazu Mori in Advances in Mathematical Logic
    Conference paper 2021

  19. Computability: Post, Gödel, Church, Turing (and Many Others)

    Kurt Gödel’s workPost, Emil hadTuring, Alan M. far-reaching effects, beyond the rather specialized fields of mathematical logic and fundamentals of...
    William D. Brewer in Kurt Gödel
    Chapter 2022
Did you find what you were looking for? Share feedback.