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.
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.
Sensory neuronSensory neurons, also known as afferent neurons, are neurons in the nervous system, that convert a specific type of stimulus, via their receptors, into action potentials or graded receptor potentials. This process is called sensory transduction. The cell bodies of the sensory neurons are located in the dorsal ganglia of the spinal cord. The sensory information travels on the afferent nerve fibers in a sensory nerve, to the brain via the spinal cord.
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.
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.
Age of consentThe age of consent is the age at which a person is considered to be legally competent to consent to sexual acts. Consequently, an adult who engages in sexual activity with a person younger than the age of consent is unable to legally claim that the sexual activity was consensual, and such sexual activity may be considered child sexual abuse or statutory rape. The person below the minimum age is considered the victim, and their sex partner the offender, although some jurisdictions provide exceptions through "Romeo and Juliet laws" if one or both participants are underage, and are close in age.
Age of majorityThe age of majority is the threshold of legal adulthood as recognized or declared in law. It is the moment when a person ceases to be considered a minor and assumes legal control over their person, actions, and decisions, thus terminating the control and legal responsibilities of their parents or guardian over them. Most countries set the age of majority at 18, but some jurisdictions have a higher age and others lower. The word majority here refers to having greater years and being of full age as opposed to minority, the state of being a minor.
Circuit complexityIn theoretical computer science, circuit complexity is a branch of computational complexity theory in which Boolean functions are classified according to the size or depth of the Boolean circuits that compute them. A related notion is the circuit complexity of a recursive language that is decided by a uniform family of circuits (see below). Proving lower bounds on size of Boolean circuits computing explicit Boolean functions is a popular approach to separating complexity classes.
Context-free languageIn formal language theory, a context-free language (CFL) is a language generated by a context-free grammar (CFG). Context-free languages have many applications in programming languages, in particular, most arithmetic expressions are generated by context-free grammars. Different context-free grammars can generate the same context-free language. Intrinsic properties of the language can be distinguished from extrinsic properties of a particular grammar by comparing multiple grammars that describe the language.
Marriageable ageMarriageable age (or marriage age) is the general age, as a legal age or as the minimum age subject to parental, religious or other forms of social approval, at which a person is legitimately allowed for marriage. Age and other prerequisites to marriage vary between jurisdictions, but in the vast majority of jurisdictions, the marriage age as a right is set at the age of majority. Nevertheless, most jurisdictions allow marriage at a younger age with parental or judicial approval, especially if the female is pregnant.
