deductive+machine

См. также в других словарях:

• Machine learning — is a subfield of artificial intelligence that is concerned with the design and development of algorithms and techniques that allow computers to learn . In general, there are two types of learning: inductive, and deductive. Inductive machine… …   Wikipedia

• analytic philosophy — n. a 20th cent. philosophic movement characterized by its method of analyzing concepts and statements in the light of common experience and ordinary language so as to eliminate confusions of thought and resolve many traditional philosophical… …   Universalium

• applied logic — Introduction       the study of the practical art of right reasoning. The formalism (formal logic) and theoretical results of pure logic can be clothed with meanings derived from a variety of sources within philosophy as well as from other… …   Universalium

• Descartes: methodology — Stephen Gaukroger INTRODUCTION The seventeenth century is often referred to as the century of the Scientific Revolution, a time of fundamental scientific change in which traditional theories were either replaced by new ones or radically… …   History of philosophy

• artificial intelligence — the capacity of a computer to perform operations analogous to learning and decision making in humans, as by an expert system, a program for CAD or CAM, or a program for the perception and recognition of shapes in computer vision systems. Abbr.:… …   Universalium

• metaphysics — /met euh fiz iks/, n. (used with a sing. v.) 1. the branch of philosophy that treats of first principles, includes ontology and cosmology, and is intimately connected with epistemology. 2. philosophy, esp. in its more abstruse branches. 3. the… …   Universalium

• Fallacy — In logic and rhetoric, a fallacy is usually incorrect argumentation in reasoning resulting in a misconception or presumption. By accident or design, fallacies may exploit emotional triggers in the listener or interlocutor (appeal to emotion), or… …   Wikipedia

• List of computer science conferences — This is a list of academic conferences in computer science. Most of these academic conferences are annual or bi annual events.The order with which the conferences are listed in their respective fields corresponds to a rough and non authoritative… …   Wikipedia

• Gödel's incompleteness theorems — In mathematical logic, Gödel s incompleteness theorems, proved by Kurt Gödel in 1931, are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest. The theorems are of… …   Wikipedia

• History of logic — Philosophy ( …   Wikipedia

• LOGIQUES NON CLASSIQUES — La logique formelle «classique» (cf. histoire de la LOGIQUE, LOGIQUE MATHÉMATIQUE, théorie de la DÉMONSTRATION) est une théorie de l’inférence valide qui ne prend pas en considération le contenu sémantique de l’argument. Elle est une logique… …   Encyclopédie Universelle