scientific article; zbMATH DE number 1339873
From MaRDI portal
Publication:4265595
Recommendations
Cited in
(52)- Complexity classes and fragments of C
- On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts
- The influence of domain interpretations on computational models
- Formalizing non-termination of recursive programs
- Analysing the implicit complexity of programs.
- A characterization of partial metrizability: Domains are quantifiable.
- Computational complexity via programming languages: Constant factors do matter
- Characterizing polynomial and exponential complexity classes in elementary lambda-calculus
- Monoidal computer. III: A coalgebraic view of computability and complexity (extended abstract)
- On the computational complexity of Longley's \(H\) functional
- Frameworks for adaptable scheduling algorithms
- A characterization of alternating log time by ramified recurrence
- The fixed point problem of a simple reversible language
- The origins of the halting problem
- Subrecursive equivalence relations and (non-)closure under lattice operations
- Generality's price: Inescapable deficiencies in machine-learned programs
- Verification of gap-order constraint abstractions of counter systems
- A hypercomputational alien
- Resource control for synchronous cooperative threads
- Computational complexity in non-Turing models of computation: the what, the why and the how
- Taming the incomputable, reconstructing the nonconstructive and deciding the undecidable in mathematical economics
- The power of non-determinism in higher-order implicit complexity. Characterising complexity classes using non-deterministic cons-free programming
- On reversible Turing machines and their function universality
- Some remarks on real numbers induced by first-order spectra
- Immune Systems in Computer Virology
- scientific article; zbMATH DE number 7228884 (Why is no real title available?)
- Asymptotic speedups, bisimulation and distillation (work in progress)
- Least upper bounds on the size of Church-Rosser diagrams in term rewriting and -calculus
- Self-generating program specializers
- scientific article; zbMATH DE number 1231465 (Why is no real title available?)
- A decidable timeout-based extension of linear temporal logic
- Non-size increasing graph rewriting for natural language processing
- scientific article; zbMATH DE number 2110614 (Why is no real title available?)
- scientific article; zbMATH DE number 1405577 (Why is no real title available?)
- Term rewriting characterisation of LOGSPACE for finite and infinite data
- Formalizing termination proofs under polynomial quasi-interpretations
- Proof-directed program transformation: a functional account of efficient regular expression matching
- scientific article; zbMATH DE number 7453191 (Why is no real title available?)
- Tight polynomial bounds for loop programs in polynomial space
- Complexity spaces as quantitative domains of computation
- Programming in biomolecular computation
- Selected topics on computability, complexity, and termination
- The Church-Turing Thesis over Arbitrary Domains
- Languages, Decidability, and Complexity
- Computational Complexity
- Kolmogorov complexity and non-determinism
- A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff
- Subclasses of \textsc{Ptime} interpreted by programming languages
- Beta-shifts, their languages, and computability
- Theoretical computer science: computability, decidability and logic
- Parameterized model-checking of discrete-timed networks and symmetric-broadcast systems
- Unbounded recursion and non-size-increasing functions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4265595)
