scientific article; zbMATH DE number 3872639

MaRDI QIDQ3339244zbMATH OpenFDO

Authors L. A. Sholomov

Publication date 1980

zbMATH Keywords

algorithm modelsautomata with memorycomplexitydiscrete devicesdiscrete informationerror correcting codeslogical functionsreliabilityswitching circuitsuncertaintyuniversal Turing machineunsolvability

Mathematics Subject Classification ID

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

Cited in

(6)

• Discrete analysis of expert information. Research trends
• scientific article; zbMATH DE number 4022632 (Why is no real title available?)
• scientific article; zbMATH DE number 45686 (Why is no real title available?)
• Evaluation of Boolean functions on noisy input
• SOLENOIDAL MAPS, AUTOMATIC SEQUENCES, VAN DER PUT SERIES, AND MEALY AUTOMATA
• Comparative complexity of quantum and classical OBDDs for total and partial functions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3339244)