|
State Complexity
State complexity is an area of theoretical computer science dealing with the size of abstract automata, such as different kinds of finite automata. The classical result in the area is that simulating an n-state nondeterministic finite automaton by a deterministic finite automaton requires exactly 2^n states in the worst case. Transformation between variants of finite automata Finite automata can be deterministic and nondeterministic, one-way (DFA, NFA) and two-way (2DFA, 2NFA). Other related classes are unambiguous (UFA), self-verifying (SVFA) and alternating (AFA) finite automata. These automata can also be two-way (2UFA, 2SVFA, 2AFA). All these machines can accept exactly the regular languages. However, the size of different types of automata necessary to accept the same language (measured in the number of their states) may be different. For any two types of finite automata, the ''state complexity tradeoff'' between them is an integer function f where f(n) is the least numb ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Theoretical Computer Science
Theoretical computer science (TCS) is a subset of general computer science and mathematics that focuses on mathematical aspects of computer science such as the theory of computation, lambda calculus, and type theory. It is difficult to circumscribe the theoretical areas precisely. The Association for Computing Machinery, ACM's ACM SIGACT, Special Interest Group on Algorithms and Computation Theory (SIGACT) provides the following description: History While logical inference and mathematical proof had existed previously, in 1931 Kurt Gödel proved with his incompleteness theorem that there are fundamental limitations on what statements could be proved or disproved. Information theory was added to the field with a 1948 mathematical theory of communication by Claude Shannon. In the same decade, Donald Hebb introduced a mathematical model of Hebbian learning, learning in the brain. With mounting biological data supporting this hypothesis with some modification, the fields of n ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
NL (complexity)
In computational complexity theory, NL (Nondeterministic Logarithmic-space) is the complexity class containing decision problems that can be solved by a nondeterministic Turing machine using a logarithmic amount of memory space. NL is a generalization of L, the class for logspace problems on a deterministic Turing machine. Since any deterministic Turing machine is also a nondeterministic Turing machine, we have that L is contained in NL. NL can be formally defined in terms of the computational resource nondeterministic space (or NSPACE) as NL = NSPACE(log ''n''). Important results in complexity theory allow us to relate this complexity class with other classes, telling us about the relative power of the resources involved. Results in the field of algorithms, on the other hand, tell us which problems can be solved with this resource. Like much of complexity theory, many important questions about NL are still open (see Unsolved problems in computer science). Occasionally NL ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
L (complexity)
In computational complexity theory, L (also known as LSPACE or DLOGSPACE) is the complexity class containing decision problems that can be solved by a deterministic Turing machine using a logarithmic amount of writable memory space., Definition 8.12, p. 295., p. 177. Formally, the Turing machine has two tapes, one of which encodes the input and can only be read, whereas the other tape has logarithmic size but can be read as well as written. Logarithmic space is sufficient to hold a constant number of pointers into the input and a logarithmic number of boolean flags, and many basic logspace algorithms use the memory in this way. Complete problems and logical characterization Every non-trivial problem in L is complete under log-space reductions, so weaker reductions are required to identify meaningful notions of L-completeness, the most common being first-order reductions. A 2004 result by Omer Reingold shows that USTCON, the problem of whether there exists a path ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Andrzej Lingas
Andrzej is the Polish form of the given name Andrew. Notable individuals with the given name Andrzej * Andrzej Bartkowiak (born 1950), Polish film director and cinematographer * Andrzej Bobola, S.J. (1591–1657), Polish saint, missionary and martyr * Andrzej Chyra (born 1964), Polish actor * Andrzej Czarniak (1931–1985), Polish alpine skier * Andrzej Duda (born 1972), Polish 6th president * Andrzej Jajszczyk, Polish scientist * Andrzej Kmicic, fictional protagonist of Henryk Sienkiewicz's novel ''The Deluge'' * Andrzej Kokowski (born 1953), Polish archaeologist * Andrzej Krauze (born 1947), Polish-British cartoonist and illustrator * Andrzej Leder (born 1960), Polish philosopher and psychotherapist * Andrzej Mazurczak (born 1993), Polish basketball player * Andrzej Mleczko (born 1949), Polish illustrator * Andrzej Nowacki (born 1953), Polish artist * Andrzej Paczkowski (born 1938), Polish historian * Sir Andrzej Panufnik (1914–1991), Polish composer * Andrzej Person, P ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computational Complexity Theory
In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and relating these classes to each other. A computational problem is a task solved by a computer. A computation problem is solvable by mechanical application of mathematical steps, such as an algorithm. A problem is regarded as inherently difficult if its solution requires significant resources, whatever the algorithm used. The theory formalizes this intuition, by introducing mathematical models of computation to study these problems and quantifying their computational complexity, i.e., the amount of resources needed to solve them, such as time and storage. Other measures of complexity are also used, such as the amount of communication (used in communication complexity), the number of gates in a circuit (used in circuit complexity) and the number of processors (used in parallel computing). One of the roles of computationa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
P Vs
P, or p, is the sixteenth letter of the Latin alphabet, used in the modern English alphabet, the alphabets of other western European languages and others worldwide. Its name in English is ''pee'' (pronounced ), plural ''pees''. History The Semitic Pê (mouth), as well as the Greek Π or π ( Pi), and the Etruscan and Latin letters that developed from the former alphabet, all symbolized , a voiceless bilabial plosive. Use in writing systems In English orthography and most other European languages, represents the sound . A common digraph in English is , which represents the sound , and can be used to transliterate ''phi'' in loanwords from Greek. In German, the digraph is common, representing a labial affricate . Most English words beginning with are of foreign origin, primarily French, Latin and Greek; these languages preserve Proto-Indo-European initial *p. Native English cognates of such words often start with , since English is a Germanic language and thus ha ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Michael Sipser
Michael Fredric Sipser (born September 17, 1954) is an American theoretical computer scientist who has made early contributions to computational complexity theory. He is a professor of applied mathematics and was the Dean of Science at the Massachusetts Institute of Technology. Biography Sipser was born and raised in Brooklyn, New York and moved to Oswego, New York when he was 12 years old. He earned his BA in mathematics from Cornell University in 1974 and his PhD in engineering from the University of California at Berkeley in 1980 under the direction of Manuel Blum.Trafton, Anne"Michael Sipser named dean of the School of Science: Sipser has served as interim dean since Marc Kastner’s departure" MIT News Office, June 5, 2014 He joined MIT's Laboratory for Computer Science as a research associate in 1979 and then was a Research Staff Member at IBM Research in San Jose. In 1980, he joined the MIT faculty. He spent the 1985-1986 academic year on the faculty of the Uni ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Viliam Geffert
Viliam Geffert (born 1955) is a Slovak theoretical computer scientist known for his contributions to the computational complexity theory in sublogarithmic space and to the state complexity of two-way finite automata. He has also developed new in-place sorting algorithms. He is a professor and the head of the computer science department at the P. J. Šafárik University in Košice. Biography Geffert did his undergraduate studies at the P. J. Šafárik University, graduating in 1979. He earned his PhD degree in 1988 from the Comenius University Comenius University in Bratislava ( sk, Univerzita Komenského v Bratislave) is the largest university in Slovakia, with most of its faculties located in Bratislava. It was founded in 1919, shortly after the creation of Czechoslovakia. It is name ... in Bratislava. Since 2003, he is a full professor of the P. J. Šafárik University. References External links * {{DEFAULTSORT:Geffert, Viliam Slovak computer scientists Theoret ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Richard J
Richard is a male given name. It originates, via Old French, from Old Frankish and is a compound of the words descending from Proto-Germanic ''*rīk-'' 'ruler, leader, king' and ''*hardu-'' 'strong, brave, hardy', and it therefore means 'strong in rule'. Nicknames include "Richie", "Dick", "Dickon", " Dickie", "Rich", "Rick", "Rico", "Ricky", and more. Richard is a common English, German and French male name. It's also used in many more languages, particularly Germanic, such as Norwegian, Danish, Swedish, Icelandic, and Dutch, as well as other languages including Irish, Scottish, Welsh and Finnish. Richard is cognate with variants of the name in other European languages, such as the Swedish "Rickard", the Catalan "Ricard" and the Italian "Riccardo", among others (see comprehensive variant list below). People named Richard Multiple people with the same name * Richard Andersen (other) * Richard Anderson (other) * Richard Cartwright (other) * Ri ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Richard E
Richard is a male given name. It originates, via Old French, from Frankish language, Old Frankish and is a Compound (linguistics), compound of the words descending from Proto-Germanic language, Proto-Germanic ''*rīk-'' 'ruler, leader, king' and ''*hardu-'' 'strong, brave, hardy', and it therefore means 'strong in rule'. Nicknames include "Richie", "Dick (nickname), Dick", "Dickon", "Dickie (name), Dickie", "Rich (given name), Rich", "Rick (given name), Rick", "Rico (name), Rico", "Ricky (given name), Ricky", and more. Richard is a common English, German and French male name. It's also used in many more languages, particularly Germanic, such as Norwegian, Danish, Swedish, Icelandic, and Dutch, as well as other languages including Irish, Scottish, Welsh and Finnish. Richard is cognate with variants of the name in other European languages, such as the Swedish "Rickard", the Catalan "Ricard" and the Italian "Riccardo", among others (see comprehensive variant list below). People ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Larry Stockmeyer
Larry Joseph Stockmeyer (1948 – 31 July 2004) was an American computer scientist. He was one of the pioneers in the field of computational complexity theory, and he also worked in the field of distributed computing. He died of pancreatic cancer. Career * 1972: BSc in mathematics, Massachusetts Institute of Technology. * 1972: MSc in electrical engineering, Massachusetts Institute of Technology. * 1974: PhD in computer science, Massachusetts Institute of Technology. ** Supervisor: Albert R. Meyer. * 1974–1982: IBM Research, Thomas J. Watson Research Center, Yorktown Heights, NY. * 1982–November 2003: IBM Research, Almaden Research Center, San Jose, CA. * October 2002–2004: University of California, Santa Cruz, Computer Science Department – Research Associate. Recognition * 1996: Fellow of the Association for Computing Machinery: "For several fundamental contributions to computational complexity theory, which have significantly affected the course of this field. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
