Complexity classIn computational complexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly analyzed resources are time and memory. In general, a complexity class is defined in terms of a type of computational problem, a model of computation, and a bounded resource like time or memory. In particular, most complexity classes consist of decision problems that are solvable with a Turing machine, and are differentiated by their time or space (memory) requirements.
Computational complexityIn computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time (generally measured by the number of needed elementary operations) and memory storage requirements. The complexity of a problem is the complexity of the best algorithms that allow solving the problem. The study of the complexity of explicitly given algorithms is called analysis of algorithms, while the study of the complexity of problems is called computational complexity theory.
Computational complexity theoryIn theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and relating these classes to each other. A computational problem is a task solved by a computer. A computation problem is solvable by mechanical application of mathematical steps, such as an algorithm. A problem is regarded as inherently difficult if its solution requires significant resources, whatever the algorithm used.
Space complexityThe space complexity of an algorithm or a computer program is the amount of memory space required to solve an instance of the computational problem as a function of characteristics of the input. It is the memory required by an algorithm until it executes completely. This includes the memory space used by its inputs, called input space, and any other (auxiliary) memory it uses during execution, which is called auxiliary space. Similar to time complexity, space complexity is often expressed asymptotically in big O notation, such as etc.
Parameterized complexityIn computer science, parameterized complexity is a branch of computational complexity theory that focuses on classifying computational problems according to their inherent difficulty with respect to multiple parameters of the input or output. The complexity of a problem is then measured as a function of those parameters. This allows the classification of NP-hard problems on a finer scale than in the classical setting, where the complexity of a problem is only measured as a function of the number of bits in the input.
ComplexityComplexity characterises the behaviour of a system or model whose components interact in multiple ways and follow local rules, leading to non-linearity, randomness, collective dynamics, hierarchy, and emergence. The term is generally used to characterize something with many parts where those parts interact with each other in multiple ways, culminating in a higher order of emergence greater than the sum of its parts. The study of these complex linkages at various scales is the main goal of complex systems theory.
Kolmogorov complexityIn algorithmic information theory (a subfield of computer science and mathematics), the Kolmogorov complexity of an object, such as a piece of text, is the length of a shortest computer program (in a predetermined programming language) that produces the object as output. It is a measure of the computational resources needed to specify the object, and is also known as algorithmic complexity, Solomonoff–Kolmogorov–Chaitin complexity, program-size complexity, descriptive complexity, or algorithmic entropy.
PovertyPoverty is a state or condition in which one lacks the financial resources and essentials for a certain standard of living. Poverty can have diverse social, economic, and political causes and effects. When evaluating poverty in statistics or economics there are two main measures: absolute poverty compares income against the amount needed to meet basic personal needs, such as food, clothing, and shelter; relative poverty measures when a person cannot meet a minimum level of living standards, compared to others in the same time and place.
Cycle of povertyIn economics, a cycle of poverty or poverty trap is caused by self-reinforcing mechanisms that cause poverty, once it exists, to persist unless there is outside intervention. It can persist across generations, and when applied to developing countries, is also known as a development trap. Families trapped in the cycle of poverty have few to no resources. There are many self-reinforcing disadvantages that make it virtually impossible for individuals to break the cycle.
United Nations Development ProgrammeThe United Nations Development Programme (UNDP) is a United Nations agency tasked with helping countries eliminate poverty and achieve sustainable economic growth and human development. The UNDP emphasizes developing local capacity towards long-term self-sufficiency and prosperity. Based at United Nations Headquarters in New York City, it is the largest UN development aid agency, with offices in 177 countries. The UNDP is funded entirely by voluntary contributions from UN member states.
Poverty reductionPoverty reduction, poverty relief, or poverty alleviation is a set of measures, both economic and humanitarian, that are intended to permanently lift people out of poverty. Measures, like those promoted by Henry George in his economics classic Progress and Poverty, are those that raise, or are intended to raise, ways of enabling the poor to create wealth for themselves as a conduit of ending poverty forever. In modern times, various economists within the Georgism movement propose measures like the land value tax to enhance access to the natural world for all.
StrategyStrategy (from Greek στρατηγία stratēgia, "art of troop leader; office of general, command, generalship") is a general plan to achieve one or more long-term or overall goals under conditions of uncertainty. In the sense of the "art of the general", which included several subsets of skills including military tactics, siegecraft, logistics etc., the term came into use in the 6th century C.E. in Eastern Roman terminology, and was translated into Western vernacular languages only in the 18th century.
Theories of povertyTheories on the causes of poverty are the foundation upon which poverty reduction strategies are based. While in developed nations poverty is often seen as either a personal or a structural defect, in developing nations the issue of poverty is more profound due to the lack of governmental funds. Some theories on poverty in the developing world focus on cultural characteristics as a retardant of further development.
