scientific article

zbMath0547.68004MaRDI QIDQ3339244

L. A. Sholomov

Publication date: 1980

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

zbMATH Keywords

complexityuncertaintyreliabilityerror correcting codesuniversal Turing machinelogical functionsunsolvabilitydiscrete devicesswitching circuitsdiscrete informationautomata with memoryalgorithm models

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Algorithms in computer science (68W99) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (4)

Discrete analysis of expert information. Research trends ⋮ Comparative complexity of quantum and classical OBDDs for total and partial functions ⋮ Evaluation of Boolean functions on noisy input ⋮ SOLENOIDAL MAPS, AUTOMATIC SEQUENCES, VAN DER PUT SERIES, AND MEALY AUTOMATA

This page was built for publication: