yusuke1997/dblp-id-title huggingface dataset:
How can Grammatical Inference Contribute to Computational Linguistics?
Three Debates about Computing
A Church-Turing Thesis for Randomness?
Barendregt's Problem #26 and Combinatory Strong Reduction
The Algorithm Concept - Tool for Historiographic Interpretation or Red Herring?
Constructing New Aperiodic Self-simulating Tile Sets
On the Effectiveness of Symmetry Breaking
Inequalities for Entropies and Dimensions
Martingale Families and Dimension in P
Liouville Numbers and the Computational Complexity of Changing Bases
Lines Missing Every Random Point
The First Order Theories of the Medvedev and Muchnik Lattices
On Learning Existentially Definable Subsets in a Computable Structure
Approximating Generalized Multicut on Trees
Proof-Carrying Neuro-Symbolic Code
Computable Fields and Weak Truth-Table Reducibility
Beyond Rogers' Non-constructively Computable Function
De Groot Duality for Represented Spaces
Newton's Forward Difference Equation for Functions from Words to Words
Total Nondeterministic Turing Machines and a p-optimal Proof System for SAT
Succinct NP Proofs from an Extractability Assumption
Extraction in Coq: An Overview
Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants
Nash Stability in Additively Separable Hedonic Games Is NP-Hard
Weak Reduction Principle and Computable Metric Spaces
Cutting Planes and the Parameter Cutwidth
Factoring Out Intuitionistic Theorems: Continuity Principles and the Uniform Continuity Theorem
FM-Representability and Beyond
Formally Computing with the Non-computable
Splittings and Robustness for the Heine-Borel Theorem
Multidimensional Tilings and MSO Logic
The Strength of the Grätzer-Schmidt Theorem
Some Notes on Spaces of Ideals and Computable Topology
Finite Language Forbidding-Enforcing Systems
Theoretical and Implementational Aspects of the Formal Language Server (LaSer)
Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry
Some Classes of Generalised Communicating P Systems and Simple Kernel P Systems
Cupping D 2 0 Enumeration Degrees to 0 e '
Graph Structures and Algorithms for Query-Log Analysis
Complexity of Maximum Fixed Point Problem in Boolean Networks
Clockability for Ordinal Turing Machines
Strong Medvedev Reducibilities and the KL-Randomness Problem
Crossroads of Computability and Logic: Insights, Inspirations, and Innovations - 21st Conference on Computability in Europe, CiE 2025, Lisbon, Portugal, July 14-18, 2025, Proceedings
Computability of Real Functions with Oracle Pointer Machines Implies Real-Time Simulation of Chemical Reaction Networks
Infinitary Computability with Infinite Time Turing Machines
Random Closed Sets
Intuitionistic Provability versus Uniform Provability in \mathsfRCA RCA
On Shift Spaces with Algebraic Structure
A Diamond Embedding Theorem in the Quotient Structure bfR/NCup
Extracting Winning Strategies in Update Games
Union of Reducibility Candidates for Orthogonal Constructor Rewriting
On Preserving the Computational Content of Mathematical Proofs: Toy Examples for a Formalising Strategy
Applying Causality Principles to the Axiomatization of Probabilistic Cellular Automata
Time-Complexity Semantics for Feasible Affine Recursions
On the Interplay Between Inductive Inference of Recursive Functions, Complexity Theory and Recursive Numberings
Nature-Based Problems in Cellular Automata
Kolmogorov Complexity Cores
A Note on the Sequential Version of Statements
On the Completeness of Quantum Computation Models
The Computation of Nature, Or: Does the Computer Drive Science and Technology?
Cupping and Diamond Embeddings: A Unifying Approach
Using Semidirect Product of (Semi)groups in Public Key Cryptography
An algorithmic approach to characterizations of admissibles
Hierarchies in Fragments of Monadic Strict NP
Algorithmic Minimal Sufficient Statistic Revisited
Placing Green Bridges Optimally, with a Multivariate Analysis
Hyperarithmetic Numerals
Learning, Social Intelligence and the Turing Test - Why an "Out-of-the-Box" Turing Machine Will Not Pass the Turing Test
Computable Analysis for Extraction of Certified Programs and Its Applications
On the Complexity of the Sperner Lemma
Complexity in Predicative Arithmetic
Skolem + Tetration Is Well-Ordered
More Intensional Versions of Rice's Theorem
Unity of Logic and Computation - 19th Conference on Computability in Europe, CiE 2023, Batumi, Georgia, July 24-28, 2023, Proceedings
The Complexity of Explicit Constructions
Complexity and Categoricity of Injection Structures Induced by Finite State Transducers
On Arithmetical Numberings in Reverse Mathematics
Non-deterministic Halting Times for Hamkins-Kidder Turing Machines
Finite Trees as Ordinals
AFCAL and the Emergence of Computer Science in France: 1957-1967
On Immortal Configurations in Turing Machines
A Compositional Semantics of Reaction Systems with Restriction
Hybrid Maximal Filter Spaces
A Computational Model of XACML-Based Access Control Management in Distributed Networks
Gödel and the Origins of Computer Science
On the Processing Power of Protozoa
A General Representation Theorem for Probability Functions Satisfying Spectrum Exchangeability
On Decidable and Computable Models of Theories
A Note on the Least Informative Model of a Theory
Recursion and Complexity
Internal Density Theorems for Hierarchies of Continuous Functionals
Membrane Computing - Current Results and Future Problems
Complete Determinacy and Subsystems of Second Order Arithmetic
Language Forbidding-Enforcing Systems Defining DNA Codewords
Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra
A Gandy Theorem for Abstract Structures and Applications to First-Order Definability
Recursion-Theoretic Alternation
Some Nonstandard Equivalences in Reverse Mathematics
Compactness and the Effectivity of Uniformization
Equivalence Relations on Classes of Computable Structures
Low n Boolean Subalgebras
Program Schemes with Deep Pushdown Storage
Topology of Asymptotic Cones and Non-deterministic Polynomial Time Computations
On the Computational Content of the Brouwer Fixed Point Theorem
Phase Transition Thresholds for Some Natural Subclasses of the Computable Functions
On Interpretability Between Some Weak Essentially Undecidable Theories
Completely Regular Bishop Spaces
Natural Computing: A Natural and Timely Trend for Natural Sciences and Science of Computation
Quantitative Coding and Complexity Theory of Compact Metric Spaces
Deciding the Borel Complexity of Regular Tree Languages
Existence of Faster than Light Signals Implies Hypercomputation already in Special Relativity
Tree-Automatic Well-Founded Trees
Lower Bounds for Kernelizations and Other Preprocessing Procedures
Survey on Oblivious Routing Strategies
Lowness for Demuth Randomness
Computable Procedures for Fields
Decidability of Hybrid Logic with Local Common Knowledge Based on Linear Temporal Logic LTL
New Nonterminal Complexity Results for Semi-conditional Grammars
Cellular Automata: Communication Matters
Programming with Ordinary Differential Equations: Some First Steps Towards a Programming Language
Three Theorems on n-REA Degrees: Proof-Readers and Verifiers
Gene Tree Correction by Leaf Removal and Modification: Tractability and Approximability
Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal
On Higher Effective Descriptive Set Theory
Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism
The Role of Algebraic Models and Type-2 Theory of Effectivity in Special Purpose Processor Design
Axiomatizing Resource Bounds for Measure
Closed Choice for Finite and for Convex Sets
Notes on the Jump of a Structure
New Bounds on the Strength of Some Restrictions of Hindman's Theorem
Computational Heuristics for Simplifying a Biological Model
Categoricity in Restricted Classes
A New Optimum-Time Firing Squad Synchronization Algorithm for Two-Dimensional Rectangle Arrays: One-Sided Recursive Halving Based
Effective Categoricity of Injection Structures
Calculating the Mind Change Complexity of Learning Algebraic Structures
Isomorphisms of Non-Standard Fields and Ash's Conjecture
Turing's Vision and Deep Learning
Relative Randomness for Martin-Löf Random Sets
Structures of Some Strong Reducibilities
Multi-scale Modeling of Gene Regulation of Morphogenesis
Character-Based Phylogeny Construction and Its Application to Tumor Evolution
Decidable and Undecidable Fragments of First-Order Concatenation Theory
Latency-Bounded Target Set Selection in Social Networks
Characteristics of Minimal Effective Programming Systems
A Note on the Computable Categoricity of \ell ^p ℓ p Spaces
Robust Simulations of Turing Machines with Analytic Maps and Flows
LJQ: A Strongly Focused Calculus for Intuitionistic Logic
Do Noetherian Modules Have Noetherian Basis Functions?
Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete
Current Developments on Computational Modeling Using P Systems
Turing Progressions and Their Well-Orders
Negative Glues and Non-determinism in Nanocomputations by Self-assembly
Proof Complexity of Monotone Branching Programs
Complexity of Existential Positive First-Order Logic
Boole: From Calculating Numbers to Calculating Thoughts
Complexity of Aperiodicity for Topological Properties of Regular omega-Languages
Randomising Realizability
Comparative Genomics on Artificial Life
Randomness and the Ergodic Decomposition
Infinities in Quantum Field Theory and in Classical Computing: Renormalization Program
On Trees Without Hyperimmune Branches
Degrees of Non-computability of Homeomorphism Types of Polish Spaces
Another Jump Inversion Theorem for Structures
Graph States and the Necessity of Euler Decomposition
On the Existence of Infinite Monomial Division Chains with Finitely Many Indeterminates
Infinite-Time Turing Machines and Borel Reducibility
Repetitions in Toeplitz Words and the Thue Threshold
Hyperloops Do Not Threaten the Notion of an Effective Procedure
Pure Iteration and Periodicity
A Miniaturisation of Ramsey's Theorem
Exploiting Membrane Features to Compute
Computing Equality-Free String Factorisations
Algebras of Complemented Subsets
Binary Trees and (Maximal) Order Types
Prawf: An Interactive Proof System for Program Extraction
On the Equivalence of Automata for KAT-expressions
On a Hierarchy of Plus-Cupping Degrees
Logic and Control
Defining Formal Explanation in Classical Logic by Substructural Derivability
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
Program Self-reference in Constructive Scott Subdomains
Sequential Automatic Algebras
Constructive Mathematics, Church's Thesis, and Free Choice Sequences
Computability and Complexity in Self-assembly
On the Computability Power of Membrane Systems with Controlled Mobility
A One-Dimensional Physically Universal Cellular Automaton
The Algebraic Counterpart of the Wagner Hierarchy
Speed-Up Theorems in Type-2 Computation
The Transfinite Action of 1 Tape Turing Machines
Destroying Bicolored P 3 s by Deleting Few Edges
Optimization and Approximation Problems Related to Polynomial System Solving
Time-Aware Uniformization of Winning Strategies
Program Size Complexity of Correction Grammars in the Ershov Hierarchy
Error and Predicativity
Structures without Scattered-Automatic Presentation
#P-completeness of Counting Update Digraphs, Cacti, and Series-Parallel Decomposition Method
Turing's Normal Numbers: Towards Randomness
Recent Advances in Text-to-Pattern Distance Algorithms
Theories and Ordinals: Ordinal Analysis
Permutive One-Way Cellular Automata and the Finiteness Problem for Automaton Groups
Reducing Reachability in Temporal Graphs: Towards a More Realistic Model of Real-World Spreading Processes
Enumeration Degrees and Topology
Randomness, Computation and Mathematics
On Some Relations Between Approximation Problems and PCPs over the Real Numbers
Constructive Dimension and Weak Truth-Table Degrees
On Guarded Extensions of MMSNP
Processing Natural Language with Biomolecules: Where Linguistics, Biology and Computation Meet
Limitwise Monotonic Spectra and Their Generalizations
Sequential Discontinuity and First-Order Problems
Beyond the Super-Turing Snare: Analog Computation and Digital Virtuality
Secret Sharing Schemes with Algebraic Properties and Applications
The Complexity of Finding Supergraphs
Interactive Physical ZKP for Connectivity: Applications to Nurikabe and Hitori
Geometric Software: Robustness Issues and Model of Computation
Functions of Baire Class One over a Bishop Topology
The Dimension of a Point: Computability Meets Fractal Geometry
An $O(\sqrt{k})$-Approximation Algorithm for Minimum Power k Edge Disjoint st-Paths
Internal Computability
Partial Orders and Immunity in Reverse Mathematics
Upper Semilattices in Many-One Degrees
Local Compactness for Computable Polish Metric Spaces is \varPi ^1_1 Π 1 1 -complete
Hilbert's Tenth Problem and Paradigms of Computation
Co-total Enumeration Degrees
On Rules and Parameter Free Systems in Bounded Arithmetic
Universal Boolean Algebras with Applications to Semantic Classes of Models
Processes Inspired by the Functioning of Living Cells: Natural Computing Approach
Phase Transitions Related to the Pigeonhole Principle
Cupping Classes of Enumeration Degrees
Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems
Cohesive Powers of Linear Orders
Surreal Blum-Shub-Smale Machines
Interpreting Localized Computational Effects Using Operators of Higher Type
Approximability and Hardness in Multi-objective Optimization
Weighted Automata on Infinite Words in the Context of Attacker-Defender Games
Kolmogorov Complexity as a Combinatorial Tool
Prefix-Like Complexities and Computability in the Limit
P Automata: Membrane Systems as Acceptors
Beyond the Horizon of Computability - 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29 - July 3, 2020, Proceedings
Ergodicity of Noisy Cellular Automata: The Coupling Method and Beyond
The Low Splitting Theorem in the Difference Hierarchy
Three Roots for Leibniz's Contribution to the Computational Conception of Reason
On the Complexity of Local Search for Weighted Standard Set Problems
Some Observations on Infinitary Complexity
Pursuit of the Universal - 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016, Proceedings
Compression Techniques in Group Theory
The Relationship Between Local and Global Structure in the Enumeration Degrees
Coinductive Proofs for Basic Real Computation
Formalising Exact Arithmetic in Type Theory
Online Computability and Differentiation in the Cantor Space
Fast Quantifier Elimination Means P = NP
Degrees of Total Algorithms versus Degrees of Honest Functions
From Constructibility and Absoluteness to Computability and Domain Independence
Effective Embeddings for Pairs of Structures
Every Sequence Is Decompressible from a Random One
Correctness, Explanation and Intention
Two Open Problems on Effective Dimension
Busy Beavers and Kolmogorov Complexity
Maps of Restrictions for Behaviourally Correct Learning
Some Aspects of a Complexity Theory for Continuous Time Systems
Immunity for Closed Sets
Sailing Routes in the World of Computation - 14th Conference on Computability in Europe, CiE 2018, Kiel, Germany, July 30 - August 3, 2018, Proceedings
Flexible Indexing of Repetitive Collections
A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets
Mapping Monotonic Restrictions in Inductive Inference
Various Regularity Lemmas in Graphs and Hypergraphs
Principal Typings for Explicit Substitutions Calculi
Robustness of Logical Depth
Visual Modelling of Complex Systems: Towards an Abstract Machine for PORGY
Pell Equations and Weak Regularity Principles
Computation of Similarity - Similarity Search as Computation
Complexity of Continuous Space Machine Operations
Hilbert's Tenth Problem for Term Algebras with a Substitution Operator
Modeling Life as Cognitive Info-computation
Base-Complexity Classifications of QCB 0 -Spaces
Böhm Trees, Krivine's Machine and the Taylor Expansion of Lambda-Terms
P Systems with Parallel Rewriting for Chain Code Picture Languages
Is Turing's Thesis the Consequence of a More General Physical Principle?
Deterministic Graphical Games Revisited
The Decision Problem for Undirected Graphs with Reachability and Acyclicity
Using Random Graphs in Population Genomics
Algorithmic Randomness for Infinite Time Register Machines
Multi-valued Functions in Computability Theory
Infinite Time Busy Beavers
Primitive Recursive Selection Functions over Abstract Algebras
On the Problems of Definability in the Enumeration Degrees
An Invariant Cost Model for the Lambda Calculus
Automata on Ordinals and Linear Orders
Parameterized Complexity and Approximation Issues for the Colorful Components Problems
Prime Model with No Degree of Autostability Relative to Strong Constructivizations
Models of Computation in Context - 7th Conference on Computability in Europe, CiE 2011, Sofia, Bulgaria, June 27 - July 2, 2011. Proceedings
From Eventually Different Functions to Pandemic Numberings
Comparing Notions of Computational Entropy
A 5n - o(n) Lower Bound on the Circuit Size over U 2 of a Linear Boolean Function
On the Impact of Treewidth in the Computational Complexity of Freezing Dynamics
New Computational Paradigms, First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings
S 0 1 and P 0 1 Equivalence Structures
A Short Note on Spector's Proof of Consistency of Analysis
K -Trivial Closed Sets and Continuous Functions
Well-Orders Realized by C.E. Equivalence Relations
Isometric Sets of Words and Generalizations of the Fibonacci Cubes
Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees
Ordinal Computability
The Classification Problem for Compact Computable Metric Spaces
Effective Inseparability and Its Applications
Subsymbolic Computation Theory for the Human Intuitive Processor
Immune Systems in Computer Virology
Algorithm Analysis Through Proof Complexity
Consecutive Ones Property Testing: Cut or Swap
Complexity of Operation Problems
Witness Hiding Without Extractors or Simulators
Turing Computable Embeddings and Coding Families of Sets
Some Notes on Degree Spectra of the Structures
The Quantum Complexity of Markov Chain Monte Carlo
Degree Spectra for Transcendence in Fields
In Search of the First-Order Part of Ramsey's Theorem for Pairs
Simple Betting and Stochasticity
Some Reducibilities on Regular Sets
Symbol Grounding in Connectionist and Adaptive Agent Models
First-Order Model Checking Problems Parameterized by the Model
Information and Logical Discrimination
On the Perceptron's Compression
Ackermannian Goodstein Sequences of Intermediate Growth
Two-Player Domino Games
Elementarily Traceable Irrational Numbers
Algebraic Model of an Arithmetic Unit for TTE-Computable Normalized Rational Numbers
Complexity Issues for Preorders on Finite Labeled Forests
Computing with Foresight and Industry - 15th Conference on Computability in Europe, CiE 2019, Durham, UK, July 15-19, 2019, Proceedings
Computational Complexity of Constraint Satisfaction
Language, Life, Limits - 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings
Computing with Genetic Gates
Uniform Operators
The Church-Turing Thesis: Consensus and Opposition
Lossiness of Communication Channels Modeled by Transducers
(Short) Survey of Real Hypercomputation
Phase Transitions for Weakly Increasing Sequences
Koepke Machines and Satisfiability for Infinitary Propositional Languages
Index Sets of Computable Structures with Decidable Theories
Online Bin Packing: Old Algorithms and New Results
∑ μ 2 is decidable for ∏ μ 2
Formal Languages in Information Extraction and Graph Databases
Rank Lower Bounds for the Sherali-Adams Operator
On Mathias Generic Sets
Turing Unbound: Transfinite Computation
Defining Long Words Succinctly in FO and MSO
Formulas with Reversal
An Application of Martin-Löf Randomness to Effective Probability Theory
Quantum First-Order Logics that Capture Logarithmic-Time/Space Quantum Computability
Formalizing a Fragment of Combinatorics on Words
An Enhanced Theory of Infinite Time Register Machines
Algorithms and Their Explanations
Producer/Consumer in Membrane Systems and Petri Nets
Non-coding Enumeration Operators
Domain Theory and the Causal Structure of Space-Time
Algorithms and Geometric Constructions
Divide and Conquer Computation of the Multi-string BWT and LCP Array
What is Turing's Comparison between Mechanism and Writing Worth?
Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings
Undecidability in Weihrauch Degrees
Uncomputability Below the Real Halting Problem
Computability-Theoretic and Proof-Theoretic Aspects of Vaughtian Model Theory
Programming Experimental Procedures for Newtonian Kinematic Machines
Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests
Properties of Range Sets of Continuous Functions in Reverse Mathematics
Degrees of Categoricity of Rigid Structures
A Tale of Optimizing the Space Taken by de Bruijn Graphs
On Stateless Multicounter Machines
Solving Simple Stochastic Games
On λ-Definable Functions on Ordinals
Universality in Molecular and Cellular Computing
An Approach to the Engineering of Cellular Models Based on P Systems
From Logic to Physics: How the Meaning of Computation Changed over Time
Abstract Partial Cylindrical Algebraic Decomposition I: The Lifting Phase
Degrees of Weakly Computable Reals
On General Sum Approximations of Irrational Numbers
The Flow of Data and the Complexity of Algorithms
On the Computational Power of Flip-Flop Proteins on Membranes
Sets of Signals, Information Flow, and Folktales
The Computing Spacetime
Index Sets and Universal Numberings
On Processes and Structures
Einstein Meets Turing: The Computability of Nonlocal Games
Balancing Straight-Line Programs for Strings and Trees
How Much Randomness Is Needed for Statistics?
If CiE Did Not Exist, It Would Be Necessary to Invent It
Symmetry for Transfinite Computability
Dedekind Cuts and Long Strings of Zeros in Base Expansions
Computational Interpretations of Analysis via Products of Selection Functions
On the Compatibility Between the Minimalist Foundation and Constructive Set Theory
A Generic m-Reducibility
On Computability of Navier-Stokes' Equation
Infima of d . r . e . Degrees
The Complexity of Satisfaction Problems in Reverse Mathematics
Kurt Gödel and Computability Theory
Covering the Recursive Sets
Complexity of Deep Inference via Atomic Flows
Noise versus Computational Intractability in Dynamics
Thin Maximal Antichains in the Turing Degrees
Natural Signs
Real Benefit of Promises and Advice
Relativized Degree Spectra
Iterative Forcing and Hyperimmunity in Reverse Mathematics
Stochastic Programs and Hybrid Automata for (Biological) Modeling
McShane-Whitney Pairs
On Algorithmic Strong Sufficient Statistics
Joining to High Degrees
Minimal Pairs and Quasi-minimal Degrees for the Joint Spectra of Structures
On Distributed Monitoring and Synthesis
Haskell before Haskell: Curry's Contribution to Programming (1946-1950)
Recursion in Higher Types and Resource Bounded Turing Machines
Computing a Model of Set Theory
Turing Patterns in Deserts
Function Spaces for Second-Order Polynomial Time
Game Arguments in Computability Theory and Algorithmic Information Theory
A Divergence Formula for Randomness and Dimension
A Thread Algebra with Multi-level Strategic Interleaving
Pseudojump Operators and P 0 1 Classes
A Personal View of the P versus NP Problem
Algorithmic Aspects of Left-Orderings of Solvable Baumslag-Solitar Groups via its Dynamical Realization
An Efficient Algorithm for the Equation Tree Automaton via the k-C-Continuations
Complexities of Theories of Profinite Subgroups of S ømega via Tree Presentations
Extending Wadge Theory to k-Partitions
On the Executability of Interactive Computation
Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests
Numberings and Randomness
On False Heine/Borel Compactness Principles in Proof Mining
Partial Continuous Functions and Admissible Domain Representations
The Domino Problem for Self-similar Structures
The Theory of Reachability of Trace-Pushdown Systems