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.
- 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)
- Deleting string rewriting systems preserve regularity (Q703575) (← links)
- The immortality problem for Lag systems (Q918728) (← links)
- The complexity of small universal Turing machines: A survey (Q1004087) (← 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)
- Decision problems for semi-Thue systems with a few rules (Q1763707) (← links)
- Context free normal systems and ETOL systems (Q1837541) (← links)
- Tag systems and lag systems (Q2395198) (← links)
- Tag systems and Collatz-like functions (Q2474075) (← links)
- Computing by commuting. (Q2490820) (← links)
- Many-one degrees associated with problems of tag (Q3214909) (← links)
- Formal systems of constructive mathematics (Q3237138) (← links)
- Logical reflection and formalism (Q3257117) (← links)
- Extended Canonical Systems (Q3282932) (← links)
- KNOWLEDGE REPRESENTATION: A SURVEY OF ITS MECHANISMS, A SKETCH OF ITS SEMANTICS (Q3345812) (← links)
- Closing the Circle: An Analysis of Emil Post's Early Work (Q3430940) (← links)
- Comparison of basic language generating devices (non-deterministic systems) (Q3484359) (← links)
- PROBLEMS WITH COMPLEXITY IN GOLD'S PARADIGM OF INDUCTION Part I: Dynamic Complexity (Q3495668) (← links)
- An Infinite Automaton Characterization of Double Exponential Time (Q3540169) (← links)
- A Natural Axiomatization of Computability and Proof of Church's Thesis (Q3616433) (← links)
- Composition of relational productions for plans and programs (Q3853103) (← links)
- Halteprobleme von Fang-Systemen (tag systems) (Q3875919) (← links)
- (Q3890137) (← links)
- Pure grammars and pure languages† (Q3902533) (← links)
- The theory of recursive functions, approaching its centennial (Q3946156) (← links)
- Herbrand semantics, the potential infinite, and ontology-free logic (Q3990954) (← links)
- A bound on the length of a random derivation-search tree in general multi-premise calculi (Q4007369) (← links)
- Some post canonical systems in one letter (Q4060951) (← links)
- (Q4094351) (← links)
- Combinatorial systems defined over one- and two-letter alphabets (Q4103085) (← links)
- The work of Kurt Gödel (Q4140948) (← links)
- Programs, Grammars and Arguments: A Personal View of some Connections between Computation, Language and Logic (Q4372922) (← links)
- Regular canonical systems (Q5338328) (← links)
- On Post's canonical systems (Q5344160) (← links)
- An Artificial Chemistry for Networking (Q5503774) (← links)
- Monogenic normal systems are universal (Q5509687) (← links)
- Zur Stufenreduktion von Kalkülen (Q5541307) (← links)
- The post correspondence problem (Q5556433) (← links)