
	Where results make sense

Topic: List of computability and complexity topics

Related Topics

Computational complexity theory

Turing reduction

List of open problems in computer science

Reduction (complexity)

Theory of computation

FNP (complexity)

Polynomial time

Oracle machine

Complexity classes P and NP

Algorithmic probability

Vertex cover problem

Boolean satisfiability problem

Hamiltonian path problem

Traveling salesman problem

Set cover problem

	Computational complexity theory - Wikipedia, the free encyclopedia
		Complexity theory is part of the theory of computation dealing with the resources required during computation to solve a given problem.
		Complexity theory differs from computability theory, which deals with whether a problem can be solved at all, regardless of the resources required.
		The time complexity of a problem is the number of steps that it takes to solve an instance of the problem as a function of the size of the input (usually measured in bits), using the most efficient algorithm.
	en.wikipedia.org /wiki/Computational_complexity (1129 words)

	List of complexity classes - Wikipedia, the free encyclopedia
		This is a list of complexity classes in computational complexity theory.
		For other computational and complexity subjects, see list of computability and complexity topics.
		See computation for a chart showing which classes are subsets of other classes.
	en.wikipedia.org /wiki/List_of_complexity_classes (494 words)

	Computational complexity theory -- Facts, Info, and Encyclopedia article (Site not responding. Last check: 2007-10-08)
		Complexity theory is part of the (Click link for more info and facts about theory of computation) theory of computation dealing with the resources required during computation to solve a given problem.
		Complexity theory differs from (Click link for more info and facts about computability theory) computability theory, which deals with whether a problem can be solved at all, regardless of the resources required.
		Many complexity classes can be characterized in terms of the (Any logical system that abstracts the form of statements away from their content in order to establish abstract criteria of consistency and validity) mathematical logic needed to express them; see (Click link for more info and facts about descriptive complexity) descriptive complexity.
	www.absoluteastronomy.com /encyclopedia/c/co/computational_complexity_theory.htm (1304 words)

	info/guide/n/np/np_hard_2 - Info and Guide.
		Complexity classes P and NP - Complexity classes P and NP Computational complexity theory is part of the theory of computation dealing with the resources required during computation to solve a given problem.
		List of computability and complexity topics - Computability theory is the part of the theory of computation that deals with what can be computed, in principle.
		Computational complexity theory - exactly in the middle - then the problem is reduced to the half).
	pheeds.com /info/guide/n/np/np_hard_2.html (1938 words)

	CONK! Encyclopedia: Category:Topic_lists (Site not responding. Last check: 2007-10-08)
		See Lists of articles by category for a structured list and overview.
		List of formal language and literal string topics
		List of harmonic analysis and representation theory topics
	www.conk.com /search/encyclopedia.cgi?q=Category:Topic_lists (86 words)

	W4236 Syllabus (Site not responding. Last check: 2007-10-08)
		Many computational problems (such as multiplying two numbers, or sorting a list of numbers) are known to be "easy" in the sense that we have efficient algorithms for them.
		Unfortunately, many other computational problems of great practical importance (such as factoring large numbers, or finding the shortest tour that passes through all the cities on a map) seem to be difficult, in the sense that no efficient algorithms are known.
		Over the past few decades, computational complexity has emerged as one of the most dynamic, interesting and important areas in computer science; indeed, the core question of computational complexity theory ("does P equal NP?") is now widely viewed as one of the most famous and important open questions in all of computer science and mathematics.
	www.cs.columbia.edu /~cs4236 (995 words)

	bqp
		It denotes the class of problems solvable by a quantum computer in polynomial time, with an error probability of at most 1/4 for all instances.
		In other words, there is an algorithm for a quantum computer that is guaranteed to run in polynomial time.
		The number of qubits in the computer is allowed to be a function of the instance size.
	www.fact-library.com /bqp.html (238 words)

	FS2: Computability and Complexity (Site not responding. Last check: 2007-10-08)
		Roughly speaking, the subject matter of the theory of computability is the precise definition of the informal concept of algorithm, and the characterization of those problems that can (or, perhaps more intriguingly, cannot) conceivably be solved by means of algorithms.
		In a nutshell, one may say that, whereas computability theory is concerned with the class of problems that can or cannot be solved algorithmically, complexity theory aims at characterizing the problems for which efficient algorithmic solutions can conceivably be found.
		We shall also touch upon the important topic of space complexity, where we classify the difficulty of solving a computational problem based on a measure of the amount of memory that it takes to compute the solution in the worst case.
	www.cs.auc.dk /~luca/FS2/kb2002-text.html (1416 words)

	Search Here - Computers - Algorithms - Complexity
		Complexity of Algorithms - A list of topics from a Computer Science course involving complexity of algorithms.
		Computational Complexity and Programming Languages - Summaries of talks of the DIMACS workshop (July 1996), collected by James Royer.
		ECCC - Electronic Colloquium on Computational Complexity - A forum for the rapid and widespread interchange of ideas, techniques, and research in computational complexity.
	www.clickheretoleave.com /Computers/Algorithms/Complexity (463 words)

	Amazon.com: Books: Computability, Complexity, and Languages : Fundamentals of Theoretical Computer Science (Computer ... (Site not responding. Last check: 2007-10-08)
		In part 4, issues in computational complexity are addressed, the measure of complexity given in terms of the Blum axioms.
		The polynomial-time computability is discussed along with the famous P vs NP problem, with the discussion given in terms of Turing machines.
		Truly understanding Computability and Complexity as Professor Davis teaches them with this book is in my opinion a definitely high achievement, bringing the sensation that you grasp it totally, with no space for ambiguity or weakness.
	www.amazon.com /exec/obidos/tg/detail/-/0122063821?v=glance (2316 words)

	LIST OF ARTICLES BY CATEGORY
		None of these are yet comprehensive or up-to-date, but filling in or creating these lists will create an easy way to track articles by their categories, as well as creating an implicit to-do list of topics for which articles have not yet been written.
		List of astronomical topics, expanded list of topics from N-Z
		List of anomalous phenomenon (paranormal) and parapsychology topics
	www.websters-online-dictionary.org /definition/LIST+OF+ARTICLES+BY+CATEGORY (307 words)

	COS 487, Fall 2000: Home Page
		Computability Theory ("What can or cannot be computed?") and Complexity Theory ("How efficient can a certain computation be?").
		Complexity theory: time and space hierarchy theorems, polynomial time computations, P v/s NP, NP-completeness and PSPACE-completeness.
		The assignment questions have been carefully selected for their pedagogical value and may be similar to questions on problem sets from past offerings of this course or courses at other universities.
	www.cs.princeton.edu /courses/archive/fall00/cs487 (337 words)

	Read about List of complexity classes at WorldVillage Encyclopedia. Research List of complexity classes and learn about ... (Site not responding. Last check: 2007-10-08)
		Research List of complexity classes and learn about List of complexity classes here!
		computation for a chart showing which classes are subsets of other classes.
		Complexity Zoo (http://www.complexityzoo.com) - list of over 400 complexity classes and their properties
	encyclopedia.worldvillage.com /s/b/List_of_complexity_classes (378 words)

	Computational Complexity: 03/28/2004 - 04/03/2004
		Computational complexity and other fun stuff in math and computer science as viewed by Lance Fortnow.
		Basic topics like Turing machines, undecidability, NP-completeness, Savitch's theorem and time and space hierarchies still get taught much the way they were taught in the 70's.
		As computers become more and more part of our daily lives, these basic questions take on greater importance and I'm excited, as always, to tackle them with a new group of students.
	weblog.fortnow.com /archive/2004_03_28_archive.html (1589 words)

	Stas Busygin's NP-Completeness Page
		In 60's-70's of the last century there was developed a conception designating a hierarchy of complexity classes for problems on finite sets.
		And so long as we use digital computers with finite memory storing discrete objects to resolve computational problems, it is relevant for any non-trivial algorithm designing.
		And it is also in NP as when someone gives us another list asserting it is a sorted version of the first one, we can easily look through it to check the order and compare elements to verify are they the same as initial.
	www.busygin.dp.ua /npc.html (896 words)

	User:Orcmid - Wikipedia, the free encyclopedia
		Well, it is not like me to leave a page empty, so for now I should just say that there is more about Orcmid's interests at nfoCentrale, and a place where there may be more some day on Orcmid's Lair.
		My interest in being here is related to the treatment of algorithms, heuristics, and computation theory (including the Church-Turing Thesis).
		These also point out a number of topics to address in my own treatment of WikiText and Wiki functionality for nfoWiki, an nfoWare project.
	www.wikipedia.org /wiki/User:Orcmid (268 words)

	lecture 1
		They are used for accounting; they are used in automobiles to improve fuel economy and control emissions; they are used to forecast weather; and there are even some indications that computers can exhibit intelligent behavior.
		This seminar explores these questions by investigating several models of computation, illustrating the power and limitations of each of these models, and relating these models to computational problems and applications.
		Topics include finite state automata, pushdown automata, grammars, Turing Machines, the Universal Turing Machine, and Computability.
	www.mtholyoke.edu /courses/cfennema/cs-311/fall-2002/syllabus.htm (977 words)

	Amazon.com: Books: Computational Complexity (Site not responding. Last check: 2007-10-08)
		Computers and Intractability : A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) by M.
		His prose is very engaging and he covers just about every topic (although be it lightly) relevant in modern complexity theory without overly diluting the proofs and results (for example, he gives a nice concise proof of Razborov's theorem on monotone circuits).
		Computational Complexity is a great introduction to contemporary formal logic, which is more heavily mathematical than even the great mathematical logicians of the past were.
	www.amazon.com /exec/obidos/tg/detail/-/0201530821?v=glance (1236 words)

	Complexity Theory Lecture Notes (preface)
		The field is concerned with the study of the intrinsic complexity of computational tasks, and this study tend to aim at generality: It focuses on natural computational resources, and the effect of limiting those on the class of problems that can be solved.
		Most of the presented material is quite independent of the specific (reasonable) model of computation, but some (e.g., Lectures 5, 16, and 19-20) depends heavily on the locality of computation of Turing machines.
		A good undergraduate computability course should cover this material, but unfortunately this is often not the case.
	www.wisdom.weizmann.ac.il /~/odedg/cc-pre.html (882 words)

	Computability Science, Directory (Site not responding. Last check: 2007-10-08)
		Computability Theory Directory of researchers working in computability theory, and list of open problems.
		Bibliographic Database for Computability Theory Extensive bibliography on computability and recursion theory, maintained by Peter Cholak.
		ECCC - Electronic Colloquium on Computational Complexity The Electronic Colloquium on Computational Complexity is a new forum for the rapid and widespread interchange of ideas, techniques, and research in computational complexity.
	www.indiapolicyinstitute.org /aW5kXzI2OTIw.aspx (175 words)

	Kolmogorov Complexity and Solomonoff Induction (Site not responding. Last check: 2007-10-08)
		The Kolmogorov Complexity mailing list is a moderated mailing list intended for people in Computer Sciences, Statistics, Mathematics, and other areas or disciplines with interests in Kolmogorov Complexity and Solomonoff Induction.
		Unfortunately the mailing list service ceased to exist and also Olivier's interest moved to different topics, but he was so kind to give me all information to continue this service.
		A gentle tour of Kolmogorov complexity and its applications, presented by Chris Hillman at UIUC, April 1999, in PostScript.
	www.idsia.ch /~marcus/kolmo.htm (1120 words)

	A List of Papers on Complexity at Higher Types
		Roughly the first half of this is a survey of complexity at higher types mainly focusing on type level 2.
		As far as I can tell this is the first paper to consider the question of the computational complexity of functionals and operators (as opposed to using functionals and operators as tools).
		J. Royer, On the Computational Complexity of Longley's H Functional, to appear in Theoretical Computer Science, presented at ICC'00.
	www.cis.syr.edu /people/royer/bib2.html (2176 words)

	Open Directory - Science: Math: Logic and Foundations: Computability (Site not responding. Last check: 2007-10-08)
		Computability and Complexity in Analysis Network - The CCA Network provides some useful information for researchers working in the field of computability and complexity in analysis.
		Computability Theory - Directory of researchers working in computability theory, and list of open problems.
		ECCC - Electronic Colloquium on Computational Complexity - The Electronic Colloquium on Computational Complexity is a new forum for the rapid and widespread interchange of ideas, techniques, and research in computational complexity.
	dmoz.org /Science/Math/Logic_and_Foundations/Computability (264 words)

	Complex Travel
		But there are still those who are reluctant to give computer radios a try, mainly because of the complexity involved in programming them and their higher cost.
		Topics, format, submission of papers, preliminary registration, accommodation, location, important dates, fees and travel information.
		Computational complexity theory deals with how hard computations are, in quantitative terms, both with upper bounds (algorithms whose complexity in the...
	www.wncwabash.com /20/99.html (822 words)

	Computational Complexity Theory Encyclopedia Article, Definition, History, Biography (Site not responding. Last check: 2007-10-08)
		Looking For computational complexity theory - Find computational complexity theory and more at Lycos Search.
		Find computational complexity theory - Your relevant result is a click away!
		Look for computational complexity theory - Find computational complexity theory at one of the best sites the Internet has to offer!
	www.karr.net /search/encyclopedia/Computational_complexity_theory (1327 words)

	List of computability and complexity topics -- Facts, Info, and Encyclopedia article (Site not responding. Last check: 2007-10-08)
		(Click link for more info and facts about Computability theory) Computability theory is the part of the theory of (Problem solving that involves numbers or quantities) computation that deals with what can be computed, in principle.
		For more abstract foundational matters, see the (Click link for more info and facts about list of mathematical logic topics) list of mathematical logic topics.
		See also (Click link for more info and facts about list of algorithms) list of algorithms, (Click link for more info and facts about list of algorithm general topics) list of algorithm general topics.
	www.absoluteastronomy.com /encyclopedia/L/Li/List_of_computability_and_complexity_topics.htm (2384 words)

Try your search on: Qwika (all wikis)