Algorithms in modern mathematics and computer science : proceedings, Urgench, Uzbek SSR, September 16-22, 1979 / edited by A.P. Ershov and D.E. Knuth.
Material type:
TextSeries: Lecture notes in computer science ; 122.Publisher: Berlin ; New York : Springer-Verlag, 1981Description: 1 online resource (xi, 487 pages) : illustrationsContent type: - text
- computer
- online resource
- 9783540386216
- 3540386211
- 511/.8 19
- QA9.58 .A43 1981
- 31.02
- 54.53
- digitized 2010 HathiTrust Digital Library committed to preserve
| Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds | |
|---|---|---|---|---|---|---|---|---|
eBook
|
e-Library | eBook LNCS | Available |
"The symposium was organized by the Academy of Sciences of the Uzbek S.S.R."--Foreword
Includes bibliographical references and index.
Use copy Restrictions unspecified star MiAaHDL
Electronic reproduction. [Place of publication not identified] : HathiTrust Digital Library, 2010. MiAaHDL
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. MiAaHDL
http://purl.oclc.org/DLF/benchrepro0212
digitized 2010 HathiTrust Digital Library committed to preserve pda MiAaHDL
Print version record.
Al-khorezmi his background, his personality his work and his influence -- Algorithms in modern mathematics and computer science -- What are the gains of the theory of algorithms -- On inductive synthesis of programs -- Expanding constructive universes -- The logical approach to programming -- The structural synthesis of programs -- On finding invariant relations of program -- What can we do with problems of exhaustive search? -- The algorithmic complexity of linear algebras -- Algorithms in various contexts -- Role of a notion of algorithm in the arithmetic language semantics -- From logicism to proceduralism (an autobiographical account) -- Abstract computability on algebraic structures -- Algorithms and algebra -- On formal transformations of algorithms -- What should we do having proved a decision problem to be unsolvable? -- On the experience of riding two horses in programming -- Church-rosser transformers and decidable propertis of tree processing -- Supplement 1 summaries of oral presentations -- Supplement 2 technical program -- Supplement 3 publications on the symposium -- List of participants -- Supplement 5 photoillustrations.