|
Shepherdson–Sturgis Register Machine
In mathematical logic and theoretical computer science a register machine is a generic class of abstract machines used in a manner similar to a Turing machine. All the models are Turing equivalent. Overview The register machine gets its name from its use of one or more " registers". In contrast to the tape and head used by a Turing machine, the model uses multiple, uniquely addressed registers, each of which holds a single positive integer. There are at least four sub-classes found in literature, here listed from most primitive to the most like a computer: * Counter machine – the most primitive and reduced theoretical model of a computer hardware. Lacks indirect addressing. Instructions are in the finite state machine in the manner of the Harvard architecture. * Pointer machine – a blend of counter machine and RAM models. Less common and more abstract than either model. Instructions are in the finite state machine in the manner of the Harvard architecture. *Random-ac ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematical Logic
Mathematical logic is the study of logic, formal logic within mathematics. Major subareas include model theory, proof theory, set theory, and recursion theory. Research in mathematical logic commonly addresses the mathematical properties of formal systems of logic such as their expressive or deductive power. However, it can also include uses of logic to characterize correct mathematical reasoning or to establish foundations of mathematics. Since its inception, mathematical logic has both contributed to and been motivated by the study of foundations of mathematics. This study began in the late 19th century with the development of axiomatic frameworks for geometry, arithmetic, and Mathematical analysis, analysis. In the early 20th century it was shaped by David Hilbert's Hilbert's program, program to prove the consistency of foundational theories. Results of Kurt Gödel, Gerhard Gentzen, and others provided partial resolution to the program, and clarified the issues involved in pr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gerald Jay Sussman
Gerald Jay Sussman (born February 8, 1947) is the Panasonic Professor of Electrical Engineering at the Massachusetts Institute of Technology (MIT). He received his S.B. and Ph.D. degrees in mathematics from MIT in 1968 and 1973 respectively. He has been involved in artificial intelligence (AI) research at MIT since 1964. His research has centered on understanding the problem-solving strategies used by scientists and engineers, with the goals of automating parts of the process and formalizing it to provide more effective methods of science and engineering education. Sussman has also worked in computer languages, in computer architecture and in Very Large Scale Integration (VLSI) design. Education Sussman attended the Massachusetts Institute of Technology as an undergraduate and received his S.B. in mathematics in 1968. He continued his studies at MIT and obtained a Ph.D. in 1973, also in mathematics, under the supervision of Seymour Papert. His doctoral thesis was titled "A Co ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Heinz Kaphengst
The H. J. Heinz Company is an American food processing company headquartered at One PPG Place in Pittsburgh, Pennsylvania. The company was founded by Henry J. Heinz in 1869. Heinz manufactures thousands of food products in plants on six continents, and markets these products in more than 200 countries and territories. The company claims to have 150 number-one or number-two brands worldwide. Heinz ranked first in ketchup in the US with a market share in excess of 50%; the Ore-Ida label held 46% of the frozen potato sector in 2003. Since 1896, the company has used its " 57 Varieties" slogan; it was inspired by a sign advertising 21 styles of shoes, and Henry Heinz chose the number 57 even though the company manufactured more than 60 products at the time, because "5" was his lucky number and "7" was his wife's. In February 2013, Heinz agreed to be purchased by Berkshire Hathaway and the Brazilian investment firm 3G Capital for $23billion. On March 25, 2015, Kraft announced its m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rózsa Péter
Rózsa Péter, born Rózsa Politzer, (17 February 1905 – 16 February 1977) was a Hungarian mathematician and logician. She is best known as the "founding mother of recursion theory". Early life and education Péter was born in Budapest, Hungary, as Rózsa Politzer (Hungarian: Politzer Rózsa). She attended Pázmány Péter University (now Eötvös Loránd University), originally studying chemistry but later switching to mathematics. She attended lectures by Lipót Fejér and József Kürschák. While at university, she met László Kalmár; they would collaborate in future years and Kalmár encouraged her to pursue her love of mathematics. After graduating in 1927, Péter could not find a permanent teaching position although she had passed her exams to qualify as a mathematics teacher. Due to the effects of the Great Depression, many university graduates could not find work and Péter began private tutoring. At this time, she also began her graduate studies. Professional ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hans Hermes
Hans Hermes (; 12 February 1912 – 10 November 2003) was a German mathematician and logician, who made significant contributions to the foundations of mathematical logic. Hermes was born in Neunkirchen, Germany. Personal life From 1931, Hermes studied mathematics, physics, chemistry, biology and philosophy at the University of Freiburg. In 1937, he passed the state examination in Münster and was attending there in 1938 when the physicist Adolf Kratzer was present. After that, he went on a scholarship to the University of Göttingen and then became an assistant at the University of Bonn. During World War II, he was a soldier on the Channel Island of Jersey until 1943 and then on to the Chemical Physics Institute of the Navy in Kiel. At the end of the war, he moved to Toplitzsee, where he was tasked with working on new encryption methods. In 1947, he became a lecturer at the University of Bonn where he took his habilitation, his thesis called ''Analytical manifolds in Riemannia ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Diophantine Equation
In mathematics, a Diophantine equation is an equation, typically a polynomial equation in two or more unknowns with integer coefficients, such that the only solutions of interest are the integer ones. A linear Diophantine equation equates to a constant the sum of two or more monomials, each of degree one. An exponential Diophantine equation is one in which unknowns can appear in exponents. Diophantine problems have fewer equations than unknowns and involve finding integers that solve simultaneously all equations. As such systems of equations define algebraic curves, algebraic surfaces, or, more generally, algebraic sets, their study is a part of algebraic geometry that is called ''Diophantine geometry''. The word ''Diophantine'' refers to the Hellenistic mathematician of the 3rd century, Diophantus of Alexandria, who made a study of such equations and was one of the first mathematicians to introduce symbolism into algebra. The mathematical study of Diophantine problems that Di ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hilbert's Problems
Hilbert's problems are 23 problems in mathematics published by German mathematician David Hilbert in 1900. They were all unsolved at the time, and several proved to be very influential for 20th-century mathematics. Hilbert presented ten of the problems (1, 2, 6, 7, 8, 13, 16, 19, 21, and 22) at the Paris conference of the International Congress of Mathematicians, speaking on August 8 at the University of Paris, Sorbonne. The complete list of 23 problems was published later, in English translation in 1902 by Mary Frances Winston Newson in the ''Bulletin of the American Mathematical Society''. Earlier publications (in the original German) appeared in and Nature and influence of the problems Hilbert's problems ranged greatly in topic and precision. Some of them, like the 3rd problem, which was the first to be solved, or the 8th problem (the Riemann hypothesis), which still remains unresolved, were presented precisely enough to enable a clear affirmative or negative answer ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Emil Post
Emil Leon Post (; February 11, 1897 – April 21, 1954) was an American mathematician and logician. He is best known for his work in the field that eventually became known as computability theory. Life Post was born in Augustów, Suwałki Governorate, Congress Poland, Russian Empire (now Poland) into a Polish-Jewish family that immigrated to New York City in May 1904. His parents were Arnold and Pearl Post. Post had been interested in astronomy, but at the age of twelve lost his left arm in a car accident. This loss was a significant obstacle to being a professional astronomer, leading to his decision to pursue mathematics rather than astronomy. Post attended the Townsend Harris High School and continued on to graduate from City College of New York in 1917 with a B.S. in Mathematics. After completing his Ph.D. in mathematics in 1920 at Columbia University, supervised by Cassius Jackson Keyser, he did a post-doctorate at Princeton University in the 1920–1921 academic year. Pos ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Program
A computer program is a sequence or set of instructions in a programming language for a computer to execute. Computer programs are one component of software, which also includes documentation and other intangible components. A computer program in its human-readable form is called source code. Source code needs another computer program to execute because computers can only execute their native machine instructions. Therefore, source code may be translated to machine instructions using the language's compiler. ( Assembly language programs are translated using an assembler.) The resulting file is called an executable. Alternatively, source code may execute within the language's interpreter. If the executable is requested for execution, then the operating system loads it into memory and starts a process. The central processing unit will soon switch to this process so it can fetch, decode, and then execute each machine instruction. If the source code is requested for execution, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Partial Recursive Function
In mathematical logic and computer science, a general recursive function, partial recursive function, or μ-recursive function is a partial function from natural numbers to natural numbers that is "computable" in an intuitive sense – as well as in a formal one. If the function is total, it is also called a total recursive function (sometimes shortened to recursive function). In computability theory, it is shown that the μ-recursive functions are precisely the functions that can be computed by Turing machines (this is one of the theorems that supports the Church–Turing thesis). The μ-recursive functions are closely related to primitive recursive functions, and their inductive definition (below) builds upon that of the primitive recursive functions. However, not every total recursive function is a primitive recursive function—the most famous example is the Ackermann function. Other equivalent classes of functions are the functions of lambda calculus and the functions tha ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Counter Machine
A counter machine is an abstract machine used in a formal logic and theoretical computer science to model computation. It is the most primitive of the four types of register machines. A counter machine comprises a set of one or more unbounded ''registers'', each of which can hold a single non-negative integer, and a list of (usually sequential) arithmetic and control instructions for the machine to follow. The counter machine is typically used in the process of designing parallel algorithms in relation to the mutual exclusion principle. When used in this manner, the counter machine is used to model the discrete time-steps of a computational system in relation to memory accesses. By modeling computations in relation to the memory accesses for each respective computational step, parallel algorithms may be designed in such a matter to avoid interlocking, the simultaneous writing operation by two (or more) threads to the same memory address. Basic features For a given counter machin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
