The following pages link to (Q3247126):
Displaying 50 items.
- Undecidability through Fourier series (Q278759) (← links)
- Metamathematical investigations on the theory of grossone (Q299407) (← links)
- A survey of state vectors (Q458456) (← links)
- Recursive analysis of singular ordinary differential equations (Q638473) (← links)
- Some undecidable termination problems for semi-Thue systems (Q673625) (← links)
- On weakly confluent monadic string-rewriting systems (Q685433) (← links)
- A formalization of multi-tape Turing machines (Q744986) (← links)
- Stability and computability in coherent domains (Q752707) (← links)
- Recursively unsolvable word problems of modular lattices and diagram- chasing (Q759047) (← links)
- Computing degrees of unsolvability (Q770790) (← links)
- Recursive digraphs, splinters and cylinders (Q771093) (← links)
- A normal form for arithmetical representation of \({\mathcal N}{\mathcal P}\)-sets (Q790804) (← links)
- Finite complete rewriting systems and the complexity of word problem (Q791314) (← links)
- Links between physics and set theory. (Q815623) (← links)
- Abstract abstract reduction (Q817587) (← links)
- Counterfactual logic and the necessity of mathematics (Q830377) (← links)
- Derived subdivisions make every PL sphere polytopal (Q891090) (← links)
- Computation, hypercomputation, and physical science (Q959046) (← links)
- Simple section interchange and properties of non-computable functions (Q988200) (← links)
- Admissible representations of effective cpo's (Q1068562) (← links)
- Pseudo-natural algorithms for the word problem for finitely presented monoids and groups (Q1074716) (← links)
- n-level rewriting systems (Q1084855) (← links)
- Complexity of certain decision problems about congruential languages (Q1085618) (← links)
- The problems of cyclic equality and conjugacy for finite complete rewriting systems (Q1089798) (← links)
- Embeddings of and into Nerode semirings (Q1100198) (← links)
- The problem of space invariance for sequential machines (Q1102112) (← links)
- Castor quadruplorum (Q1103615) (← links)
- Free word problems for additive relation algebras of modules (Q1104352) (← links)
- On randomness, determinism and computability (Q1120202) (← links)
- The first example of a recursive function which is not primitive recursive (Q1135847) (← links)
- A numerical analysis of two point boundary value problem algorithms (Q1157116) (← links)
- On the computational power of automata with time or space bounded by Ackermann's or superexponential functions (Q1159662) (← links)
- An arithmetical characterization of NP (Q1171050) (← links)
- Some undecidable determined games (Q1171511) (← links)
- Quantum mechanical Hamiltonian models of discrete processes that erase their own histories: Application to Turing machines (Q1171882) (← links)
- On sets polynomially enumerable by iteration (Q1176233) (← links)
- Myhill's work in recursion theory (Q1192344) (← links)
- Some properties of finite special string-rewriting systems (Q1201349) (← links)
- The pre-NTS property is undecidable for context-free grammars (Q1208437) (← links)
- Translations and structure for partial propositional calculi (Q1211980) (← links)
- A geometric hierarchy of languages (Q1212799) (← links)
- Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems (Q1220388) (← links)
- Complexity classes of partial recursive functions (Q1221487) (← links)
- Remarks on the complexity of nondeterministic counter languages (Q1228202) (← links)
- Fuzzy and probabilistic programs (Q1229093) (← links)
- Nonexistence of program optimizers in several abstract settings (Q1231391) (← links)
- Conditional Grammars (Q1241987) (← links)
- Embedding and unsolvability theorems for modular lattices (Q1245859) (← links)
- Polynomial indexing of integer lattice-points. I. General conceopts and quadratic polynomials (Q1252374) (← links)
- Communication, computability, and common interest games (Q1294100) (← links)
