en.unionpedia.org

Vaughan Pratt, the Glossary

Vaughan Pratt (born April 12, 1944) is a Professor Emeritus at Stanford University, who was an early pioneer in the field of computer science.^[1]

50 relations: Ambigram, Anna Patterson, Association for Computing Machinery, Byte (magazine), CGOL, Chu space, Co-NP-complete, Computer science, Concurrency (computer science), David Harel, David Magerman, Donald Knuth, Douglas Crockford, Dynamic logic (modal logic), James H. Morris, JSLint, Knox Grammar School, Knuth–Morris–Pratt algorithm, Maclisp, Macsyma, Manuel Blum, Massachusetts Institute of Technology, Median of medians, Melbourne, Modal logic, Natural language processing, NP (complexity), Operator-precedence parser, Parham Aarabi, Pentium FDIV bug, Primality certificate, Primality test, Professor, Robert Tarjan, Robert W. Floyd, Ron Rivest, Search algorithm, Selection algorithm, Shellsort, SIOD, Sorting algorithm, Sorting network, Stanford University, String-searching algorithm, Sun Microsystems, SUN workstation, Symposium on Principles of Programming Languages, TECO (text editor), University of California, Berkeley, University of Sydney.
1997 Fellows of the Association for Computing Machinery

Ambigram

An ambigram is a calligraphic composition of glyphs (letters, numbers, symbols or other shapes) that can yield different meanings depending on the orientation of observation.

See Vaughan Pratt and Ambigram

Anna Patterson

Anna Patterson is a software engineer and a contributor to search engines.

See Vaughan Pratt and Anna Patterson

Association for Computing Machinery

The Association for Computing Machinery (ACM) is a US-based international learned society for computing.

See Vaughan Pratt and Association for Computing Machinery

Byte (magazine)

Byte (stylized as BYTE) was a microcomputer magazine, influential in the late 1970s and throughout the 1980s because of its wide-ranging editorial coverage.

See Vaughan Pratt and Byte (magazine)

CGOL

CGOL (pronounced "see goll") is an alternative syntax featuring an extensible algebraic notation for the Lisp programming language.

See Vaughan Pratt and CGOL

Chu spaces generalize the notion of topological space by dropping the requirements that the set of open sets be closed under union and finite intersection, that the open sets be extensional, and that the membership predicate (of points in open sets) be two-valued.

See Vaughan Pratt and Chu space

Co-NP-complete

In complexity theory, computational problems that are co-NP-complete are those that are the hardest problems in co-NP, in the sense that any problem in co-NP can be reformulated as a special case of any co-NP-complete problem with only polynomial overhead.

See Vaughan Pratt and Co-NP-complete

Computer science

Computer science is the study of computation, information, and automation.

See Vaughan Pratt and Computer science

Concurrency (computer science)

In computer science, concurrency is the ability of different parts or units of a program, algorithm, or problem to be executed out-of-order or in partial order, without affecting the outcome.

See Vaughan Pratt and Concurrency (computer science)

David Harel

David Harel (דוד הראל; born 12 April 1950) is a computer scientist, currently serving as President of the Israel Academy of Sciences and Humanities.

See Vaughan Pratt and David Harel

David Magerman

David Mitchell Magerman (born 1968) is an American computer scientist and philanthropist.

See Vaughan Pratt and David Magerman

Donald Knuth

Donald Ervin Knuth (born January 10, 1938) is an American computer scientist and mathematician. Vaughan Pratt and Donald Knuth are Stanford University School of Engineering faculty.

See Vaughan Pratt and Donald Knuth

Douglas Crockford

Douglas Crockford is an American computer programmer who is involved in the development of the JavaScript language.

See Vaughan Pratt and Douglas Crockford

Dynamic logic (modal logic)

In logic, philosophy, and theoretical computer science, dynamic logic is an extension of modal logic capable of encoding properties of computer programs.

See Vaughan Pratt and Dynamic logic (modal logic)

James H. Morris

James Hiram Morris (born 1941) is a professor (emeritus) of Computer Science at Carnegie Mellon.

See Vaughan Pratt and James H. Morris

JSLint

JSLint is a static code analysis tool used in software development for checking if JavaScript source code complies with coding rules.

See Vaughan Pratt and JSLint

Knox Grammar School

Knox Grammar School is an independent Uniting Church day and boarding school for boys, located in Wahroonga, New South Wales, an Upper North Shore suburb of Sydney, Australia. Vaughan Pratt and Knox Grammar School are People educated at Knox Grammar School.

See Vaughan Pratt and Knox Grammar School

Knuth–Morris–Pratt algorithm

In computer science, the Knuth–Morris–Pratt algorithm (or KMP algorithm) is a string-searching algorithm that searches for occurrences of a "word" W within a main "text string" S by employing the observation that when a mismatch occurs, the word itself embodies sufficient information to determine where the next match could begin, thus bypassing re-examination of previously matched characters.

See Vaughan Pratt and Knuth–Morris–Pratt algorithm

Maclisp

Maclisp (or MACLISP, sometimes styled MacLisp or MacLISP) is a programming language, a dialect of the language Lisp.

See Vaughan Pratt and Maclisp

Macsyma

Macsyma ("Project MAC's SYmbolic MAnipulator") is one of the oldest general-purpose computer algebra systems still in wide use.

See Vaughan Pratt and Macsyma

Manuel Blum

