Have a deep view into what people are curious about.

Red Star (Russian: Красная звезда) is Alexander Bogdanov's 1908 science fiction novel about a communist society on Mars. The first edition was published in St. Petersburg in 1908, before eventually being republished in Moscow and Petrograd in 1918, and then again in Moscow in 1922. Set in early Russia during the Revolution of 1905 and additionally on a fictional socialist society on Mars, the novel tells the story of Leonid, a Russian scientist-revolutionary who travels to Mars to learn and experience their socialist system and to teach them of his own world. In the process, he becomes enamored of the people and technological efficiency that he encounters in this new world. An English translation by Charles Rougle was published in 1984.

In computational complexity and optimization the no free lunch theorem is a result that states that for certain types of mathematical problems, the computational cost of finding a solution, averaged over all problems in the class, is the same for any solution method. The name alludes to the saying "no such thing as a free lunch", that is, no method offers a "short cut". This is under the assumption that the search space is a probability density function. It does not apply to the case where the search space has underlying structure (e.g., is a differentiable function) that can be exploited more efficiently (e.g., Newton's method in optimization) than random search or even has closed-form solutions (e.g., the extrema of a quadratic polynomial) that can be determined without search at all. For such probabilistic assumptions, the outputs of all procedures solving a particular type of problem are statistically identical. A colourful way of describing such a circumstance, introduced by David Wolpert and William G. Macready in connection with the problems of search and optimization, is to say that there is no free lunch. Wolpert had previously derived no free lunch theorems for machine learning (statistical inference). Before Wolpert's article was published, Cullen Schaffer independently proved a restricted version of one of Wolpert's theorems and used it to critique the current state of machine learning research on the problem of induction.

In the "no free lunch" metaphor, each "restaurant" (problem-solving procedure) has a "menu" associating each "lunch plate" (problem) with a "price" (the performance of the procedure in solving the problem). The menus of restaurants are identical except in one regard – the prices are shuffled from one restaurant to the next. For an omnivore who is as likely to order each plate as any other, the average cost of lunch does not depend on the choice of restaurant. But a vegan who goes to lunch regularly with a carnivore who seeks economy might pay a high average cost for lunch. To methodically reduce the average cost, one must use advance knowledge of a) what one will order and b) what the order will cost at various restaurants. That is, improvement of performance in problem-solving hinges on using prior information to match procedures to problems.

In formal terms, there is no free lunch when the probability distribution on problem instances is such that all problem solvers have identically distributed results. In the case of search, a problem instance in this context is a particular objective function, and a result is a sequence of values obtained in evaluation of candidate solutions in the domain of the function. For typical interpretations of results, search is an optimization process. There is no free lunch in search if and only if the distribution on objective functions is invariant under permutation of the space of candidate solutions. This condition does not hold precisely in practice, but an "(almost) no free lunch" theorem suggests that it holds approximately.

In knot theory, Conway notation, invented by John Horton Conway, is a way of describing knots that makes many of their properties clear. It composes a knot using certain operations on tangles to construct it.

Rekursiv was a computer processor designed by David M. Harland in the mid-1980s for Linn Smart Computing in Glasgow, Scotland. It was one of the few computer architectures intended to implement object-oriented concepts directly in hardware, a form of high-level language computer architecture. The Rekursiv operated directly on objects rather than bits, nibbles, bytes and words. Virtual memory was used as a persistent object store and unusually, the processor instruction set supported recursion (hence the name).

The project originated in an initiative within the hi-fi manufacturer Linn Products to improve its manufacturing automation systems, which at the time ran on a DEC VAX minicomputer. This resulted in the design of Lingo, an object-oriented programming language derived from Smalltalk and ALGOL. Due to the poor performance of Lingo on the VAX, a subsidiary company, Linn Smart Computing Ltd., was formed to develop a new processor to efficiently run Lingo.

The Rekursiv processor consisted of four gate-array chips named Numerik (32-bit ALU), Logik (instruction sequencer), Objekt (object-oriented memory management unit) and Klock (processor clock and support logic). A small number of prototype VMEbus boards, called Hades, comprising these four chips plus 80 MB of RAM were produced. These were intended for installation in a host system such as a Sun-3 workstation.

Although the Rekursiv was never fully developed and was not a commercial success, several Hades boards were used in academic research projects in the UK. The last known copy of a Rekursiv computer ended up at the bottom of the Forth and Clyde canal in Glasgow.

