Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userWhat Kind of Person Wins the Turing Award?
169
0
0.0
(
0
)
Added by
Zhongkai Shangguan
Publication date
2021
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Computer science has grown rapidly since its inception in the 1950s and the pioneers in the field are celebrated annually by the A.M. Turing Award. In this paper, we attempt to shed light on the path to influential computer scientists by examining the characteristics of the 72 Turing Award laureates. To achieve this goal, we build a comprehensive dataset of the Turing Award laureates and analyze their characteristics, including their personal information, family background, academic background, and industry experience. The FP-Growth algorithm is used for frequent feature mining. Logistic regression plot, pie chart, word cloud and map are generated accordingly for each of the interesting features to uncover insights regarding personal factors that drive influential work in the field of computer science. In particular, we show that the Turing Award laureates are most commonly white, male, married, United States citizen, and received a PhD degree. Our results also show that the age at which the laureate won the award increases over the years; most of the Turing Award laureates did not major in computer science; birth order is strongly related to the winners success; and the number of citations is not as important as one would expect.
rate research
Read More
The ACM A.M. Turing Award is commonly acknowledged as the highest distinction in the realm of computer science. Since 1960s, it has been awarded to computer scientists who made outstanding contributions. The significance of this award is far-reaching to the laureates as well as their research teams. However, unlike the Nobel Prize that has been extensively investigated, little research has been done to explore this most important award. To this end, we propose the Turing Number (TN) index to measure how far a specific scholar is to this award. Inspired by previous works on Erdos Number and Bacon Number, this index is defined as the shortest path between a given scholar to any Turing Award Laureate. Experimental results suggest that TN can reflect the closeness of collaboration between scholars and Turing Award Laureates. With the correlation analysis between TN and metrics from the bibliometric-level and network-level, we demonstrate that TN has the potential of reflecting a scholars academic influence and reputation.
We propose here to make the connection between the definitions given by Turing and Wittgenstein about what it means to follow a rule. It will be here a presentation of the Turing test in order to observe that humans and machines have more in common than one might initially believe when it comes to interpreting signs. We will see that both encounter a decision problem. For that, we will come back to the definition of the concepts of forms of life and language games from Wittgenstein, in order to see how we can apply them to a Turing machine.
It is assumed that the holographic complexities such as the complexity-action (CA) and the complexity-volume (CV) conjecture are dual to complexity in field theory. However, because the definition of the complexity in field theory is still not complete, the confirmation of the holographic duality of the complexity is ambiguous. To improve this situation, we approach the problem from a different angle. We first identify minimal and genuin properties that the filed theory dual of the holographic complexity should satisfy without assuming anything from the circuit complexity or the information theory. Based on these properties, we propose a field theory formula dual to the holographic complexity. Our field theory formula implies that the complexity between certain states in two dimensional CFTs is given by the Liouville action, which is compatible with the path-integral complexity. It gives natural interpretations for both the CA and CV conjectures and identify what their reference states are. When applied to the thermo-field double states, it also gives consistent results with the holographic results in the CA conjecture: both the divergent term and finite term.
The angel-devil game is played on an infinite two-dimensional ``chessboard. The squares of the board are all white at the beginning. The players called angel and devil take turns in their steps. When it is the devils turn, he can turn a square black. The angel always stays on a white square, and when it is her turn she can fly at a distance of at most J steps (each of which can be horizontal, vertical or diagonal) to a new white square. Here J is a constant. The devil wins if the angel does not find any more white squares to land on. The result of the paper is that if J is sufficiently large then the angel has a strategy such that the devil will never capture her. This deceptively easy-sounding result has been a conjecture, surprisingly, for about thirty years. Several other independent solutions have appeared simultaneously, some of them prove that J=2 is sufficient (see the Wikipedia on the angel problem). Still, it is hoped that the hierarchical solution presented here may prove useful for some generalizations.
It was observed that the spatiotemporal chaos in lattices of coupled chaotic maps was suppressed to a spatiotemporal fixed point when some fraction of the regular coupling connections were replaced by random links. Here we investigate the effects of different kinds of parametric fluctuations on the robustness of this spatiotemporal fixed point regime. In particular we study the spatiotemporal dynamics of the network with noisy interaction parameters, namely fluctuating fraction of random links and fluctuating coupling strengths. We consider three types of fluctuations: (i) noisy in time, but homogeneous in space; (ii) noisy in space, but fixed in time; (iii) noisy in both space and time. We find that the effect of different kinds of parameteric noise on the dy- namics is quite distinct: quenched spatial fluctuations are the most detrimental to spatiotemporal regularity; spatiotemporal fluctuations yield phenomena similar to that observed when parameters are held constant at the mean-value; and interestingly, spatiotemporal regularity is most robust under spatially uniform temporal fluctuations, which in fact yields a larger fixed point range than that obtained under constant mean-value parameters.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
