Random Articles
Have a deep view into what people are curious about.
🔗 Bohm Dialogue
Bohm Dialogue (also known as Bohmian Dialogue or "Dialogue in the Spirit of David Bohm") is a freely flowing group conversation in which participants attempt to reach a common understanding, experiencing everyone's point of view fully, equally and nonjudgementally. This can lead to new and deeper understanding. The purpose is to solve the communication crises that face society, and indeed the whole of human nature and consciousness. It utilizes a theoretical understanding of the way thoughts relate to universal reality. It is named after physicist David Bohm who originally proposed this form of dialogue.
Discussed on
- "Bohm Dialogue" | 2019-10-02 | 46 Upvotes 14 Comments
🔗 Corecursion
In computer science, corecursion is a type of operation that is dual to recursion. Whereas recursion works analytically, starting on data further from a base case and breaking it down into smaller data and repeating until one reaches a base case, corecursion works synthetically, starting from a base case and building it up, iteratively producing data further removed from a base case. Put simply, corecursive algorithms use the data that they themselves produce, bit by bit, as they become available, and needed, to produce further bits of data. A similar but distinct concept is generative recursion which may lack a definite "direction" inherent in corecursion and recursion.
Where recursion allows programs to operate on arbitrarily complex data, so long as they can be reduced to simple data (base cases), corecursion allows programs to produce arbitrarily complex and potentially infinite data structures, such as streams, so long as it can be produced from simple data (base cases) in a sequence of finite steps. Where recursion may not terminate, never reaching a base state, corecursion starts from a base state, and thus produces subsequent steps deterministically, though it may proceed indefinitely (and thus not terminate under strict evaluation), or it may consume more than it produces and thus become non-productive. Many functions that are traditionally analyzed as recursive can alternatively, and arguably more naturally, be interpreted as corecursive functions that are terminated at a given stage, for example recurrence relations such as the factorial.
Corecursion can produce both finite and infinite data structures as results, and may employ self-referential data structures. Corecursion is often used in conjunction with lazy evaluation, to produce only a finite subset of a potentially infinite structure (rather than trying to produce an entire infinite structure at once). Corecursion is a particularly important concept in functional programming, where corecursion and codata allow total languages to work with infinite data structures.
Discussed on
- "Corecursion" | 2014-05-08 | 167 Upvotes 62 Comments
🔗 Invented Tradition
Invented traditions are cultural practices that are presented or perceived as traditional, arising from the people starting in the distant past, but which in fact are relatively recent and often even consciously invented by identifiable historical actors. The concept was highlighted in the 1983 book The Invention of Tradition, edited by Eric Hobsbawm and Terence Ranger. Hobsbawm's introduction argues that many "traditions" which "appear or claim to be old are often quite recent in origin and sometimes invented." This "invention" is distinguished from "starting" or "initiating" a tradition that does not then claim to be old. The phenomenon is particularly clear in the modern development of the nation and of nationalism, creating a national identity promoting national unity, and legitimising certain institutions or cultural practices.
Discussed on
- "Invented Tradition" | 2023-09-03 | 41 Upvotes 22 Comments
🔗 Tierra (Computer Simulation)
Tierra is a computer simulation developed by ecologist Thomas S. Ray in the early 1990s in which computer programs compete for time (central processing unit (CPU) time) and space (access to main memory). In this context, the computer programs in Tierra are considered to be evolvable and can mutate, self-replicate and recombine. Tierra's virtual machine is written in C. It operates on a custom instruction set designed to facilitate code changes and reordering, including features such as jump to template (as opposed to the relative or absolute jumps common to most instruction sets).
Discussed on
- "Tierra (Computer Simulation)" | 2023-10-28 | 15 Upvotes 1 Comments
🔗 Ronald Read – Philanthropist, investor, janitor, and gas station attendant
Ronald James Read (October 23, 1921 – June 2, 2014) was an American philanthropist, investor, janitor, and gas station attendant. Read grew up in Dummerston, Vermont, in an impoverished farming household. He walked or hitchhiked 4 mi (6.4 km) daily to his high school and was the first high school graduate in his family. He enlisted in the United States Army during World War II, serving in Italy as a military policeman. Upon an honorable discharge from the military in 1945, Read returned to Brattleboro, Vermont, where he worked as a gas station attendant and mechanic for about 25 years. Read retired for one year and then took a part-time janitor job at J. C. Penney where he worked for 17 years until 1997.
Read died in 2014. He received media coverage in numerous newspapers and magazines after bequeathing US$1.2 million to Brooks Memorial Library and $4.8 million to Brattleboro Memorial Hospital. Read amassed a fortune of almost $8 million by investing in dividend-producing stocks, avoiding the stocks of companies he did not understand such as technology companies, living frugally, and being a buy and hold investor in a diversified portfolio of stocks with a heavy concentration in blue chip companies.
🔗 James Dewar
Sir James Dewar (20 September 1842 – 27 March 1923) was a Scottish chemist and physicist. He is best known for his invention of the vacuum flask, which he used in conjunction with research into the liquefaction of gases. He also studied atomic and molecular spectroscopy, working in these fields for more than 25 years.
Discussed on
- "James Dewar" | 2020-04-01 | 20 Upvotes 2 Comments
🔗 The moving sofa problem
The moving sofa problem or sofa problem is a two-dimensional idealisation of real-life furniture-moving problems and asks for the rigid two-dimensional shape of largest area A that can be maneuvered through an L-shaped planar region with legs of unit width. The area A thus obtained is referred to as the sofa constant. The exact value of the sofa constant is an open problem.
Discussed on
- "The moving sofa problem" | 2018-07-13 | 215 Upvotes 51 Comments
- "Moving sofa problem" | 2016-12-28 | 38 Upvotes 5 Comments
🔗 Mars Curiosity Operating System: VxWorks
VxWorks is a real-time operating system (RTOS) developed as proprietary software by Wind River Systems, a wholly owned subsidiary of TPG Capital, US. First released in 1987, VxWorks is designed for use in embedded systems requiring real-time, deterministic performance and, in many cases, safety and security certification, for industries, such as aerospace and defense, medical devices, industrial equipment, robotics, energy, transportation, network infrastructure, automotive, and consumer electronics.
VxWorks supports Intel architecture, POWER architecture, ARM architectures and RISC-V. The RTOS can be used in multicore asymmetric multiprocessing (AMP), symmetric multiprocessing (SMP), and mixed modes and multi-OS (via Type 1 hypervisor) designs on 32- and 64-bit processors.
VxWorks comes with the kernel, middleware, board support packages, Wind River Workbench development suite and complementary third-party software and hardware technologies. In its latest release, VxWorks 7, the RTOS has been re-engineered for modularity and upgradeability so the OS kernel is separate from middleware, applications and other packages. Scalability, security, safety, connectivity, and graphics have been improved to address Internet of Things (IoT) needs.
Discussed on
- "Mars Curiosity Operating System: VxWorks" | 2012-08-06 | 93 Upvotes 44 Comments
🔗 Flashsort
Flashsort is a distribution sorting algorithm showing linear computational complexity for uniformly distributed data sets and relatively little additional memory requirement. The original work was published in 1998 by Karl-Dietrich Neubert.
Discussed on
- "Flashsort" | 2020-02-09 | 141 Upvotes 31 Comments