Longpré, Luc; Kreinovich, Vladik Can quantum computers be useful when there are not yet enough qubits? (English) Zbl 1169.81316 Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 79, 164-169 (2003). MSC: 81P68 68Q05 PDFBibTeX XMLCite \textit{L. Longpré} and \textit{V. Kreinovich}, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 79, 164--169 (2003; Zbl 1169.81316)
Kreinovich, Vladik; Longpré, Luc; Ferson, Scott; Ginzburg, Lev Why is selecting the simplest hypothesis (consistent with data) a good idea? A simple explanation. (English) Zbl 1024.68594 Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 77, 191-194 (2002). MSC: 68T20 68T27 PDFBibTeX XMLCite \textit{V. Kreinovich} et al., Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 77, 191--194 (2002; Zbl 1024.68594)
Koshelev, Misha; Kreinovich, Vladik; Longpré, Luc Encryption algorithms made (somewhat) more natural (a pedagogical remark). (English) Zbl 0931.68040 Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 67, 153-156 (1999). MSC: 68P25 94A60 PDFBibTeX XMLCite \textit{M. Koshelev} et al., Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 67, 153--156 (1999; Zbl 0931.68040)
Gates, Ann Q.; Kreinovich, Vladik; Longpré, Luc Kolmogorov complexity justifies software engineering heuristics. (English) Zbl 0911.68086 Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 66, 150-154 (1998). MSC: 68Q30 68N99 PDFBibTeX XMLCite \textit{A. Q. Gates} et al., Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 66, 150--154 (1998; Zbl 0911.68086)