Lectures related to From Algorithms to Architectures: Isomorphic Mapping and Efficiency Assessment

Covers the Subset Sum problem and the efficient LLL algorithm for finding solutions in lattice basis reduction.

Covers recursively enumerable languages, Turing machines, and the construction of undecidable languages.

Explores algorithm complexity, analyzing efficiency and worst-case scenarios of sorting algorithms.

Explores simulating molecular biology dynamics, addressing challenges and opportunities in computational research.

Explores linear systems, convergence, and solving methods with a focus on CPU time and memory requirements.

Explores critical phenomena in complex systems, including stochastic objects, percolation, and combinatorial optimization.