scientific article

From MaRDI portal
Publication:3863873

zbMath0427.03037MaRDI QIDQ3863873

Yuri L. Ershov

Publication date: 1977


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (27)

Recursive unary algebras and treesRice’s Theorem in Effectively Enumerable Topological SpacesOn Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theoryOn recursively enumerable structuresUnnamed ItemRepresentability of locally compact regular spaces by domains and formal spacesComputable elements and functions in effectively enumerable topological spacesSome results related to the continuity problemInductive inference and computable numberingsA category-theoretic characterization of functional completenessNonflatness and totalityComputability and the morphological complexity of some dynamics on continuous domainsMathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting)A learning-theoretic characterization of classes of recursive functionsFine hierarchies and m-reducibilities in theoretical computer scienceOn p-reducibility of numerationsTowards Computability over Effectively Enumerable Topological SpacesTotal sets and objects in domain theorySome effectively infinite classes of enumerationsComputability in higher types, P\(\omega\) and the completeness of type assignmentComputable one-to-one enumerations of effective domainsUnnamed ItemUnnamed ItemEquilogical spacesDomain representations of topological spacesEnumerations in computable structure theory\({\mathcal M}^\omega\) considered as a programming language







This page was built for publication: