tbt

5 ms·

1.
by tbt 7mo ago
Sigh, thanks for letting me know. Ok since this is the ~third time someone has said this, I'll try to figure out a convenient solution (I guess hosting images on github?). Just FYI a VPN should let you see imgur images.
2.
by tbt 7mo ago
Oh sorry that was a joke. (Though you could teach that in kindergarten.) When I was in undergrad I had the privilege of taking Laszlo Babai's combinatorics class. I don't recall exactly how he phrased it, but he would say things
3.
by tbt 7mo ago
Ohhh, oops, good point, thanks.
4.
by tbt 10mo ago
Yeah I use imgur, which I've heard is somehow blocked in the UK. The US should work. Maybe I'll try to figure out fallback images and double-host on github, if that's a thing.
5.
by tbt 10mo ago
Thanks. Yeah I'm happy it at least exists somewhere.
6.
Introduction to radix (best cognate-tree grower, pre-α, dormant)(tsvibt.blogspot.com)
2 points by tbt 10mo ago|2 comments
7.
Forum Poweruser Forum(tsvibt.blogspot.com)
1 points by tbt 10mo ago|0 comments
8.
The Bughouse Effect(lesswrong.com)
1 points by tbt 10mo ago|0 comments
9.
Show HN: Theoriz3r, minimal proof of concept exploratory theorem prover(github.com)
3 points by tbt 3y ago|0 comments
10.
by tbt 3y ago
Regexression
11.
by tbt 4y ago
Idiocracy: https://www.youtube.com/watch?v=sVyRkl5qNb8
12.
by tbt 4y ago
Does anyone know any writeups that describe how someone solved a difficult problem they couldn't previously solve, using a note-taking app?
13.
by tbt 4y ago
It rarely helps with learning vs. natural counterfactuals. It harms by socializing kids to not believe that their own curiosity is hopeworthy. See John Taylor Gatto's work. Instead of inefficient spending for large, programmed classes,
14.
by tbt 4y ago
School rarely helps with learning and almost always harms learning. If you're still sending your kids to school, be mindful that you're doing that for reasons other than to help them learn.
15.
by tbt 4y ago
I had a math question that had some free parameters, making it a sort of question machine, giving one question for each setting of the parameters. It was hard to keep track of my thoughts and partial answers about the question-family, so I
16.
Show HN: Multi-Dimensional Spreadsheets in Vim(github.com)
2 points by tbt 4y ago|1 comments
17.
by tbt 5y ago
The browser could give the user a unique popup style (colored borders, etc.). As long as that info is hidden, this attack would have only a tiny chance of succeeding.
18.
by tbt 10y ago
Have you seen gwern's essay on computational complexity arguments about AI? https://www.gwern.net/Complexity%20vs%20AI
19.
by tbt 10y ago
>Self-trust seems like a problem on paper, but the reality is that normal mathematics uses very few universes. Self-trust (broadly construed) is interesting to me because it seems relevant to designing goal-based agents that are "st
20.
by tbt 10y ago
[ For some work formalizing a reflection principle in HOL, see https://intelligence.org/files/ProofProducingReflection.pdf ]
21.
by tbt 10y ago
Yep, that's the idea :) This is in the vein of "prediction using ensembles of experts" methods such as SI, with a twist that the experts are traders, not forecasters; they don't have to have opinions on everything the lo
22.
by tbt 10y ago
Yeah. It's still surprising to me, though; P_n can predict extremely long-running computations, even ones with a much longer runtime than P_n, at least as well as any quickly computable "pattern". (The algorithm in the paper
23.
by tbt 10y ago
> This allows you to state and show meta theorems "for all (small) types", by quantifying over a universe. As you say, this isn't quite self-trust. Another natural move is to relax the criterion of self-trust away from &qu
24.
by tbt 10y ago
This is a good point. I think it'd be pretty interesting and useful to get a better grasp on when/whether/how a system can reason about itself as embedded in the world in a sane way.
25.
by tbt 10y ago
This is right, but perhaps misleading; most of the properties are "asymptotic", meaning that they may take an extremely long time to hold, but they hold at finite times. For example, "provability induction" says that if
26.
by tbt 10y ago
The universal semimeasure is "computably approximable from below", aka (lower) semicomputable, meaning that you can computably list out all the rational numbers below a given value assigned by the measure. The probabilities assign