„computability“

Suchergebnisse

457 Treffer

• Philosophical Explorations of the Legacy of Alan Turing – Turing 100
  Floyd, Juliet ; Bokulich, Alisa 2017 Springer International Publishing
• Logical Foundations of Computer Science – International Symposium, LFCS 2016, Deerfield Beach, FL, USA, January 4-7, 2016. Proceedings
  Artemov, Sergej N. ; Nerode, Anil 2015 Springer International Publishing
• A Coinductive Representation of Computable Functions
  Tang, Alvin ; Pattinson, Dirk 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Computability and Complexity Theory
  Homer, Steven ; Selman, Alan L. 2001 Springer New York
• Logic, Computation, Hierarchies
  Brattka, Vasco ; Diener, Hannes ; Spreen, Dieter 2014 De Gruyter
• Computability of Banach space principles
  Brattka, Vasco 2016 FernUniversität in Hagen
• Unity of Logic and Computation – 19th Conference on Computability in Europe, CiE 2023, Batumi, Georgia, July 24–28, 2023, Proceedings
  2023 Springer Nature Switzerland
• Computability on the Probability Measures on the Borel Sets of the Unit Interval
  Weihrauch, Klaus 2017 FernUniversität in Hagen
• THE COMPUTABILITY OF COMPETENCE
  MOYNE, J. A.
• Minimality and Computability of Languages of G-Shifts
  Amir, Djamel Eddine ; Hellouin de Menibus, Benjamin 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Computability of Rectifiable Simple Curve (Extended Abstract)
  Rettinger, Robert ; Zheng, Xizhong 2009 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Synthesizing Computable Functions from Rational Specifications over Infinite Words
  Filiot, Emmanuel ; Winter, Sarah 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Wait-Free Solvability of Equality Negation Tasks
  Goubault, Éric ; Lazić, Marijana ; Ledent, Jérémy ; Rajsbaum, Sergio 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Simple Computability Theorem for Colorless Tasks in Submodels of the Iterated Immediate Snapshot
  Coutouly, Yannis ; Godard, Emmanuel 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Higher-Order Constrained Dependency Pairs for (Universal) Computability
  Guo, Liye ; Hagens, Kasper ; Kop, Cynthia ; Vale, Deivid 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Consistent Ultrafinitist Logic
  Gajda, Michał J. 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Semantics for a Turing-Complete Reversible Programming Language with Inductive Types
  Chardonnet, Kostia ; Lemonnier, Louis ; Valiron, Benoît 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Solving Discontinuous Initial Value Problems with Unique Solutions Is Equivalent to Computing over the Transfinite
  Bournez, Olivier ; Gozzi, Riccardo 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Contributions to the Domino Problem: Seeding, Recurrence and Satisfiability
  Bitar, Nicolás 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Magic: The Gathering Is Turing Complete
  Churchill, Alex ; Biderman, Stella ; Herrick, Austin 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik