Search results
Results From The WOW.Com Content Network
The following articles contain lists of problems: List of philosophical problems; List of undecidable problems; Lists of unsolved problems; List of NP-complete problems; List of PSPACE-complete problems
Practice theory (or praxeology, theory of social practices) is a body of social theory within anthropology and sociology that explains society and culture as the result of structure and individual agency. Practice theory emerged in the late 20th century and was first outlined in the work of the French sociologist Pierre Bourdieu.
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.
This is a list of some of the more commonly known problems that are NP-complete when expressed as decision problems. As there are thousands of such problems known, this list is in no way comprehensive. Many problems of this type can be found in Garey & Johnson (1979).
The problem of determining if a given set of Wang tiles can tile the plane. The problem of determining the Kolmogorov complexity of a string. Hilbert's tenth problem: the problem of deciding whether a Diophantine equation (multivariable polynomial equation) has a solution in integers.
Open problems around exact algorithms by Gerhard J. Woeginger, Discrete Applied Mathematics 156 (2008) 397–405. The RTA list of open problems – open problems in rewriting. The TLCA List of Open Problems – open problems in area typed lambda calculus
The opposite has also been claimed, for example by Karl Popper, who held that such problems do exist, that they are solvable, and that he had actually found definite solutions to some of them. David Chalmers divides inquiry into philosophical progress in meta-philosophy into three questions.
In computational complexity theory, Karp's 21 NP-complete problems are a set of computational problems which are NP-complete.In his 1972 paper, "Reducibility Among Combinatorial Problems", [1] Richard Karp used Stephen Cook's 1971 theorem that the boolean satisfiability problem is NP-complete [2] (also called the Cook-Levin theorem) to show that there is a polynomial time many-one reduction ...