I was digging through my OneDrive recently for work, and found this piece of writing.

There is naught but a small, dirt-filled puddle in front of this lawn. Yet only here – by the puddle – can Gary find a small, much-needed respite from the neverending work. Of course, without the hours he has committed to the sweatshop, his mother would have died ages ago from colora.

But how does it matter now? Rarely now – once every year – does he even earn the privilege to exit the heavily-guarded area to visit his mother; and how little time he has during such visits: each visit seems to just be a long walk, a knock, a kiss on the cheek – then back to the workhouse he goes.

DOI: 10.3389/fpsyg.2020.623237

One-Liner (thrice)

1. Used features extracted by VGGish from raw acoustic audio against a SVM, Perceptron, 1NN; got \(59.1\%\) classif. accuracy for dementia
2. Then, trained a CNN on raw wave-forms and got \(63.6\%\) accuracy
3. Then, they fine-tuned a VGGish on the raw wave-forms and didn’t report their results and just said “we discovered that audio transfer learning with a pretrained VGGish feature extractor performs better” Gah!

Novelty

Threw the kitchen sink to process only raw acoustic input, most of it missed; wanted 0 human involvement. It seems like last method is promising.

Anything that can be computed by a reasonable model of computation can also be computed by a turing machine.

“Everyone’s intuitive notion of algorithms is a Turing-machine”

Note that this is not a theorem: its just a scientific hypothesis because we have no formalization of the “intuitive notion”.

multi-tape machines

Consider:

would this give us something stronger? as in, we modify our transition function as simultaneously operating on all tapes

A circuit is a new model of computation, like turing machines. circuit are defined in terms of boolean logic, with components \(\text{AND}, \text{OR}, \text{NOT}\).

Most important quirk

constituents

• sequence of \(n\) true/false inputs \(x_1, …, x_{n}\)
• a graph with nodes belled AND/OR/NOT combining these things pairwise boolean gates
• a single output true/false

complexity measures of circuits

size (circuits)

number of gates—corresponds roughly to “time complexity”

depth (circuits)

length of the longest part from the output gate to inputs—roughly “parallel time complexity”