Difference between revisions of "Template:Quote Shura-Bura"
GerdIsenberg (talk | contribs) (Created page with "Quote from ''The Early Development of Programming in the USSR'' by Andrey Ershov and Mikhail R. Shura-Bura <ref>Mathematician#Ershov|Andrey Ersh...") |
GerdIsenberg (talk | contribs) m |
||
| Line 1: | Line 1: | ||
| − | Quote from ''The Early Development of Programming in the USSR'' by [[Mathematician#Ershov|Andrey Ershov]] and [[Mikhail R. Shura-Bura]] <ref>[[Mathematician#Ershov|Andrey Ershov]], [[Mikhail R. Shura-Bura]] ('''1980'''). ''[http://ershov.iis.nsk.su/archive/eaindex.asp?lang=2&gid=910 The Early Development of Programming in the USSR]''. in [https://en.wikipedia.org/wiki/Nicholas_C._Metropolis Nicholas C. Metropolis] (ed.) ''[http://dl.acm.org/citation.cfm?id=578384 A History of Computing in the Twentieth Century]''. [https://en.wikipedia.org/wiki/Academic_Press Academic Press], [http://ershov.iis.nsk.su/archive/eaimage.asp?did=28792&fileid=173671 preprint pp. 44]</ref> | + | [[Template:Quote Shura-Bura|Quote]] from ''The Early Development of Programming in the USSR'' by [[Mathematician#Ershov|Andrey Ershov]] and [[Mikhail R. Shura-Bura]] <ref>[[Mathematician#Ershov|Andrey Ershov]], [[Mikhail R. Shura-Bura]] ('''1980'''). ''[http://ershov.iis.nsk.su/archive/eaindex.asp?lang=2&gid=910 The Early Development of Programming in the USSR]''. in [https://en.wikipedia.org/wiki/Nicholas_C._Metropolis Nicholas C. Metropolis] (ed.) ''[http://dl.acm.org/citation.cfm?id=578384 A History of Computing in the Twentieth Century]''. [https://en.wikipedia.org/wiki/Academic_Press Academic Press], [http://ershov.iis.nsk.su/archive/eaimage.asp?did=28792&fileid=173671 preprint pp. 44]</ref> |
At the end of the 1950's a group of Moscow mathematicians began a study of computerized chess. Sixteen years later, the studies would lead to victory in the [[WCCC 1974|first world chess tournament for computer programs]] held in Stockholm during the 1974 [[IFIP]] Congress. An important component of this success was a deep study of the problems of information organization in [[Memory|computer memory]] and of various [[Search|search heuristics]]. [[Georgy Adelson-Velsky|G. M. Adelson-Velsky]] and [[Mathematician#Landis|E. M. Landis]] invented the [https://en.wikipedia.org/wiki/AVL_tree binary search tree] ("dichotomic inquiry") and [[Alexander Brudno|A. L. Brudno]], independent of [[John McCarthy|J. McCarthy]], discovered the [[Alpha-Beta|(α,β)-heuristic]] for reducing search times on a game tree. | At the end of the 1950's a group of Moscow mathematicians began a study of computerized chess. Sixteen years later, the studies would lead to victory in the [[WCCC 1974|first world chess tournament for computer programs]] held in Stockholm during the 1974 [[IFIP]] Congress. An important component of this success was a deep study of the problems of information organization in [[Memory|computer memory]] and of various [[Search|search heuristics]]. [[Georgy Adelson-Velsky|G. M. Adelson-Velsky]] and [[Mathematician#Landis|E. M. Landis]] invented the [https://en.wikipedia.org/wiki/AVL_tree binary search tree] ("dichotomic inquiry") and [[Alexander Brudno|A. L. Brudno]], independent of [[John McCarthy|J. McCarthy]], discovered the [[Alpha-Beta|(α,β)-heuristic]] for reducing search times on a game tree. | ||
Revision as of 12:03, 10 April 2018
Quote from The Early Development of Programming in the USSR by Andrey Ershov and Mikhail R. Shura-Bura [1]
At the end of the 1950's a group of Moscow mathematicians began a study of computerized chess. Sixteen years later, the studies would lead to victory in the first world chess tournament for computer programs held in Stockholm during the 1974 IFIP Congress. An important component of this success was a deep study of the problems of information organization in computer memory and of various search heuristics. G. M. Adelson-Velsky and E. M. Landis invented the binary search tree ("dichotomic inquiry") and A. L. Brudno, independent of J. McCarthy, discovered the (α,β)-heuristic for reducing search times on a game tree.
