Pages that link to "Item:Q5845381"

The following pages link to Formal Reductions of the General Combinatorial Decision Problem (Q5845381):

Displaying 50 items.

• Formal systems of constructive mathematics (Q3237138) (← links)
• Logical reflection and formalism (Q3257117) (← links)
• Extended Canonical Systems (Q3282932) (← links)
• Why Post Did [Not] Have Turing’s Thesis (Q3305321) (← 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)
• Conceptual Confluence in 1936: Post and Turing (Q4637215) (← links)
• Why Turing’s Thesis Is Not a Thesis (Q4637226) (← links)
• Recursive Unsolvability of a problem of Thue (Q4919632) (← links)
• Maurice Margenstern’s Contributions to the Field of Small Universal Turing Machines (Q4982992) (← links)
• (Q5061519) (← links)
• Fine-Grained Reductions from Approximate Counting to Decision (Q5065630) (← links)
• Average-Case Completeness in Tag Systems (Q5090467) (← links)
• (Q5092482) (← links)
• Queue Automata: Foundations and Developments (Q5112182) (← links)
• Variants of Networks of Evolutionary Processors with Polarizations and a Small Number of Processors (Q5205040) (← links)
• The Developments of the Concept of Machine Computability from 1936 to the 1960s (Q5250213) (← links)
• Regular canonical systems (Q5338328) (← links)
• On Post's canonical systems (Q5344160) (← links)
• UNDECIDABILITY OF CONSEQUENCE RELATION IN FULL NON-ASSOCIATIVE LAMBEK CALCULUS (Q5501771) (← 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)
• The equivalence of some general combinatorial decision problems (Q5556434) (← links)
• A Note on Pushdown Store Automata and Regular Systems (Q5573974) (← links)
• Canonical systems which produce periodic sets (Q5582344) (← links)
• On some metamathematical results as properties of general systems (Q5595151) (← links)
• The Solvability of the Derivability Problem for One-Normal Systems (Q5608015) (← links)
• The many-one equivalence of some general combinatorial decision problems (Q5619078) (← links)
• Decision problems for tag systems (Q5663844) (← links)
• Computability and Recursion (Q5689263) (← links)
• Non-deterministic structures of computation (Q5740658) (← links)
• A variant of a recursively unsolvable problem (Q5845383) (← links)