The following pages link to (Q5829025):
Displaying 27 items.
- Notes on computable analysis (Q519888) (← links)
- On the eliminability of ideal linguistic entities (Q916641) (← links)
- Unsolvability of the universal theory of finite groups (Q1054715) (← links)
- A universal machine without change of state (Q1100903) (← links)
- Distributive lattices of subspaces and the equality problem for algebras with a single relation (Q1244344) (← links)
- Constructivization of the concepts of \(\varepsilon\) entropy and \(\varepsilon\) capacity (Q1256465) (← links)
- Computing congruent closures on terms (Q1280915) (← links)
- Markov's constructive analysis; a participant's view (Q1292407) (← links)
- On fixed-point theorems in synthetic computability (Q1683373) (← links)
- Intuitionism and effective descriptive set theory (Q1688967) (← links)
- On the information carried by programs about the objects they compute (Q1693999) (← links)
- A Banach-Mazur computable but not Markov computable function on the computable real numbers (Q1765159) (← links)
- Decidability of elementary theories of certain finitely defined algebras (Q1803020) (← links)
- Nonalgorithmic discrete procedures (Q1816100) (← links)
- Finitely presented semigroups with nontrivial identities (Q1836748) (← links)
- The effects of effects on constructivism (Q2133168) (← links)
- On systems of word equations over three unknowns with at most six occurrences of one of the unknowns (Q2271428) (← links)
- A survey of predicate realizability logic (Q2510768) (← links)
- Primitive constructive functions (Q2531036) (← links)
- Beziehungen zwischen gewissen Klassen effektiv topologischer Räume (Q2537310) (← links)
- PANON-1B: A programming language for symbol manipulation (Q2547486) (← links)
- A conditional functional three-handling generalized Markov algorithm which interprets a nondeterministic abstract machine (Q2554239) (← links)
- On the algorithmic undecidability of A-completeness for the boundedly determinate functions (Q2562181) (← links)
- The non-parametrizability of the word equation \(xyz=zvx\): a short proof (Q2575750) (← links)
- (Q5518362) (← links)
- Overlapping algorithms (Q5588646) (← links)
- The Failure in Computable Analysis of a Classical Existence Theorem for Differential Equations (Q5623667) (← links)
