|
Self-reference
Self-reference occurs in natural or formal languages when a sentence, idea or formula refers to itself. The reference may be expressed either directly—through some intermediate sentence or formula—or by means of some encoding. In philosophy, it also refers to the ability of a subject to speak of or refer to itself, that is, to have the kind of thought expressed by the first person nominative singular pronoun "I" in English. Self-reference is studied and has applications in mathematics, philosophy, computer programming, second-order cybernetics, and linguistics, as well as in humor. Self-referential statements are sometimes paradoxical, and can also be considered recursive. In logic, mathematics and computing In classical philosophy, paradoxes were created by self-referential concepts such as the omnipotence paradox of asking if it was possible for a being to exist so powerful that it could create a stone that it could not lift. The Epimenides paradox, 'All Cre ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ouroboros
The ouroboros or uroboros () is an ancient symbol depicting a serpent or dragon eating its own tail. The ouroboros entered Western tradition via ancient Egyptian iconography and the Greek magical tradition. It was adopted as a symbol in Gnosticism and Hermeticism and most notably in alchemy. The term derives , from ''oura'' 'tail' plus ''-boros'' '-eating'. The ''ouroboros'' is often interpreted as a symbol for eternal cyclic renewal or a cycle of life, death, and rebirth; the snake’s skin-sloughing symbolizes the transmigration of souls. The snake biting its own tail is a fertility symbol in some religions: the tail is a phallic symbol and the mouth is a yonic or womb-like symbol. Some snakes, such as rat snakes, have been known to consume themselves. One captive snake attempted to consume itself twice, dying in the second attempt. Another wild rat snake was found having swallowed about two-thirds of its body. Historical representations Ancient Egypt One o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Self-referential Humor
Self-referential humor, also known as self-reflexive humor, self-aware humor, or meta humor, is a type of comedic expression that—either directed toward some other subject, or openly directed toward itself—is self-referential in some way, intentionally alluding to the very person who is expressing the humor in a comedic fashion, or to some specific aspect of that same comedic expression. Self-referential humor expressed discreetly and surrealistically is a form of bathos. In general, self-referential humor often uses hypocrisy, oxymoron, or paradox to create a contradictory or otherwise absurd situation that is humorous to the audience. History Old Comedy of Classical Athens is held to be the first—in the extant sources—form of self-referential comedy. Aristophanes, whose plays form the only remaining fragments of Old Comedy, used fantastical plots, grotesque and inhuman masks and status reversals of characters to slander prominent politicians and court his audienc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Recursion
Recursion (adjective: ''recursive'') occurs when a thing is defined in terms of itself or of its type. Recursion is used in a variety of disciplines ranging from linguistics to logic. The most common application of recursion is in mathematics and computer science, where a function being defined is applied within its own definition. While this apparently defines an infinite number of instances (function values), it is often done in such a way that no infinite loop or infinite chain of references ("crock recursion") can occur. Formal definitions In mathematics and computer science, a class of objects or methods exhibits recursive behavior when it can be defined by two properties: * A simple ''base case'' (or cases) — a terminating scenario that does not use recursion to produce an answer * A ''recursive step'' — a set of rules that reduces all successive cases toward the base case. For example, the following is a recursive definition of a person's ''ancestor''. One's anc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Recursion
Recursion (adjective: ''recursive'') occurs when a thing is defined in terms of itself or of its type. Recursion is used in a variety of disciplines ranging from linguistics to logic. The most common application of recursion is in mathematics and computer science, where a function being defined is applied within its own definition. While this apparently defines an infinite number of instances (function values), it is often done in such a way that no infinite loop or infinite chain of references ("crock recursion") can occur. Formal definitions In mathematics and computer science, a class of objects or methods exhibits recursive behavior when it can be defined by two properties: * A simple ''base case'' (or cases) — a terminating scenario that does not use recursion to produce an answer * A ''recursive step'' — a set of rules that reduces all successive cases toward the base case. For example, the following is a recursive definition of a person's ''ancestor''. One's anc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Paradoxes
A paradox is a logically self-contradictory statement or a statement that runs contrary to one's expectation. It is a statement that, despite apparently valid reasoning from true premises, leads to a seemingly self-contradictory or a logically unacceptable conclusion. A paradox usually involves contradictory-yet-interrelated elements that exist simultaneously and persist over time. They result in "persistent contradiction between interdependent elements" leading to a lasting "unity of opposites". In logic, many paradoxes exist that are known to be invalid arguments, yet are nevertheless valuable in promoting critical thinking, while other paradoxes have revealed errors in definitions that were assumed to be rigorous, and have caused axioms of mathematics and logic to be re-examined. One example is Russell's paradox, which questions whether a "list of all lists that do not contain themselves" would include itself, and showed that attempts to found set theory on the identification ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
I (pronoun)
In Modern English, ''I'' is the singular, first-person pronoun. Morphology In Standard Modern English, ''I'' has five distinct word forms: * ''I'': the nominative (subjective) form **''I'' is the only pronoun form that is always capitalized in English. This practice became established in the late 15th century, though lowercase ''i'' was sometimes found as late as the 17th century. * ''me'': the accusative (objective) forms (The accusative case is also called the ' oblique'.) * ''my:'' the dependent genitive (possessive) form * ''mine'': the independent genitive * ''myself'': the reflexive form History Old English had a first person pronoun that inflected for four cases and three numbers. ''I'' originates from Old English (OE) ''ic'', which had in turn originated from the continuation of Proto-Germanic *''ik'', and ''ek''; The asterisk denotes an unattested form, but ''ek'' was attested in the Elder Futhark inscriptions (in some cases notably showing the variant ''e ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Paradox
A paradox is a logically self-contradictory statement or a statement that runs contrary to one's expectation. It is a statement that, despite apparently valid reasoning from true premises, leads to a seemingly self-contradictory or a logically unacceptable conclusion. A paradox usually involves contradictory-yet-interrelated elements that exist simultaneously and persist over time. They result in "persistent contradiction between interdependent elements" leading to a lasting "unity of opposites". In logic, many paradoxes exist that are known to be invalid arguments, yet are nevertheless valuable in promoting critical thinking, while other paradoxes have revealed errors in definitions that were assumed to be rigorous, and have caused axioms of mathematics and logic to be re-examined. One example is Russell's paradox, which questions whether a "list of all lists that do not contain themselves" would include itself, and showed that attempts to found set theory on the identification ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Impredicativity
In mathematics, logic and philosophy of mathematics, something that is impredicative is a self-referencing definition. Roughly speaking, a definition is impredicative if it invokes (mentions or quantifies over) the set being defined, or (more commonly) another set that contains the thing being defined. There is no generally accepted precise definition of what it means to be predicative or impredicative. Authors have given different but related definitions. The opposite of impredicativity is predicativity, which essentially entails building stratified (or ramified) theories where quantification over lower levels results in variables of some new type, distinguished from the lower types that the variable ranges over. A prototypical example is intuitionistic type theory, which retains ramification so as to discard impredicativity. Russell's paradox is a famous example of an impredicative construction—namely the set of all sets that do not contain themselves. The paradox is that ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Second-order Cybernetics
Second-order cybernetics, also known as the cybernetics of cybernetics, is the recursive application of cybernetics to itself and the reflexive practice of cybernetics according to such a critique. It is cybernetics where "the role of the observer is appreciated and acknowledged rather than disguised, as had become traditional in western science". Glanville, R. (2002). "Second order cybernetics." In F. Parra-Luna (ed.), Systems science and cybernetics. In ''Encyclopaedia of Life Support Systems'' (EOLSS). OxfordEoLSS Second-order cybernetics was developed between the late 1960s and mid 1970s by Heinz von Foerster and others, with key inspiration coming from Margaret Mead. Foerster referred to it as "the control of control and the communication of communication" and differentiated first order cybernetics as "the cybernetics of observed systems" and second-order cybernetics as "the cybernetics of observing systems". Foerster, Heinz von, ed. ''Cybernetics of Cybernetics: Or, the Contro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Russell's Paradox
In mathematical logic, Russell's paradox (also known as Russell's antinomy) is a set-theoretic paradox discovered by the British philosopher and mathematician Bertrand Russell in 1901. Russell's paradox shows that every set theory that contains an unrestricted comprehension principle leads to contradictions. The paradox had already been discovered independently in 1899 by the German mathematician Ernst Zermelo. However, Zermelo did not publish the idea, which remained known only to David Hilbert, Edmund Husserl, and other academics at the University of Göttingen. At the end of the 1890s, Georg Cantor – considered the founder of modern set theory – had already realized that his theory would lead to a contradiction, which he told Hilbert and Richard Dedekind by letter. According to the unrestricted comprehension principle, for any sufficiently well-defined property, there is the set of all and only the objects that have that property. Let ''R'' be the set of all sets ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Consistency
In classical deductive logic, a consistent theory is one that does not lead to a logical contradiction. The lack of contradiction can be defined in either semantic or syntactic terms. The semantic definition states that a theory is consistent if it has a model, i.e., there exists an interpretation under which all formulas in the theory are true. This is the sense used in traditional Aristotelian logic, although in contemporary mathematical logic the term ''satisfiable'' is used instead. The syntactic definition states a theory T is consistent if there is no formula \varphi such that both \varphi and its negation \lnot\varphi are elements of the set of consequences of T. Let A be a set of closed sentences (informally "axioms") and \langle A\rangle the set of closed sentences provable from A under some (specified, possibly implicitly) formal deductive system. The set of axioms A is consistent when \varphi, \lnot \varphi \in \langle A \rangle for no formula \varphi. If there ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
The Halting Problem
In computability theory, the halting problem is the problem of determining, from a description of an arbitrary computer program and an input, whether the program will finish running, or continue to run forever. Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program–input pairs cannot exist. For any program that might determine whether programs halt, a "pathological" program , called with some input, can pass its own source and its input to ''f'' and then specifically do the opposite of what ''f'' predicts ''g'' will do. No ''f'' can exist that handles this case. A key part of the proof is a mathematical definition of a computer and program, which is known as a Turing machine; the halting problem is '' undecidable'' over Turing machines. It is one of the first cases of decision problems proven to be unsolvable. This proof is significant to practical computing efforts, defining a class of applications which no programming inventi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
