Turing Number: How Far Are You to A. M. Turing Award?

05/03/2021
by   Feng Xia, et al.
0

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 scholar's academic influence and reputation.

READ FULL TEXT

page 1

page 2

page 3

page 4

04/04/2021

What Kind of Person Wins the Turing Award?

Computer science has grown rapidly since its inception in the 1950s and ...
06/22/2021

Turing Award elites revisited: patterns of productivity, collaboration, authorship and impact

The Turing Award is recognized as the most influential and prestigious a...
11/18/2020

A Theoretical Computer Science Perspective on Consciousness

The quest to understand consciousness, once the purview of philosophers ...
02/05/2014

Levels of Abstraction and the Apparent Contradictory Philosophical Legacy of Turing and Shannon

In a recent article, Luciano Floridi explains his view of Turing's legac...
01/25/2019

Program algebra for Turing-machine programs

This note presents an algebraic theory of instruction sequences with ins...
05/29/2019

Sub-Turing Islands in the Wild

Recently, there has been growing debate as to whether or not static anal...
03/15/2016

Turing learning: a metric-free approach to inferring behavior and its application to swarms

We propose Turing Learning, a novel system identification method for inf...