Noted: Tuesday, October 08, 2024, 19:30:00 + 5
parent
42450fa745
commit
9304082714
|
|
@ -1,5 +1,13 @@
|
|||
{
|
||||
"recentFiles": [
|
||||
{
|
||||
"basename": "About Databases",
|
||||
"path": "Coding Tips (Classical)/Terminal Tips/System Client/Servers/Databases/About Databases.md"
|
||||
},
|
||||
{
|
||||
"basename": "Qyte vs Byte",
|
||||
"path": "Machine Tips (Quantum)/Resources/QIS/Qyte vs Byte.md"
|
||||
},
|
||||
{
|
||||
"basename": "Alt. Obsidian",
|
||||
"path": "About Obsidian/Alt. Obsidian.md"
|
||||
|
|
@ -191,10 +199,6 @@
|
|||
{
|
||||
"basename": "NQI Joint Algorithms Workshop",
|
||||
"path": "Machine Tips (Quantum)/Resources/Companies, Orgs, & Events/NQI Joint Algorithms Workshop.md"
|
||||
},
|
||||
{
|
||||
"basename": "<PROGRAMMING 2023>",
|
||||
"path": "Machine Tips (Quantum)/Resources/Companies, Orgs, & Events/QP 2023/<PROGRAMMING 2023>.md"
|
||||
}
|
||||
],
|
||||
"omittedPaths": [],
|
||||
|
|
|
|||
|
|
@ -61,7 +61,7 @@
|
|||
"state": {
|
||||
"type": "markdown",
|
||||
"state": {
|
||||
"file": "About Obsidian/Alt. Obsidian.md",
|
||||
"file": "Coding Tips (Classical)/Terminal Tips/System Client/Servers/Databases/About Databases.md",
|
||||
"mode": "source",
|
||||
"source": false
|
||||
}
|
||||
|
|
@ -199,7 +199,7 @@
|
|||
"state": {
|
||||
"type": "backlink",
|
||||
"state": {
|
||||
"file": "About Obsidian/Alt. Obsidian.md",
|
||||
"file": "Coding Tips (Classical)/Terminal Tips/System Client/Servers/Databases/About Databases.md",
|
||||
"collapseAll": false,
|
||||
"extraContext": false,
|
||||
"sortOrder": "alphabetical",
|
||||
|
|
@ -216,7 +216,7 @@
|
|||
"state": {
|
||||
"type": "outgoing-link",
|
||||
"state": {
|
||||
"file": "About Obsidian/Alt. Obsidian.md",
|
||||
"file": "Coding Tips (Classical)/Terminal Tips/System Client/Servers/Databases/About Databases.md",
|
||||
"linksCollapsed": false,
|
||||
"unlinkedCollapsed": true
|
||||
}
|
||||
|
|
@ -239,7 +239,7 @@
|
|||
"state": {
|
||||
"type": "outline",
|
||||
"state": {
|
||||
"file": "About Obsidian/Alt. Obsidian.md"
|
||||
"file": "Coding Tips (Classical)/Terminal Tips/System Client/Servers/Databases/About Databases.md"
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
@ -269,8 +269,11 @@
|
|||
},
|
||||
"active": "d40066ccef541699",
|
||||
"lastOpenFiles": [
|
||||
"jetzy bmeeting.md",
|
||||
"Pasted image 20241008191503.png",
|
||||
"Machine Tips (Quantum)/Resources/QIS/Qyte vs Byte.md",
|
||||
"Coding Tips (Classical)/Terminal Tips/System Client/Servers/Databases/About Databases.md",
|
||||
"About Obsidian/Alt. Obsidian.md",
|
||||
"jetzy bmeeting.md",
|
||||
"Coding Tips (Classical)/Project Vault/Setup Guides/Setting up GDrive for Export.md",
|
||||
"Machine Tips (Quantum)/Resources/Companies, Orgs, & Events/List of Quantum Companies.md",
|
||||
"Machine Tips (Quantum)/Resources/Technologies, Orgs, & Apps/Applications/Machine Learning/Machine Learning (QML).md",
|
||||
|
|
@ -292,9 +295,6 @@
|
|||
"Machine Tips (Quantum)/Resources/Technologies, Orgs, & Apps/Applications/Quantum Cryptography/Blind Quantum computing.md",
|
||||
"Coding Tips (Classical)/Terminal Tips/1. Terminals/Shells/General Terminology.md",
|
||||
"Coding Tips (Classical)/Terminal Tips/About terminal.md",
|
||||
"Coding Tips (Classical)/Terminal Tips/System Client/Servers/Databases/Repos/Gitea.md",
|
||||
"Coding Tips (Classical)/Terminal Tips/1. Terminals/Shells/Terminal Emulators.md",
|
||||
"Coding Tips (Classical)/Terminal Tips/1. Terminals/Shells/Zsh.md",
|
||||
"About Obsidian/imgFiles/Pasted image 20240930161853.png",
|
||||
"Machine Tips (Quantum)/Project Vault/Website Projects",
|
||||
"Machine Tips (Quantum)/Resources/Technologies, Orgs, & Apps/Applications/Machine Learning",
|
||||
|
|
|
|||
|
|
@ -2,3 +2,43 @@
|
|||
You can have a database running on a physical server, cloud server, or just inside of your plain paper notebook. :-)
|
||||
|
||||
A database is a table of information.
|
||||
|
||||
|
||||
|
||||
---
|
||||
|
||||
# Kolmogorov complexity
|
||||
|
||||
|
||||
he 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. It is named after Andrey Kolmogorov, who first published on the subject in 1963 and is a generalization of **classical information theory**.
|
||||
|
||||
|
||||
The Kolmogorov complexity can be **defined for any mathematical object**, but for simplicity the scope of this article is restricted to strings. We must first specify a description language for strings. Such a description language can be based on any computer programming language, such as Lisp, Pascal, or Java. If P is a program which outputs a string x, then P is a description of x. The length of the description is just the length of P as a character string, multiplied by the number of bits in a character (e.g., 7 for ASCII)
|
||||
|
||||
|
||||
[Algorithmic information theory](https://en.wikipedia.org/wiki/Algorithmic_information_theory "Algorithmic information theory") is the area of computer science that studies Kolmogorov complexity and other complexity measures on strings (or other [data structures](https://en.wikipedia.org/wiki/Data_structure "Data structure")).
|
||||
|
||||
|
||||
---via [source](https://en.wikipedia.org/wiki/Kolmogorov_complexity)
|
||||
|
||||
|
||||
|
||||
# Issues with Occam's Razor
|
||||
---
|
||||
|
||||
For example, if a man, accused of breaking a vase, makes supernatural claims that leprechauns were responsible for the breakage, a simple explanation might be that the man did it, but ongoing ad hoc justifications (e.g., "... and that's not me breaking it on the film; they tampered with that, too") could successfully prevent complete disproof. This endless supply of elaborate competing explanations, called saving hypotheses, cannot be technically ruled out – except by using Occam's razor.
|
||||
|
||||
|
||||
![[Pasted image 20241008191503.png]]
|
||||
|
||||
|
||||
|
||||
# Akaike information criterion
|
||||
---
|
||||
|
||||
an estimator of prediction error and thereby relative quality of statistical models for a given set of data.[1][2][3] Given a collection of models for the data, AIC estimates the quality of each model, relative to each of the other models. Thus, AIC provides a means for model selection.
|
||||
|
||||
AIC is founded on information theory. When a statistical model is used to represent the process that generated the data, the representation will almost never be exact; so some information will be lost by using the model to represent the process. AIC estimates the relative amount of information lost by a given model: the less information a model loses, the higher the quality of that model.
|
||||
|
||||
|
||||
-- via [source](https://en.wikipedia.org/wiki/Akaike_information_criterion)
|
||||
|
|
@ -7,4 +7,7 @@ A single typed [character](https://simple.wikipedia.org/wiki/Character "Charact
|
|||
|
||||
In the field of quantum information science we want to draw similar enough connections. A qyte is a unit of measurement of the size of quantum information on quantum devices. A single qyte is usually 8 qubits. Some earlier computers used binary qubits for each byte. This is not the case for the kyte.
|
||||
|
||||
>[!note] This principle goes back at least as far as Aristotle, who wrote "Nature operates in the shortest way possible."
|
||||
|
||||
|
||||
|
||||
|
|
|
|||
Binary file not shown.
|
After Width: | Height: | Size: 857 KiB |
Loading…
Reference in New Issue