Titlebook: Algorithms: Main Ideas and Applications; Vladimir Uspensky,Alexei Semenov Book 1993 Springer Science+Business Media B.V. 1993 Notation.alg

搖尾乞憐

書目名稱Algorithms: Main Ideas and Applications影響因子(影響力)




書目名稱Algorithms: Main Ideas and Applications影響因子(影響力)學(xué)科排名




書目名稱Algorithms: Main Ideas and Applications網(wǎng)絡(luò)公開度




書目名稱Algorithms: Main Ideas and Applications網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Algorithms: Main Ideas and Applications被引頻次




書目名稱Algorithms: Main Ideas and Applications被引頻次學(xué)科排名




書目名稱Algorithms: Main Ideas and Applications年度引用




書目名稱Algorithms: Main Ideas and Applications年度引用學(xué)科排名




書目名稱Algorithms: Main Ideas and Applications讀者反饋




書目名稱Algorithms: Main Ideas and Applications讀者反饋學(xué)科排名

啤酒

The general notion of an algorithm as an independent (separate) conceptemphasize that this discovery should not be confused with the discovery of representative computational models (constructed by Turing, Post, Markov, Kolmogorov); they will be discussed in chap. 1.2. Sometimes it is wrongly believed that the concept of an algorithm cannot be well understood without c

instate

The general notion of a calculus as an independent (separate) conceptinitions. The notion of a calculus reflects and generalizes an intuitive idea of inductive generation of a set (see [Mas 67], [Eb 70], [Mas 79]). Mathematical roots of the concept of a calculus go back to antiquity (see [Janovs 62]). Games with strict rules — such as chess, dominoes, majong — are pr

Epithelium

Representative generating modelsany given calculus. (To be more exact we should speak not about representative but about .-representative models. Assume that . is an aggregate; a generating model is called . if for any calculus generating a subset of . there exists a calculus of this model generating the same subset.) The notion o

Germinate

Interrelations between algorithms and calculuseshe set of all pairs 〈., .〉 such that .(.) = .. On the other hand, (3) for any calculus there is an algorithm whose domain is a set generated by this calculus; and (4) any calculus generating a set of pairs 〈., .〉 being the graph of a function can be transformed into an algorithm computing this funct

interlude

ethnology

點(diǎn)燃

向下五度才偏

affinity

The concept of a computable operationive object from another, a computable operation effectively produces one set of constructive objects from another; informally, effectiveness here means that the operation makes it possible to generate the resulting set provided a process of generation of the argument is given. Because of the above s