 |
Real Computation
In computability theory, the theory of real computation deals with hypothetical computing machines using infinite-precision real numbers. They are given this name because they operate on the set of real numbers. Within this theory, it is possible to prove interesting statements such as "The complement of the Mandelbrot set is only partially decidable." These hypothetical computing machines can be viewed as idealised analog computers which operate on real numbers, whereas digital computers are limited to computable numbers. They may be further subdivided into differential and algebraic models (digital computers, in this context, should be thought of as topological, at least insofar as their operation on computable reals is concerned). Depending on the model chosen, this may enable real computers to solve problems that are inextricable on digital computers (For example, Hava Siegelmann's neural nets can have noncomputable real weights, making them able to compute nonrecursive lan ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
Operational Amplifier Integrator
An operational definition specifies concrete, replicable procedures designed to represent a construct. In the words of American psychologist S.S. Stevens (1935), "An operation is the performance which we execute in order to make known a concept." For example, an operational definition of "fear" (the construct) often includes measurable physiologic responses that occur in response to a perceived threat. Thus, "fear" might be operationally defined as specified changes in heart rate, galvanic skin response, pupil dilation, and blood pressure. Overview An operational definition is designed to model or represent a concept or theoretical definition, also known as a construct. Scientists should describe the operations (procedures, actions, or processes) that define the concept with enough specificity such that other investigators can replicate their research. Operational definitions are also used to define system states in terms of a specific, publicly accessible process of preparation ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Blum–Shub–Smale Machine
In computation theory, the Blum–Shub–Smale machine, or BSS machine, is a model of computation introduced by Lenore Blum, Michael Shub and Stephen Smale, intended to describe computations over the real numbers. Essentially, a BSS machine is a Random Access Machine with registers that can store arbitrary real numbers and that can compute rational functions over reals in a single time step. It is often referred to as Real RAM model. BSS machines are more powerful than Turing machines, because the latter are by definition restricted to a finite alphabet. A Turing machine can be empowered to store arbitrary rational numbers in a single tape symbol by making that finite alphabet arbitrarily large (in terms of a physical machine using transistor-based memory, building its memory locations of enough transistors to store the desired number), but this does not extend to the uncountable real numbers (for example, no number of transistors can accurately represent Pi). Definition A BSS ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Stephen Smale
Stephen Smale (born July 15, 1930) is an American mathematician, known for his research in topology, dynamical systems and mathematical economics. He was awarded the Fields Medal in 1966 and spent more than three decades on the mathematics faculty of the University of California, Berkeley (1960–1961 and 1964–1995), where he currently is Professor Emeritus, with research interests in algorithms, numerical analysis and global analysis. Education and career Smale was born in Flint, Michigan and entered the University of Michigan in 1948. Initially, he was a good student, placing into an honors calculus sequence taught by Bob Thrall and earning himself A's. However, his sophomore and junior years were marred with mediocre grades, mostly Bs, Cs and even an F in nuclear physics. However, with some luck, Smale was accepted as a graduate student at the University of Michigan's mathematics department. Yet again, Smale performed poorly in his first years, earning a C average as a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Lenore Blum
Lenore Carol Blum (née Epstein, born December 18, 1942) is an American computer scientist and mathematician who has made pioneering contributions to the theories of real number computation, cryptography, and pseudorandom number generation. She was a distinguished career professor of computer science at Carnegie Mellon University until 2019 and is currently a professor in residence at the University of California, Berkeley. She is also known for her efforts to increase diversity in mathematics and computer science. Early life and education Blum was born to a Jewish family in New York City, where her mother was a science teacher. They moved to Venezuela when Blum was nine. After graduating from her Venezuelan high school at age 16, she studied architecture at Carnegie Institute of Technology (now Carnegie Mellon University) beginning in 1959. With the assistance of Alan Perlis, she shifted fields to mathematics in 1960. She married Manuel Blum, then a student at the Massachuset ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Hypercomputation
Hypercomputation or super-Turing computation refers to models of computation that can provide outputs that are not Turing-computable. Super-Turing computing, introduced at the early 1990's by Hava Siegelmann, refers to such neurological inspired, biological and physical realizable computing; It became the mathematical foundations of Lifelong Machine Learning. Hypercomputation, introduced as a field of science in the late 1990s, is said to be based on the Super Turing but it also includes constructs which are philosophical. For example, a machine that could solve the halting problem would be a hypercomputer; so too would one that can correctly evaluate every statement in Peano arithmetic. The Church–Turing thesis states that any "computable" function that can be computed by a mathematician with a pen and paper using a finite set of simple algorithms, can be computed by a Turing machine. Hypercomputers compute functions that a Turing machine cannot and which are, hence, not comput ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
SIGACT
ACM SIGACT or SIGACT is the Association for Computing Machinery Special Interest Group on Algorithms and Computation Theory, whose purpose is support of research in theoretical computer science. It was founded in 1968 by Patrick C. Fischer. Publications SIGACT publishes a quarterly print newsletter, ''SIGACT News''. Its online version, ''SIGACT News Online'', is available since 1996 for SIGACT members, with unrestricted access to some features. Conferences SIGACT sponsors or has sponsored several annual conferences. *COLT: Conference on Learning Theory, until 1999 *PODC: ACM Symposium on Principles of Distributed Computing (jointly sponsored by SIGOPS) *PODS: ACM Symposium on Principles of Database Systems *POPL: ACM Symposium on Principles of Programming Languages *SOCG: ACM Symposium on Computational Geometry (jointly sponsored by SIGGRAPH), until 2014 *SODA: ACM/SIAM Symposium on Discrete Algorithms (jointly sponsored by the Society for Industrial and Applied Mathematics) ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Scott Aaronson
Scott Joel Aaronson (born May 21, 1981) is an American theoretical computer scientist and David J. Bruton Jr. Centennial Professor of Computer Science at the University of Texas at Austin. His primary areas of research are quantum computing and computational complexity theory. Early life and education Aaronson grew up in the United States, though he spent a year in Asia when his father—a science writer turned public-relations executive—was posted to Hong Kong. He enrolled in a school there that permitted him to skip ahead several years in math, but upon returning to the US, he found his education restrictive, getting bad grades and having run-ins with teachers. He enrolled in The Clarkson School, a gifted education program run by Clarkson University, which enabled Aaronson to apply for colleges while only in his freshman year of high school. He was accepted into Cornell University, where he obtained his BSc in computer science in 2000, [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
 |
Bekenstein Bound
In physics, the Bekenstein bound (named after Jacob Bekenstein) is an upper limit on the thermodynamic entropy ''S'', or Shannon entropy ''H'', that can be contained within a given finite region of space which has a finite amount of energy—or conversely, the maximal amount of information required to perfectly describe a given physical system down to the quantum level. It implies that the information of a physical system, or the information necessary to perfectly describe that system, must be finite if the region of space and the energy are finite. In computer science this implies that non-finite models such as Turing machines are not realizable as finite devices. Equations The universal form of the bound was originally found by Jacob Bekenstein in 1981 as the inequality : S \leq \frac, where ''S'' is the entropy, ''k'' is the Boltzmann constant, ''R'' is the radius of a sphere that can enclose the given system, ''E'' is the total mass–energy including any rest masses, ''ħ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
Holographic Principle
The holographic principle is an axiom in string theories and a supposed property of quantum gravity that states that the description of a volume of space can be thought of as encoded on a lower-dimensional boundary to the region — such as a light-like boundary like a gravitational horizon. First proposed by Gerard 't Hooft, it was given a precise string-theory interpretation by Leonard Susskind, who combined his ideas with previous ones of 't Hooft and Charles Thorn. Leonard Susskind said, “The three-dimensional world of ordinary experience––the universe filled with galaxies, stars, planets, houses, boulders, and people––is a hologram, an image of reality coded on a distant two-dimensional surface." As pointed out by Raphael Bousso, Thorn observed in 1978 that string theory admits a lower-dimensional description in which gravity emerges from it in what would now be called a holographic way. The prime example of holography is the AdS/CFT correspondence. The ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
 |
Polynomial Time
In computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Time complexity is commonly estimated by counting the number of elementary operations performed by the algorithm, supposing that each elementary operation takes a fixed amount of time to perform. Thus, the amount of time taken and the number of elementary operations performed by the algorithm are taken to be related by a constant factor. Since an algorithm's running time may vary among different inputs of the same size, one commonly considers the worst-case time complexity, which is the maximum amount of time required for inputs of a given size. Less common, and usually specified explicitly, is the average-case complexity, which is the average of the time taken on inputs of a given size (this makes sense because there are only a finite number of possible inputs of a given size). In both cases, the time complexity is generally express ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
Sharp P
Sharp or SHARP may refer to: Acronyms * SHARP (helmet ratings) (Safety Helmet Assessment and Rating Programme), a British motorcycle helmet safety rating scheme * Self Help Addiction Recovery Program, a charitable organisation founded in 1991 by Barbara Bach and Pattie Boyd * Sexual Harassment/Assault Response & Prevention, a US Army program dealing with sexual harassment * Skinheads Against Racial Prejudice, an anti-racist Trojan skinhead organization formed to combat White power skinheads * Society for the History of Authorship, Reading and Publishing * Stationary High Altitude Relay Platform, a 1980s beamed-power aircraft * Super High Altitude Research Project, a 1990s project to develop a high-velocity gun Companies * I. P. Sharp Associates, a former Canadian computer services company * Sharp Airlines, an Australian regional airline * Sharp Corporation, a Japanese electronics manufacturer * Sharp Entertainment, an American TV program producer * Sharp HealthCare, a hospi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
 |
NP-complete
In computational complexity theory, a problem is NP-complete when: # it is a problem for which the correctness of each solution can be verified quickly (namely, in polynomial time) and a brute-force search algorithm can find a solution by trying all possible solutions. # the problem can be used to simulate every other problem for which we can verify quickly that a solution is correct. In this sense, NP-complete problems are the hardest of the problems to which solutions can be verified quickly. If we could find solutions of some NP-complete problem quickly, we could quickly find the solutions of every other problem to which a given solution can be easily verified. The name "NP-complete" is short for "nondeterministic polynomial-time complete". In this name, "nondeterministic" refers to nondeterministic Turing machines, a way of mathematically formalizing the idea of a brute-force search algorithm. Polynomial time refers to an amount of time that is considered "quick" for a det ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |