To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

How to transfigure the Wikipedia

Would you like Wikipedia to always look as professional and up-to-date? We have created a browser extension. It will enhance any encyclopedic page you visit with the magic of the WIKI 2 technology.

Try it — you can delete it anytime.

Install in 5 seconds
4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
Great Wikipedia has got greater.
.
Leo
Newton
Brights
Milds

Neil D. Jones

From Wikipedia, the free encyclopedia

Neil D. Jones
Born22 March 1941 (1941-03-22)
Centralia, Illinois, United States
Died27 March 2023 (2023-03-28) (aged 82)
NationalityAmerican
CitizenshipDanish (since 1991)
Alma materUniversity of Western Ontario
Known forPartial evaluation, control-flow analysis, size-change termination
AwardsOrder of the Dannebrog (1998); SIGPLAN Programming Languages Achievement Award (2014)
Scientific career
FieldsComputer science
InstitutionsUniversity of Copenhagen
University of Aarhus
University of Kansas
Pennsylvania State University
University of Western Ontario
Doctoral advisorArto Salomaa

Neil D. Jones (22 March 1941 Centralia, Illinois, USA - 27 March 2023, Rungsted, Denmark) was an American computer scientist. He was a Professor Emeritus in computer science at University of Copenhagen.

His work spanned both programming languages and the theory of computation. Within programming languages he was particularly known for his work on partial evaluation and for pioneering work within both data-flow analysis, control-flow analysis[1] and termination analysis.[2] Within the theory of computation, he was among the pioneers of the study of Log-space reductions and P-completeness.[3]

Neil D. Jones was a Knight of the Order of the Dannebrog (since 1998) and also a member of the Academia Europaea (since 1999). He was a 1998 Fellow of the Association for Computing Machinery for "outstanding contributions to semantics-directed compilation, especially partial evaluation, and to the theory of computation, formal models and their practical realization".[4]

YouTube Encyclopedic

  • 1/1
    Views:
    8 809
  • Dean's Lecture Series 2015 - Prof. Neil Brenner

Transcription

External links

Selected publications

References

  1. ^ Jones, Neil D. (1981), "Flow analysis of lambda expressions", Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 115, pp. 114–128, doi:10.1007/3-540-10843-2_10, ISBN 978-3-540-10843-6
  2. ^ Chin Soon Lee, Neil D. Jones and Amir M. Ben-Amram (2001), "The size-change principle for program termination", Principles of Programming Languages, 36 (3): 81–92, doi:10.1145/373243.360210
  3. ^ Neil D. Jones and William T. Laaser (1974), "Complete Problems for Deterministic Polynomial Time", Symposium on the Theory of Computation: 40–46, doi:10.1145/800119.803883, S2CID 12251817
  4. ^ "Neil D. Jones". Association for Computing Machinery. Retrieved 19 July 2017.
This page was last edited on 9 March 2024, at 01:52
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.
Contact WIKI 2
Introduction
Terms of Service
Privacy Policy