Lukas' Notes
Search
Search
Dark mode
Light mode
Home
❯
Insights
Folder: Insights
69 items under this folder.
A 1-bit oracle can leak a whole database
A Deadline Gap Can Hide Subset Sum
A format string walks the stack by counting specifiers, not argument count
security
memory
c
A Hessian Eigenvalue Is Curvature in One Direction
A Large Learning-Rate Ratio Makes Descent Slow
A Matrix is a Linear Operator
A Neural Layer Draws Many Tests, Not One Boundary
A Pattern Carries Its Own Restart Points
A Perceptron Draws One Hyperplane
A Reduction Transfers Hardness, Not Weakness
complexity-theory
reductions
A Smooth Proxy Can Miss a Separator
Adding Sentences Shrinks Models and Grows Consequences
classical-logic
model-theory
Adjectives and Verbs are Predicates
An origin maps to many UI trees and PWMs guess which
web
security
mobile
Approximation's Collapse to Exactness
Bain's Ideas
Binary Encoding is Compact
Binary Error is Flat
Bras Test Directions and Kets Rebuild Them
Computation is about exploring Search Spaces
Cookies carry integrity, not just confidentiality, of the session
Eigenvectors Are Directions a Linear Operator Only Scales
Every mitigation closes one attack class and opens the next
security
memory
Every Normed Vector Space is a Metric Space
Fixed Machines Hide Number Partitioning
God does not play dice with the Universe
Hidden Neurons Have No Teacher
Hyperexcitability doesn't improve Cognition
Independent Set Inherits 3-SAT's Exponential Barrier
Linear Operations Are Index Wiring
Matroids are the Shape Behind Greedy
Migraine is about Overexcitement
Minus times Minus is Plus in a Ring
Mixing code and data is the root of web injection
MLPs are universal Boolean functions
MLPs are universal classifiers
MLPs are universal function approximators
Moving Branching Decisions into Decode Stage reduces Branch Delay
Neurons that fire together wire together
Not Every Decision Problem is decidable
Nouns are Terms
One Learning Rate Has to Please Every Direction
Orthogonality Splits Space
P = NP Is Not About Stacking Paths
complexity-theory
nondeterministic-turing-machines
P = NP Starts with a Missing Arrow
complexity-theory
computational-complexity
Pseudo-Polynomial Dynamic Programming is about Compression
Quantum Circuits Must Be Reversible
Quantum Computing is about Distributing Information
Reverse-Engineering the password_manager_v2 binary
security
binary-analysis
Same-origin vs same-site is the seam XSS and CSRF defences break on
Second Law of Thermodynamics gives Time its Arrow
Security properties are undecidable
Set of all Strings is countable
Sigmoid Turns a Score into a Probability
Some NP-Complete Problems Fit Through Subexponential Gaps
Spooky Action at a Distance
todo
Stable Infiniteness Removes Hidden Cardinality Conflicts
satisfiability-modulo-theory
decision-procedures
Subexponential Time Needs a Ruler
The Brain has no Pain Receptors
The Dot Product Is a Length-Weighted Shadow
linear-algebra
geometry
The Exponent Is the Terrain
complexity-theory
asymptotic-analysis
The first Anti-Malware Software was a Malware
The Geometry of the Perceptron Algorithm
The ModGreedyKnapsack Algorithm is a PTAS
The saved return address turns adjacent buffers into control flow
security
memory
c
Time in a Turing Machine
computational-complexity
input-encoding
turing-machines
Translation Begins with Truth Conditions
propositional-logic
Two Machines Can Hide Partition
URL validation is hard
1
2
3
4
5
6
7
Page 1 of 7