scientific article; zbMATH DE number 3532933

zbMath0342.02028MaRDI QIDQ4109660

Evgeniĭ Andreevich Palyutin

Publication date: 1975

Full work available at URL: https://eudml.org/doc/186883

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

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory (03D99)

Related Items (6)

PERMUTATIONS OF THE INTEGERS INDUCE ONLY THE TRIVIAL AUTOMORPHISM OF THE TURING DEGREES ⋮ Structure of the upper semilattice of recursively enumerable m-degrees and related questions. I ⋮ The enumeration degrees: Local and global structural interactions ⋮ Computably enumerable sets and related issues ⋮ Empty intervals in the enumeration degrees ⋮ The upper semilattice of numerations

This page was built for publication: