对RPE算法进行了改进和补充,使之适用于简单递归网,用来对网络的权值和阈值进行调整。
This RPE algorithm was adapted to the simple recurrent network by making improvement and complementarity, and the weight and the threshold of the network can be adjusted at the same time.
通过简单的递归语句,可以轻松地推动处理符号和数据列表。
Through simple recursive statements, you can power process lists of symbols and data easily.
很多植物在生成分枝形状和叶片图案时遵循简单的递归法则。
Many plants follow simple recursive formulas in generating their branching shapes and leaf patterns.
What's the point of this? Again, now that I can think about things recursively, I can similarly break things down into simpler versions of the same problem. It could be one version.
这些的意思是什么呢?再一次我想说,我既然能够以递归的方式思考了,那么我就可以简单地把问题,转化为更简单的同类问题。
But I want to stress again, as long as I do the base case right and my inductive or recursive step reduces it to a smaller version of the same problem, the code will in fact converge and give me out an answer.
就开心的去做吧,但是我想再次强调,只要基础事件处理正确而我的递归,或递推步骤能把它简化为更简单的同类问题,那么这段代码就可以收敛。
And the idea behind recursion I'm going to describe with a simple example. And then I'm going to show you how we can actually use it.
但是为了解释递归的意义,我想举个简单的例子,我将会给你们展示我们该如何使用它。
应用推荐