Theoretical computer science Theoretical computer science An algebraic semantics of a programming language is a form of axiomatic semantics based on algebraic laws for describing and reasoning about program semantics in a formal manner. ...more on Wikipedia about "Algebraic semantics"
Automated reasoning is an area of computer science dedicated to understanding different aspects of reasoning in a way that allows the creation of software which allows computers to reason completely or nearly completely automatically. As such, it is usually considered a subfield of artificial intelligence, but it also has strong connections to theoretical computer science and even philosophy. ...more on Wikipedia about "Automated reasoning"
Axiomatic Semantics is an approach based on mathematical logic to proving the correctness of computer programs. It is closely related to Hoare logic. ...more on Wikipedia about "Axiomatic semantics"
Biologically-inspired computing (also bio-inspired computing) is a field of study that loosely knits together subfields related to the topics of connectionism, social behaviour and emergence. It is often closely related to the field of artificial intelligence, as many of its pursuits can be linked to machine learning. It relies heavily on the fields of biology, computer science and mathematics. Briefly put, it is the use of computers to model nature, and simultaneously the study of nature to improve the usage of computers. Biologically-inspired computing is a major subset of natural computation. ...more on Wikipedia about "Biologically-inspired computing"
In theoretical computer science a bisimulation is an equivalence relation between state transition systems, associating systems which behave in the same way in the sense that one system simulates the other and vice-versa. ...more on Wikipedia about "Bisimulation"
Categorical logic is a branch of category theory within mathematics, adjacent to mathematical logic but in fact more notable for its connections to theoretical computer science. In broad terms, it is a theory about the transition from a type theory, understood to be within an intuitionistic logic or constructive mathematics setting, to a category, by means of a translation that respects both the syntax and the intended computational meaning of type-theoretic constructions. The subject has been recognisable in these terms since about 1970, when the needs of domain theory started to call on category theory. The earlier history is relatively complex, and contains some ironies. ...more on Wikipedia about "Categorical logic"
In programming languages, a closure is an abstraction that combines a function and a special lexical environment bound to that function ( scope). The variables in the lexical environment are designed to retain state information between function calls. Unlike garden-variety functions which retain no memory of what happened in previous calls, closures are capable of storing information across function calls. Closure lexical variables differ from global variables in that they do not occupy (or pollute) the global variable namespace. They differ from object oriented object variables in that they are bound to functions and not objects. Closures are useful when functions need to "remember" information from a previous call. One common use is for a function that needs to take a special action the first time it is called, but not in subsequent calls; closures can allow the function to 'remember' that it performed this special action the first time it was called. ...more on Wikipedia about "Closure (computer science)"
In computer science, corecursion is a type of operation that is dual to recursion. Corecursion is typically used (in conjunction with lazy evaluation) to generate infinite data structures. ...more on Wikipedia about "Corecursion"
In theoretical physics, digital physics holds the basic premise that the entire history of our universe is computable, that is, the output of a (presumably short) computer program. The hypothesis was pioneered in Konrad Zuse's book Rechnender Raum (translated by MIT into English as Calculating Space, 1970). Its proponents include Edward Fredkin , Juergen Schmidhuber, Stephen Wolfram, and Nobel laureate Gerard 't Hooft . They hold that the apparently probabilistic nature of quantum physics is not incompatible with the notion of computability. A quantum version of digital physics has recently been proposed by Seth Lloyd . ...more on Wikipedia about "Digital physics"
Don't repeat yourself (DRY) is a philosophy about information duplication. No piece of information, be it in a database or a programs source code, should ever be duplicated. In a DRY environment, you will only have to change things once — the opposite of a non-DRY environment, where you will have to do multiple changes to change one piece of information, as it is duplicated. ...more on Wikipedia about "Don't repeat yourself"
The European Association for Theoretical Computer Science (EATCS) is an international organization founded in 1972. Its aim is to facilitate the exchange of ideas and results among theoretical computer scientists as well as to stimulate cooperation between the theoretical and the practical community in computer science. ...more on Wikipedia about "EATCS"
it, an exact cover is a collection of some of the subsets Si so that every ...more on Wikipedia about "Exact cover"
In combinatorics, an expander graph refers to a sparse graph which has high connectivity properties, quantified using vertex or edge expansion as described below. Expander constructions have spawned research in pure and applied mathematics, with several applications to computer science, and in particular to theoretical computer science, design of robust computer networks and the theory of error-correcting codes. ...more on Wikipedia about "Expander graph"
In theoretical computer science, formal semantics is the field concerned with the rigorous mathematical study of the meaning of programming languages and models of computation. ...more on Wikipedia about "Formal semantics of programming languages"
Indirect self-reference describes an object referring to itself indirectly. ...more on Wikipedia about "Indirect self-reference"
The Institut national de recherche en informatique et en automatique (INRIA) is a French national research institution focusing on computer science, control theory and applied mathematics. Created in 1967 at Rocquencourt near Paris, INRIA (The National Institute for Research in Computer Science and Control) is a public scientific and technological establishment ( EPST) under the double supervision of the French Research Ministry and the Ministry of Economy, Finance and Industry. ...more on Wikipedia about "Institut national de recherche en informatique et en automatique"
Interactive computation involves communication with the external world during the computation. This is in contrast to the traditional understanding of computation which assumes a simple interface between a computing agent and its environment, consisting in asking a question (input) and generating an answer (output). ...more on Wikipedia about "Interactive computation"
A Kripke structure is a type of nondeterministic finite state machine used in model checking to represent the behaviour of a system. It is basically a graph whose nodes represent the reachable states of the system and whose edges represent state transitions. A labeling function maps each node to a set of properties that hold in the corresponding state. Temporal logics are traditionally interpreted in terms of Kripke structures. ...more on Wikipedia about "Kripke structure"
In computer science, the lambda calculus is a formal system designed to investigate function definition, function application, and recursion. It was introduced by Alonzo Church and Stephen Cole Kleene in the 1930s; Church used the lambda calculus in 1936 to give a negative answer to the Entscheidungsproblem. The calculus can be used to cleanly define what a computable function is. The question of whether two lambda calculus expressions are equivalent cannot be solved by a general algorithm, and this was the first question, even before the halting problem, for which undecidability could be proved. Lambda calculus has greatly influenced functional programming languages, especially Lisp. ...more on Wikipedia about "Lambda calculus"
Neighbour-Sensing model - the proposed hypothesis of the fungal morphogenesis. The hypothesis suggests that each hypha in the fungal mycelium generates certain abstract field that (like the known physical fields) decreases when increasing the distance. The proposed mathematical models deal with both scalar and vector fields. The field and its gradient are sensed by the hyphal tips that choose the growth direction following some supposed algorithm. The model was suggested by Audrius Meškauskas and David Moore in 2004 and proven using the supercomputing facilities of University of Manchester. ...more on Wikipedia about "Neighbour-Sensing model"
Predicate transformer semantics is an extension of Floyd-Hoare Logic invented by Dijkstra and extended and refined by other researchers. It was first introduced in Dijkstra's paper "Guarded commands, nondeterminacy and formal derivation of programs". It is a method for defining the semantics of an imperative programming language by assigning to each command in the language a corresponding predicate transformer. A predicate transformer is a total function mapping between two predicates on the state space of a program. ...more on Wikipedia about "Predicate transformer semantics"
In computer science, program verification is the process of formally proving that a computer program does exactly what is stated in the program specification it was written to realize. It is an instance of formal verification (and more generally formal methods). Program verification is more specific in that it aims to verify the code itself, not only some abstract model of the program. ...more on Wikipedia about "Program verification"
Proof and Refutations is a book by the philosopher Imre Lakatos expounding his view of ...more on Wikipedia about "Proofs and Refutations"
A recursive definition is a one which defines a word in terms of itself, albeit in a useful way. For that to work, the definition in any given case must be well founded, avoiding an infinite regress. Sometimes inductive definition is used as a synonym. ...more on Wikipedia about "Recursive definition"
The Scientific Community Metaphor is an approach to understanding scientific communities by extending pattern directed invocation programming languages that invoke high level procedural plans on the basis of messages (e.g. assertions and goals) building on the philosophy, history and sociology of science with its analysis that scientific research depends critically on monotonicity, concurrency, commutativity, and pluralism to propose, modify, support, and oppose scientific methods, practices, and theories. ...more on Wikipedia about "Scientific Community Metaphor" Made by http://www.shortopedia.com. shortopedia
This article is licensed under the GNU Free Documentation License.
It uses material from the Wikipedia . Direct links to the original articles are in the text.
If you use exact copy or modified of this article you should preserve above paragraph and put also : It uses material from
the Shortopedia article about "Theoretical computer science".
| MAIN PAGE | MAIN INDEX | CONTACT US |