„computability“
Suchergebnisse
457 Treffer
-
Gödel’s Theorem Without Tears - Essential Incompleteness in Synthetic Computability
-
Constructive and Synthetic Reducibility Degrees: Post’s Problem for Many-One and Truth-Table Reducibility in Coq
-
On Synthesizing Computable Skolem Functions for First Order Logic
-
Undecidability of Dyadic First-Order Logic in Coq
-
Synthetic Kolmogorov Complexity in Coq
-
Computability of Finite Simplicial Complexes
-
Certified Decision Procedures for Two-Counter Machines
-
An Analysis of Tennenbaum’s Theorem in Constructive Type Theory
-
Sheaf Semantics of Termination-Insensitive Noninterference
-
Oritatami Systems Assemble Shapes No Less Complex Than Tile Assembly Model (ATAM)
-
The Aperiodic Domino Problem in Higher Dimension
-
Continuous Tasks and the Asynchronous Computability Theorem
-
Brief Annoucement: On Extending Brandt’s Speedup Theorem from LOCAL to Round-Based Full-Information Models
-
A Rice’s Theorem for Abstract Semantics
-
Synthetic Undecidability of MSELL via FRACTRAN Mechanised in Coq
-
Synthetic Undecidability and Incompleteness of First-Order Axiom Systems in Coq
-
A Mechanised Proof of the Time Invariance Thesis for the Weak Call-By-Value λ-Calculus
-
Church’s Thesis and Related Axioms in Coq’s Type Theory
-
Synthesis of Computable Regular Functions of Infinite Words
-
Synchronizing Deterministic Push-Down Automata Can Be Really Hard