Pages that link to "Item:Q5845381"
From MaRDI portal
The following pages link to Formal Reductions of the General Combinatorial Decision Problem (Q5845381):
Displayed 50 items.
- Generating and accepting P systems with minimal left and right insertion and deletion (Q256963) (← links)
- The categorical and the hypothetical: a critique of some fundamental assumptions of standard semantics (Q383070) (← links)
- On the mathematical foundations of \textit{Syntactic structures} (Q438597) (← links)
- A personal account of Turing's imprint on the development of computer science (Q465701) (← links)
- On the computational power of networks of polarized evolutionary processors (Q515676) (← links)
- Functions with local state: regularity and undecidability (Q557802) (← links)
- A representation theorem of infinite dimensional algebras and applications to language theory (Q579947) (← links)
- Mutation calculi (Q599718) (← links)
- On the complex behavior of simple tag systems -- an experimental approach (Q616497) (← links)
- Tree search and quantum computation (Q638594) (← links)
- Deleting string rewriting systems preserve regularity (Q703575) (← links)
- Proof search algorithm in pure logical framework (Q779163) (← links)
- Parsimonious computational completeness (Q832917) (← links)
- The immortality problem for Lag systems (Q918728) (← links)
- Small universal accepting hybrid networks of evolutionary processors (Q968278) (← links)
- The complexity of small universal Turing machines: A survey (Q1004087) (← links)
- Turing oracle machines, online computing, and three displacements in computability theory (Q1032637) (← links)
- Minimality in template-guided recombination (Q1041038) (← links)
- Novikov's centrally symmetric group (Q1080951) (← links)
- A universal machine without change of state (Q1100903) (← links)
- Unsolvable algorithmic problems for semigroups, groups and rings (Q1117039) (← links)
- Herbrand strategies and the ''greater deducibility'' relation (Q1147113) (← links)
- Calculi with monotone deductions and their economic interpretation (Q1168323) (← links)
- Deduction search in calculi of general type (Q1245945) (← links)
- Probabilistic canonical calculi (Q1245947) (← links)
- Macroevolution as deduction process (Q1254019) (← links)
- Cut-type rules for calculi of general type (Q1256457) (← links)
- On the universality of Post and splicing systems (Q1575914) (← links)
- Computationalism (Q1583773) (← links)
- The never-ending recursion (Q1688713) (← links)
- Decision problems for semi-Thue systems with a few rules (Q1763707) (← links)
- Context free normal systems and ETOL systems (Q1837541) (← links)
- Computational power of two stacks with restricted communication (Q1959441) (← links)
- Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors (Q2003446) (← links)
- An automated approach to the Collatz conjecture (Q2055879) (← links)
- Undecidability of the problem of recognizing axiomatizations of superintuitionistic propositional calculi (Q2259003) (← links)
- Mathematics as information compression via the matching and unification of patterns (Q2281995) (← links)
- Polarization: a new communication protocol in networks of bio-inspired processors (Q2299886) (← links)
- Undecidable iterative propositional calculus (Q2364331) (← links)
- Tag systems and lag systems (Q2395198) (← links)
- Tag systems and Collatz-like functions (Q2474075) (← links)
- Computing by commuting. (Q2490820) (← links)
- The Complexity of Small Universal Turing Machines: A Survey (Q2891384) (← links)
- PSEUDORECURSIVE VARIETIES OF SEMIGROUPS — II (Q2909488) (← links)
- Formalism and intuition in computability (Q2941588) (← links)
- From Turing machines to computer viruses (Q2941590) (← links)
- Small Universal Devices (Q2944894) (← links)
- Pāṇini's Grammar and Modern Computation (Q2963983) (← links)
- RULES FOR SUBATOMIC DERIVATION (Q3094185) (← links)
- Many-one degrees associated with problems of tag (Q3214909) (← links)