Manuel Blum (born 26 April 1938) is a Venezuelan born American computer scientist who received the Turing Award in 1995 "In recognition of his contributions to the foundations of computational complexity theory and its application to cryptography and program checking". Vaughan Pratt and Manuel Blum are theoretical computer scientists.

See Vaughan Pratt and Manuel Blum

Massachusetts Institute of Technology

The Massachusetts Institute of Technology (MIT) is a private land-grant research university in Cambridge, Massachusetts.

See Vaughan Pratt and Massachusetts Institute of Technology

In computer science, the median of medians is an approximate median selection algorithm, frequently used to supply a good pivot for an exact selection algorithm, most commonly quickselect, that selects the kth smallest element of an initially unsorted array.

See Vaughan Pratt and Median of medians

Melbourne

Melbourne (Boonwurrung/Narrm or Naarm) is the capital and most populous city of the Australian state of Victoria, and the second-most populous city in Australia, after Sydney.

See Vaughan Pratt and Melbourne

Modal logic

Modal logic is a kind of logic used to represent statements about necessity and possibility.

See Vaughan Pratt and Modal logic

Natural language processing

Natural language processing (NLP) is an interdisciplinary subfield of computer science and artificial intelligence.

See Vaughan Pratt and Natural language processing

NP (complexity)

In computational complexity theory, NP (nondeterministic polynomial time) is a complexity class used to classify decision problems.

See Vaughan Pratt and NP (complexity)

Operator-precedence parser

In computer science, an operator precedence parser is a bottom-up parser that interprets an operator-precedence grammar.

See Vaughan Pratt and Operator-precedence parser

Parham Aarabi

Parham Aarabi (پرهاماعرابی, born August 25, 1976) is a professor and entrepreneur from Toronto, Canada.

See Vaughan Pratt and Parham Aarabi

Pentium FDIV bug

The Pentium FDIV bug is a hardware bug affecting the floating-point unit (FPU) of the early Intel Pentium processors.

See Vaughan Pratt and Pentium FDIV bug

Primality certificate

In mathematics and computer science, a primality certificate or primality proof is a succinct, formal proof that a number is prime.

See Vaughan Pratt and Primality certificate

Primality test

A primality test is an algorithm for determining whether an input number is prime.

See Vaughan Pratt and Primality test

Professor

Professor (commonly abbreviated as Prof.) is an academic rank at universities and other post-secondary education and research institutions in most countries.

See Vaughan Pratt and Professor

Robert Tarjan

Robert Endre Tarjan (born April 30, 1948) is an American computer scientist and mathematician.

See Vaughan Pratt and Robert Tarjan

Robert W. Floyd

Robert W Floyd (June 8, 1936 – September 25, 2001) was a computer scientist. Vaughan Pratt and Robert W. Floyd are Stanford University School of Engineering faculty.

See Vaughan Pratt and Robert W. Floyd

Ron Rivest

Ronald Linn Rivest (born May 6, 1947) is a cryptographer and computer scientist whose work has spanned the fields of algorithms and combinatorics, cryptography, machine learning, and election integrity.

See Vaughan Pratt and Ron Rivest

Search algorithm

In computer science, a search algorithm is an algorithm designed to solve a search problem.

See Vaughan Pratt and Search algorithm

Selection algorithm

In computer science, a selection algorithm is an algorithm for finding the kth smallest value in a collection of ordered values, such as numbers.

See Vaughan Pratt and Selection algorithm

Shellsort

Shellsort, also known as Shell sort or Shell's method, is an in-place comparison sort.

See Vaughan Pratt and Shellsort

SIOD

Scheme In One Defun, or humorously Scheme In One Day (SIOD) is a programming language, a dialect of the language Lisp, a small-size implementation of the dialect Scheme, written in C and designed to be embedded inside C programs.

See Vaughan Pratt and SIOD

Sorting algorithm

In computer science, a sorting algorithm is an algorithm that puts elements of a list into an order.

See Vaughan Pratt and Sorting algorithm

Sorting network

In computer science, comparator networks are abstract devices built up of a fixed number of "wires", carrying values, and comparator modules that connect pairs of wires, swapping the values on the wires if they are not in a desired order.

See Vaughan Pratt and Sorting network

Stanford University

Stanford University (officially Leland Stanford Junior University) is a private research university in Stanford, California.

See Vaughan Pratt and Stanford University

String-searching algorithm

In computer science, string-searching algorithms, sometimes called string-matching algorithms, are an important class of string algorithms that try to find a place where one or several strings (also called patterns) are found within a larger string or text.

See Vaughan Pratt and String-searching algorithm

Sun Microsystems

Sun Microsystems, Inc. (Sun for short) was an American technology company that sold computers, computer components, software, and information technology services and created the Java programming language, the Solaris operating system, ZFS, the Network File System (NFS), and SPARC microprocessors.

See Vaughan Pratt and Sun Microsystems

SUN workstation

The SUN workstation was a modular computer system designed at Stanford University in the early 1980s.

See Vaughan Pratt and SUN workstation

Symposium on Principles of Programming Languages

The annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) is an academic conference in the field of computer science, with focus on fundamental principles in the design, definition, analysis, and implementation of programming languages, programming systems, and programming interfaces.

See Vaughan Pratt and Symposium on Principles of Programming Languages

References

[1] https://en.wikipedia.org/wiki/Vaughan_Pratt

Also known as Vaughan R. Pratt, Vaughan Ronald Pratt, Vaughn Pratt.

Vaughan Pratt, the Glossary

Table of Contents

See also

1997 Fellows of the Association for Computing Machinery

References