Imagen de Portada

Computable Approximations of Semicomputable Graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Čačić, Vedran, Čelar, Matea, Horvat, Marko, Iljazović, Zvonko
Formato:	Preprint
Publicado:	2024
Materias:	Logic in Computer Science 03D78, 03D80, 03F60 F.1.1
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Effective bases and notions of effective second countability in computable analysis
por: Brattka, Vasco, et al.
Publicado: (2025)

Weihrauch problems as containers
por: Pradic, Cécilia, et al.
Publicado: (2025)

Exploring the abyss in Kleene's computability theory
por: Sanders, Sam
Publicado: (2023)

Randomness versus superspeedability
por: Hölzl, Rupert, et al.
Publicado: (2024)

The computational content of multidimensional discontinuity
por: Hölzl, Rupert, et al.
Publicado: (2024)

Benign approximations and non-speedability
por: Hölzl, Rupert, et al.
Publicado: (2023)

Loops, Inverse Limits and Non-Determinism
por: Brattka, Vasco
Publicado: (2025)

Computability of the Hahn-Banach Theorem Revisited
por: Brattka, Vasco, et al.
Publicado: (2026)

Problems with fixpoints of polynomials of polynomials
por: Pradic, Cécilia, et al.
Publicado: (2026)

Predicative Ordinal Recursion on the Constructive Veblen Hierarchy
por: Tabatabai, Amirhossein Akbar, et al.
Publicado: (2025)

On the computational properties of basic mathematical notions
por: Normann, Dag, et al.
Publicado: (2022)

On some computational properties of open sets
por: Normann, Dag, et al.
Publicado: (2024)

Reordered Computable Numbers
por: Janicki, Philip
Publicado: (2023)

The reverse mathematics of the pigeonhole hierarchy
por: Houérou, Quentin Le, et al.
Publicado: (2024)

Consistent ultrafinitist logic
por: Gajda, Michał J.
Publicado: (2021)

Computably discrete represented spaces
por: Neumann, Eike, et al.
Publicado: (2025)

Fundamental sequences based on localization
por: Wilken, Gunnar
Publicado: (2024)

Generalizing Goodstein's theorem and Cichon's independence proof
por: Wilken, Gunnar
Publicado: (2025)

Computability of Initial Value Problems
por: Brattka, Vasco, et al.
Publicado: (2024)

Complexity Results in Team Semantics: Nonemptiness Is Not So Complex
por: Anttila, Aleksi, et al.
Publicado: (2025)

Proof-theoretic dilator and intermediate pointclasses
por: Jeon, Hanul
Publicado: (2025)

Undecidability in Relevant Logic
por: Knudstorp, Søren Brinck
Publicado: (2026)

Listing the hyperarithmetical functions
por: Miller, Joseph S., et al.
Publicado: (2026)

A Logspace Constructive Proof of L=SL
por: Buss, Sam, et al.
Publicado: (2025)

Algorithmic Randomness, Effective Disintegrations, and Rates of Convergence to the Truth
por: Huttegger, Simon M., et al.
Publicado: (2024)

Induction on Dilators and Bachmann-Howard Fixed Points
por: Aguilera, Juan P., et al.
Publicado: (2024)

Adversarial Barrier in Uniform Class Separation
por: Rosko, Milan
Publicado: (2025)

Minimal covers in the Weihrauch degrees
por: Lempp, Steffen, et al.
Publicado: (2023)

A propositional cirquent calculus for computability logic
por: Japaridze, Giorgi
Publicado: (2024)

A foundational characterization of Hoare Logic
por: Leivant, Daniel
Publicado: (2026)

Two strong undefinability results in inquisitive and team semantics
por: Barbero, Fausto
Publicado: (2024)

Do not throw out the baby: Clarithmetics as alternatives to weak arithmetics
por: Japaridze, Giorgi
Publicado: (2026)

Robust non-computability of dynamical systems and computability of robust dynamical systems
por: Graça, Daniel S., et al.
Publicado: (2023)

More conservativity for weak Kőnig's lemma
por: Freund, Anton, et al.
Publicado: (2024)

Countable Ordered Groups and Weihrauch Reducibility
por: Li, Ang
Publicado: (2024)

Punctually Standard and Nonstandard Models of Natural Numbers
por: Bazhenov, Nikolay, et al.
Publicado: (2026)

Sheaves as oracle computations
por: Ahman, Danel, et al.
Publicado: (2026)

On Some Complexity Results for Even Linear Languages
por: Cojocaru, Liliana
Publicado: (2024)

Algorithmic correspondence and analytic rules
por: De Domenico, Andrea, et al.
Publicado: (2022)

The Aurellion Function: A Recursive Fast-Growing Hierarchy Beyond Knuth Notation
por: Vodrazka, Daniel
Publicado: (2025)