Abstract
Modern science has not made the world less mysterious, and future discoveries may be even more surprising than the conclusions of relativity or quantum mechanics, confirming the thesis of A. Clarke that “advanced technology is indistinguishable from magic”. In other words, with a certain level of technology development, an adequate understanding of them may require intellectual resources that exceed the capabilities of a single human, primarily for handling large amounts of information. What is it, how are cognitive processes defined and physically implemented in nature, how effectively can their technical simulation be implemented, and, finally, whether it is possible to build not just a supercomputer, but a superbrain for solving super tasks. These issues are currently at the forefront of current research in both natural and human sciences, as well as computer technology. In this chapter, the problem is considered in the aspect of finding solutions of “bounded rationality” that is, based on the regularization of solutions obtained using computable functions that are defined on a set of data taking into account certain specific or even personal cognitive biases.
Let’s not argue—let’s do the math.
J. L. Lagrange
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Todd Oppenheimer.: The Flickering Mind: Saving Education from the False Promise of Technology, p. 528. Random House Publishing Group (2007)
Kalyaev, I., Antonov, A., Zaborovske, V.: The architecture of Reconfigurable Heterogeneous Distributed Supercomputer System for Solving Problems of Intelligent Data Processing in the Era of Digital Transformation of the Economy, pp. 2–11. Voprosy kiberbezopasnosti. 2–11. https://doi.org/10.21681/2311-3456-2019-5-02-11
Antonov, A., Zaborovskij, V., Kisilev, I.: Specialized reconfigurable computers in network-centric supercomputer systems. High Availab. Syst. 14(3), 57–62 (2018). https://doi.org/10.18127/j20729472-201803-09
Usman Ashraf, M., Alburaei Eassa, F., Ahmad Albeshri, A., Algarni, A.: Performance and power efficient massive parallel computational model for HPC heterogeneous exascale systems. IEEE Access 6, 23095–23107 (2018). https://doi.org/10.1109/ACCESS.2018.2823299
Intel FPGA. [Online]. Available: https://www.intel.com/content/www/us/en/products/programmable.html. Last Accessed 19 April 2020
Dongarra, J., Gottlieb, S., Kramer, W.: Race to exascale. Comput. Sci. Eng. 21(1), 4–5 (2019). https://doi.org/10.1109/MCSE.2018.2882574
Supercomputer Center ‘Polytechnic’. [Online]. Available: https://www.top500.org/system/178469. Last Accessed 19 April 2020
NVIDIA Tesla V100. [Online]. Available: https://www.nvidia.com/en-us/data-center/tesla-v100/. Last Accessed 19 April 2020
Xilinx FPGA. [Online]. Available: https://www.xilinx.com/. Last Accessed 01 Feb 2020
IDE Vivado HLS, https://www.xilinx.com/video/hardware/vivado-hls-tool-overview.html. Last Accessed 19 April 2020
UltraScale and UltraScale+ FPGA Product Table, https://www.xilinx.com/products/silicon-devices/fpga/virtex-ultrascale.html#productTable. Last Accessed 19 April 2020 (2019)
Sorting Methods, https://www.mathworks.com/matlabcentral/fileexchange/45125-sorting-methods?focused=3805900&tab=function. Last Accessed 19 April 2020
Vitis_Libraries, https://github.com/Xilinx/Vitis_Libraries. Last Accessed 19 April 2020
Antonov, A., Besedin, D., Filippov A.: Research of the efficiency of high-level synthesis tool for FPGA based hardware implementation of some basic algorithms for the big data analysis and management tasks. In Proceedings of the FRUCT’26, pp. 23–29 (2020)
Merge sort, https://rosettacode.org/wiki/Sorting_algorithms/Merge_sort. Last Accessed 19 April 2020
Acknowledgements
The authors are grateful to the Supercomputer Center ‘Polytechnic’ for the help in gaining access to the resources of the supercomputer. The reported study was funded by RFBR according to the research project №18-2903250 MK “Robust methods of synthesis of intelligent transport systems of cyber-physical objects coalition based on the Bayesian concept of probability and the modal logic”.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Zaborovskij, V., Polyanskiy, V., Popov, S. (2021). On the Problem of Computability of Bounded Rationality Cognitive Solutions. In: Kravets, A.G., Bolshakov, A.A., Shcherbakov, M. (eds) Society 5.0: Cyberspace for Advanced Human-Centered Society. Studies in Systems, Decision and Control, vol 333. Springer, Cham. https://doi.org/10.1007/978-3-030-63563-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-030-63563-3_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-63562-6
Online ISBN: 978-3-030-63563-3
eBook Packages: EngineeringEngineering (R0)