scientific article; zbMATH DE number 3611342

From MaRDI portal

Publication:4175267

Jump to:navigation, search

zbMath0394.03039MaRDI QIDQ4175267

E. A. Polyakov, M. G. Rozinas

Publication date: 1976

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

zbMATH Keywords

Algorithms Recursively Enumerable Sets Textbook Reducibility By Enumeration

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Computability and recursion theory (03D99) Algorithms in computer science (68W99)

Related Items (1)

e- and s-degrees

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4175267&oldid=17999513"