|
Paul Vitányi
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 (Centrum Wiskunde & Informatica, CWI) 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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Budapest
Budapest is the Capital city, capital and List of cities and towns of Hungary, most populous city of Hungary. It is the List of cities in the European Union by population within city limits, tenth-largest city in the European Union by population within city limits and the List of cities and towns on the river Danube, second-largest city on the river Danube. The estimated population of the city in 2025 is 1,782,240. This includes the city's population and surrounding suburban areas, over a land area of about . Budapest, which is both a List of cities and towns of Hungary, city and Counties of Hungary, municipality, forms the centre of the Budapest metropolitan area, which has an area of and a population of 3,019,479. It is a primate city, constituting 33% of the population of Hungary. The history of Budapest began when an early Celts, Celtic settlement transformed into the Ancient Rome, Roman town of Aquincum, the capital of Pannonia Inferior, Lower Pannonia. The Hungarian p ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Arto Salomaa
Arto Kustaa Salomaa (6 June 1934 – 26 January 2025) was a Finnish mathematician and computer scientist. His research career, which spanned over 40 years, was focused on formal languages and automata theory. Early life and education Salomaa was born in Turku, Finland on 6 June 1934. He earned a Bachelor's degree from the University of Turku in 1954 and a PhD from the same university in 1960. Salomaa's father was a professor of philosophy at the University of Turku. Salomaa was introduced to the theory of automata and formal languages during seminars at Berkeley given by John Myhill in 1957. Career In 1965 Salomaa became a professor of mathematics at the University of Turku, a position he retired from in 1999. He also spent two years in the late 1960s at the University of Western Ontario in London, Ontario, Canada, and two years in the 1970s at Aarhus University in Aarhus, Denmark.. Salomaa was president of the European Association for Theoretical Computer Science ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Reversible Computing
Reversible computing is any model of computation where every step of the process is time-reversible. This means that, given the output of a computation, it's possible to perfectly reconstruct the input. In systems that progress deterministically from one state to another, a key requirement for reversibility is a one-to-one correspondence between each state and its successor. Reversible computing is considered an unconventional approach to computation and is closely linked to quantum computing, where the principles of quantum mechanics inherently ensure reversibility (as long as quantum states are not measured or " collapsed"). Reversibility There are two major, closely related types of reversibility that are of particular interest for this purpose: physical reversibility and logical reversibility. A process is said to be ''physically reversible'' if it results in no increase in physical entropy; it is isentropic. There is a style of circuit design ideally exhibiting thi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Kolmogorov Structure Function
In 1973, Andrey Kolmogorov proposed a non-probabilistic approach to statistics and model selection. Let each datum be a finite binary string and a model be a finite set of binary strings. Consider model classes consisting of models of given maximal Kolmogorov complexity. The Kolmogorov structure function of an individual data string expresses the relation between the complexity level constraint on a model class and the least log-cardinality of a model in the class containing the data. The structure function determines all stochastic properties of the individual data string: for every constrained model class it determines the individual best-fitting model in the class irrespective of whether the true model is in the model class considered or not. In the classical case we talk about a set of data with a probability distribution, and the properties are those of the expectations. In contrast, here we deal with individual data strings and the properties of the individual string focused ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Shared Register
In distributed computing, shared-memory systems and message-passing systems are two widely studied methods of interprocess communication. In shared-memory systems, processes communicate by accessing shared data structures. A shared (read/write) register, sometimes just called a register, is a fundamental type of shared data structure which stores a value and has two operations: ''read'', which returns the value stored in the register, and ''write'', which updates the value stored. Other types of shared data structures include read–modify–write, test-and-set, compare-and-swap etc. The memory location which is concurrently accessed is sometimes called a register. Classification Registers can be classified according to the consistency condition they satisfy when accessed concurrently, the domain of possible values that can be stored, and how many processes can access with the ''read'' or ''write'' operation, which leads to in total 24 register types. When ''read'' and ''writ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Kolmogorov Complexity
In algorithmic information theory (a subfield of computer science and mathematics), the Kolmogorov complexity of an object, such as a piece of text, is the length of a shortest computer program (in a predetermined programming language) that produces the object as output. It is a measure of the computational resources needed to specify the object, and is also known as algorithmic complexity, Solomonoff–Kolmogorov–Chaitin complexity, program-size complexity, descriptive complexity, or algorithmic entropy. It is named after Andrey Kolmogorov, who first published on the subject in 1963 and is a generalization of classical information theory. The notion of Kolmogorov complexity can be used to state and prove impossibility results akin to Cantor's diagonal argument, Gödel's incompleteness theorem, and Turing's halting problem. In particular, no program ''P'' computing a lower bound for each text's Kolmogorov complexity can return a value essentially larger than ''P'''s own len ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Simplicity Theory
Simplicity theory is a cognitive theory that seeks to explain the attractiveness of situations or events to human minds. It is based on work done by scientists like behavioural scientist Nick Chater, computer scientist Paul Vitanyi, psychologist Jacob Feldman, and artificial intelligence researchers Jean-Louis Dessalles Dessalles, J.-L. (2013)"Algorithmic simplicity and relevance" In D. L. Dowe (Ed.), Algorithmic probability and friends - LNAI 7070, 119-130. Berlin, D: Springer Verlag. and Jürgen Schmidhuber. It claims that interesting situations appear simpler than expected to the observer. Overview Technically, simplicity corresponds in a drop in Kolmogorov complexity, which means that, for an observer, the shortest description of the situation is shorter than anticipated. For instance, the description of a consecutive lottery draw, such as 22-23-24-25-26-27, is significantly shorter than a typical one, such as 12-22-27-37-38-42. The former requires only one instantiat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ronald De Wolf
Ronald Michiel de Wolf (born 1973) is a Dutch Computer Scientist, currently a Senior Researcher at Centrum Wiskunde & Informatica (CWI) and a professor at the Institute for Logic, Language and Computation (ILLC) of the University of Amsterdam (UvA). His research interests are on Quantum computing, Quantum information, Coding theory, and Computational complexity theory. His scientific contributions include the first exponential separation between one-way quantum and classical communication protocols for a partial Boolean function, and a proof that a locally decodable code (LDC) with 2 classical queries need exponential length. This suggested the use of techniques from quantum computing to prove results in "classical" computer science. De Wolf and his coauthors received the Best Paper Award at the Annual ACM Symposium on Theory of Computing (STOC) in 2012. For the same article, they also received the 2022 STOC 10-year test of time award and the 2023 Gödel Prize.https://eatcs.o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
