Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/a-guided-tour-of-artificial-intelligence-research-theoretical-computer-952FzuLQ78
- Publisher
- Springer International Publishing
- Copyright
- © Springer Nature Switzerland AG 2020
- ISBN
- 978-3-030-06169-2
- Pages
- 51 –89
- DOI
- 10.1007/978-3-030-06170-8_2
- Publisher site
- See Chapter on Publisher Site
Abstract
[How much time, space and/or hardware resource does require an algorithm? Such questions lead to surprising results: conceptual simplicity does not always go along with efficiency. A lot of quite natural questions remain open, e.g., the famous P\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$=$$\end{document}NP problem raised in 1970. The so elementary model of finite automata, adequately tailored to diverse data structures, proves to be a flexible and powerful tool in the subject whereas quantum computing opens astonishing perspectives. An elegant tool for proofs of lower bounds for time/space complexity is a totally different notion of complexity: Kolmogorov complexity which measures the information contents.]
Published: May 8, 2020