Submit a new job. The most important command!
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>Set of all decision problems solvable by a Turing machine, i.e. that decide if a string belongs to a recursive language.
Converts RNA to DNA, i.e. the inverse of transcription. Found in viruses such as Retrovirus, which includes e.g. HIV.
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
Most important application: produce X-rays for X-ray crystallography.
Note however that the big experiments at CERN, like the Large Hadron Collider, are also synchrotrons.
List of facilities: en.wikipedia.org/wiki/List_of_synchrotron_radiation_facilities
Uses the frequency of the hyperfine structure of caesium-133 ground state, i.e spin up vs spin down of its valence electron , to define the second.
International System of Units definition of the second since 1967, because this is what atomic clocks use.
TODO why does this have more energy than the hyperfine split of the hydrogen line given that it is further from the nucleus?
They can only absorb electrons up to a certain point, but then the pushback becomes too strong, and current stops.
Therefore, they cannot conduct direct current long term.
For alternating current however, things are different, because in alternating current, electrons are just jiggling back and forward a little bit around a center point. So you can send alternating current power across a capacitor.
The key equation that relates Voltage to electric current in the capacitor is:So if a voltage Heavyside step function is applied what happens is:More realistically, one may consider the behavior or the series RC circuit to see what happens without infinities when a capacitor is involved as in the step response of the series RC circuit.
- the capacitor fills up instantly with an infinite current
- the current then stops instantly
Capacitors Explained by The Engineering Mindset
. Source. 2019.Not unique: different generating sets lead to different graphs, see e.g. two possible en.wikipedia.org/w/index.php?title=Cayley_graph&oldid=1028775401#Examples for the
For some reason, Ciro Santilli is mildly obsessed with understanding and visualizing the real projective plane.
To see why this is called a plane, move he center of the sphere to , and project each line passing on the center of the sphere on the x-y plane. This works for all points of the sphere, except those at the equator . Those are the points at infinity. Note that there is one such point at infinity for each direction in the x-y plane.
This one strikes the right balance between restriction and permissions. NC and ND are simply too restrictive.
TODO where does the SA boundary end? E.g.:
- software: opensource.stackexchange.com/questions/173/what-do-i-need-to-share-if-i-include-cc-by-sa-artwork-in-my-software/11323#11323
- video game:
- website: graphicdesign.stackexchange.com/questions/68805/using-cc-by-sa-3-0-images-in-website-does-share-alike-affect-my-websites-lice/145124#145124
- book: academia.stackexchange.com/questions/48375/using-images-with-cc-by-sa-license-in-slides-or-a-thesis
- music in a podcast: opensource.stackexchange.com/questions/7022/using-cc-by-sa-music-in-a-podcast
There are unlisted articles, also show them or only show them.