|
Interactions Of Actors Theory
In information theory, Interactions of actors theory is a theory developed by Gordon Pask and Gerard de Zeeuw. It is a generalisation of Pask's earlier conversation theory: The chief distinction being that conversation theory focuses on analysing the specific features that allow a conversation to emerge between two participants, whereas interaction of actor's theory focuses on the broader domain of conversation in which conversations may appear, disappear, and reappear over time. Overview Interactions of actors theory was developed late in Pask's career. It is reminiscent of Freud's psychodynamics, Bateson's panpsychism (see "Mind and Nature: A Necessary Unity" 1980). Pask's nexus of analogy, dependence and mechanical spin produces the differences that are central to cybernetics. While working with clients in the last years of his life, Pask produced an axiomatic scheme for his interactions of actors theory, less well-known than his conversation theory. ''Interactions of Actors ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gordon Pask
Andrew Gordon Speedie Pask (28 June 1928 – 29 March 1996) was an English author, inventor, educational theorist, cybernetician and psychologist who made contributions to cybernetics, instructional psychology, experimental epistemology and educational technology. Pask first learned about cybernetics in the early 1950s when the originator of the subject, Norbert Wiener, spoke at Cambridge University, where Pask was an undergraduate student. Pask was asked to be of assistance during Wiener's talk. Holding three doctorate degrees, Pask published more than 250 journal articles, books, patents and technical reports from funding from United States Armed Forces, the British Ministry of Defence, the British Home Office and the British Road Research Laboratory. He taught at the University of Illinois, Old Dominion University, Concordia University, Open University, University of New Mexico, Architectural Association School of Architecture and MIT. Biography Pask was born in Derby, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Knot Theory
In the mathematical field of topology, knot theory is the study of knot (mathematics), mathematical knots. While inspired by knots which appear in daily life, such as those in shoelaces and rope, a mathematical knot differs in that the ends are joined so it cannot be undone, Unknot, the simplest knot being a ring (or "unknot"). In mathematical language, a knot is an embedding of a circle in 3-dimensional Euclidean space, \mathbb^3 (in topology, a circle is not bound to the classical geometric concept, but to all of its homeomorphisms). Two mathematical knots are equivalent if one can be transformed into the other via a deformation of \mathbb^3 upon itself (known as an ambient isotopy); these transformations correspond to manipulations of a knotted string that do not involve cutting it or passing through itself. Knots can be described in various ways. Using different description methods, there may be more than one description of the same knot. For example, a common method of descr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Theorem
In mathematics, a theorem is a statement that has been proved, or can be proved. The ''proof'' of a theorem is a logical argument that uses the inference rules of a deductive system to establish that the theorem is a logical consequence of the axioms and previously proved theorems. In the mainstream of mathematics, the axioms and the inference rules are commonly left implicit, and, in this case, they are almost always those of Zermelo–Fraenkel set theory with the axiom of choice, or of a less powerful theory, such as Peano arithmetic. A notable exception is Wiles's proof of Fermat's Last Theorem, which involves the Grothendieck universes whose existence requires the addition of a new axiom to the set theory. Generally, an assertion that is explicitly called a theorem is a proved result that is not an immediate consequence of other known theorems. Moreover, many authors qualify as ''theorems'' only the most important results, and use the terms ''lemma'', ''proposition'' and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Concurrency (computer Science)
In computer science, concurrency is the ability of different parts or units of a program, algorithm, or problem to be executed out-of-order or in partial order, without affecting the outcome. This allows for parallel execution of the concurrent units, which can significantly improve overall speed of the execution in multi-processor and multi-core systems. In more technical terms, concurrency refers to the decomposability of a program, algorithm, or problem into order-independent or partially-ordered components or units of computation. According to Rob Pike, concurrency is the composition of independently executing computations, and concurrency is not parallelism: concurrency is about dealing with lots of things at once but parallelism is about doing lots of things at once. Concurrency is about structure, parallelism is about execution, concurrency provides a way to structure a solution to solve a problem that may (but not necessarily) be parallelizable. A number of mathema ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Heinz Von Foerster
Heinz von Foerster (German spelling: Heinz von Förster; November 13, 1911 – October 2, 2002) was an Austrian American scientist combining physics and philosophy, and widely attributed as the originator of Second-order cybernetics. He was twice a Guggenheim fellow (1956–57 and 1963–64) and also was a fellow of the American Association for the Advancement of Science, 1980. He is well known for his 1960 Doomsday equation formula published in ''Science'' predicting future population growth. As a polymath, he wrote nearly two hundred professional papers, gaining renown in fields from computer science and artificial intelligence to epistemology, and researched high-speed electronics and electro-optics switching devices as a physicist, and in biophysics, the study of memory and knowledge. He worked on cognition based on neurophysiology, mathematics, and philosophy and was called "one of the most consequential thinkers in the history of cybernetics". He came to the United States, an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Atomic Number
The atomic number or nuclear charge number (symbol ''Z'') of a chemical element is the charge number of an atomic nucleus. For ordinary nuclei, this is equal to the proton number (''n''p) or the number of protons found in the nucleus of every atom of that element. The atomic number can be used to uniquely identify ordinary chemical elements. In an ordinary uncharged atom, the atomic number is also equal to the number of electrons. For an ordinary atom, the sum of the atomic number ''Z'' and the neutron number ''N'' gives the atom's atomic mass number ''A''. Since protons and neutrons have approximately the same mass (and the mass of the electrons is negligible for many purposes) and the mass defect of the nucleon binding is always small compared to the nucleon mass, the atomic mass of any atom, when expressed in unified atomic mass units (making a quantity called the "relative isotopic mass"), is within 1% of the whole number ''A''. Atoms with the same atomic number but dif ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Epistemology
Epistemology (; ), or the theory of knowledge, is the branch of philosophy concerned with knowledge. Epistemology is considered a major subfield of philosophy, along with other major subfields such as ethics, logic, and metaphysics. Epistemologists study the nature, origin, and scope of knowledge, epistemic justification, the rationality of belief, and various related issues. Debates in epistemology are generally clustered around four core areas: # The philosophical analysis of the nature of knowledge and the conditions required for a belief to constitute knowledge, such as truth and justification # Potential sources of knowledge and justified belief, such as perception, reason, memory, and testimony # The structure of a body of knowledge or justified belief, including whether all justified beliefs must be derived from justified foundational beliefs or whether justification requires only a coherent set of beliefs # Philosophical skepticism, which questions the possibili ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Analogy
Analogy (from Greek ''analogia'', "proportion", from ''ana-'' "upon, according to" lso "against", "anew"+ ''logos'' "ratio" lso "word, speech, reckoning" is a cognitive process of transferring information or meaning from a particular subject (the analog, or source) to another (the target), or a linguistic expression corresponding to such a process. In a narrower sense, analogy is an inference or an argument from one particular to another particular, as opposed to deduction, induction, and abduction, in which at least one of the premises, or the conclusion, is general rather than particular in nature. The term analogy can also refer to the relation between the source and the target themselves, which is often (though not always) a similarity, as in the biological notion of analogy. Analogy plays a significant role in problem solving, as well as decision making, argumentation, perception, generalization, memory, creativity, invention, prediction, emotion, explanation, concep ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Truth Value
In logic and mathematics, a truth value, sometimes called a logical value, is a value indicating the relation of a proposition to truth, which in classical logic has only two possible values (''true'' or '' false''). Computing In some programming languages, any expression can be evaluated in a context that expects a Boolean data type. Typically (though this varies by programming language) expressions like the number zero, the empty string, empty lists, and null evaluate to false, and strings with content (like "abc"), other numbers, and objects evaluate to true. Sometimes these classes of expressions are called "truthy" and "falsy" / "false". Classical logic In classical logic, with its intended semantics, the truth values are ''true'' (denoted by ''1'' or the verum ⊤), and '' untrue'' or '' false'' (denoted by ''0'' or the falsum ⊥); that is, classical logic is a two-valued logic. This set of two values is also called the Boolean domain. Corresponding semantics of l ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Von Neumann Architecture
The von Neumann architecture — also known as the von Neumann model or Princeton architecture — is a computer architecture based on a 1945 description by John von Neumann, and by others, in the ''First Draft of a Report on the EDVAC''. The document describes a design architecture for an electronic digital computer with these components: * A processing unit with both an arithmetic logic unit and processor registers * A control unit that includes an instruction register and a program counter * Memory that stores data and instructions * External mass storage * Input and output mechanisms.. The term "von Neumann architecture" has evolved to refer to any stored-program computer in which an instruction fetch and a data operation cannot occur at the same time (since they share a common bus). This is referred to as the von Neumann bottleneck, which often limits the performance of the corresponding system. The design of a von Neumann architecture machine is simpler than in a Harva ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quantum Computing
Quantum computing is a type of computation whose operations can harness the phenomena of quantum mechanics, such as superposition, interference, and entanglement. Devices that perform quantum computations are known as quantum computers. Though current quantum computers may be too small to outperform usual (classical) computers for practical applications, larger realizations are believed to be capable of solving certain computational problems, such as integer factorization (which underlies RSA encryption), substantially faster than classical computers. The study of quantum computing is a subfield of quantum information science. There are several models of quantum computation with the most widely used being quantum circuits. Other models include the quantum Turing machine, quantum annealing, and adiabatic quantum computation. Most models are based on the quantum bit, or "qubit", which is somewhat analogous to the bit in classical computation. A qubit can be in a 1 or 0 quantum s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stafford Beer
Anthony Stafford Beer (25 September 1926 – 23 August 2002) was a British theorist, consultant and professor at the Manchester Business School. He is best known for his work in the fields of operational research and management cybernetics. Biography Early life Beer was born in Putney, London in 1926. At age 17 he was expelled from Whitgift School and enrolled for a degree in philosophy at University College London. But in 1944 he left to join the army, first as Gunner in the Royal Artillery, but he soon received a commission first in the Royal Fusiliers, and then as a company commander in the 9th Gurkha Rifles. He saw service in India and stayed there until 1947. Upon returning to England he was assigned to the Human factors Branch of Operations research at the War Office. In 1949, he was demobilised, having reached the rank of captain. He dropped the use of his first name "Anthony" when he was about twenty-one and persuaded his brother, Ian Beer, to sign a statement that he w ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.PNG "Click for more on -> Theorem")
.jpg "Click for more on -> Quantum Computing")
