Classes of Recursively Enumerable Sets and Their Decision Problems
From MaRDI portal
Cites work
Cited in
(86)- A Rice-style theorem for parallel automata
- The three-color and two-color Tantrix\(^{\text{TM}}\) rotation puzzle problems are NP-complete via parsimonious reductions
- The basic theory of partial -recursive operators
- An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines
- Recursion theorems and effective domains
- Index sets related to prompt simplicity
- Indexings of subrecursive classes
- Decision-procedures for invariant properties of short algorithms
- Aggregating inductive expertise on partial recursive functions
- Index sets in 0'
- Complexity classes of partial recursive functions
- Recognition of invariant properties of algorithms
- Some decision problems for polynomial mappings
- A second step towards complexity-theoretic analogs of Rice's Theorem
- Code obfuscation against abstraction refinement attacks
- On the information carried by programs about the objects they compute
- A complete uniform substitution calculus for differential dynamic logic
- A well-structured framework for analysing Petri net extensions
- Analogues of Rice's theorem for semantic classes of propositions
- On an optimal propositional proof system and the structure of easy subsets of TAUT.
- The complexity of universal text-learners.
- What one has to know when attacking \(\mathsf{P}\) vs.\(\mathsf{NP}\)
- Intensional Kleene and Rice theorems for abstract program semantics
- Subrecursive equivalence relations and (non-)closure under lattice operations
- Parametric Church's thesis: synthetic computability without choice
- Efficient equivalence-checking algorithms for procedural programs in progressive semigroup gateway models
- Parameterized synthesis for fragments of first-order logic over data words
- Things that can be made into themselves
- Introducing complexity to formal testing
- More really is different
- Weakening additivity in adjoining closures
- Referenced automata and metaregular families
- Fixed-parameter decidability: extending parameterized complexity analysis
- Improving strategies via SMT solving
- Rice's theorem for -limit sets of cellular automata
- Introduction to model checking
- Asymptotic density, immunity and randomness
- Degrees of Computability
- Some Theorems on Classes of Recursively Enumerable Sets
- Connecting program synthesis and reachability: automatic program repair using test-input generation
- Index sets and universal numberings
- scientific article; zbMATH DE number 3478858 (Why is no real title available?)
- Recursively enumerable sets and degrees
- Descriptional complexity of two-way pushdown automata with restricted head reversals
- On the Decidability of the Equivalence Problem for Monadic Recursive Programs
- Questions in algebra and mathematical logic. Scientific heritage of S. I. Adian
- Non-overlapping inversion on strings and languages
- Superintelligence cannot be contained: lessons from computability theory
- Highly automated formal proofs over memory usage of assembly code
- Translating between language and logic: what is easy and what is difficult
- Vladimir Andreevich Uspensky (27/11/1930–27/6/2018)
- COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS
- An Effective Operator, Continuous but not Partial Recursive
- Productive Sets
- The Physical Meaning of the Holographic Principle
- Calculational design of a regular model checker by abstract interpretation
- Cutting corners
- From undecidability of non-triviality and finiteness to undecidability of learnability
- Looking at Euler flows through a contact mirror: universality and undecidability
- Population-induced phase transitions and the verification of chemical reaction networks
- How much partiality is needed for a theory of computability?
- Deciding program properties via complete abstractions on bounded domains
- Quantum plug n' play: modular computation in the quantum regime
- Abstract semantic dependency
- Communication protocols and QECCs from the perspective of TQFT. I: Constructing LOCC protocols and QECCs from TQFTs
- The semilattice of computable families of recursively enumerable sets
- Spaces with combinators
- Money, time, and information: inspirations from Gödel, Tarski, and Chaitin
- Recursiveness and preference orderings
- Undecidability in physics: a review
- Considerations on approaches and metrics in automated theorem generation/finding in geometry
- On a Rice theorem for dynamical properties of SFTs on groups
- Mathematical algorithm design for deep learning under societal and judicial constraints: the algorithmic transparency requirement
- A query-based constraint acquisition approach for enhanced precision in program precondition inference
- A correctness and incorrectness program logic
- Lower bounds and the hardness of counting properties
- Nash equilibria and undecidability in generic physical interactions -- a free energy perspective
- Index sets and universal numberings
- The paradox of predictability
- Rice-like theorems for automata networks
- A Rice's theorem for abstract semantics
- A characterization of positive entropy of Markov tree-shifts
- The geometry of computable Banach spaces
- Some lattice-invariant properties of classes of recursively enumerable sets
- Edge-label controlled graph grammars
- Computability and the morphological complexity of some dynamics on continuous domains
This page was built for publication: Classes of Recursively Enumerable Sets and Their Decision Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5823276)
