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

Gardado en:
Detalles Bibliográficos
Autor Corporativo: International symposium on algorithms in modern mathematics and computer science :Urgench
Outros autores: Ershov, Andrei Petrovich, 1931-1988 (Directeur de la publication), Knuth, Donald Ervin, 1938- (Directeur de la publication)
Formato: Livre numérique
Idioma:Anglais
Publicado: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Series:Lecture notes in computer science 122
Sujets:
Acceso en liña:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Nota: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Algorithms in modern mathematics and computer science, proceedings, Urgench, Uzbek SSR, September 16-22, 1979, edited by A.P. Ershov and D.E. Knuth, Berlin, Springer-Verlag, 1981, 1 vol. (XI-487 p.), Lecture notes in computer science, 0-387-11157-3
• Algorithms in Modern Mathematics and Computer Science, Texte imprimé, 9783662206003
Table des matières:
  • 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.