Wikipedia: "On 13 February 1945, bad weather over Europe prevented any USAAF operations, and it was left to RAF Bomber Command to carry out the first raid. It had been decided that
>the raid would be a double strike, in which a second wave of bombers would attack three hours after the first, just as the rescue teams were trying to put out the fires.[De Bruhl 2006; pp. 203–206]
As was standard practice, other raids were carried out that night to confuse
Feb 13 • 7 tweets • 6 min read
"This paper is NOT written in order to vindicate #QuantumLogic. Rather it is written to rebut a mistaken criticism of quantum logic. The criticism is due to Popper () and it concerns a classical paper by #Birkhoff and #vonNeumann ().
>As is well known, this latter paper inaugurated the study of two rather different though interconnected kinds of problem, namely (1) the philosophical problem whether quantum mechanics involves a non-classical #logic, the so-called #QuantumLogic (2) the mathematical problem of
"Larger circuits can be constructed out of smaller circuits in three ways.
•..‘in parallel’[:] inputs and outputs are..placed side-by-side
•[‘inseries’][:] outputs of one circuit can be fed into the inputs of the next circuit[:] the resulting circuit
>has the inputs of the first circuit and the outputs of the second
•[‘#feedback’]: some of the outputs of a circuit can be fed back as its own input.
Using these three forms of #composition, circuits of billions of elementary components can be created using a very small number>
Feb 11 • 6 tweets • 3 min read
Recommendable: healthwyze.org/political-vide…("Another sign of the system being totally corrupted is their #SmartBoards which are replacing blackboards in every room. Along with most other so-called "smart" technologies, it is really a device intended more to dumb-down the users,
>or to at least insult their intelligence. These devices cost roughly $5,000 per unit, and require an additional recent..#computer to drive them. Therefore, when the cost of one of these is added to the cost of its driving computer, plus the #cost of setup,
By local testability we mean that the object can be tested for the natural property (i.e., being a codeword or a valid proof) using a small (typically constant)[Footnote: In this part, we associate local testability with tests
>that perform a constant number of probes.] number of probes, each recovering individual bits in a standard representation of the object. Thus, local testability allows for super-fast testing of the corresponding objects. The tests are probabilistic and hence the result
Jan 2 • 5 tweets • 2 min read
C. Teevs, ISBN 9783531164830: "[Er] ist ein Exot in der bundesdeutschen Politikerlandschaft..
Von..#Medien seit jeher gerne befragt.., ist er für die Parteiführung der #SPD zum..Ärgernis geworden.
..#Lauterbach [gehört] zu den unbeliebtesten Abgeordneten seiner Fraktion – aber
>auch zu den spannendsten[!]
Wie kam es dazu, dass der C4-Professor für Gesundheitsökonomie sein eigenes Institut hinter sich ließ und sich um ein Bundestagsmandat bewarb?
Die biografischen und strukturellen Hintergründe dieses Seiteneinstiegs werden geschildert und analysiert."
"Codes, proofs and their length
Codes are sets of strings (of equal length), typically, having a large pairwise distance. Equivalently, codes are viewed as mappings from short (𝑘-bit) strings to longer (𝑛-bit) strings, called codewords,
>such that the codewords are distant from one another. We will focus on codes with relative constant distance; that is, every two 𝑛-bit codewords are at distance Ω(𝑛) apart. The length of the code is measured in terms of the length of the pre-image (i.e., we are interested
Jan 2 • 4 tweets • 2 min read
We survey known results regarding locally testable codes and locally testable proofs (known as PCPs), with emphasis on the length of these constructs. Local testability refers to approximately testing large objects based on a very small
>number of probes, each retrieving a single bit in the representation of the object.
This yields super-fast approximate #testing of the corresponding property (ie., be a codeword or a valid proof).
We also review the related concept of local decodable [recte 'locally decodable'
A locally testable code (LTC) is an #ErrorCorrectingCode that has a property-tester. The tester reads 𝑞 bits (randomly - but not necessarily uniformly chosen) from a given word, and rejects words with probability proportional to
>their distance from the code. The parameter 𝑞 is called the locality of the tester.
A random code has, with high probability, constant rate and distance, but locality that is proportional to the length. This is true even for random #LDPC codes [BHR05], and
Dec 27, 2021 • 4 tweets • 3 min read
Relevant #detail: as of 2021-12-27, the article "Peter A. McCullough" in the English #Wikipedia does not mention the article with Jessica Rose at all! This looks like a coverup.
Relevant: as of 2021-12-27 the English #Wikipedia's version is more slanderous than the French, writing: "#McCullough promoted misinformation and falsehoods about COVID-19, the..vaccine, and..treatments."
French version: "il tient des propos contraires au consensus scientifique".