Outer Web | Explore

Explore >> Select a destination

You are here		www.jeremykun.com P vs. NP, A Primer (And a Proof Written in Racket) \|\| Math ? Programming
\|	\|	www.yodaiken.com Mathematics errors in computer science - keeping simple	11.2 parsecs away Travel
\|	\|		11.2 parsecs away Travel
\|	\|	reportofanimals.com Thinking About Thought - REPORT OF ANIMALS	12.1 parsecs away Travel
\|	\|	DISCLAIMER: This is an essay I wrote for my Masters degree in 2023, part of a series I will be putting on this site to get me started. While I have changed some of my views and found new lines of inquiry since I wrote this, I feel there is value in it and after...	12.1 parsecs away Travel
\|	\|	jeremykun.wordpress.com Turing Machines - A Primer - Math ? Programming	6.3 parsecs away Travel
\|	\|	We assume the reader is familiar with the concepts of determinism and finite automata, or has read the corresponding primer on this blog. The Mother of All Computers Last time we saw some models for computation, and saw in turn how limited they were. Now, we open Pandrora's hard drive: Definition: A Turing machineis a...	6.3 parsecs away Travel
\|	\|	jmanton.wordpress.com Some Comments on the Situation of a Random Variable being Measurable with respect to the Sigma-Algebra Generated by Another Random Variable \| Jonathan Manton's Blog	103.9 parsecs away Travel
\|		If $latex Y$ is a $latex \sigma(X)$-measurable random variable then there exists a Borel-measurable function $latex f \colon \mathbb{R} \rightarrow \mathbb{R}$ such that $latex Y = f(X)$. The standard proof of this fact leaves several questions unanswered. This note explains what goes wrong when attempting a "direct" proof. It also explains how the standard proof...	103.9 parsecs away Travel