Lists of comets refer to compilations or catalogs that document known comets, usually categorized by their characteristics such as their orbital parameters, the names of their discoverers, and other relevant information. Comets are typically named after their discoverers or based on the year of their discovery. There are a few key aspects typically included in lists of comets: 1. **Periodic Comets**: These are comets that have regular orbits around the Sun, returning at predictable intervals.
"Lists of mathematicians by award" refers to compilations and categorizations of mathematicians who have received various prestigious awards and honors for their contributions to the field of mathematics. These lists provide an overview of mathematicians recognized for their achievements and can include awards such as: 1. **Fields Medal**: Often described as the Nobel Prize of mathematics, awarded every four years to mathematicians under 40 years of age.
In the context of Wikipedia, "stubs" are short articles that provide only limited information on a topic and are often considered incomplete. They typically need further development and expansion to provide a more comprehensive overview. The term "Materials Science journal stubs" would refer specifically to articles related to materials science journals that are labeled as stubs.
Asymptotic analysis is a mathematical method used to describe the behavior of functions as inputs become large. In the context of computer science and algorithm analysis, it is primarily used to evaluate the performance or complexity of algorithms, specifically in terms of time (running time) and space (memory usage).
Large-scale mathematical formalization projects refer to extensive efforts aimed at translating mathematical concepts, theorems, and proofs into formal languages that can be processed by computers. These projects typically involve the use of formal proof assistants or theorem provers, which are software tools that help users construct mathematical proofs in a precise and verifiable manner.
Computational problems are tasks or questions that can be solved through computational processes, typically involving algorithms and data structures. These problems can arise in various fields, including computer science, mathematics, and engineering, and they often require a systematic approach to find a solution. Computational problems can be classified into several categories: 1. **Decision Problems**: These are problems with a yes-or-no answer. An example is determining whether a given number is prime.
Mathematical paradoxes are statements or propositions that, despite seemingly valid reasoning, lead to a conclusion that contradicts common sense, intuition, or accepted mathematical principles. These paradoxes often highlight inconsistencies or problems in foundational concepts, definitions, or assumptions within mathematics. There are several types of mathematical paradoxes, including: 1. **Set Paradoxes**: These explore the nature of sets and can arise from self-referential definitions.
Pinned article: Introduction to the OurBigBook Project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
Intro to OurBigBook
. Source. We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
Figure 1. Screenshot of the "Derivative" topic page. View it live at: ourbigbook.com/go/topic/derivativeVideo 2. OurBigBook Web topics demo. Source. - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 3. Visual Studio Code extension installation.
Figure 4. Visual Studio Code extension tree navigation.
Figure 5. Web editor. You can also edit articles on the Web editor without installing anything locally.Video 3. Edit locally and publish demo. Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.Video 4. OurBigBook Visual Studio Code extension editing and navigation demo. Source. 
- Infinitely deep tables of contents:
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact