Difference between revisions of "Template:Quote Donskoy on Hashing"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| Line 1: | Line 1: | ||
[[Template:Quote Donskoy on Hashing|Quote]] from [[Mikhail Donskoy|Mikhail Donskoy's]] ''life cycle of a programmer'' <ref>[http://www.polit.ru/article/2008/08/20/programmist/ Михаил Донской: Жизненный цикл программиста - ПОЛИТ.РУ] (Russian) [[Mikhail Donskoy]] - [http://translate.google.com/translate?sl=ru&tl=en&js=n&prev=_t&hl=en&ie=UTF-8&u=http%3A%2F%2Fwww.polit.ru%2Farticle%2F2008%2F08%2F20%2Fprogrammist%2F The life cycle of a programmer] translated by [https://en.wikipedia.org/wiki/Google_Translate Google Translate], [https://www.facebook.com/politru polit.ru] August 20, 2008</ref>: | [[Template:Quote Donskoy on Hashing|Quote]] from [[Mikhail Donskoy|Mikhail Donskoy's]] ''life cycle of a programmer'' <ref>[http://www.polit.ru/article/2008/08/20/programmist/ Михаил Донской: Жизненный цикл программиста - ПОЛИТ.РУ] (Russian) [[Mikhail Donskoy]] - [http://translate.google.com/translate?sl=ru&tl=en&js=n&prev=_t&hl=en&ie=UTF-8&u=http%3A%2F%2Fwww.polit.ru%2Farticle%2F2008%2F08%2F20%2Fprogrammist%2F The life cycle of a programmer] translated by [https://en.wikipedia.org/wiki/Google_Translate Google Translate], [https://www.facebook.com/politru polit.ru] August 20, 2008</ref>: | ||
When I was in high school I learned to program on the [[M-20]] ... In the group of programmers at [[Institute of Theoretical and Experimental Physics]], where computing work was done on [https://en.wikipedia.org/wiki/Nuclear_physics nuclear physics] on the M-20, they came up with [[Array|arrays]], [[Linked List|lists]], the need for [https://en.wikipedia.org/wiki/Subroutine subroutines] and more. One of my teachers, [[Georgy Adelson-Velsky]] came up with a [[Hash Table|hash memory]]. Details can be found in another of my teachers - [[Alexander Kronrod]] "Conversations about programming". Even before [[Mathematician#EWDijkstra|Dijkstra's]] basic principles of [https://en.wikipedia.org/wiki/Structured_programming structured programming] was known, [[Alexander Brudno]] published the book "Programming in meaningful notation." There was also created the first chess program ... The [[ITEP Chess Program|chess program ITEP]], the predecessor of [[Kaissa]] fit in memory of M-20, namely in 4096 cells, each of which has a 48-bit ... | When I was in high school I learned to program on the [[M-20]] ... In the group of programmers at [[Institute of Theoretical and Experimental Physics]], where computing work was done on [https://en.wikipedia.org/wiki/Nuclear_physics nuclear physics] on the M-20, they came up with [[Array|arrays]], [[Linked List|lists]], the need for [https://en.wikipedia.org/wiki/Subroutine subroutines] and more. One of my teachers, [[Georgy Adelson-Velsky]] came up with a [[Hash Table|hash memory]]. Details can be found in another of my teachers - [[Alexander Kronrod]] "Conversations about programming". Even before [[Mathematician#EWDijkstra|Dijkstra's]] basic principles of [https://en.wikipedia.org/wiki/Structured_programming structured programming] was known, [[Alexander Brudno]] published the book "Programming in meaningful notation." There was also created the first chess program ... The [[ITEP Chess Program|chess program ITEP]], the predecessor of [[Kaissa]] fit in memory of M-20, namely in 4096 cells, each of which has a 48-bit ... | ||
| − | |||
Latest revision as of 16:26, 7 December 2019
Quote from Mikhail Donskoy's life cycle of a programmer [1]:
When I was in high school I learned to program on the M-20 ... In the group of programmers at Institute of Theoretical and Experimental Physics, where computing work was done on nuclear physics on the M-20, they came up with arrays, lists, the need for subroutines and more. One of my teachers, Georgy Adelson-Velsky came up with a hash memory. Details can be found in another of my teachers - Alexander Kronrod "Conversations about programming". Even before Dijkstra's basic principles of structured programming was known, Alexander Brudno published the book "Programming in meaningful notation." There was also created the first chess program ... The chess program ITEP, the predecessor of Kaissa fit in memory of M-20, namely in 4096 cells, each of which has a 48-bit ...- ↑ Михаил Донской: Жизненный цикл программиста - ПОЛИТ.РУ (Russian) Mikhail Donskoy - The life cycle of a programmer translated by Google Translate, polit.ru August 20, 2008
