skip to content
Algorithms in modern mathematics and computer science : proceedings, Urgench, Uzbek SSR, September 16-22, 1979 Preview this item
ClosePreview this item
Checking...

Algorithms in modern mathematics and computer science : proceedings, Urgench, Uzbek SSR, September 16-22, 1979

Author: A P Ershov; Donald Ervin Knuth; Ŭzbekiston SSR fanlar akademii︠a︡si.
Publisher: Berlin ; New York : Springer-Verlag, 1981.
Series: Lecture notes in computer science, 122.
Edition/Format:   Book : Conference publication : EnglishView all editions and formats
Database:WorldCat
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Conference proceedings
Congresses
Congrès
Additional Physical Format: Online version:
International Symposium on Algorithms in Modern Mathematics and Computer Science (1979 : Urganch, Uzbekistan).
Algorithms in modern mathematics and computer science.
Berlin ; New York : Springer-Verlag, 1981
(OCoLC)559510878
Material Type: Conference publication, Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: A P Ershov; Donald Ervin Knuth; Ŭzbekiston SSR fanlar akademii︠a︡si.
ISBN: 0387111573 9780387111575 3540111573 9783540111573
OCLC Number: 7948639
Notes: "The symposium was organized by the Academy of Sciences of the Uzbek S.S.R."--Foreword.
Description: xi, 487 pages : illustrations ; 24 cm.
Contents: 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.
Series Title: Lecture notes in computer science, 122.
Responsibility: edited by A.P. Ershov and D.E. Knuth.
More information:

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/7948639>
library:oclcnum"7948639"
library:placeOfPublication
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/7948639>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:contributor
schema:datePublished"1981"
schema:exampleOfWork<http://worldcat.org/entity/work/id/1104424150>
schema:genre"Conference proceedings."@en
schema:genre"Conference proceedings"@en
schema:inLanguage"en"
schema:name"Algorithms in modern mathematics and computer science : proceedings, Urgench, Uzbek SSR, September 16-22, 1979"@en
schema:publisher
schema:url
schema:workExample
schema:workExample
umbel:isLike<http://d-nb.info/810982234>

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.