The goal of this project is to carry out behavioral experiments and develop computational models to identify and characterize perception, cognition, and action in the wild. Yet, although past research in the behavioral sciences has revealed many properties of these constituent faculties, the understanding of how humans coordinate these cognitive abilities when carrying out every-day tasks is still rudimentary. Such an every-day situation requires a sequence of behaviors involving the sophisticated interplay of perception, attention, cognition, planning, and action, all unfolding in an ambiguous and uncertain world. (Iz.Imagine navigating through your kitchen, walking around your table and chairs, reaching the counter, sliding a cup on the countertop, pouring yourself some coffee, and preparing a sandwich. With a small number of generators”, Russian Math.
M. Rybakov, “Computational complexity of the word problem in modal and pseudo-Boolean algebras Peikert C., Springer International Publishing Ag, 2021, 11–40 Pass R., “On the Possibility of Basing Cryptography on Exp Not Equal Bpp”, Advances in Cryptology (Crypto 2021), Pt i, Lecture Notes in Computer Science, 12825, ed. Malkin T. I. I. Batyrshin, “Asymptotic density and computability”, Russian Math. Vladimir V. Rybakov, “Satisfiability in Boolean logic (SAT problem) is polynomial”, Zhurn. Seriya: Prikladnaya matematika, 2021, no. 3, 5–17 M. N. Rybakov, “Slozhnost problemy ravenstva slov v mnogoobraziyakh modalnykh algebr”, Vestnik TvGU. Ī. A. Semenov, K. V. Antonov, I. A. Gribanova, “Porozhdenie dopolnitelnykh ogranichenii v zadachakh algebraicheskogo kriptoanaliza pri pomoschi SAT-orakulov”, PDM.G. V. Safonov, G. V. Bokov, V. B. Kudryavtsev, “On irreduceability of Boolean functions with respect to commutative associative operation”, Moscow University Mathematics Bulletin, 75:4 (2020), 169–171 G. V. Bokov, “O grafovom rasshirenii metoda rezolyutsii dlya bulevykh formul”, Intellektualnye sistemy.
ĭ. E. Gorbatenko, A. A. Semenov, “Protivodeistvie sgovoru v diskretnykh dinamicheskikh modelyakh kompyuternykh setei”, UBS, 75 (2018), 76–102.Ī. V. Sozykin, “Obzor metodov obucheniya glubokikh neironnykh setei”, Vestn.V. N. Zakharov, V. A. Kozmidiadi, “On relationships between complexity classes of Turing machines”, Comput. S. I. Nikolenko, D. S. Tugaryov, “A complete one-way function based on a free finite rank $\mathbb Z\times\mathbb Z$-module”, J. Ī. A. Kozhevnikov, S. I. Nikolenko, “On complete one-way functions”, Problems Inform.Ī. D. Korshunov, “Some unsolved problems in discrete mathematics and mathematical cybernetics”, Russian Math.Į. A. Hirsch, D. Yu. Grigor'ev, K. V. Pervyshev, “Time hierarchies for cryptographic function inversion with advice”, J.L. A. Levin, “One-Way Functions”, Problems Inform. Ī. O. Slisenko, “Complexity problems in computational theory”, Russian Math.M. Kh. Aizenshtein, “On the existence of optimal algorithms for combinatorial problems and languages”, Russian Math.
This publication is cited in the following articles:
0 kommentar(er)
