„computability“

Suchergebnisse

457 Treffer

• Computability in Analysis and Physics
  Pour-El, Marian B. ; Richards, J. Ian 1989 Springer Berlin Heidelberg
• DETERMINISTIC COMPUTABILITY
  Nabiatek, Ireneusz
• Computability by nondeterministic program and the Moschovakis search computability
  Solov'ev, V. D.
• Computability and complexity theory
  Homer, Steven ; Selman, Alan L. 2001 Springer
• Combinatorics, computability and logic – proceedings of the Third International Conference on Combinatorics, Computability and Logic, (DMTCS '01)
  Calude, Cristian 2001 Springer
• Simplification orders in term rewriting – derivation lengths, order types, and computability
  Lepper, Ingo
• Horn clause computability
  Tärnlund, Sten-Åke
• Berechenbarkeit als Sphäre digitaler Medien
  Nückel, Thomas ; Ernst, Wolfgang 2018 Humboldt-Universität zu Berlin
• On time computability of functions in one-way cellular automata
  Buchholz, Thomas ; Kutrib, Martin 1998 Universitätsbibliothek
• Subrecursiveness: Machine-independent notions of computability in restricted time and storage
  Thompson, David B.
• Twenty Years of Theoretical and Practical Synergies – 20th Conference on Computability in Europe, CiE 2024, Amsterdam, The Netherlands, July 8–12, 2024, Proceedings
  Levy Patey, Ludovic ; Pimentel, Elaine ; Galeotti, Lorenzo ; Manea, Florin 2024 Springer Nature Switzerland, Imprint: Springer
• Computability theory of real numbers
  Zheng, Xizhong 2005 BTU, Inst. of Computer Science
• Computability and fractal dimension
  Reimann, Jan
• On restricted turing computability
  Glinert, Ephraim P.
• Relativization of questions about log space computability
  Ladner, Richard E. ; Lynch, Nancy A.
• CCA 2004 – August 16 - 20, 2004, Lutherstadt Wittenberg, Germany
  Brattka, Vasco 2003 Fernuniv., Fachbereich Informatik
• Real‐Time Decidability, Computability, Countability and Generability
  Ochranová‐Doleželová, Renata
• Enumerability, decidability, computability – An introduction to the theory of recursive functions
  Hermes, Hans ; Herman, Gabor T. ; Plassmann, Ortwin 1965 Springer
• Computability by finite automata and pisot bases
  Berend, Daniel ; Frougny, Christiane
• Computability by means of effectively definable schemes and definability via enumerations
  Soskov, Ivan N.