Skip to content
Surf Wiki
Save to docs
technology/computing

From Surf Wiki (app.surf) — the open knowledge base

Paul Vitányi

Dutch theoretical computer scientist


Dutch theoretical computer scientist

FieldValue
namePaul Michael Béla Vitányi
imagePaul Vitanyi 2005.jpg
image_size250px
captionPaul M. B. Vitányi 2005
birth_date
birth_placeBudapest
nationalityDutch
fieldsComputer science, Mathematics
workplacesCWI, University of Amsterdam, University of Copenhagen, Massachusetts Institute of Technology, Monash University, Tokyo Institute of Technology, NICTA at University of New South Wales, Boston University, University of Waterloo
alma_materDelft University of Technology
Free University of Amsterdam
doctoral_advisorJaco de Bakker
Arto Salomaa
doctoral_studentsRonald Cramer
John Tromp
Barbara Terhal
Ronald de Wolf
known_forSimplicity theory
Kolmogorov complexity
Normalized Compression Distance
Normalized Google Distance
Information Distance
Incompressibility Method
Shared register
Kolmogorov structure function
Reversible computing

Free University of Amsterdam Arto Salomaa John Tromp Barbara Terhal Ronald de Wolf Kolmogorov complexity Normalized Compression Distance Normalized Google Distance Information Distance Incompressibility Method Shared register Kolmogorov structure function Reversible computing

Paul Michael Béla Vitányi (born 21 July 1944) is a Dutch computer scientist, professor of computer science at the University of Amsterdam and researcher at the Dutch Centrum Wiskunde & Informatica.

Biography

Vitányi was born in Budapest to a Dutch mother and a Hungarian father. He received his degree of mathematical engineer from Delft University of Technology in 1971 and his Ph.D. from the Free University of Amsterdam in 1978.

Career

Vitányi was appointed professor of computer science at the University of Amsterdam, and researcher at the National Research Institute for Mathematics and Computer Science in the Netherlands (CWI, initially Mathematical Centre [MC]) where he is currently a CWI Fellow. He was guest professor at the University of Copenhagen in 1978; research associate at the Massachusetts Institute of Technology in 1985/1986; Gaikoku-Jin Kenkyuin (councilor professor) at INCOCSAT at the Tokyo Institute of Technology in 1998; visiting professor at Boston University in 2004, at Monash University in 1996 and at the National ICT of Australia NICTA at University of New South Wales in 2004/2005; visiting professor at and adjunct professor of computer science at the University of Waterloo from 2005.

Vitányi has served on the editorial boards of Distributed Computing (1987–2003), Information Processing Letters; the Theory of Computing Systems; the Parallel Processing Letters; the International journal of Foundations of Computer Science; the Entropy; the Information; the * SN Computer Science*; the Journal of Computer and Systems Sciences (guest editor), and elsewhere.

Awards and honours

  • 1999 – National Outstanding Scientific and Technological Book Award of the People's Republic of China
  • 2003 – CWI Fellow
  • 2003 – Bronze Medal University of Helsinki
  • 2005 – Adjunct Professor Computer Science University of Waterloo
  • 2007 – Knighthood in the Order of the Netherlands Lion,
  • 2007 – International Federation for Information Processing (IFIP) Silver Core Award
  • 2011 – Member of the Academia Europaea.
  • 2020 - McGuffey Longevity Award of the Textbook & Academic Authors Association (TAA).

Work

Vitányi has worked on cellular automata, computational complexity, distributed and parallel computing, machine learning and prediction, physics of computation, Kolmogorov complexity, information theory and quantum computing, publishing over 200 research papers and some books. As of 2020 his work on normalized compression distance was used in 15 US patents and on normalized Google distance in 10 US patents.

Together with Ming Li he pioneered theory and applications of Kolmogorov complexity. They co-authored the textbook An Introduction to Kolmogorov Complexity and Its Applications, parts of which have been translated into Chinese, Russian and Japanese. The textbook received the William Holmes McGuffey Longevity Award of the Textbook & Academic Authors Association (TAA) (2020), and the Chinese translation received the National Outstanding Scientific and Technological Book Award of the People's Republic of China (1999).

References

References

  1. {{mathgenealogy
  2. (10 September 2007). "Paul Vitányi ontvangt koninklijke onderscheiding". [[Verenigde Nederlandse Uitgeverijen.
  3. "Analysing Human Aspects of Safety-Critical Software".
  4. [http://www.ae-info.org/ae/User/Vitanyi_Paul Academia Europaea]
  5. "Computer science papers DBLP".
  6. "Paul Vitanyi".
  7. "MathSciNet Mathematical Reviews".
  8. (May 3, 2007). "Applications of algorithmic information theory". Scholarpedia.
  9. [https://www.amazon.com/Introduction-Kolmogorov-Complexity-Applications-Computer/dp/0387339981/ref=dp_ob_title_bk= M. Li and P. M. B.Vitányi, ''An Introduction to Kolmogorov Complexity and its Applications'', Springer, New York, 1993 (1st Ed.), 1997 (2nd ed.), 2008 (3rd ed.), 2019 (4th ed.)]
  10. Schmieder, Eric. (February 26, 2020). "TAA announces 2020 Textbook Award winners - Textbook & Academic Authors Association Blog".
  11. (September 2025). "Chinese translation of ''An Introduction to Kolmogorov Complexity and its Applications''}}{{Dead link".
Info: Wikipedia Source

This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.

Want to explore this topic further?

Ask Mako anything about Paul Vitányi — get instant answers, deeper analysis, and related topics.

Research with Mako

Free with your Surf account

Content sourced from Wikipedia, available under CC BY-SA 4.0.

This content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.

Report