„Computability“

Suchergebnisse

457 Treffer

• P ≠ NP for all infinite Boolean algebras
  Prunescu, Mihai
• Two constructive embedding‐extension theorems with applications to continuity principles and to Banach‐Mazur computability
  Bauer, Andrej ; Simpson, Alex
• Computability and continuity in metric partial algebras equipped with computability structures
  Dahlgren, Fredrik
• Computable operators on regular sets
  Ziegler, Martin
• Type‐2 computability on spaces of integrable functions
  Kunkle, Daren
• The minimal complementation property above 0′
  Lewis, Andrew E. M.
• Effective Borel degrees of some topological functions
  Gherardi, Guido
• Quasi‐completeness and functions without fixed‐points
  Batyrshin, Ilnur I.
• Computability of measurable sets via effective metrics
  Wu, Yongcheng ; Ding, Decheng
• Minimal extensions of Π 0 1 classes
  Cenzer, Douglas ; Riazati, Farzan
• Properly Σ 2 minimal degrees and 0″ complementation
  Barry Cooper, S. ; Lewis, Andrew E. M. ; Yang, Yue
• Computability
  2022 Springer International Publishing
• Towards a theory of representations
  Kreitz, Christoph ; Weihrauch, Klaus 2018 FernUniversität in Hagen
• Computability and Decidability – An Introduction for Students of Computer Science
  Loeckx, Jacques 1972 Springer Berlin Heidelberg
• Computability
  Weihrauch, Klaus 1987 Springer Berlin Heidelberg
• Reflexive Structures – An Introduction to Computability Theory
  Sanchis, Luis E. 1988 Springer New York
• Reflexive structures – an introduction to computability theory
  Sanchis, Luis E. 1988 Springer
• Computability
  Weihrauch, Klaus 1987 Springer
• Towards a theory of representations
  Kreitz, Christoph ; Weihrauch, Klaus 1983 Fernuniv.
• Computability and decidability – an introd. for students of computer science
  Loeckx, Jacques 1972 Springer