Explore >> Select a destination
|
You are here 
|
xorshammer.com | ||
| | | | |
mathematicaloddsandends.wordpress.com
|
|
| | | | | I recently came across this theorem on John Cook's blog that I wanted to keep for myself for future reference: Theorem. Let $latex f$ be a function so that $latex f^{(n+1)}$ is continuous on $latex [a,b]$ and satisfies $latex |f^{(n+1)}(x)| \leq M$. Let $latex p$ be a polynomial of degree $latex \leq n$ that interpolates... | |
| | | | |
unstableontology.com
|
|
| | | | | (note: one may find the embedded LaTeX more readable on LessWrong) The Löwenheim-Skolem theorem implies, among other things, that any first-order theory whose symbols are countable, and which has an infinite model, has a countably infinite model. This means that, in attempting to refer to uncountably infinite structures (such as in set theory), one "may... | |
| | | | |
daniellefong.com
|
|
| | | | | The following occurred to me on a run about two years ago: It's not given much press, but the the Halting Problem is intimately related to Gödel's First Incompleteness Theorem. Indeed it produces it as a correllary. Historically, Gödel's incompleteness results were proved by hacking arithmetic into a Turing complete system, and this is still... | |
| | | | |
techsavvypriya.wordpress.com
|
|
| | | A quick introduction to 8 commonly used data structures Data Structuresare a specialized means of organizing and storing data in computers in such a way that we can perform operations on the stored data more efficiently. Data structures have a wide and diverse scope of usage across the fields of Computer Science and Software Engineering.... | ||
