標(biāo)題: Titlebook: Algorithms: Main Ideas and Applications; Vladimir Uspensky,Alexei Semenov Book 1993 Springer Science+Business Media B.V. 1993 Notation.alg [打印本頁] 作者: 搖尾乞憐 時間: 2025-3-21 19:17
書目名稱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é)科排名
作者: 啤酒 時間: 2025-3-22 00:18
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 時間: 2025-3-22 04:08
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 時間: 2025-3-22 06:13
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 時間: 2025-3-22 08:44
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 時間: 2025-3-22 16:31 作者: ethnology 時間: 2025-3-22 17:50 作者: 點燃 時間: 2025-3-22 21:46 作者: 向下五度才偏 時間: 2025-3-23 04:05 作者: affinity 時間: 2025-3-23 09:00
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作者: 暴發(fā)戶 時間: 2025-3-23 13:46
The concept of a program; programs as objects of computation and generationp. 1.2 and chap. 1.4) exist and can in their turn be considered as objects for algorithmic transformations or generation. This discovery was made by Turing in [Tu 36]. In this chapter we discuss the notions of a “programming system” (or a “method of programming”) and a “program” arising in this conn作者: Employee 時間: 2025-3-23 15:58 作者: 諷刺滑稽戲劇 時間: 2025-3-23 20:54
Klassische Astronomie. Das Planetensystem,f introducing new concepts and refining old ones. A.Maltsev wrote in this connection: “A system of concepts and a language are not something external for a mathematical theory but constitute an essential part of it” [Mal 66, p.72].作者: 符合規(guī)定 時間: 2025-3-23 22:37
Kosmologie: Der Kosmos als Ganzeserating model is called . if for any calculus generating a subset of . there exists a calculus of this model generating the same subset.) The notion of a generating model appears in the same way as the notion of a computational model.作者: 收藏品 時間: 2025-3-24 06:06 作者: 善于 時間: 2025-3-24 10:04 作者: 在駕駛 時間: 2025-3-24 12:55 作者: 不吉祥的女人 時間: 2025-3-24 17:40
https://doi.org/10.1007/978-3-662-00491-3a formal explication of the notion of algorithm (or, better to say, computable function) — therefore the notion of algorithm was considered as existing independently of (and before) these constructions.作者: Morose 時間: 2025-3-24 20:15 作者: EVEN 時間: 2025-3-24 23:11
https://doi.org/10.1007/978-3-662-06529-7obably the earliest examples of calculuses in a real world. Of course when we consider a game as a calculus we ignore completely its competitive nature and are interested only in its “juridical” aspects — in the possibility to make moves according to certain rules.作者: 雪崩 時間: 2025-3-25 04:36
Aufbau und Entwicklung der Sternelass of all computable functions from . into ., so Com(.) ? .(.). If we have an .-representative model for some aggregates . and ., then, of course, we can formally define Com(.) as the class of all functions from .(.) which can be computed by this model.作者: BILE 時間: 2025-3-25 10:25 作者: Leaven 時間: 2025-3-25 12:50 作者: 付出 時間: 2025-3-25 19:07 作者: Perigee 時間: 2025-3-25 19:59
,Risk-Benefit für den New Mobile-Commerce,tatement a computable operation transforms generable sets into generable sets. We can summarize these ideas in the following definition of a computable operation (see [Us 55] or [Rog 67, sect.9.7] where computable operations are called .).作者: Engaged 時間: 2025-3-26 02:51 作者: Priapism 時間: 2025-3-26 06:52
Computable functions and generable sets; decidable sets; enumerable setslass of all computable functions from . into ., so Com(.) ? .(.). If we have an .-representative model for some aggregates . and ., then, of course, we can formally define Com(.) as the class of all functions from .(.) which can be computed by this model.作者: 顯微鏡 時間: 2025-3-26 10:41 作者: 品嘗你的人 時間: 2025-3-26 16:19
Construction of an undecidable generable setems of constructing of decision algorithms) naturally arising in mathematical practice are decision problems for generable sets (of course in the theory of algorithms and calculuses as well as in mathematical logic there are also decision problems of a different, more complicated type).作者: Uncultured 時間: 2025-3-26 18:37 作者: Tartar 時間: 2025-3-26 23:48 作者: Neutral-Spine 時間: 2025-3-27 01:33
Book 1993ans "from Khorezm"). He lived between c. 783 and 850 B.C. and the year 1983 was chosen to celebrate his 1200th birthday. A short biography of al-Khwarizmi compiled in the tenth century starts as follows: "al-Khwarizmi. His name is Muhammad ibn Musa, he is from Khoresm" (cited according to [Bul Rozen Ah 83, p.8]).作者: 啪心兒跳動 時間: 2025-3-27 07:42 作者: CHOKE 時間: 2025-3-27 10:11 作者: Aerophagia 時間: 2025-3-27 16:00
The concept of a program; programs as objects of computation and generationp. 1.2 and chap. 1.4) exist and can in their turn be considered as objects for algorithmic transformations or generation. This discovery was made by Turing in [Tu 36]. In this chapter we discuss the notions of a “programming system” (or a “method of programming”) and a “program” arising in this connection.作者: 評論者 時間: 2025-3-27 20:21 作者: Gentry 時間: 2025-3-27 23:59
978-90-481-4256-9Springer Science+Business Media B.V. 1993作者: Reclaim 時間: 2025-3-28 02:54
Mathematics and Its Applicationshttp://image.papertrans.cn/a/image/153309.jpg作者: Fibroid 時間: 2025-3-28 09:21 作者: mercenary 時間: 2025-3-28 13:50 作者: Acclaim 時間: 2025-3-28 15:52 作者: Agronomy 時間: 2025-3-28 21:48
Kosmologie: Der Kosmos als Ganzesany 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作者: CHAR 時間: 2025-3-29 02:46 作者: 高興去去 時間: 2025-3-29 05:01 作者: 宮殿般 時間: 2025-3-29 08:13 作者: Limited 時間: 2025-3-29 12:39
Der Mond. Mond- und Sonnenfinsternisse between the notions of decidability and generability. Namely there is a calculus such that there is no algorithm to decide whether an arbitrary element of . can be generated by this calculus. On the other hand, from the practical point of view it is remarkable that all decision problems (i.e. probl作者: SSRIS 時間: 2025-3-29 16:27 作者: Goblet-Cells 時間: 2025-3-29 23:43 作者: 削減 時間: 2025-3-30 00:01
https://doi.org/10.1007/978-3-658-36665-0p. 1.2 and chap. 1.4) exist and can in their turn be considered as objects for algorithmic transformations or generation. This discovery was made by Turing in [Tu 36]. In this chapter we discuss the notions of a “programming system” (or a “method of programming”) and a “program” arising in this conn作者: 襲擊 時間: 2025-3-30 07:26
Aufbau und Dynamik des Milchstra?ensystemshe 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 function.作者: 比賽用背帶 時間: 2025-3-30 11:19 作者: dearth 時間: 2025-3-30 15:38
https://doi.org/10.1007/978-3-662-06534-1A.N.Kolmogorov writes in his preface [Kol 54]: “The distinction between “constructive” and “nonconstructive” plays a big role in the modern mathematical thinking”. And later: “Theoretically speaking any natural number can be given constructively as 1+1+1+...+1.”作者: 精密 時間: 2025-3-30 16:58
Klassische Astronomie. Das Planetensystem,The discovery discussed in this chapter is that of well-outlined and representative classes of algorithms. . means that for suitable aggregates .,. the class contains an algorithm equivalent to (i.e. determining the same function as) any previously given .-.-algorithm.作者: Stress-Fracture 時間: 2025-3-30 21:28 作者: stratum-corneum 時間: 2025-3-31 04:11 作者: Fibrin 時間: 2025-3-31 05:50
https://doi.org/10.1007/978-3-8349-3626-4Here the main discovery is the formulation of the problem.作者: 隱士 時間: 2025-3-31 10:13 作者: Anthropoid 時間: 2025-3-31 13:36
