Algorithms: Main Ideas and Applications [electronic resource] / by Vladimir Uspensky, Alexei Semenov.
The theory of algorithms not only answers philosophical questions but also is eminently applicable to practical computing, as well as to software and hardware design. This book presents exact mathematical formulations of major concepts and facts of the theory of algorithms in a unified and elegant w...
Saved in:
| Online Access: |
Full Text (via Springer) |
|---|---|
| Main Author: | |
| Other Authors: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Dordrecht :
Springer Netherlands,
1993.
|
| Series: | Mathematics and Its Applications ;
251. |
| Subjects: |
MARC
| LEADER | 00000cam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | b7997974 | ||
| 006 | m o d | ||
| 007 | cr ||||||||||| | ||
| 008 | 130125s1993 ne o 000 0 eng | ||
| 005 | 20240801211841.8 | ||
| 019 | |a 968304151 |a 1113508185 | ||
| 020 | |a 9789401582322 |q (electronic bk.) | ||
| 020 | |a 9401582327 |q (electronic bk.) | ||
| 020 | |z 9789048142569 | ||
| 020 | |z 9048142563 | ||
| 020 | |z 9401582327 | ||
| 024 | 7 | |a 10.1007/978-94-015-8232-2 |2 doi | |
| 029 | 0 | |a AU@ |b 000051655678 | |
| 029 | 1 | |a AU@ |b 000065497006 | |
| 029 | 1 | |a NZ1 |b 15017396 | |
| 029 | 1 | |a NZ1 |b 15308378 | |
| 029 | 1 | |a AU@ |b 000074440293 | |
| 035 | |a (OCoLC)spr851367483 | ||
| 035 | |a (OCoLC)851367483 |z (OCoLC)968304151 |z (OCoLC)1113508185 | ||
| 037 | |a spr978-94-015-8232-2 | ||
| 040 | |a AU@ |b eng |e pn |c AU@ |d GW5XE |d OCLCQ |d OCLCF |d OCLCO |d UA@ |d COO |d OCLCQ |d YDX |d UAB |d OCLCQ |d U3W |d AU@ |d LEAUB |d OCLCQ |d UKBTH |d OCLCQ |d OCLCO |d OCLCQ |d OCLCO |d OCLCL |d S9M |d OCLCQ | ||
| 049 | |a GWRE | ||
| 050 | 4 | |a QA8.9-10.3 | |
| 100 | 1 | |a Uspensky, Vladimir. | |
| 245 | 1 | 0 | |a Algorithms: Main Ideas and Applications |h [electronic resource] / |c by Vladimir Uspensky, Alexei Semenov. |
| 260 | |a Dordrecht : |b Springer Netherlands, |c 1993. | ||
| 300 | |a 1 online resource (xii, 269 pages). | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a volume |b nc |2 rdacarrier | ||
| 347 | |a text file | ||
| 347 | |b PDF | ||
| 490 | 1 | |a Mathematics and Its Applications ; |v 251 | |
| 520 | |a The theory of algorithms not only answers philosophical questions but also is eminently applicable to practical computing, as well as to software and hardware design. This book presents exact mathematical formulations of major concepts and facts of the theory of algorithms in a unified and elegant way. Precise mathematical statements are given, together with their underlying motivations, philosophical interpretations and historical developments, starting with Frege, Hilbert and Borel through Gödel and Turing up to Kolmogorov's results of 1950-1980. The book is divided into two parts. The first part outlines the fundamental discoveries of the general theory of algorithms. Numerous applications are discussed in the second part. The concept of probabilistic algorithms is presented in the Appendix. This work will be of interest to mathematicians, computer scientists, engineers and to everyone who uses algorithms. | ||
| 505 | 0 | |a Notation and Terminology -- 1.0 Preliminary notions of the theory of algorithms: constructive objects and aggregates; local properties and local actions -- 1.1 The general notion of an algorithm as an independent (separate) concept -- 1.2 Representative computational models -- 1.3 The general notion of a calculus as an independent (separate) concept -- 1.4 Representative generating models -- 1.5 Interrelations between algorithms and calculuses -- 1.6 Time and Space as complexities of computation and generation -- 1.7 Computable functions and generable sets; decidable sets; enumerable sets -- 1.8 The concept of a?-recursive function -- 1.9 Possibility of an arithmetical and even Diophantine representation of any enumerable set of natural numbers -- 1.10 Construction of an undecidable generable set -- 1.11 Post's reducibility problem -- 1.12 The concept of a relative algorithm, or an oracle algorithm -- 1.13 The concept of a computable operation -- 1.14 The concept of a program; programs as objects of computation and generation -- 1.15 The concept of a numbering and the theory of numberings -- 1.16 First steps in the invariant, or machine-independent, theory of complexity of computations -- 1.17 The theory of complexity and entropy of constructive objects -- 1.18 Convenient computational models -- 2.1 Investigations of mass problems -- 2.2 Applications to the foundations of mathematics: constructive semantics -- 2.3 Applications to mathematical logic: formalized languages of logic and arithmetic -- 2.4 Computable analysis -- 2.5 Numbered structures -- 2.6 Applications to probability theory: definitions of a random sequence -- 2.7 Applications to information theory: the algorithmic approach to the concept of quantity of information -- 2.8 Complexity bounds for particular problems -- 2.9 Influence of the theory of algorithms on algorithmic practice -- Appendix. Probabilistic Algorithms (How the Use of Randomness Makes Computations Shorter) -- A.1 Preliminary remarks -- A.2 Main results -- A.3 Formal definitions -- References -- Author Index. | |
| 546 | |a English. | ||
| 650 | 0 | |a Mathematics. |0 http://id.loc.gov/authorities/subjects/sh85082139 | |
| 650 | 0 | |a Logic. |0 http://id.loc.gov/authorities/subjects/sh85078106 | |
| 650 | 0 | |a Information theory. |0 http://id.loc.gov/authorities/subjects/sh85066289 | |
| 650 | 0 | |a Logic, Symbolic and mathematical. |0 http://id.loc.gov/authorities/subjects/sh85078115 | |
| 650 | 7 | |a Information theory. |2 fast | |
| 650 | 7 | |a Logic. |2 fast | |
| 650 | 7 | |a Logic, Symbolic and mathematical. |2 fast | |
| 650 | 7 | |a Mathematics. |2 fast | |
| 700 | 1 | |a Semenov, A. L. |q (Alekseĭ Lʹvovich) |0 http://id.loc.gov/authorities/names/n88258594 |1 https://id.oclc.org/worldcat/entity/E39PCjwhMHYgx6hpqpm3GPJVYP |1 http://isni.org/isni/0000000117476775 | |
| 758 | |i has work: |a Algorithms (Text) |1 https://id.oclc.org/worldcat/entity/E39PCFFbfDC8fXgpyqq3b4F8Q3 |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 0 | 8 | |i Print version: |z 9789048142569 |
| 856 | 4 | 0 | |u https://colorado.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-94-015-8232-2 |z Full Text (via Springer) |
| 830 | 0 | |a Mathematics and Its Applications ; |v 251. | |
| 915 | |a - | ||
| 936 | |a BATCHLOAD | ||
| 944 | |a MARS - RDA ENRICHED | ||
| 956 | |a Springer e-books | ||
| 956 | |b Springer Nature - Springer Book Archive - Springer Mathematics | ||
| 994 | |a 92 |b COD | ||
| 998 | |b WorldCat record encoding level change | ||
| 999 | f | f | |i 4046f60b-22fe-587d-ab71-1c68cb6cd79f |s d8f50462-ee20-57b4-9602-c1ebff2c8621 |
| 952 | f | f | |p Can circulate |a University of Colorado Boulder |b Online |c Online |d Online |e QA8.9-10.3 |h Library of Congress classification |i Ebooks, Prospector |n 1 |