Search results
Results from the WOW.Com Content Network
Another form of logic puzzle, popular among puzzle enthusiasts and available in magazines dedicated to the subject, is a format in which the set-up to a scenario is given, as well as the object (for example, determine who brought what dog to a dog show, and what breed each dog was), certain clues are given ("neither Misty nor Rex is the German Shepherd"), and then the reader fills out a matrix ...
In computability theory, an undecidable problem is a decision problem for which an effective method (algorithm) to derive the correct answer does not exist. More formally, an undecidable problem is a problem whose language is not a recursive set ; see the article Decidable language .
Many mathematical problems have been stated but not yet solved. These problems come from many areas of mathematics, such as theoretical physics, computer science, algebra, analysis, combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory, dynamical systems, and partial differential equations.
The Wason selection task (or four-card problem) is a logic puzzle devised by Peter Cathcart Wason in 1966. [1] [2] [3] It is one of the most famous tasks in the study of deductive reasoning. [4] An example of the puzzle is: You are shown a set of four cards placed on a table, each of which has a number on one side and a color on the other.
This is a list of mathematical logic topics. For traditional syllogistic logic, see the list of topics in logic . See also the list of computability and complexity topics for more theory of algorithms .
Sleeping Beauty problem: A probability problem that can be correctly answered as one half or one third depending on how the question is approached. Three Prisoners problem , also known as the Three Prisoners paradox: [ 3 ] A variation of the Monty Hall problem .
The biadjacency matrix of a simple, undirected bipartite graph is a (0, 1)-matrix, and any (0, 1)-matrix arises in this way. The prime factors of a list of m square-free, n-smooth numbers can be described as an m × π(n) (0, 1)-matrix, where π is the prime-counting function, and a ij is 1 if and only if the jth prime divides the ith number.
[8] Three utilities problem – Connect three cottages to gas, water, and electricity without crossing lines. [9] Thirty-six officers problem – Arrange six regiments consisting of six officers each of different ranks in a 6 × 6 square so that no rank or regiment is repeated in any row or column. [10]