Lists Of Problems

	Lists Of Problems 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 Here are some of the more commonly known problems that are PSPACE-complete when expressed as decision problems. This list is in no way comprehensive. Games and puzzles Generalized game, Generalized versions of: * Amazons (game), Amazons * At ... {{DEFAULTSORT:Problems ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu]
	List Of Philosophical Problems This is a list of some of the major problems in philosophy. Philosophy of language Counterfactuals A counterfactual statement is a conditional statement with a false antecedent. For example, the statement "If Joseph Swan had not invented the modern incandescent light bulb, then someone else would have invented it anyway" is a counterfactual, because, in fact, Joseph Swan invented the modern incandescent light bulb. The most immediate task concerning counterfactuals is that of explaining their truth-conditions. As a start, one might assert that background information is assumed when stating and interpreting counterfactual conditionals and that this background information is just every true statement about the world as it is (pre-counterfactual). In the case of the Swan statement, we have certain trends in the history of technology, the utility of artificial light, the discovery of electricity, and so on. We quickly encounter an error with this initial account: among the true st ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu]
	List Of Undecidable Problems 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. There are uncountably many undecidable problems, so the list below is necessarily incomplete. Though undecidable languages are not recursive languages, they may be subsets of Turing recognizable languages: i.e., such undecidable languages may be recursively enumerable. Many, if not most, undecidable problems in mathematics can be posed as word problems: determining when two distinct strings of symbols (encoding some mathematical concept or object) represent the same object or not. For undecidability in axiomatic mathematics, see List of statements undecidable in ZFC. Problems about abstract machines * The halting problem (determining whether a Turing machine halts on a given input) and the morta ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu]
	Lists Of Unsolved Problems List of unsolved problems may refer to several notable conjectures or open problems in various academic fields: Natural sciences, engineering and medicine * Unsolved problems in astronomy * Unsolved problems in biology * Unsolved problems in chemistry * Unsolved problems in geoscience * Unsolved problems in medicine * Unsolved problems in neuroscience * Unsolved problems in physics Mathematics, statistics and information sciences * Unsolved problems in mathematics * Unsolved problems in statistics * Unsolved problems in computer science * Unsolved problems in information theory Social sciences and humanities * Problems in philosophy * Unsolved problems in economics * Unsolved problems in fair division See also * Cold case (unsolved crimes) * List of ciphertexts * List of hypothetical technologies * List of NP-complete problems * List of paradoxes * List of PSPACE-complete problems * List of undecidable problems * List of unsolved deaths This list of unsolved death ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu]
	List Of NP-complete Problems 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 . Graphs and hypergraphs Graphs occur frequently in everyday applications. Examples include biological or social networks, which contain hundreds, thousands and even billions of nodes in some cases (e.g. Facebook or LinkedIn). * 1-planarity * 3-dimensional matching * Bandwidth problem * Bipartite dimension * Capacitated minimum spanning tree Route inspection problem (also called Chinese postman problem) for mixed graphs (having both directed and undirected edges). The program is solvable in polynomial time if the graph has all undirected or all directed edges. Variants include the rural postman problem. Clique cover problem * Clique problem * Complete coloring, a.k.a. achromatic number * Cycle rank * Degree-constrained spanning tre ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu]
	List Of PSPACE-complete Problems Here are some of the more commonly known problems that are PSPACE-complete when expressed as decision problems. This list is in no way comprehensive. Games and puzzles Generalized game, Generalized versions of: * Amazons (game), Amazons * Atomix (computer game), Atomix * Checkers if a draw is forced after a polynomial number of non-jump moves * Dyson Telescope Game * TipOver, Cross Purposes * Generalized geography, Geography * Two-player game version of Instant Insanity * Ko rule, Ko-free Go (game), Go * Ladder (Go), Ladder capturing in GoGo ladders are PSPACE-complete * m,n,k-game, Gomoku * Hex (board game), Hex * Konane * Lemmings (video game), Lemmings * Node Kayles * Poset Game * Reversi * River Cro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu]