Experience sharing | it turns out that these Turing Award masters are hiding around
2020-12-06 20:44:59 【Big sai】
Search on wechat ：bigsai The article is included in github welcome star
This is a true story , When the author takes part in the postgraduate entrance examination this year , Because of the epidemic, it was an online retest , But some processes remain unchanged , Machine test + After the written examination is the interview .
And then I started the intense interview , Everyone knows that the English part of the interview is at the beginning , When the teacher said let's start speaking English , I have already recited the well-known personal introduction hidden in my mind, is ready to let out, waiting for the teacher to say "Please introduce yourself" When , Things suddenly reversed , The teacher said ："Do you know who won the Turing prize?". I frowned as hard as I could, pretending to think hard ( In fact, it would not have been ), After that, I still don't forget to tell me secretly in Chinese ： Turing Award . I looked at the interviewer and said ：“Sorry, I don’t know” ( I only know this prize, but I don't know who has won it ).
The teacher said it didn't matter , One more ：“Do you know who put forward the relational model of relational database？” , I stopped for a long time, frowned and pretended not to hear , The teacher speaks Chinese directly “ Do you know who put forward the relational model of relational database ？” My brows are getting tighter , Again ：“Sorry, I don’t know” ( this ……).
At this time, I feel that it is too bad , How to ask this question , But fortunately, the teacher asked me what encryption algorithms there are , There are some crawler experience, know some encryption algorithm, I falter out in English , It also introduces some differences , Fortunately, the answer in the back is OK, and the written test and machine test in front are also OK. It's very dangerous Go ashore .
Finally, the teacher said that the proponent of relational model is also the winner of Turing prize , I wonder ：“ Does the teacher think that I know who put forward the relationship model, but I don't know what prize he won ！ Who won the Turing prize? I don't know , I don't know who put forward the relational model ”！ But I still smile and the teacher said ：“ ha-ha , This has reached a blind spot , Go back and learn about a wave of ” ! But I don't know about it , As you all know .
Turing Award （Turing Award）, Full name A.M. Turing Award （A.M Turing Award）, By the American computer association （ACM） On 1966 The computer award was established in , The name comes from Allen · Maxson · Turing （Alan M. Turing）, It aims to reward individuals who have made important contributions to the computer industry . The Turing prize has very high requirements for the winning conditions , The award process is very strict , Generally, only one computer scientist is awarded each year . The Turing prize is the highest international award in the field of computer science , Known as the “ The Nobel Prize in Computing ”.
Turing awards are usually held every year 3 In the last ten days of the month . from 1966 - 2019 year , The Turing prize was awarded to 72 Winners , In the United States 、 European scientists are the main . According to statistics , By 2020 year 3 month , The number of winners of Turing awards in universities around the world is Stanford University （28 position ）、 Massachusetts Institute of Technology （26 position ）、 University of California, Berkeley （25 position ）、 Harvard University （14 position ） And Princeton University （14 position ）.
2000 year , Yao Qizhi, a Chinese scientist ( Born in Shanghai ) Turing award , It is the first and only time for Chinese to win Turing Award .
Of course, we don't know who won the Turing prize in the short term ( What to play after the second round exam 、 We've finished the design 、 Open black, open black ), But this is, after all, a barrier that used to be , After a long time, I still can't be reconciled to , Open Baidu search relational database relational model The key word found the answer ：
And I found the answer , By the way, let's also popularize science ：
1970 year ,IBM Research Fellow E.F.Codd Doctor publish 《 The relational model of large shared data banks 》 This paper proposes the concept of relational model , This paper discusses the theory of paradigms and the system of measuring relations 12 Standards , For example, some relational algebra operations are defined , The functional correlation of data is studied , Defines the third paradigm of relationships , Thus, the research on relational method of database and data normalization theory is created , He got 1981 Turing Award in .
later Codd Many articles have been published in succession , Lay the foundation of relational database . Relational models have a strict mathematical foundation , High level of abstraction , And it's simple and clear , Easy to understand and use . But at that time, some people thought that relational model was an ideal data model , Used to implement DBMS It's unrealistic , Especially worried about the performance of relational database is difficult to accept , Some people regard it as a serious threat to the standardization of mesh database at that time . To promote understanding of the problem ,1974 year ACM Led a seminar , A separate meeting was held to Codd and Bachman The first is for and against the debate between relational databases . This famous debate has driven the development of relational databases , Make it the mainstream of modern database products .
I'll teach you a trick ： Later, the interviewer asks you to be familiar with relational databases (MySQL) Do you , You go to Codd Doctor A wave of , Then he eulogized a wave of its brief deeds and said that he was in 1981 He won the Turing prize for his research on relational database theory , And with a look of admiration and admiration . The interviewer must feel good ： This guy is good at it , The attitude was also very good , Plus points plus points ！ It's safe to get offer The probability is greatly increased ！( If it works, remember to come back three times in a row ).
Although the blind spot of Turing prize winners has been broken , But I can't help but wonder who won the Turing prize , Take a look, most of them are in the field of artificial intelligence mathematics, and some of them are unfamiliar and hard to remember faces that are relatively low-level or database related , I'm a little disappointed . But suddenly I found a familiar face ：Dijkstra
wow , This algorithm must be learned in data structure and algorithm graph theory , Graph theory algorithm can be counted ,Dijkstra、prim、floyed Plus the classic dfs and bfs Well ！ I'm excited to open Dijkstra Introduction of the big man ,Dijkstra Big guys are called The father of structural programming , He has the following achievements ：
Knowing ：goto On harmfulness ( familiar to the ear ); first Algol 60 Compiler designers and implementers ( Amazing. );THE The designers and developers of the operating system ( What a big man ！);
conversant ：Dijkstra Shortest path algorithm ( Famous for it ); The creator of the banker's algorithm ; It's solved “ Philosophers eat together ” problem ; Put forward the semaphore and PV The original language ;
At this time, I was shocked , That's true. pv Semaphores and primitives , I know the banker's algorithm , The dining problem of philosophers is a classic problem of operating system , I didn't expect it was all Dijkstra The big man put forward and found , It's really strong ！ also Dijkstra And D. E. Knuth And called the greatest computer scientist of our time .
Dijkstra Is the classic single source to find the shortest path , And corresponding to the popular multi-source shortest path algorithm —Floyd( Freud ) Algorithm , The algorithm is named after one of the founders 、1978 Turing prize winner in 、 Robert, Professor of computer science at Stanford University · Freud named . In addition, in terms of algorithm , Freud （Floyd） And Williams （J．Williams） stay 1964 Co invented the famous Heap sort algorithm heapSort( I just wrote a few days ago, but I didn't find )！
Talking about sorting , That fast line must be indispensable , Sir Hall ( British computer scientist ) Namely Quick sort The inventor of the , It happened that Sir hall was there 1980 Turing Award in .
Who won the Turing prize with one sentence Pascal The father of ——Niklaus Wirth( wo ) , The sentence that won him the Turing prize is his famous formula ：“ Algorithm + data structure = Program ” , As a programmer , The first section of College c Language or data structure and algorithm class, we heard the teacher said this sentence . The influence of this formula on computer science is similar to that of Einstein in physics “E=MC^2”— A formula shows the nature of the program .
Find an interesting connection through a little thing . They all have a common connection — Turing Award , In the past , My understanding is like this ：
Through the collation and learning of this article , Now there is a more organized understanding of some knowledge ：
Of course , There are so many Turing Prize Winners , Every winner is a great talent , They are all models of our generation , Here is just a list of the links to 、 The winner who is familiar with data structure and algorithm , The others will not be listed one by one ！
Although this is not a very big thing , A question from the second interview , But through the subsequent search, I always have a new feeling for familiar algorithms and characters ： It's still like this ！ And in life 、 In the work 、 There are many similar places in learning , We may be only one step away from discovering more 、 Build more effective connections and knowledge architecture . And we are often floating on the surface , I hope that in the future study and life, I can make a People with a heart .
One last question for you , You know why the Turing trophy is a silver bowl ？
Originality is not easy. ,bigsai Please help me with two things :
One button, three links 、 Share your support , You must be the source of my creation .
WeChat search 「bigsai」, Follow my public number , Not only free e-books for you , I will also share knowledge and technology in official account for the first time . Plus I can also pull you into the force buckle punch group punch together LeetCode.
Remember to pay attention to 、 See you next time ！
Recent highlights ：
- C++ 数字、string和char*的转换
- Won the CKA + CKS certificate with the highest gold content in kubernetes in 31 days!
- C + + number, string and char * conversion
- C + + Learning -- capacity() and resize() in C + +
- C + + Learning -- about code performance optimization
C + + programming experience (6): using C + + style type conversion
Latest party and government work report ppt - Park ppt
Online ID number extraction birthday tool
Field pointer? Dangling pointer? This article will help you understand!
GVRP of hcna Routing & Switching
- LeetCode 91. 解码方法
- Seq2seq implements chat robot
- [chat robot] principle of seq2seq model
- Leetcode 91. Decoding method
- HCNA Routing＆Switching之GVRP
- GVRP of hcna Routing & Switching
- HDU7016 Random Walk 2
- [Code+＃1]Yazid 的新生舞会
- CF1548C The Three Little Pigs
- HDU7033 Typing Contest
- HDU7016 Random Walk 2
- [code + 1] Yazid's freshman ball
- CF1548C The Three Little Pigs
- HDU7033 Typing Contest
- Qt Creator 自动补齐变慢的解决
- HALCON 20.11：如何处理标定助手品质问题
- HALCON 20.11：标定助手使用注意事项
- Solution of QT creator's automatic replenishment slowing down
- Halcon 20.11: how to deal with the quality problem of calibration assistant
- Halcon 20.11: precautions for use of calibration assistant
- "Top ten scientific and technological issues" announced| Young scientists 50 ² forum
- Reverse linked list
- JS data type
- Remember the bug encountered in reading and writing a file
- Singleton mode
- 在这个 N 多编程语言争霸的世界，C++ 究竟还有没有未来？
- In this world of N programming languages, is there a future for C + +?
- js Promise
- js 数组方法 回顾
- ES6 template characters
- js Promise
- JS array method review
- 【Golang】️走进 Go 语言️ 第一课 Hello World
- [golang] go into go language lesson 1 Hello World