IITH BTECH CSE all Courses' Codes and Assignments
-
Updated
May 12, 2021 - Jupyter Notebook
IITH BTECH CSE all Courses' Codes and Assignments
Knaster-Tarski least fixpoint iterative solver computing greatest lower bounds and invariant convergence over complete finite lattices.
Knaster-Tarski least fixpoint iterative solver computing greatest lower bounds and invariant convergence over complete finite lattices.
🌌 The Ouroboros Code: Formal specifications for n/, a data-centric, lattice-based declarative language. Data ≅ Type ≅ Logic. Truth is the point of convergence.
A systematic, dimensionless derivation of Planckian and cosmological constants within a discrete signed 32-bit integer grid architecture.
Lattice-theory based Fuzzy Inference System, suited for sparse rule bases.
A from-scratch Python library for Monotone Co-Design Problems (MCDPs) after Censi (2015): compose design problems over functionality/resource posets with series/parallel/feedback, solve Pareto fronts by Kleene fixed-point iteration. Ships uncertainty, online learning, temporal & sequential co-design, 25 worked examples, and a 113-page manual.
A short historical survey of the Congruence Lattice Problem in lattice theory
Lean 4 formalization of First Proof Second Batch Problem 6: an irreducible vertex in a positive-definite integer-weighted tree lattice.
Volume IV of Learning Real Analysis: Abstract algebra, linear algebra, lattice theory, category theory, and algebraic structures.
To associate your repository with the lattice-theory topic, visit your repo's landing page and select "manage topics."