Browser game Updated 2025-07-16
Browser platform game Updated 2025-07-16
gobattle.io/#! 2D top down dungeon crawler/brawler, controls feel good.
Browse S3 bucket on web browser Updated 2025-07-16
They can't even make this basic stuff just work!
bsub get job stdout and stderr Updated 2025-07-16
By default, LSF only sends you an email with the stdout and stderr included in it, and does not show or store anything locally.
One option to store things locally is to use:as documented at:
bsub -oo stdout.log -eo stderr.log 'echo myout; echo myerr 1>&2'Or to use files with the job id in them:
bsub -oo %J.out -eo %J.err 'echo myout; echo myerr 1>&2'By default as mentioned at:
bsub -oo:To get just the stdout to the file, use
bsub -N -oo which:- stores only stdout on the file
- re-enables the completion email
Another option is to run with the bsub This immediately prints stdout and stderr to the terminal.
-I option:bsub -I 'echo a;sleep 1;echo b;sleep 1;echo c' btcdeb Updated 2025-07-16
Tested on Ubuntu 23.10:Patch submited at: github.com/bitcoin-core/btcdeb/pull/143
sudo apt install libtool
git clone https://github.com/bitcoin-core/btcdeb
cd btcdeb
git checkout 4fd007e57b79cba9b5ffdf5ffe599778c0d63b88
./autogen.sh
./configure
make -jThen we use it;and inside the shell:
./btcdeb '[OP_1 OP_2 OP_ADD]'btcdeb 5.0.24 -- type `./btcdeb -h` for start up options
LOG: signing segwit taproot
notice: btcdeb has gotten quieter; use --verbose if necessary (this message is temporary)
3 op script loaded. type `help` for usage information
script | stack
--------+--------
1 |
2 |
OP_ADD |
#0000 1
btcdeb> step
<> PUSH stack 01
script | stack
--------+--------
2 | 01
OP_ADD |
#0001 2
btcdeb> step
<> PUSH stack 02
script | stack
--------+--------
OP_ADD | 02
| 01
#0002 OP_ADD
btcdeb> step
<> POP stack
<> POP stack
<> PUSH stack 03
script | stack
--------+--------
| 03
btcdeb> step
script | stack
--------+--------
| 03
btcdeb> step
at end of script
btcdeb> Build automation Updated 2025-07-16
Buildroot Updated 2025-07-16
The basis for Linux Kernel Module Cheat.
Bullet Physics parallel execution Updated 2025-07-16
Does not seem to support it unfortunately:
- 2015 thread: pybullet.org/Bullet/phpBB3/viewtopic.php?t=10783. On the reply pybullet.org/Bullet/phpBB3/viewtopic.php?p=36197&sid=5fbceed0c3a5ebcf233d328bb4ee1342#p36197 Erwin Coumans says there's no support, and no support planned.
Bullshit Updated 2025-07-16
Bundle assets into a single file in Phaser Updated 2025-07-16
Business film Updated 2025-07-16
Ciro Santilli defines a "business film" as a film about business, enterprises or entrepreneurship. Political thrillers are closed related as well.
This is one of his favorite film genres!
Some lists:
- www.99signals.com/movies-entrepreneur-watch-inspiration Hit and miss.
- www.imdb.com/list/ls033563570/ Best Business Movies and Documentaries by scott_dowle
Business-to-business Updated 2025-07-16
Busy beaver Updated 2025-07-16
The busy beaver game consists in finding, for a given , the turing machine with states that writes the largest possible number of 1's on a tape initially filled with 0's. In other words, computing the busy beaver function for a given .
There are only finitely many Turing machines with states, so we are certain that there exists such a maximum. Computing the Busy beaver function for a given then comes down to solving the halting problem for every single machine with states.
Some variant definitions define it as the number of time steps taken by the machine instead. Wikipedia talks about their relationship, but no patience right now.
The Busy Beaver problem is cool because it puts the halting problem in a more precise numerical light, e.g.:
- the Busy beaver function is the most obvious uncomputable function one can come up with starting from the halting problem
- the Busy beaver scale allows us to gauge the difficulty of proving certain (yet unproven!) mathematical conjectures
Busy Beaver Challenge Updated 2025-07-16
Project trying to compute BB(5) once and for all. Notably it has better presentation and organization than any other previous effort, and appears to have grouped everyone who cares about the topic as of the early 2020s.
Very cool initiative!
By 2023, they had basically decided every machine: discuss.bbchallenge.org/t/the-30-to-34-ctl-holdouts-from-bb-5/141
Busy beaver scale Updated 2025-07-16
The Busy beaver scale allows us to gauge the difficulty of proving certain (yet unproven!) mathematical conjectures!
To to this, people have reduced certain mathematical problems to deciding the halting problem of a specific Turing machine.
A good example is perhaps the Goldbach's conjecture. We just make a Turing machine that successively checks for each even number of it is a sum of two primes by naively looping down and trying every possible pair. Let the machine halt if the check fails. So this machine halts iff the Goldbach's conjecture is false! See also Conjecture reduction to a halting problem.
Therefore, if we were able to compute , we would be able to prove those conjectures automatically, by letting the machine run up to , and if it hadn't halted by then, we would know that it would never halt.
Of course, in practice, is generally uncomputable, so we will never know it. And furthermore, even if it were computable, it would take a lot longer than the age of the universe to compute any of it, so it would be useless.
However, philosophically speaking at least, the number of states of the equivalent Turing machine gives us a philosophical idea of the complexity of the problem.
The busy beaver scale is likely mostly useless, since we are able to prove that many non-trivial Turing machines do halt, often by reducing problems to simpler known cases. But still, it is cute.
But maybe, just maybe, reduction to Turing machine form could be useful. E.g. The Busy Beaver Challenge and other attempts to solve BB(5) have come up with large number of automated (usually parametrized up to a certain threshold) Turing machine decider programs that automatically determine if certain (often large numbers of) Turing machines run forever.
So it it not impossible that after some reduction to a standard Turing machine form, some conjecture just gets automatically brute-forced by one of the deciders, this is a path to
Butterfly dream Updated 2025-07-16
Chapter 2 paragraph 14:
Formerly, I, Zhuang Zhou, dreamt that I was a butterfly, a butterfly flying about, feeling that it was enjoying itself. I did not know that it was Zhou. Suddenly I awoke, and was myself again, the veritable Zhou. I did not know whether it had formerly been Zhou dreaming that he was a butterfly, or it was now a butterfly dreaming that it was Zhou. But between Zhou and a butterfly there must be a difference. This is a case of what is called the Transformation of Things.'
B vitamin Updated 2025-07-16
C2 Oxford physics course Updated 2025-07-16
C3 Oxford physics course Updated 2025-07-16
- web.archive.org/web/20170907092044/http://www2.physics.ox.ac.uk/students/course-materials/c3-condensed-matter-major-option it wasn't paywalled in the past up to 2017, but later became. Bastards.
- www2.physics.ox.ac.uk/sites/default/files/page/2011/10/04/c3-intro-vacprobs17-41753.pdf gives the 2016 structure:
- Crystal Structure & Dynamics 10 lectures Dr Roger Johnston
- Band Theory 10 lectures Prof Michael Johnston
- Magnetism 7 lectures Prof Radu Coldea
- Optical Properties 6 lectures Prof Laura Herz
- Superconductivity 7 lectures Dr Peter Leek and Dr Amalia Coldea. web.archive.org/web/20170912021658/http://www2.physics.ox.ac.uk/sites/default/files/page/2011/10/04/cmpsc-handout-2017-41006.pdf
Cabbage (Csound) Updated 2025-07-16
There are unlisted articles, also show them or only show them.