"There's Plenty of Room at the Bottom: An Invitation to Enter a New Field of Physics" was a lecture given by physicist Richard Feynman at the annual American Physical Society meeting at Caltech on December 29, 1959. Feynman considered the possibility of direct manipulation of individual atoms as a more powerful form of synthetic chemistry than those used at the time. Although versions of the talk were reprinted in a few popular magazines, it went largely unnoticed and did not inspire the conceptual beginnings of the field. Beginning in the 1980s, nanotechnology advocates cited it to establish the scientific credibility of their work.

Swarm intelligence (SI) is the collective behavior of decentralized, self-organized systems, natural or artificial. The concept is employed in work on artificial intelligence. The expression was introduced by Gerardo Beni and Jing Wang in 1989, in the context of cellular robotic systems.

SI systems consist typically of a population of simple agents or boids interacting locally with one another and with their environment. The inspiration often comes from nature, especially biological systems. The agents follow very simple rules, and although there is no centralized control structure dictating how individual agents should behave, local, and to a certain degree random, interactions between such agents lead to the emergence of "intelligent" global behavior, unknown to the individual agents. Examples of swarm intelligence in natural systems include ant colonies, bird flocking, hawks hunting, animal herding, bacterial growth, fish schooling and microbial intelligence.

The application of swarm principles to robots is called swarm robotics, while 'swarm intelligence' refers to the more general set of algorithms. 'Swarm prediction' has been used in the context of forecasting problems. Similar approaches to those proposed for swarm robotics are considered for genetically modified organisms in synthetic collective intelligence.

Languages spoken in India belong to several language families, the major ones being the Indo-Aryan languages spoken by 78.05% of Indians and the Dravidian languages spoken by 19.64% of Indians. Languages spoken by the remaining 2.31% of the population belong to the Austroasiatic, Sino-Tibetan, Tai-Kadai and a few other minor language families and isolates. India (780) has the world's second highest number of languages, after Papua New Guinea (839).

Article 343 of the Indian constitution stated that the official language of the Union should become Hindi in Devanagari script instead of the extant English. Later, a constitutional amendment, The Official Languages Act, 1963, allowed for the continuation of English alongside Hindi in the Indian government indefinitely until legislation decides to change it. The form of numerals to be used for the official purposes of the Union are "the international form of Indian numerals", which are referred to as Arabic numerals in most English-speaking countries. Despite the misconceptions, Hindi is not the national language of India. The Constitution of India does not give any language the status of national language.

The Eighth Schedule of the Indian Constitution lists 22 languages, which have been referred to as scheduled languages and given recognition, status and official encouragement. In addition, the Government of India has awarded the distinction of classical language to Kannada, Malayalam, Odia, Sanskrit, Tamil and Telugu. Classical language status is given to languages which have a rich heritage and independent nature.

According to the Census of India of 2001, India has 122 major languages and 1599 other languages. However, figures from other sources vary, primarily due to differences in definition of the terms "language" and "dialect". The 2001 Census recorded 30 languages which were spoken by more than a million native speakers and 122 which were spoken by more than 10,000 people. Two contact languages have played an important role in the history of India: Persian and English. Persian was the court language during the Mughal period in India. It reigned as an administrative language for several centuries until the era of British colonisation. English continues to be an important language in India. It is used in higher education and in some areas of the Indian government. Hindi, the most commonly spoken language in India today, serves as the lingua franca across much of North and Central India. Bengali is the second most spoken and understood language in the country with a significant amount of speakers in Eastern and North- eastern regions. However, there have been concerns raised with Hindi being imposed in South India, most notably in the state of Tamil Nadu and Karnataka. Maharashtra, West Bengal, Assam, Punjab and other non-Hindi regions have also started to voice concerns about Hindi.

Brandolini's law, also known as the bullshit asymmetry principle, is an internet adage which emphasizes the difficulty of debunking bullshit: "The amount of energy needed to refute bullshit is an order of magnitude bigger than to produce it."

Bir Tawil (Egyptian Arabic: بير طويل, romanized: Bīr Ṭawīl, lit. 'tall water well', [biːɾ tˤɑˈwiːl]) is a 2,060 km² (795.4 sq mi) area of land along the border between Egypt and Sudan, which is uninhabited and claimed by neither country. When spoken of in association with the neighbouring Halaib Triangle, it is sometimes referred to as the Bir Tawil Triangle, despite the area's quadrilateral shape; the two "triangles" border at a quadripoint.

Its terra nulliuscode: lat promoted to code: la status results from a discrepancy between the straight political boundary between Egypt and Sudan established in 1899, and the irregular administrative boundary established in 1902. Egypt asserts the political boundary, and Sudan asserts the administrative boundary, with the result that the Hala'ib Triangle is claimed by both and Bir Tawil by neither. In 2014, author Alastair Bonnett described Bir Tawil as the only place on Earth that was habitable but was not claimed by any recognised government.