DISCLOSURE:
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission at no extra cost to you. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network, Amazon and Alibris.
The two most powerful warriors are patience and time.
ISBN10: 3540111573, ISBN13: 9783540111573, [publisher: Springer Berlin Heidelberg] Softcover Druck auf Anfrage Neuware - Printed after ordering - 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. [Einbeck, Germany] [Publication Year: 1981] ...
Springer, Date: 1981-12-01. Paperback. Very Good. 8x1x10. Ex-library paperback in very nice condition with the usual markings and attachments. 1981. Springer ISBN 3540111573 9783540111573 [US]
ISBN10: 3540111573, ISBN13: 9783540111573, [publisher: Springer Berlin Heidelberg] Softcover Druck auf Anfrage Neuware - Printed after ordering - 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. [Einbeck, Germany] [Publication Year: 1981] ...
New. New Book; Fast Shipping from UK; Not signed; Not First Edition; The Algorithms in Modern Mathematics and Computer Science : Proceedings, Urgench, Uzbek SSR September 16-22, 1979. ISBN 3540111573 9783540111573 [GB]
DISCLOSURE:
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission at no extra cost to you. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network, Amazon and Alibris.