Lectures related to Opacity (optics)

Covers the basics of computational complexity, including big O notation and complexity classes.

Introduces regular expressions, covering language sets, syntax, semantics, and limitations.

Explores computational complexity, NP-completeness, and polynomial reductions in theoretical computer science.

Explores Turing machines, recursive languages, and decidability in the theory of computation.

Explores the behavior of a circular plate under distributed load, focusing on pure bending and displacement scenarios.

Explores work, potential energy, and virtual work in statics and dynamics, emphasizing equilibrium states and stability.

Explores virtual work, conservative forces, equilibrium, and internal loads in structures.

Covers regular languages, encoding, alphabets, words, languages, concatenation, exponentiation, and iterative closure.

Covers the kinematics and equilibrium equations of Kirchhoff rods, discussing geometric coupling between bending and twist.

Explores Turing machines, recursive languages, undecidability, and symbol elimination.

Covers the formal definition and properties of stack automata.

Covers deterministic pushdown automata and their use in language recognition.

Introduces the computation of deformations in structures by combining struts and rigid members, emphasizing equilibrium and displacement diagrams.

Covers advanced topics in beam bending, stress tensors, elasticity, and Atomic Force Microscopy.

Explores reflection at metal surfaces and optical constants of metals.

Explores beam bending, moment distribution, and buckling in structural mechanics.