| 词条 | Convergence (logic) |
| 释义 |
In mathematics, computer science and logic, convergence is the idea that different sequences of transformations come to a conclusion in a finite amount of time (the transformations are terminating), and that the conclusion reached is independent of the path taken to get to it (they are confluent). More formally, a preordered set of term rewriting transformations are said to be convergent if they are confluent and terminating.[1] See also
References1. ^{{cite book|author1=Franz Baader|author2=Tobias Nipkow|title=Term Rewriting and All That|year=1998|publisher=Cambridge University Press|isbn=0-521-77920-0}} {{mathlogic-stub}}{{plt-stub}} 1 : Rewriting systems |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。