Oxford Index Browse

You are looking at 1-10 of 10 items for:

Computing x Philosophy x clear all

Refine by type

Refine by product

 

asymptotic

Overview page. Subjects: Computing — Philosophy.

A line is asymptotic to a curve if the distance between the line and the curve tends to zero as the distance along the curve tends to infinity.

See overview in Oxford Index

Church's thesis

Overview page. Subjects: Philosophy — Computing.

The hypothesis, put forward by Alonzo Church in 1935, that any function on the natural numbers that can be computed by an algorithm can be defined by a formula of the lambda calculus. See...

See overview in Oxford Index

completeness

Overview page. Subjects: Computing — Philosophy.

The property or state of being logically or mathematically complete. In logic, an inference procedure is complete if it can derive every possible valid conclusion from the given axioms. A...

See overview in Oxford Index

computable function

Overview page. Subjects: Computing — Philosophy.

A function

f : XY

for which there exists an algorithm for evaluating f(x) for any element x in the domain X of f.

See overview in Oxford Index

connective

Overview page. Subjects: Computing — Philosophy.

In formal logic a connective is an element of a sentence that joins parts in such a way that the logical properties of the whole are a defined function of the logical properties of the...

See overview in Oxford Index

grammar

Overview page. Subjects: Computing — Philosophy.

The whole system and structure of a language or of languages in general, usually taken as consisting of syntax and morphology (including inflections) and sometimes also phonology and...

See overview in Oxford Index

modal logic

Overview page. Subjects: Computing — Philosophy.

A logic studying the notions of necessity and possibility. Modal logic was of great importance historically, particularly in the light of various doctrines concerning the necessary...

See overview in Oxford Index

ordered pair

Overview page. Subjects: Computing — Philosophy.

An ordered pair consists of two objects considered in a particular order. Thus, if a ≠ b, the ordered pair (a, b) is not the same as the ordered pair (b, a). See Cartesian product.

See overview in Oxford Index

Polish notation

Overview page. Subjects: Philosophy — Computing.

A form of notation, invented by the Polish mathematician Jan Lukasiewicz, in which each operator precedes its operands, e.g.

a + b is expressed as +ab

null...

See overview in Oxford Index

symbolic logic

Overview page. Subjects: Computing — Philosophy.

The treatment of formal logic involving the setting up of a formalized language. The propositional calculus and predicate calculus are two of the more common areas of interest.

See overview in Oxford Index