随着课程的推进,我们进入了特殊线性表——栈与队列的学习。而栈有一个重要应用是在程序设计语言中实现递归。递归是算法设计中常用的手段,它通常可把一个大型复杂问题的描述和求解变得简洁和清晰。因此递归算法常常比非递归算法更易设计,尤其是当问题本身或所涉及的数据结构是递归定义的时候,使用递归方法更加合适。除此之外,递归在人工智能方面也有着广泛的应用,如深度学习领域的递归神经网络、人工智能分支之一人工生命。人工智能的本质其实就是算法智能。总之,递归算法在很多领域都有显著体现和重要应用。
With the advancement of the course, we entered into the study of special linear tables - stacks and queues. One important application of stack is to realize recursion in programming language. Recursion is a common method in algorithm design, which can make the description and solution of a large complex problem concise and clear. Therefore, recursive algorithms are often easier to design than non recursive algorithms, especially when the problem itself or the data structure involved is recursively defined. In addition, recursion is also widely used in artificial intelligence, such as recurrent neural networks in the field of deep learning, fractal geometry of large objects, chaos and artificial life, which are branches of artificial intelligence. The essence of AI is actually algorithmic intelligence. In a word, recursive algorithm has significant embodiment and important application in many fields.
Keywords: recursion, data structure, artificial intelligence, algorithm, deep learning
目录