drummyfish/less_retarded_wiki
5
1
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

Update

Browse source
This commit is contained in:
Miloslav Ciz 2025-04-30 00:58:00 +02:00
parent 910eefc063
commit c6e3d45699
11 changed files with 2156 additions and 2070 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

13
exercises.md
View file

@ -53,9 +53,10 @@ This place is for suggesting programming [projects](project.md) that will in fir
9. **[bytebeat](bytebeat.md)**: Make at least three cool sounding bytebeat songs.
10. **Lorem ipsum [markdown](md.md) generator**: Create a program that generates gibberish text in markdown format that looks like normal human text. Each time it is run, it will generate generally a different text that consists of 3 to 5 sections, each section starts with a heading which starts with `# ` after which 3 to 5 words follow, then there are two newlines and then 3 to 5 paragraphs follow; each paragraph ends with two newlines, except for the last one in the document which only ends with one newline. Paragraph consists of 5 to 10 sentences; each sentence consists of 3 to 10 words, starts with capital letter (other letters are lowercase) and ends with period. About 1 in 20 words in paragraphs are highlighted -- highlight is either italic (the word is between `*`s) or bold (the word is between `**`s). After period there is space except when it's the last period in a paragraph (then there is no space). Words are selected randomly from some set of words that you define (have at least 10 different words). Thumbs up for also generating lists etc.
11. **Caesar cipher**: Make a program that encrypts/decrypts text with the simple cipher known as Caesar cipher, i.e. by offsetting each letter by certain fixed number *N* (e.g. with *N = 2* the letter *A* will become *C*, *B* will become *D* etc.). Assume just ASCII characters on input (encrypted output can be non-ASCII). You can just choose and hardcode some specific *N* but thumbs up for allowing to set any *N*. You can input/output text from/to standard input/output or files -- it's up to you -- also you can either make one program that does both encoding and decoding (e.g. depending on CLI flag) or make two programs, one for each task.
12. **simple website generator**: All static site generators suck ass, make your own. Make a simple markup language and a program that will turn this markup into [HTML](html.md) file -- this will allow you to write HTML websites very easily. The program will read the input file on standard input (i.e. NOT from a file, though you can optionally support this too) and output the HTML on standard output (again, output to file is optional), so that the program can be used like this: `cat myfile.mymarkup | ./mymarkupprocessor > mywebpage.html`. The markup language may be super simple: let's say `_` and `;_` could mark the start and end of bold text (translating to `<b>` and `</b>` respectively) , `#` and `;#` start and end of heading (translating to `<h1>` and `</h1>` respectively) and so on (you can make your own tags, this is just an example). Basically you'll be mostly just translating your tags into HTML tags. You don't have to implement escape sequences for special characters (i.e. it's fine if it's impossible to have let's say the `#` character in your output), but thumbs up if you do. You HAVE TO output a correct HTML, i.e. you have to output a prologue (something like `<html> <head> </head> <body> ...`) and epilogue (something like `</body> </html>`) and somehow deal with possible HTML special characters in the input text: for example if the input contains `<`, you have to translate it to `&lt;` etc., but it is allowed to handle non-trivial cases (like weird Unicode stuff or something) by e.g. just replacing problematic input with `???`. [Unicode](unicode.md) doesn't have to be supported on output, you can output plain [ASCII](ascii.md). You have to support at least normal text, 2 levels of headings and bold text, thumbs up for additional things like images, links, lists etc. Thumbs up for additional features like allowing to set website title with a CLI flag, choose from several hardcoded [CSS](css.md) styles or adding extra output formats like [Markdown](md.md), LaTeX and so on. Test that you generate correct HTML with some HTML validator.
13. **filetype guesser**: Create a program that reads a file and guesses its file type. You can NOT use the file name, only the file content. First look at the [magic number](magic_number.md) (file signature) -- check at least PDF, JPEG, PNG, MP3, GIF and TAR. If this doesn't succeed, then see if 90% of bytes are printable ASCII characters: if so, then guess the file to be TXT, otherwise you may report unknown type (or optionally you can try some extra checks if you want).
14. **[brainfuck](brainfuck.md) interpreter**: Make a program that interprets brainfuck. You may choose to read the input program either from standard input or from a file (the file may have some hardcoded name, e.g. your program will just look for a file named `program.bf` in the same directory). If the brainfuck program is invalid or runtime error occurs in it, you may just write out `error` and halt your interpreter. Thumbs up for making the interpreter nicer, e.g. allowing to pass input file name as a CLI argument, reporting more details about errors (e.g. its position in source code) and so on.
12. **Roman numeral converter**: make a program that will convert between Roman numerals and our traditional decimal numerals (only positive whole numbers, at least up to the limit of unsigned integer range), both ways. The program will read the numeral on its input (you can choose: either read it from standard input or take it from program arguments, this isn't that important), then recognize if it's Roman numeral or decimal number, then convert it to the other representation and print it out. Handle errors only on a basic level (e.g. write out if the input value is in wrong format).
13. **simple website generator**: All static site generators suck ass, make your own. Make a simple markup language and a program that will turn this markup into [HTML](html.md) file -- this will allow you to write HTML websites very easily. The program will read the input file on standard input (i.e. NOT from a file, though you can optionally support this too) and output the HTML on standard output (again, output to file is optional), so that the program can be used like this: `cat myfile.mymarkup | ./mymarkupprocessor > mywebpage.html`. The markup language may be super simple: let's say `_` and `;_` could mark the start and end of bold text (translating to `<b>` and `</b>` respectively) , `#` and `;#` start and end of heading (translating to `<h1>` and `</h1>` respectively) and so on (you can make your own tags, this is just an example). Basically you'll be mostly just translating your tags into HTML tags. You don't have to implement escape sequences for special characters (i.e. it's fine if it's impossible to have let's say the `#` character in your output), but thumbs up if you do. You HAVE TO output a correct HTML, i.e. you have to output a prologue (something like `<html> <head> </head> <body> ...`) and epilogue (something like `</body> </html>`) and somehow deal with possible HTML special characters in the input text: for example if the input contains `<`, you have to translate it to `&lt;` etc., but it is allowed to handle non-trivial cases (like weird Unicode stuff or something) by e.g. just replacing problematic input with `???`. [Unicode](unicode.md) doesn't have to be supported on output, you can output plain [ASCII](ascii.md). You have to support at least normal text, 2 levels of headings and bold text, thumbs up for additional things like images, links, lists etc. Thumbs up for additional features like allowing to set website title with a CLI flag, choose from several hardcoded [CSS](css.md) styles or adding extra output formats like [Markdown](md.md), LaTeX and so on. Test that you generate correct HTML with some HTML validator.
14. **filetype guesser**: Create a program that reads a file and guesses its file type. You can NOT use the file name, only the file content. First look at the [magic number](magic_number.md) (file signature) -- check at least PDF, JPEG, PNG, MP3, GIF and TAR. If this doesn't succeed, then see if 90% of bytes are printable ASCII characters: if so, then guess the file to be TXT, otherwise you may report unknown type (or optionally you can try some extra checks if you want).
15. **[brainfuck](brainfuck.md) interpreter**: Make a program that interprets brainfuck. You may choose to read the input program either from standard input or from a file (the file may have some hardcoded name, e.g. your program will just look for a file named `program.bf` in the same directory). If the brainfuck program is invalid or runtime error occurs in it, you may just write out `error` and halt your interpreter. Thumbs up for making the interpreter nicer, e.g. allowing to pass input file name as a CLI argument, reporting more details about errors (e.g. its position in source code) and so on.
### Level 2: Mid, *Hurt Me Plenty*
@ -541,7 +542,8 @@ Bear in mind this is not a school test that's supposed to decide if you get to a
130. Two [women](woman.md) [kill themselves](suicide.md) at the same time, one is a midget weighting 30 kg, the other one an [American](usa.md) weighting 300 kg. They jump simultaneously from a bridge that's 50 meters above ground. Which one, and by how many seconds, hits the ground first? Ignore air resistance etc.
131. In which [science](science.md) is multiplication the same thing as division?
132. Create a fraction ([rational number](rational_number.md) that [approximates](approximation.md) [pi](pi.md) at least to 8 fractional digits, i.e. the approximation must start with 3.14159265.
133. Did you enjoy this quiz?
133. You have 7 [fat](body_shaming.md), horribly smelling [transsexual](transsexual.md) [reddit](reddit.md) admins who all stink exactly the same except for one, which smells yet a little worse. You have a smell comparator with two chambers: you can put any number of people into the chambers and the machine will tell you if the total smell in one chamber is worse, better or equal to than in the other chamber. You can only afford to perform two measurements. How do you identify the worst smelling redditor?
134. Did you enjoy this quiz?
### Answers
@ -678,7 +680,8 @@ sin(x) / cos(x) - log2(2) = tg(x) - 1*, so we get *tg(x) >= 1*. So that will hol
130. Both hit the ground at the same time, weight doesn't matter.
131. Biology.
132. Do it like this: 3.14159265 = 314159265 / 100000000 = 62831853 / 20000000.
133. yes
133. Put three and three into the two comparator chambers, leave one outside. If the smells are equal, the one outside is the worst smelling. Otherwise take the three people out of the worse smelling chamber and do the same: put one in one chamber, another in the other chamber and leave one outside. If the smells are equal, the one outside is the worst smelling, otherwise it's the one in the worse smelling chamber.
134. yes
## Other

2
less_retarded_society.md
View file

@ -73,7 +73,7 @@ As people don't have to work, very few have to undergo daily travels, minimizing
**People aren't individualist and [egoistic](egoism.md)**, they don't have tattoos, dyed hair, piercing etc., that's simply bullshit of primitive competitive cultures. It is correctly seen as immoral to try to persuade by "good looks" -- for example by wearing a [suit](suit.md) -- that's simply a cheap attempt at deception. Everyone is valued the same no matter his looks, people don't feel the need to change their gender or alter their look so as to appeal to anyone or to follow some kind of fashion, trend, to strategically join some minority to gain the best set of "[rights](rights_culture.md)" or to infiltrate specific social class. Of course cutting hair e.g. for comfort is practiced, but no one wastes his time with makeup and similar nonsense.
**People live in harmony with nature**, from space it is hard to tell humans live on Earth, the enormous waste of capitalism and consumerist society has been eliminated, industry isn't raping nature. Cities (or rather many villages) are greener and more integrated with nature, people live in energy-efficient underground houses (by which they create more land), there are fewer roads as people don't use [cars](car.md) much thanks to efficient public transport and lower need for commuting and transportation thanks to not having to go to work, utilizing mostly local resources etc. Thanks to this light pollution, noise and CO2 emissions decrease greatly. Although work is automatized, relatively few machines are required thanks to simplification and eliminating all bullshit that's connected to running our current farms and factories (which further eliminates the recursive need for factories that create machines for building and maintaining factories etc.), and thanks to decreased need of things, for example mentioned cars.
**People live in harmony with nature**, from space it is hard to tell humans live on Earth, the enormous waste of capitalism and consumerist society has been eliminated, industry isn't raping nature. Cities (or rather many villages) are greener and more integrated with nature, people live in energy-efficient underground houses (by which they create more land), there are fewer roads as people don't use [cars](car.md) much thanks to efficient public transport and lower need for commuting and transportation thanks to not having to go to work, utilizing mostly local resources etc. Thanks to this light pollution, noise and CO2 emissions decrease greatly. Although work is automated, relatively few machines are required thanks to simplification and eliminating all bullshit that's connected to running our current farms and factories (which further eliminates the recursive need for factories that create machines for building and maintaining factories etc.), and thanks to decreased need of things, for example mentioned cars.
**Research advances faster, people are smarter, more rational, emphatic, loving and more moral**. Nowadays probably the majority of the greatest brains are wasted on bullshit activity such as studying and trying to hack the [market](market.md) -- even professional researchers nowadays waste time on "safe", lucrative unnecessary bullshit research in the "publish or perish" spirit, chasing grants, easy [patents](patent.md) etc. In our ideal society smart people focus on truly relevant issues such as curing cancer, without being afraid of failure, stalling, negative results, lack of funds etc. People are well educated and practice e.g. voluntary birth control to prevent overpopulation. However people are NOT cold rational machines, on the contrary emotions are present much more than today, for example the emotion of [love](love.md) towards life is so strong most people are willing to die to save someone else, even a complete stranger. People express emotion through rich art and good deeds. People are also spiritual despite being highly rational -- they know rationality is but one of many tools for viewing and understanding the world. **[Religion](religion.md) still exists** commonly but not in radical or hostile forms; Christianity, Islam and similar religions become more similar to e.g. [Buddhism](buddhism.md), some even merge after realizing their differences are relatively unimportant and stop competing for mass control of people, religion becomes much less organized and much more personal.

2
main.md
View file

File diff suppressed because one or more lines are too long

267
number.md
View file

@ -167,9 +167,9 @@ Of course there are countless other number sets, especially those induced by var
Worthy of mentioning is also [linear algebra](linear_algebra.md) which treats [vectors](vector.md) and [matrices](matrix.md) like elementary algebra treats numbers -- though vectors and matrices aren't usually seen as numbers, they may be seen as an extension of the concept.
**Numbers are [awesome](awesome.md)**, just ask any number theorist (or watch a numberphile video for that matter). Normal people perceive numbers just as boring, soulless quantities but the opposite is true for that who studies them with [love](love.md) -- the world of numbers is staggeringly beautiful, their study runs to depths without end, possibly as far as humans can ever hope to get a glimpse at the mechanisms of our [Universe](universe.md), and oftentimes once you pay a closer attention to a seemingly innocently looking detail, you reveal a breathtaking pattern and discover the [art](art.md) of nature. Each number has its own unique set of properties which give it a kind of "personality", different sets of numbers create species and "teams" of numbers. Numbers are intertwined in intricate ways, there are literally infinitely many patterns that are all related in weird ways -- normies think that mathematicians know basically everything about numbers, but in higher math it's the exact opposite, most things about number sequences are mysterious and mathematicians don't even have any clue about why they're so, many things are probably even [unknowable](knowability.md). Numbers are also self referencing which leads to new and new patterns appearing without end -- for example prime numbers are interesting numbers, but you may start counting them and a number that counts numbers is itself a number, you are getting new numbers just by looking at other numbers. The world of numbers is like a whole universe you can explore just in your head, anywhere you go, it's almost like the best, most free video [game](game.md) of all time, embedded right in this [Universe](universe.md), in [logic](logic.md) itself. Numbers are like animals, some are small, some big, some are hardly visible, trying to hide, some can't be overlooked -- they inhabit various areas and interact with each other, just exploring this can make you quite happy. { Pokemon-like game with numbers when? ~drummyfish }
**Numbers are [awesome](awesome.md)**, just ask any number theorist (or watch a numberphile video for that matter). Normal people perceive numbers just as boring, soulless quantities but the opposite is true for that who studies them with [love](love.md) -- the world of numbers is without a doubt staggeringly beautiful, their study runs to depths without end, possibly as far as humans can ever hope to get a glimpse of the mechanisms behind the curtains of our [Universe](universe.md), and oftentimes once you pay a closer attention to a seemingly innocently looking detail, you reveal a breathtaking pattern and discover the [art](art.md) of nature. Each number has its own unique set of properties which give it a kind of "personality", different sets of numbers create species and "teams" of numbers. Numbers are intertwined in intricate ways, there are literally infinitely many patterns that are all related in weird ways -- normies think that mathematicians know basically everything about numbers, but in higher math it's the exact opposite, most things about number sequences are mysterious and mathematicians don't even have any clue about why they're so, many things are probably even [unknowable](knowability.md). Numbers are also self referencing which leads to new and new patterns appearing without end -- for example prime numbers are interesting numbers, but you may start counting them and a number that counts numbers is itself a number, you are getting new numbers just by looking at other numbers. The world of numbers is like a whole universe you can explore just in your head, anywhere you go, it's almost like the best, most free video [game](game.md) of all time, embedded right in this [Universe](universe.md), in [logic](logic.md) itself. Numbers are like animals, some are small, some big, some are hardly visible, trying to hide, some can't be overlooked -- they inhabit various areas and interact with each other, just exploring this can make you quite happy. { Pokemon-like game with numbers when? ~drummyfish }
There is a famous [encyclopedia](encyclopedia.md) of integer sequences at https://oeis.org/, made by number theorists -- it's quite [minimalist](minimalism.md), now also [free licensed](free_culture.md) (used to be [proprietary](proprietary.md), they seem to enjoy license hopping). At the moment it contains more than 370000 sequences; by browsing it you can get a glimpse of how deep the study of numbers goes. These people are also [funny](fun.md), they give numbers entertaining names like *happy numbers* (adding its squared digits eventually gives 1), *polite numbers*, *friendly numbers*, *cake numbers*, *lucky numbers* or *weird numbers*.
There is a famous [encyclopedia](encyclopedia.md) of integer sequences at https://oeis.org/, made by number theorists -- it's quite [minimalist](minimalism.md), now also [free licensed](free_culture.md) (used to be [proprietary](proprietary.md), they seem to enjoy license hopping). At the moment it contains more than 370000 sequences; by browsing it you can get a glimpse of how deep the study of numbers goes. These people are also somewhat [funny](fun.md), they give numbers entertaining names like *happy numbers* (adding its squared digits eventually gives 1), *polite numbers*, *friendly numbers*, *cake numbers*, *lucky numbers* or *weird numbers*.
**Some numbers cannot be computed**, i.e. there exist [noncomputable](computability.md) numbers. This follows from the existence of noncomputable functions (such as that representing the [halting problem](halting_problem.md)). For example let's say we have a real number *x*, written in [binary](binary.md) as *0. d0 d1 d2 d3 ...*, where *dn* is *n*th digit (1 or 0) after the radix point. We can define the number so that *dn* is 1 if and only if a [Turing machine](turing_machine.md) represented by number *n* halts. Number *x* is noncomputable because to compute the digits to any arbitrary precision would require being able to solve the unsolvable halting problem.
@ -179,7 +179,7 @@ TODO: what is the best number? maybe top 10? would 10 be in top 10? what's the f
## Numbers In Programming/Computers
While mathematicians work mostly with infinite number sets and all kind of "weird" hypothetical numbers like hyperreals and transcendentals, [programmers](programming.md) still mostly work with "normal" numbers pertaining to practical applications, and have to limit themselves to finite number sets because, of course, computers have limited memory and can only store limited number of numeric values -- computers typically work with [modulo](mod.md) arithmetic with some high power of two modulo, e.g. 2^32 or 2^64, which is a [good enough](good_enough.md) approximation of an infinite number set. Mathematicians are as precise with numbers as possible as they're interested in structures and patterns that numbers form, programmers just want to use numbers to solve problems, so they mostly use [approximations](approximation.md) where they can -- for example programmers normally approximate [real numbers](real_number.md) with [floating point](float.md) numbers that are really just a subset of rational numbers. This isn't really a problem though, computers can comfortably work with numbers large and precise enough for solving any practical problem -- a slight annoyance is that one has to be careful about such things as [underflows](underflow.md) and [overflows](overflow.md) (i.e. a value wrapping around from lowest to highest value and vice versa), limited and sometimes non-uniform precision resulting in [error](error.md) accumulation, unlinearization of linear systems and so on. Programmers also don't care about strictly respecting some properties that certain number sets must mathematically have, for example integers along with addition are mathematically a [group](group.md), however signed integers in [two's complement](twos_complement.md) aren't a group because the lowest value doesn't have an inverse element (e.g. on 8 bits the lowest value is -128 and highest 127, the lowest value is missing its partner). Programmers also allow "special" values to be parts of their number sets, especially e.g. with the common IEEE [floating point](float.md) types we see values like plus/minus [infinity](infinity.md), [negative zero](negative_zero.md) or [NaN](nan.md) ("not a number") which also break some mathematical properties and creates situations like having a number that says it's not a number, but again this really doesn't play much of a role in practical problems. Numbers in computers are represented in [binary](binary.md) and programmers themselves often prefer to write numbers in binary, hexadecimal or octal representation -- they also often meet powers of two rather than powers of ten or primes or other similar limits (for example the data type limits are typically limited by some power of two). There also comes up the question of specific number encoding, for example direct representation, sign-magnitude, [two's complement](twos_complement.md), [endianness](byte_sex.md) and so on. Famously programmers start counting from 0 (they go as far as using the term "zeroth") while mathematicians rather tend to start at 1. Just as mathematicians have different sets of numbers, programmers have an analogy in numeric [data types](data_type.md) -- a data type defines a set of values and operations that can be performed with them. The following are some of the common data types and representations of numbers in computers:
While mathematicians work mostly with infinite number sets and all kinds of "weird" hypothetical numbers like hyperreals and transcendentals, [programmers](programming.md) still typically deal with "normal" numbers pertaining to practical applications, and have to limit themselves to finite number sets because, of course, computers have limited memory and can only store limited number of numeric values -- computers typically work with [modulo](mod.md) arithmetic with some high power of two, e.g. 2^32 or 2^64, which is a [good enough](good_enough.md) [approximation](approximation.md) of an infinite number set. Mathematicians are as precise with numbers as possible as they're interested in structures and patterns that numbers form, programmers just want to use numbers to solve problems, so they mostly use [approximations](approximation.md) where they can -- for example programmers normally approximate [real numbers](real_number.md) with [floating point](float.md) numbers that are really just a subset of rational numbers. This isn't really a problem though, computers can comfortably work with numbers large and precise enough for solving any practical problem -- a slight annoyance is that one has to be careful about such things as [underflows](underflow.md) and [overflows](overflow.md) (i.e. a value wrapping around from lowest to highest value and vice versa), limited and sometimes non-uniform precision resulting in [error](error.md) accumulation, unlinearization of linear systems and so on. Programmers also don't care about strictly respecting some properties that certain number sets must mathematically have, for example integers along with addition are mathematically a [group](group.md), however signed integers in [two's complement](twos_complement.md) aren't a group because the lowest value doesn't have an inverse element (e.g. on 8 bits the lowest value is -128 and highest 127, the lowest value is missing its partner). Programmers also allow "special" values to be parts of their number sets, especially e.g. with the common IEEE [floating point](float.md) types we see values like plus/minus [infinity](infinity.md), [negative zero](negative_zero.md) or [NaN](nan.md) ("not a number") which also break some mathematical properties and creates situations like having a number that says it's not a number, but again this really doesn't play much of a role in practical problems. Numbers in computers are represented in [binary](binary.md) and programmers themselves often prefer to write numbers in binary, hexadecimal or octal representation -- they also often meet powers of two rather than powers of ten or primes or other similar limits (for example the data type limits are typically limited by some power of two). There also comes up the question of specific number encoding, for example direct representation, sign-magnitude, [two's complement](twos_complement.md), [endianness](byte_sex.md) and so on. Famously programmers start counting from 0 (they go as far as using the term "zeroth") while mathematicians rather tend to start at 1. Just as mathematicians have different sets of numbers, programmers have an analogy in numeric [data types](data_type.md) -- a data type defines a set of values and operations that can be performed with them. The following are some of the common data types and representations of numbers in computers:
- **numeric**: Anything considered a number. In very high level languages there may be just one generic "number" type that can store any kind of number, automatically choosing best representation for it etc.
- **[unsigned](unsigned.md)**: Don't allow negative values -- this is sufficient in many cases, simpler to implement and can offer higher range in the positive direction.
@ -203,97 +203,178 @@ However some programming languages, such as [Lisp](lisp.md), sometimes treat num
## Notable Numbers
Here is a table of some numbers worthy of mention, mostly relevant in math and programming but also some famous ones from [physics](physics.md) and popular [culture](culture.md) (note: the order is roughly from lower numbers to higher ones, however not all of these numbers can be compared easily or at all, so the ordering isn't strictly correct).
Here is a table of some numbers and "number like objects" worthy of mention, mostly relevant in math and programming but also some famous ones from [physics](physics.md) and popular [culture](culture.md) (note: the order is roughly from lower numbers to higher ones, however not all of these numbers can be compared easily or at all, so the ordering isn't strictly correct).
| number | value | equal to | notes |
| ----------------------------------- | ------------------- | ---------------------------------------- | ------------------------------------------------------- |
| minus [infinity](infinity.md) | | | not always considered a number, smallest possible value |
| minus/negative one | -1 | i^2, j^2, k^2 | |
| "[negative zero](negative_zero.md)" | "-0" | zero | non-mathematical, sometimes used in programming |
| [zero](zero.md) | 0 | negative zero, e^(i * pi) + 1 | "nothing" |
| epsilon | | 1 / omega | infinitesimal, "infinitely small" non-zero |
| |4.940656... * 10^-324| | smallest number storable in IEEE-754 64 binary float |
| |1.401298... * 10^-45 | | smallest number storable in IEEE-754 32 binary float |
| |1.616255... * 10^-35 | | Planck length in meters, smallest "length" in Universe |
| one eight | 0.125 | 2^-3 | |
| one fourth | 0.25 | 2^-2 | |
| one third | 0.333333... | ...1313132 (5-adic) | |
| one half | 0.5 | 2^-1 | |
| [one](one.md) | 1 | 2^0, 0!, 0.999... | NOT a prime |
| [square root](sqrt.md) of two | 1.414213... | 2^(1/2) | irrational, diagonal of unit square, important in geom. |
| supergolden ratio | 1.465571... | solve(x^3 - x^2 - 1 = 0) | similar to golden ratio, bit more difficult to compute |
|phi ([golden ratio](golden_ratio.md))| 1.618033... | (1 + sqrt(5)) / 2, solve(x^2 - x - 1 = 0)| irrational, visually pleasant ratio, divine proportion |
| [two](two.md) | 2 | 2^1, 0b000010 | (only even) prime |
| [silver ratio](silver_ratio.md) | 2.414213... | 1 + sqrt(2), solve(x^2 - 2 * x - 1 = 0) | similar to golden ratio |
| [e](e.md) (Euler's number) | 2.718281... | | base of natural [logarithm](log.md) |
| [three](three.md) | 3 | 2^2 - 1 | prime, max. unsigned number with 2 bits |
| [pi](pi.md) | 3.141592... | | circle circumference to its diameter, irrational |
| [four](four.md) | 4 | 2^2, 0b000100 |first composite number, min. needed to color planar graph|
| [five](five.md) | 5 | | (twin) prime, number of platonic solids |
| [six](six.md) | 6 | 3!, 1 * 2 * 3, 1 + 2 + 3 | highly composite number, perfect number |
| [tau](tau.md) | 6.283185... | 2 * pi | radians in full circle, defined mostly for convenience |
| [thrembo](thrembo.md) | ??? | | the hidden number |
| [seven](seven.md) | 7 | 2^3 - 1 |(twin) prime, days in week, max. unsigned n. with 3 bits |
| [eight](eight.md) | 8 | 2^3, 0b001000 | |
| [nine](nine.md) | 9 | | |
| [ten](ten.md) | 10 | 10^1, 1 + 2 + 3 + 4 | your IQ? :D |
| twelve, dozen | 12 | 2 * 2 * 3 | highly composite number |
| fifteen | 15 | 2^4 - 1, 0b1111, 0x0f, 1 + 2 + 3 + 4 + 5 | maximum unsigned number storable with 4 bits |
| [sixteen](sixteen.md) | 16 | 2^4, 2^2^2, 0b010000 | |
| twenty four | 24 | 2 * 2 * 2 * 3, 4! | highly composite number |
| thirty one | 31 | 2^5 - 1 |max. unsigned number storable with 5 bits, Mersenne prime|
| [thirty two](thirty_two.md) | 32 | 2^5, 0b100000 | |
| thirty six | 36 | 2 * 2 * 3 * 3 | highly composite number |
| thirty seven | 37 | | most commonly chosen 1 to 100 "random" number |
| [fourty two](42.md) | 42 | | cringe number, answer to some stuff |
| fourty eight | 48 | 2^5 + 2^4, 2 * 2 * 2 * 2 * 3 | highly composite number |
| sixty three | 63 | 2^6 - 1 | maximum unsigned number storable with 6 bits |
| [sixty four](sixty_four.md) | 64 | 2^6 | |
| [sixty nine](69.md) | 69 | | sexual position |
| ninety six | 96 | 2^5 + 2^6 | alternative sexual position |
| one hundred | 100 | 10^2 | |
| one hundred twenty one | 121 | 11^2 | |
| one hundred twenty seven | 127 | 2^7 - 1 | maximum value of signed byte, Mersenne prime |
| one hundred twenty eight | 128 | 2^7 | |
| one hundred fourty four | 144 | 12^2 | |
| one hundred sixty eight | 168 | 24 * 7 | hours in week |
| two hundred fifty five | 255 | 2^8 - 1, 0b11111111, 0xff | maximum value of unsigned [byte](byte.md) |
| two hundred fifty six | 256 | 2^8, 16^2, ((2^2)^2)^2 | number of values that can be stored in one byte |
| three hundred sixty | 360 | 2 * 2 * 2 * 3 * 3 * 5 | highly composite number, degrees in full circle |
| four hundred twenty | 420 | | stoner shit (they smoke it at 4:20), divisible by 1 to 7|
| five hundred twelve | 512 | 2^9 | |
| six hundred and sixty six | 666 | | number of the beast |
| one thousand | 1000 | 10^3 | |
| one thousand twenty four | 1024 | 2^10 | |
| two thousand fourty eight | 2048 | 2^11 | |
| four thousand ninety six | 4096 | 2^12 | |
| ten thousand | 10000 | 10^4, 100^2 | |
| ... (enough lol) | 65535 | 2^16 - 1 | maximum unsigned number storable with 16 bits |
| | 65536 | 2^16, 256^2, 2^(2^(2^2)) | number of values storable with 16 bits |
| | 80085 | | looks like BOOBS |
| hundred thousand | 100000 | 10^5 | |
| one [million](million.md) | 1000000 | 10^6 | |
| one [billion](billion.md) | 1000000000 | 10^9 | |
| | 3735928559 | 0xdeadbeef | one of famous hexadeciaml constants, spells out DEADBEEF|
| | 4294967295 | 2^32 - 1, 0xffffffff | maximum unsigned number storable with 32 bits |
| | 4294967296 | 2^32 | number of values storable with 32 bits |
| one trillion | 1000000000000 | 10^12 | |
| |18446744073709551615 | 2^64 - 1 | maximum unsigned number storable with 64 bits |
| |18446744073709551616 | 2^64 | number of values storable with 64 bits |
| | 3.402823... * 10^38 | | largest number storable in IEEE-754 32 binary float |
| | 10^80 | | approx. number of atoms in observable universe |
| [googol](googol.md) | 10^100 | | often used big number |
| [asankhyeya](asankhyeya.md) | 10^140 | | religious number, often used in [Buddhism](buddhism.md) |
| | 4.65... * 10^185 | | approx. number of Planck volumes in observable universe |
| |1.797693... * 10^308 | | largest number storable in IEEE-754 64 binary float |
| [googolplex](googolplex.md) | 10^(10^100) | 10^googol | another large number, number of genders in 21st century |
| [Graham's number](grahams_number.md)| | g64 | extremely, unimaginably large number, > googolplex |
| TREE(3) | unknown | | yet even larger number, > Graham's number |
| [infinity](infinity.md) | | | not always considered a number, largest possible value |
| [aleph](aleph.md) zero | | beth zero, cardinality(N) | infinite cardinal number, "size" of the set of nat. num.|
| [i](i.md) (imaginary unit) | | j * k | part of complex numbers and quaternions |
| [j](j.md) | | k * i | one of quaternion units |
| [k](k.md) | | i * j | one of quaternion units |
| number | value | equal to, AKA | notes |
| ----------------------------------- | -------------------- | ---------------------------------------- | ------------------------------------------------------- |
| not a number (NaN, undefined, ...) | none | 1/0, 0^0, tan(pi/2) | error value |
| minus [infinity](infinity.md) | | | not always considered a number, smallest possible value |
| |-1.797693... * 10^308 | | smallest number storable in IEEE-754 64 bit float |
| | -3.402823... * 10^38 | | smallest number storable in IEEE-754 32 bit float |
| | -9223372036854776000 | -1 * 2^64 / 2 | minimum two's complement signed 64 bit number |
| | -2147483648 | -1 * 2^32 / 2 | minimum two's complement signed 32 bit number |
| minus thirty two thousand seven ... | -32768 | -1 * 2^16 / 2 | minimum two's complement signed 16 bit number |
| minus one hundred twenty eight | -128 | -1 * 2^7 | minimum value of signed byte (two's complement) |
| minus/negative one | -1 | i^2, j^2, k^2 | |
| "[negative zero](negative_zero.md)" | "-0" | 0 | non-mathematical, sometimes used in programming |
| [zero](zero.md) | 0 | "-0", e^(i * pi) + 1, lim x->inf 1/x | "nothing", additive identity |
| epsilon | | 1 / omega | infinitesimal, "infinitely small" non-zero |
| |4.940656... * 10^-324 | | smallest pos. number storable in IEEE-754 64 bit float |
| | 1.401298... * 10^-45 | | smallest pos. number storable in IEEE-754 32 bit float |
| | 1.616255... * 10^-35 | | Planck length in meters, smallest "length" in Universe |
| one eight | 0.125 | 2^-3 | |
| one fourth | 0.25 | 2^-2 | |
| one third | 0.333333... | ...1313132 (5-adic) | |
| one half | 0.5 | 2^-1 | |
| one over square root of two | 0.707106... | 1/sqrt(2), sin(pi/4), cos(pi/4), 2^(-1/2)| |
| [one](one.md) | 1 |2^0, 0!, 0.999..., sqrt(1), I, 0b1, cos(0)| NOT a prime, unit, multiplicative identity |
| [square root](sqrt.md) of two | 1.414213... | sqrt(2), 2^(1/2) | irrational, diagonal of unit square, important in geom. |
| supergolden ratio | 1.465571... | solve(x^3 - x^2 - 1 = 0) | similar to golden ratio, bit more difficult to compute |
|phi ([golden ratio](golden_ratio.md))| 1.618033... | (1 + sqrt(5)) / 2, solve(x^2 - x - 1 = 0)| irrational, visually pleasant ratio, divine proportion |
| square root of three | 1.732050... | sqrt(3), 3^(1/2) | irrational |
| [two](two.md) | 2 | 2^1, 2!, 2!!, 0b000010, II, 0b10 | (only even) prime, base of [binary](binary.md) system |
| [silver ratio](silver_ratio.md) | 2.414213... | 1 + sqrt(2), solve(x^2 - 2 * x - 1 = 0) | similar to golden ratio |
| [e](e.md) (Euler's number) | 2.718281... | | base of natural [logarithm](log.md) |
| [three](three.md) | 3 | 2^2 - 1, III, Ob11 | prime, max. number on 2 bits, regular plane tilings |
| [pi](pi.md) | 3.141592... | 2 * asin(1) | circle circumference to its diameter, irrational |
| [four](four.md) | 4 | 2^2, 0b000100, IV, 0b100 |first composite number, min. needed to color planar graph|
| [five](five.md) | 5 | 3^2 - 2^2, V, 0b101 | (twin) prime, number of platonic solids |
| [six](six.md) | 6 | 3!, 1 * 2 * 3, 1 + 2 + 3, VI, 0b110 | highly composite number, perfect number |
| [tau](tau.md) | 6.283185... | 2 * pi | radians in full circle, defined mostly for convenience |
| [thrembo](thrembo.md) | ??? | | the hidden number |
| [seven](seven.md) | 7 | 2^3 - 1, VII, 0b111 |(twin) prime, days in week, max. unsigned n. with 3 bits |
| [eight](eight.md) | 8 | 2^3, 0b001000, VIII, 0b1000 | base of [octal](oct.md) system |
| [nine](nine.md) | 9 | 3^3, 1^3 + 2^3, sqrt(81), IX, 0b1001 | |
| [ten](ten.md) | 10 | 10^1, 1 + 2 + 3 + 4, X, 0b1010 | your IQ? :D base of our decimal system |
| eleven | 11 | XI, 0b1011 | palindromic prime |
| twelve, dozen | 12 | 2 * 2 * 3, XII, 0b1100 | highly composite number |
| fifteen | 15 | 2^4 - 1, 0b1111, 0x0f, 1 + 2 + 3 + 4 + 5 | maximum unsigned number storable with 4 bits |
| [sixteen](sixteen.md) | 16 | 2^4, 2^2^2, 0b010000, 0x10, XVI | base of [hexadecimal](hex.md) system |
| twenty one | 21 | BB(3), XXI | maximum number of 1s produced by 3 state Turing Machine |
| twenty four | 24 | 2 * 2 * 2 * 3, 4!, XXIV |highly composite number, possible ways to order 4 objects|
| twenty five | 25 | 5^2, sqrt(625), XXV | |
| thirty one | 31 | 2^5 - 1, 0b11111, 0x1f, XXXI |max. unsigned number storable with 5 bits, Mersenne prime|
| [thirty two](thirty_two.md) | 32 | 2^5, 0b100000, 0x20, XXXII | number of possible values storable with 5 bits |
| thirty three | 33 | 1! + 2! + 3! + 4!, XXXIII | |
| thirty six | 36 | 2 * 2 * 3 * 3, XXXVI | highly composite number |
| thirty seven | 37 | XXXVII | most commonly chosen 1 to 100 "random" number |
| [forty two](42.md) | 42 | XLII | cringe number, answer to some stuff |
| forty eight | 48 |2^5 + 2^4, 2 * 2 * 2 * 2 * 3, XLVIII, 0x30| highly composite number |
| forty nine | 49 | 7^2 | |
| fifty | 50 | L | |
| fifty five | 55 | 1 + 2 + ... + 10, LV | sum of numbers up to 10 |
| sixty three | 63 | 2^6 - 1, LXIII | maximum unsigned number storable with 6 bits |
| [sixty four](sixty_four.md) | 64 | 2^6, LXIV, 0x40 | number of squares on a chess board |
| [sixty nine](69.md) | 69 | LXIX | sexual position |
| eighty one | 81 | 3^4, 9*9, XXCI | |
| ninety six | 96 | 2^5 + 2^6, 5! - 4!, 0x60 | alternative sexual position |
| one hundred | 100 | 10^2, 0x64, C | |
| one hundred seven | 107 | BB(4) | maximum number of 1s produced by 4 state Turing machine |
| one hundred twenty | 120 | 5!, C(10,3), CXX | possible ways to order 5 objects |
| one hundred twenty one | 121 | 11^2, CXXI | [palindromic](palindrome.md) |
| one hundred twenty five | 125 | 5^3, CXXV | |
| one hundred twenty seven | 127 | 2^7 - 1, 0x7f, 0b01111111, CXXVII | maximum value of signed byte, Mersenne prime |
| one hundred twenty eight | 128 | 2^7, 0x80, 0b10000000, CXXVIII | |
| one hundred forty four | 144 | 12^2, CXLIV | |
| one hundred sixty eight | 168 | 24 * 7, CLXVIII | hours in week |
| two hundred forty three | 243 | 3^5, CCXLIII | |
| two hundred fifty five | 255 | 2^8 - 1, 0xff, 0b11111111, CCLV | maximum value of unsigned [byte](byte.md) |
| two hundred fifty six | 256 | 2^8, 16^2, 0x100, ((2^2)^2)^2, CCLVI | number of values that can be stored in one byte |
| three hundred forty three | 343 | 7^3, CCCXLIII | |
| three hundred sixty | 360 | 2 * 2 * 2 * 3 * 3 * 5, CCCLX | highly composite number, degrees in full circle |
| three hundred sixty five | 365 | CCCLXV | days in a year |
| four hundred twenty | 420 | CDXX | stoner shit (they smoke it at 4:20), divisible by 1 to 7|
| five hundred eleven | 511 | 2^9 - 1, DXI | largest number storable with 9 bits |
| five hundred twelve | 512 | 2^9, 2^(3^2), DXII | number of values storable with 9 bits |
| six hundred twenty five | 625 | 25^2, 5^4, DCXXV | |
| six hundred and sixty six | 666 | DCLXVI | number of the beast, palindromic |
| seven hundred twenty | 720 | 6!, 3!!, DCCXX | possible ways to order 6 objects |
| seven hundred twenty nine | 729 | 3^6, (3^2)^3, DCCXXIX | |
| one thousand | 1000 | 10^3, M, 0x3e8 | |
| one thousand twenty three | 1023 | 2^10 - 1, 0x3ff, MXXIII | largest number storable with 10 bits |
| one thousand twenty four | 1024 | 2^10, 0x400, MXXIV | number of values storable with 10 bits |
| two thousand forty eight | 2048 | 2^11, 0x800, MMXLVIII | number of values storable with 11 bits |
|two thousand one hundred eighty seven| 2187 | 3^7, MMCXXCVII | |
| two thousand four hundred one | 2401 | 7^4, MMCDI | |
| three thousand one hundred ... | 3125 | 5^5, MMMCXXV | |
| three thousand nine hundred ... | 3999 | MMMCMXCIX | largest number that can be written with Roman numerals |
| four thousand ninety six | 4096 | 2^12, 2^(3^4), 0x1000 | number of values storable with 12 bits |
| five thousand forty | 5040 | 7!, 1 * 2 * ... * 7 | possible ways to order 7 objects |
| five thousand fifty | 5050 | 1 + 2 + ... + 100 | sum of numbers up to 100 |
| six thousand five hundred sixty one | 6561 | 3^8, 3^(2^3) | |
| ten thousand | 10000 | 10^4, 100^2 | |
| fifteen thousand six hundred ... | 15625 | 5^6 | |
| sixteen thousand eight hundred ... | 16807 | 7^5 | |
| nineteen thousand six hundred ... | 19683 | 3^9, 3^(3^3) | |
|thirty two thousand seven hundred ...| 32767 | 2^16 / 2 - 1, 0x7fff | maximum two's complement signed 16 bit number |
| forty thousand three hundred twenty | 40320 | 8!, 1 * 2 * ... * 8 | possible ways to order 8 objects |
| ... (enough lol) | 59049 | 3^10 | |
| | 65504 | | largest number storable in IEEE-754 16 bit float |
| | 65535 | 2^16 - 1, 0xffff | maximum unsigned number storable with 16 bits |
| | 65536 | 2^16, 256^2, 0x10000, 2^(2^(2^2)) | number of values storable with 16 bits |
| | 72078 | | number of possible chess positions after 4 half moves |
| | 80085 | | looks like BOOBS |
| | 86400 | 60 * 60 * 24 | seconds in a day |
| hundred thousand | 100000 | 10^5 | |
| | 362880 | 9!, 1 * 2 * ... * 9 | possible ways to order 9 objects |
| | 500500 | 1 + 2 + ... + 1000 | sum of numbers up to 1000 |
| one [million](million.md) | 1000000 | 10^6 | |
| | 3197281 | | number of possible chess games after 4 half moves |
| | 3628800 | 10!, 1 * 2 * ... * 10 | possible ways to order 10 objects |
| | 16777216 | 2^24, 16^6, 0xffffff | number of distinct 24 bit values (e.g. RGB24 colors) |
| | 43046721 | 3^16 | |
| | 47176870 | BB(5) | maximum number of 1s produced by 5 state Turing machine |
| | 31556926 | | seconds in a year |
| | 39916800 | 11!, 1 * 2 * ... * 11 | possible ways to order 11 objects |
| | 479001600 | 12!, 1 * 2 * ... * 12 | possible ways to order 12 objects |
| one [billion](billion.md) | 1000000000 | 10^9, milliard | |
| | 2147483647 | 2^32 / 2 - 1 | maximum two's complement signed 32 bit number |
| | 3735928559 | 0xdeadbeef | one of famous hexadeciaml constants, spells out DEADBEEF|
| | 4294967295 | 2^32 - 1, 0xffffffff | maximum unsigned number storable with 32 bits |
| | 4294967296 | 2^32, ((((2^2)^2)^2)^2)^2, 0x100000000 | number of values storable with 32 bits |
| | 6227020800 | 13!, 1 * 2 * ... * 13 | possible ways to order 13 objects |
| | 87178291200 | 14!, 1 * 2 * ... * 14 | possible ways to order 14 objects |
| | 500000500000 | 1 + 2 + ... + 1000000 | sum of numbers up to 1000000 |
| one trillion | 1000000000000 | 10^12, billion (LS) | |
| | 1307674368000 | 15! | possible ways to order 15 objects |
| | 20922789888000 | 16! | possible ways to order 16 objects |
| thirty trillion | 30000000000000 | | approximate number of cells in human body |
| | 355687428096000 | 17! | possible ways to order 17 objects |
| bazillion | ??? | | used to just express a very large value |
| quadrillion | 1000000000000000 | 10^15 | |
| | 6402373705728000 | 18! | possible ways to order 18 objects |
| | 121645100408832000 | 19! | possible ways to order 19 objects |
| quintillion | 1000000000000000000 | 10^18 | |
| | 2432902008176640000 | 20! | possible ways to order 20 objects |
| | 9223372036854776000 | 2^64 / 2 - 1 | maximum two's complement signed 64 bit number |
| | 43252003274489856000 | | number of possible Rubik's cube configurations |
| | 18446744073709551615 | 2^64 - 1, 0xffffffffffffffff | maximum unsigned number storable with 64 bits |
| | 18446744073709551616 | 2^64 | number of values storable with 64 bits |
| |2015099950053364471960| | number of possible chess games after 15 half moves |
| |6670903752021072936960| | possible valid filled [sudoku](sudoku.md) grids |
| | 1.267650... * 10^30 | 2^100 | number of values storable with 100 bits |
| | 3.402823... * 10^38 | (2 - 2^(-23)) * 2^127 | largest number storable in IEEE-754 32 bit float |
| | 3.402823... * 10^38 | 2^128 | number of values storable with 128 bits |
| | 1.157920... * 10^77 | 2^256 | number of values storable with 256 bits |
| | 10^80 | | approx. number of atoms in observable universe |
| [googol](googol.md) | 10^100 | | often used big number |
| Shannon number | 10^120 | | estimated number of possible games in [chess](chess.md) |
| [asankhyeya](asankhyeya.md) | 10^140 | | religious number, often used in [Buddhism](buddhism.md) |
| | 1.340780... * 10^154 | 2^512 | number of values storable with 512 bits |
| | 9.332621... * 10^157 | 100! | possible ways to order 100 objects |
| | 4.65... * 10^185 | | approx. number of Planck volumes in observable universe |
| | 1.797693... * 10^308 | | largest number storable in IEEE-754 64 bit float |
| | 1.797693... * 10^308 | 2^1024 | number of values storable with 1024 bits |
| | 3.231700... * 10^616 | 2^2048 | number of values storable with 2048 bits |
| | 4.023872... * 10^2567| 1000! | possibe ways to order 1000 objects |
| [googolplex](googolplex.md) | 10^(10^100) | 10^googol | another large number, number of genders in 21st century |
| [Graham's number](grahams_number.md)| | g64 | extremely, unimaginably large number, > googolplex |
| TREE(3) | unknown | | yet even larger number, > Graham's number |
| [infinity](infinity.md) | | lim x->0 1/x, 1 + 1 + 1 + ... | not always considered a number, largest possible value |
| [aleph](aleph.md) zero | | beth zero, cardinality(N) | infinite cardinal number, "size" of the set of nat. num.|
| [i](i.md) (imaginary unit) | | j * k | part of complex numbers and quaternions |
| [j](j.md) | | k * i | one of quaternion units |
| [k](k.md) | | i * j | one of quaternion units |
## See Also

3
often_confused.md
View file

@ -6,7 +6,7 @@ There exist many terms that are highly similar and can legitimately be used inte
- **[1D](1d.md)** vs **[2D](2d.md)** vs **[2.5D](pseudo3d.md)** vs **[3D](3d.md)** (e.g. 2D function vs 3D function, 1D raycasting vs 2D raycasting, ...)
- **academia** vs **[science](science.md)** vs **[soyence](soyence.md)**
- **[address](address.md)** vs **[pointer](pointer.md)** vs **[reference](reference.md)** vs **[index](index.md)** vs **[vector](vector.md)**
- **[AI](ai.md)** vs **[machine learning](machine_learning.md)** vs **[neural networks](neural_net.md)** vs **[LLM](llm.md**
- **[AI](ai.md)** vs **[machine learning](machine_learning.md)** vs **[neural networks](neural_net.md)** vs **[LLM](llm.md)**
- **[algebra](algebra.md)** vs **[arithmetic](arithmetic.md)** vs **[math](math.md)** vs **[logic](logic.md)**
- **[algorithm](algorithm.md)** vs **[program](program.md)** vs **[process](process.md)** vs **[heuristic](heuristic.md)** vs **[source code](source_code.md)** vs **[software](sw.md)**
- **[algorithm](algorithm.md)** vs **[logarithm](logarithm.md)** lol
@ -123,6 +123,7 @@ There exist many terms that are highly similar and can legitimately be used inte
- **[gradient noise](gradient_noise.md)** vs **[value noise](value_noise.md)**
- **[GUI](gui.md)** vs **graphics** vs **[UI](ui.md)** vs **[TUI](tui.md)** vs **[CLI](cli.md)**
- **heading** vs **header**
- **heat** vs **temperature**
- **[hyperlink](hyperlink.md)** vs **[link](link.md)** vs **[URI](uri.md)** vs **[URL](url.md)** vs **[URN](urn.md)**
- **[ideology](ideology.md)** vs **[philosophy](philosophy.md)** vs **[religion](religion.md)** vs **[paradigm](paradigm.md)**
- **[imperative](imperative.md) paradigm** vs **procedural paradigm** vs **[procedural generation](procgen.md)**

3
palette.md
View file

@ -60,4 +60,5 @@ Other common palettes include [RGB332](rgb332.md) (256 colors, one byte represen
## See Also
- [color ramp](color_ramp.md)
- [color ramp](color_ramp.md)
- [color](color.md)

6
programming_language.md
View file

@ -70,13 +70,13 @@ Besides the standard library there will also exist many third party [libraries](
## History
WIP
Programmability of the earliest computers was very limited, they were machines with hard-wired functionality and reprogramming them meant physically altering the circuitry -- even much later many of the simpler "computers", such as hand held electronic games, weren't running on any programmable [CPU](cpu.md) or chips of similar nature, but were rather a hand-designed electronic circuit "programmed" by the engineer who manually placed all the resistors and capacitors. However, theoretically, the idea of a programming language had been around for a long time -- in 18th century Basile Bouchon created a system for "programming" looms with what were essentially punch cards, in 19th century [Charles Babbage](babbage.md) designed mechanical computers that in principle very closely resembled today's computers and in the first half of the 20th century the universal [Turing machine](turing_machine.md) provided a theoretical framework for a fully programmable [digital](digital.md) computer even before there were any "real" computers to speak of. It was more of a question of technological [progress](progress.md) to make this a reality.
Very early computers were programmed directly in [machine code](machine_code.md), there weren't even any assemblers and assembly languages around, programmers had to do things like search for opcodes in computer manuals, manually encode data and get this all onto punch cards or in better case use some primitive interface such as so called "front panel" to program the computer. These kinds of machine languages that were used back then are now called **first generation languages**.
Along with cheaper and more abundant [transistors](transistor.md) finally came computers programmable with what we might call a "language" -- the first ones were programmed directly in [machine code](machine_code.md), there weren't even any assemblers and assembly languages around, programming involved tasks such as searching for opcodes in computer manuals, hand-encoding data and getting it all onto punch cards -- in better cases it was possible to use some primitive interface such as a "front panel" to program the computer. These kinds of machine languages that were used back then are now called **first generation languages**.
The **first higher level programming language** was probably Plankalkul made by Konrad Zuse some time shortly after 1942, though it didn't run on any computer, it was only in stage of specification -- implementation of it would only be made much later, in 1975. It was quite advanced -- it had [functions](function.md), arrays, exceptions and some advanced data structures, though it for example didn't support [recursive](recursion.md) calls. It was important as it planted the seed of an idea of an abstract, higher level, machine independent language.
The **first [assembly](assembly.md) language** was created by Maurice Wilkes and his team for the [EDSAC](edsac.md) computer released in 1949. It used single letters for instructions. Assembly languages are called **second generation languages**, they further help with programming, though still at very low level. Programmers were now able to write text (as opposed to plain numbers), instructions got human friendlier names and assemblers did some simple but tedious tasks automatically, but it's still it was pretty tedious to write in assembly and programs were still machine specific, non-portable.
The **first [assembly](assembly.md) language** was created by Maurice Wilkes and his team for the [EDSAC](edsac.md) computer released in 1949. It used single letters for instructions. Assembly languages are called **second generation languages**, they further facilitate programming, though still at very low level. These were things we now take for granted: programmers for example became able to type programs as text (instead of numbers), instructions we given human friendlier names and assemblers automated some simple but tedious tasks, but it still remained rather time consuming to write in assembly and programs were still machine specific, non-portable.
Only the **third generation languages** made the step of adding significant [abstraction](abstraction.md) to achieve a level of comfortable development and portability -- programmers would be able to e.g. write algebraic expressions that would be automatically translated to specific instructions by the language compiler; it would be enough to write the program once and then automatically compile it for different CPUs, without the need to rewrite it. **[Fortran](fortran.md)** is considered to be first such language, made in 1957 by [IBM](ibm.md). Fortran would develop and change throughout the years, it was standardized and added more "features", it became quite popular and is still used even nowadays, it is known for being very fast. In 1958 John McCarthy started to develop **[Lisp](lisp.md)**, a highly elegant, high level language that would spawn many derivatives and remains very popular even nowadays.

3776
random_page.md
View file

File diff suppressed because it is too large Load diff

2
science.md
View file

@ -4,7 +4,7 @@
Science (from Latin *scientia*, knowledge or understanding) in a wide sense means systematic gathering, inference and organization of knowledge, in a more strict, "western" sense this process has to be kept "reasonably rational" by obeying some specific strict rules and adhering to whatever principles of objectivity are currently set: nowadays for example the [scientific method](scientific_method.md) or mathematical [proof](proof.md). Sciences in the strict sense include [mathematics](math.md) (so called formal science), [physics](physics.md), biology, chemistry, [computer science](computer_science.md), as well as "soft sciences" such as [psychology](psychology.md), sociology etc. **The beauty of science is you don't have to trust anyone**: science is just about discovering ideas that work, ideas which anyone can verify himself at home, so there is no place for preachers, reviewers, judges of "trustworthiness" or "credibility"; people do not matter at all in science, only ideas do. For this science must not be [confused](often_confused.md) not only with [pseudoscience](pseudoscience.md) (such as [numerology](numerology.md) or [astrology](astrology.md)) but especially with **[soyence](soyence.md)** (political propaganda masked as "science", e.g. [gender studies](gender_studies.md), sponsored "science" of big pharma etc.) -- it must be remembered that **when science can no longer be questioned, it seizes to be science**, as asking questions and examining EVERYTHING are the very basic premises of a true science: this means that anything prohibited to be questioned, by law or [otherwise](de_facto.md) (e.g. by [cancel culture](cancel_culture.md)), such as the [Holocaust](holocaust.md) (forbidden to be denied in many countries such as Germany), [COVID](covid.md) vaccines, [racial](race.md) differences (prohibited on grounds of "[hate speech](hate_speech.md)") and similar topics CANNOT be seen as scientifically established, but rather politically established. Any shift towards establishing principles of trust, belief and "[moderation](moderation.md)", such as nowadays standard [peer censorship](peer_review.md), turns science into religion. As with everything once science becomes politically valuable, it will be seized by politicians -- in the [capitalist](capitalism.md) age the *science* sticker presents a brand and therefore capital; this capital is of course not just left lying around, politicians and businessmen take over it, and so the [21st century](21st_century.md) definition of science is made by politicians, not scientists, and in fact even many of those officially called scientists nowadays not scientists at all.
In the wider sense science may include anything that involves systematic intellectual research, e.g. [Buddhists](buddhism.md) often say their teaching is science rather than religion, that it is searching for objective truths, and it really is true -- a western fedora atheist will shit his pants in fury hearing such claim, however that's all he can really do.
In the wider sense science may include anything that involves systematic intellectual research, e.g. [Buddhists](buddhism.md) often say their teaching is science rather than religion, that it is searching for objective truths, and it really is true -- a western fedora [atheist](atheism.md) will shit his pants in fury hearing such claim, however that's all he can really do.
TODO: some noice tree of sciences or smth

2
wiki_pages.md
View file

File diff suppressed because one or more lines are too long

150
wiki_stats.md
View file

@ -3,16 +3,16 @@
This is an autogenerated article holding stats about this wiki.
- number of articles: 638
- number of commits: 1011
- total size of all texts in bytes: 5369555
- total number of lines of article texts: 38812
- number of commits: 1012
- total size of all texts in bytes: 5398270
- total number of lines of article texts: 39031
- number of script lines: 324
- occurrences of the word "person": 10
- occurrences of the word "nigger": 139
longest articles:
- [exercises](exercises.md): 128K
- [exercises](exercises.md): 132K
- [c_tutorial](c_tutorial.md): 128K
- [chess](chess.md): 108K
- [how_to](how_to.md): 80K
@ -35,60 +35,84 @@ longest articles:
top 50 5+ letter words:
- which (2924)
- there (2297)
- people (2200)
- example (1858)
- other (1664)
- about (1500)
- number (1363)
- software (1314)
- because (1228)
- their (1155)
- something (1111)
- would (1108)
- being (1091)
- program (1071)
- language (1014)
- called (989)
- things (945)
- without (909)
- simple (888)
- function (879)
- computer (860)
- numbers (850)
- different (825)
- these (799)
- programming (797)
- however (795)
- world (794)
- should (770)
- which (2936)
- there (2306)
- people (2201)
- example (1876)
- other (1669)
- about (1502)
- number (1365)
- software (1315)
- because (1231)
- their (1158)
- would (1115)
- something (1112)
- being (1093)
- program (1075)
- language (1016)
- called (991)
- things (948)
- without (913)
- simple (889)
- function (881)
- computer (862)
- numbers (851)
- different (832)
- these (802)
- programming (800)
- however (798)
- world (795)
- should (774)
- system (766)
- still (756)
- doesn (747)
- games (721)
- doesn (746)
- games (724)
- drummyfish (703)
- point (694)
- point (698)
- always (692)
- while (691)
- society (690)
- always (689)
- possible (684)
- probably (676)
- simply (672)
- using (657)
- course (633)
- https (628)
- possible (686)
- probably (678)
- simply (673)
- using (659)
- https (640)
- course (635)
- similar (624)
- actually (622)
- similar (621)
- someone (613)
- first (599)
- though (593)
- value (597)
- though (595)
- really (583)
- value (577)
latest changes:
```
Date: Sun Apr 27 03:32:20 2025 +0200
acronym.md
anarchism.md
bill_gates.md
capitalism.md
color.md
exercises.md
furry.md
interesting.md
interpolation.md
lrs_dictionary.md
main.md
morality.md
often_confused.md
random_page.md
reactionary_software.md
rgb332.md
rgb565.md
sorting.md
stereotype.md
wiki_pages.md
wiki_stats.md
wikidata.md
woman.md
Date: Tue Apr 22 21:55:26 2025 +0200
abstraction.md
acronym.md
@ -104,30 +128,6 @@ Date: Tue Apr 22 21:55:26 2025 +0200
earth.md
egoism.md
encryption.md
everyone_does_it.md
exercises.md
faggot.md
how_to.md
kiss.md
library.md
lrs_dictionary.md
math.md
money.md
pi.md
random_page.md
stereotype.md
wiki_pages.md
wiki_stats.md
wolf3d.md
Date: Mon Apr 21 21:24:21 2025 +0200
algorithm.md
anorexia.md
atheism.md
beauty.md
binary.md
c_tutorial.md
duskos.md
encyclopedia.md
```
most wanted pages:
@ -157,21 +157,21 @@ most popular and lonely pages:
- [lrs](lrs.md) (349)
- [capitalism](capitalism.md) (320)
- [c](c.md) (247)
- [c](c.md) (248)
- [bloat](bloat.md) (247)
- [free_software](free_software.md) (206)
- [game](game.md) (163)
- [suckless](suckless.md) (152)
- [proprietary](proprietary.md) (141)
- [modern](modern.md) (132)
- [computer](computer.md) (130)
- [minimalism](minimalism.md) (129)
- [computer](computer.md) (128)
- [censorship](censorship.md) (124)
- [kiss](kiss.md) (122)
- [programming](programming.md) (117)
- [math](math.md) (117)
- [programming](programming.md) (118)
- [math](math.md) (118)
- [shit](shit.md) (116)
- [fun](fun.md) (115)
- [fun](fun.md) (116)
- [woman](woman.md) (113)
- [gnu](gnu.md) (108)
- [linux](linux.md) (106)
@ -183,8 +183,8 @@ most popular and lonely pages:
- [hacking](hacking.md) (96)
- [work](work.md) (93)
- [less_retarded_society](less_retarded_society.md) (93)
- [internet](internet.md) (93)
- [programming_language](programming_language.md) (92)
- [internet](internet.md) (92)
- ...
- [friend_detox](friend_detox.md) (5)
- [free_body](free_body.md) (5)