Variable
One word, taught differently in 3 fields. Each use is given apart.
In Systems & CS
A named storage location in memory that holds a value.
In Theory & Algos
A symbol in a context-free grammar that appears on the left-hand side of a rule.
In AI & ML
Something that can have an assignment.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Computer memory1Constraint satisfaction problem1Context-free grammar1Data types1Programming concepts1User interface actions1Value1
Opens up
Concepts that name this one as a prerequisite.
In Systems & CS
2Each in their own terms, from the easiest level.
David J. Malan
A variable is a container in the computer's memory for some value.Alan Kay
A named storage location in programming that holds a value.
In Theory & Algos
1In AI & ML
1Lectures that assume it
97The first 12 are shown.
- Spelled-Out Intro to Neural Networks & Backpropagation: Building micrograd
- Preface: MIT Calculus Revisited - Single Variable Calculus
- Exceptions
- Loops
- Conditionals
- Metacircular Evaluator, Part 1 (1986)
- Streams, Part 1
- Compound Data Structures in Programming
- Higher-Order Procedures and Functional Abstraction
- HTML, CSS, JavaScript
- The Fourier Expansion and Basic Formulas
- Assignment, State, and Side-effects (SICP Lecture 5a)
Connections
109The lectures that define it or assume it, and the concepts next to it.
Concepts7
Show 1 moreShow fewer
Lectures102
- Functions, Variables
- Constraints: Search and Domain Reduction
- C Programming
- Regular Pumping Lemma, Conversion of FA to Regular Expressions
- The Computer Revolution Hasn't Happened Yet (2003 ACM A.M. Turing Award Lecture)
- Spelled-Out Intro to Neural Networks & Backpropagation: Building micrograd
Show 96 moreShow fewer
- Preface: MIT Calculus Revisited - Single Variable Calculus
- Exceptions
- Loops
- Conditionals
- Metacircular Evaluator, Part 1 (1986)
- Streams, Part 1
- Compound Data Structures in Programming
- Higher-Order Procedures and Functional Abstraction
- HTML, CSS, JavaScript
- The Fourier Expansion and Basic Formulas
- Assignment, State, and Side-effects (SICP Lecture 5a)
- Matrix Algebra: Linearity Revisited
- Sorting Algorithms
- Harvard CS50’s Artificial Intelligence with Python – Full University Course
- Introduction to Neural Networks
- The Anatomy of an Optimization Problem
- Lists and Mutability in Python
- Functions as Objects
- Decomposition, Abstraction, and Functions
- Strings, Input/Output, and Branching in Python
- Introduction to Computation and Python Programming
- Explicit-Control Evaluator
- Compound Data Structures in SICP
- Regular Expressions
- Bentley Rules for Optimizing Work
- Complexity: P, NP, NP-completeness, Reductions
- Introductory Calculus: First Year Student Lecture
- Parametric Curves in ℝ³
- Equations of Lines and Planes
- Recursion
- Higher-order Procedures (SICP Lecture 2a)
- Reasoning About Programs
- Constraint Satisfaction Problems
- Fundamentals of Creative Audio Coding I: SuperCollider Environment and Core Programming Concepts (MUS 403, Week 1)
- Reality and the Orbital Approximation
- Gaussian Elimination and Tomographic Imaging
- Python Classes
- List Comprehension, Functions as Objects, Testing, and Debugging in Python
- Aliasing and Cloning in Python
- Bisection Search and Newton-Raphson
- Iteration and Control Flow in Python
- Object-Oriented Programming
- Media for Thinking the Unthinkable
- Thinking Above the Code
- Arrays
- Algorithms
- Data Structures
- The Geography of Upward Mobility in America
- Pushdown Automata, Conversion of CFG to PDA and Reverse Conversion
- Linear Programming: LP, Reductions, Simplex
- Category Theory 3.2: Kleisli Category
- Unit Tests
- Convex Optimization II: Primal and Dual Decomposition Methods
- Constraint Satisfaction Problems (CSPs) Part 1/2
- First-Order Substitution Methods: Bernoulli and Homogeneous ODEs
- Curves in 2D and 3D Spaces
- Computing with High-Dimensional Vectors
- Linear Algebra: Introduction to Linear Systems
- Memory Management, Pointers, and Buffer Overflows
- Python Class Methods: Decomposition and Abstraction
- Loops over Strings, Guess-and-Check, and Binary
- File I/O
- Related Rates
- Mathematical Optimization & Why Convexity Is the Watershed
- Cognitive Neuroscience Methods I
- Memory
- Improving Judicial Decisions
- Boolean Satisfiability (SAT)
- Introduction to Linear Programming
- Logic Programming, Part 2 (SICP Lecture 8b)
- Convex Optimization II: Localization and Cutting-Plane Methods
- DEFINING THE STUDY OUTCOME _ DR SHRIKANT I BANGDIWALA
- The Mathematics of Causal Inference and the Logic of Science
- Proofs, Eigenvalues, and PageRank
- Arithmetic Geometry and Computation
- Massive Open Online Courses (MOOCs): How Do They Work?
- Et Cetera
- Programming
- Technology and Invention in Finance
- Python
- Tangible Examples in Quantum Mechanics
- Algebraic Circuit Complexity
- Constraint Satisfaction Problems
- UG-Hardness Results from Dictator Tests
- Inheritance
- Selection of Study Population
- TYPES OF ANALYSIS _ DR SHRIKANT BANGDIWALA
- Double Minima, Earnshaw's Theorem and Plum-Puddings
- Rediscovering JavaScript
- Backpropagation: Finding Partial Derivatives
- Medical Education Workshop: Designing a Research Study
- Day 3 (I) - End-of- study analyses_ Prof. Shrikant I Bangdiwala
- Day 1 (I) - Why do we need clinical trials _ Prof. SI Bangdiwala
- The Future of Programming will be Live
- Data Management
- Mojo: Modular's Unified Device Accelerator Language