Pages that link to "Item:Q5823276"
From MaRDI portal
The following pages link to Classes of Recursively Enumerable Sets and Their Decision Problems (Q5823276):
Displaying 50 items.
- Descriptional complexity of two-way pushdown automata with restricted head reversals (Q443747) (← links)
- Non-overlapping inversion on strings and languages (Q500959) (← links)
- The semilattice of computable families of recursively enumerable sets (Q684511) (← links)
- Spaces with combinators (Q688513) (← links)
- Recursiveness and preference orderings (Q690175) (← links)
- Lower bounds and the hardness of counting properties (Q703531) (← links)
- Index sets and universal numberings (Q716308) (← links)
- Some lattice-invariant properties of classes of recursively enumerable sets (Q752705) (← links)
- Edge-label controlled graph grammars (Q909484) (← links)
- Computability and the morphological complexity of some dynamics on continuous domains (Q930875) (← links)
- A Rice-style theorem for parallel automata (Q1004287) (← links)
- The three-color and two-color Tantrix\(^{\text{TM}}\) rotation puzzle problems are NP-complete via parsimonious reductions (Q1041029) (← links)
- The basic theory of partial \(\alpha\)-recursive operators (Q1078175) (← links)
- An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines (Q1094140) (← links)
- Recursion theorems and effective domains (Q1102949) (← links)
- Index sets related to prompt simplicity (Q1115863) (← links)
- Indexings of subrecursive classes (Q1140080) (← links)
- Decision-procedures for invariant properties of short algorithms (Q1168315) (← links)
- Aggregating inductive expertise on partial recursive functions (Q1187022) (← links)
- Index sets in 0' (Q1212448) (← links)
- Complexity classes of partial recursive functions (Q1221487) (← links)
- Recognition of invariant properties of algorithms (Q1245949) (← links)
- Some decision problems for polynomial mappings (Q1248614) (← links)
- A second step towards complexity-theoretic analogs of Rice's Theorem (Q1575716) (← links)
- Code obfuscation against abstraction refinement attacks (Q1624593) (← links)
- On the information carried by programs about the objects they compute (Q1693999) (← links)
- A complete uniform substitution calculus for differential dynamic logic (Q1707599) (← links)
- A well-structured framework for analysing Petri net extensions (Q1763373) (← links)
- Analogues of Rice's theorem for semantic classes of propositions (Q1803023) (← links)
- On an optimal propositional proof system and the structure of easy subsets of TAUT. (Q1853507) (← links)
- The complexity of universal text-learners. (Q1854315) (← links)
- What one has to know when attacking \(\mathsf{P}\) vs.\(\mathsf{NP}\) (Q2009642) (← links)
- Intensional Kleene and Rice theorems for abstract program semantics (Q2105439) (← links)
- Subrecursive equivalence relations and (non-)closure under lattice operations (Q2117798) (← links)
- Parametric Church's thesis: synthetic computability without choice (Q2151397) (← links)
- Efficient equivalence-checking algorithms for procedural programs in progressive semigroup gateway models (Q2191014) (← links)
- Parameterized synthesis for fragments of first-order logic over data words (Q2200816) (← links)
- Things that can be made into themselves (Q2252527) (← links)
- Introducing complexity to formal testing (Q2291824) (← links)
- More really is different (Q2389362) (← links)
- Weakening additivity in adjoining closures (Q2520722) (← links)
- Referenced automata and metaregular families (Q2535534) (← links)
- Fixed-parameter decidability: Extending parameterized complexity analysis (Q2958220) (← links)
- Improving Strategies via SMT Solving (Q3000582) (← links)
- Rice’s Theorem for μ-Limit Sets of Cellular Automata (Q3012911) (← links)
- Introduction to Model Checking (Q3176359) (← links)
- Asymptotic density, immunity and randomness (Q3195648) (← links)
- Degrees of Computability (Q3232282) (← links)
- Some Theorems on Classes of Recursively Enumerable Sets (Q3255349) (← links)
- Connecting Program Synthesis and Reachability: Automatic Program Repair Using Test-Input Generation (Q3303900) (← links)
