Pages that link to "Item:Q775202"
From MaRDI portal
The following pages link to Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines (Q775202):
Displayed 50 items.
- One-reversal counter machines and multihead automata: revisited (Q714812) (← links)
- Instruction sequence processing operators (Q715042) (← links)
- Undecidable properties of extensions of the logic of provability (Q757339) (← links)
- The word and order problems for self-similar and automata groups (Q784904) (← links)
- Nondecidable intermediate calculus (Q786806) (← links)
- On the solvability of a class of Diophantine equations and applications (Q818150) (← links)
- Iterated uniform finite-state transducers on unary languages (Q831808) (← links)
- Parsimonious computational completeness (Q832917) (← links)
- The complexity of finding SUBSEQ\((A)\) (Q839630) (← links)
- Reachability problems and abstract state spaces for time Petri nets with stopwatches (Q884758) (← links)
- Decision problems for pushdown threads (Q884992) (← links)
- The immortality problem for Lag systems (Q918728) (← links)
- The submonoid and rational subset membership problems for graph groups. (Q947493) (← links)
- Confusion of memory (Q963414) (← links)
- The complexity of small universal Turing machines: A survey (Q1004087) (← links)
- Existential arithmetization of Diophantine equations (Q1006616) (← links)
- Computation with finite stochastic chemical reaction networks (Q1035715) (← links)
- What is a universal computing machine? (Q1036530) (← links)
- Bad news on decision problems for patterns (Q1049406) (← links)
- Complexity and decidability for chain code picture languages (Q1058857) (← links)
- A characterization of reversal-bounded multipushdown machine languages (Q1058865) (← links)
- Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. I (Q1065930) (← links)
- Two-way automata with more than one storage medium (Q1083206) (← links)
- An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines (Q1094140) (← links)
- On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes (Q1094874) (← links)
- The complexity of reachability in distributed communicating processes (Q1098622) (← links)
- Pushdown automata with reversal-bounded counters (Q1112611) (← links)
- Unsolvable algorithmic problems for semigroups, groups and rings (Q1117039) (← links)
- Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. III (Q1118677) (← links)
- Problems concerning fairness and temporal logic for conflict-free Petri nets (Q1121023) (← links)
- Simple counter machines and number-theoretic problems (Q1136223) (← links)
- Indirect addressing and the time relationships of some models of sequential computation (Q1140427) (← links)
- Herbrand strategies and the ''greater deducibility'' relation (Q1147113) (← links)
- The reachability problem for Petri nets and decision problems for Skolem arithmetic (Q1148890) (← links)
- The complexity of decision problems for finite-turn multicounter machines (Q1151753) (← links)
- Two-way deterministic multi-weak-counter machines (Q1165028) (← links)
- Decision problems for propositional linear logic (Q1192352) (← links)
- Narrowing based procedures for equational disunification (Q1197097) (← links)
- Communication for alternating machines (Q1203600) (← links)
- On incomparable abstract family of languages (AFL) (Q1210909) (← links)
- Computation by assembly (Q1225457) (← links)
- Remarks on the complexity of nondeterministic counter languages (Q1228202) (← links)
- Finite automata with multiplication (Q1233317) (← links)
- Complexity of some problems in Petri nets (Q1238999) (← links)
- Das Entscheidungsproblem der Klasse von Formeln, die höchstens zwei Primformeln enthalten (Q1241510) (← links)
- Remarks on blind and partially blind one-way multicounter machines (Q1251070) (← links)
- Cut-type rules for calculi of general type (Q1256457) (← links)
- Typability and type checking in System F are equivalent and undecidable (Q1302292) (← links)
- \(\Pi_ 1^ 1\)-universality of some propositional logics of concurrent programs (Q1311976) (← links)
- Linear logic as a logic of computations (Q1326780) (← links)