Language
One word, taught differently in 4 fields. Each use is given apart.
In Theory & Algos
A subset of all possible strings over an alphabet.
In Art & Architecture
Capacity for abstraction, conceptualization, and visualization.
In Systems & CS
Of a vocabulary and rules for what a string of words might mean to a person or a machine that hears them.
In Psychology
The computational or generative procedure that specifies the properties of an infinite range of linguistic expressions.
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.
Computational representational systems1Generative procedure1Machine1Person1Sets1String1Strings over an alphabet1Vocabulary1
Opens up
Concepts that name this one as a prerequisite.
In Theory & Algos
2Each in their own terms, from the easiest level.
Michael Sipser
A set of strings.
In Art & Architecture
1In Systems & CS
1In Psychology
1Lectures that assume it
35The first 12 are shown.
- Randomized Complexity: RP, coRP, and ZPP
- Approximate counting
- Hardness within P
- Morphology, Part 1
- P and NP, SAT, Poly-Time Reducibility
- Pushdown Automata, Conversion of CFG to PDA and Reverse Conversion
- The Complexity Class NP
- Reductions
- The Polynomial Hierarchy
- Interactive Proofs: IP=PSPACE
- If Brains Are Computers, Who Designs the Software?
- Recursion Theorem and Logic
Connections
47The lectures that define it or assume it, and the concepts next to it.
Concepts7
- Computational representational systems
- Machine
- NP
- TIME(t(n))
- Acceptance problem for Turing machines
- Arbitrariness of the sign
Show 1 moreShow fewer
Lectures40
- OOPSLA Conference: Growing a Language
- Introduction, Finite Automata, Regular Expressions
- Turing Machines
- Language, Generative Grammar, and the Cognitive Revolution (Killian Lecture)
- ARTH2710 Lecture 02: Prehistoric Art
- Randomized Complexity: RP, coRP, and ZPP
Show 34 moreShow fewer
- Approximate counting
- Hardness within P
- Morphology, Part 1
- P and NP, SAT, Poly-Time Reducibility
- Pushdown Automata, Conversion of CFG to PDA and Reverse Conversion
- The Complexity Class NP
- Reductions
- The Polynomial Hierarchy
- Interactive Proofs: IP=PSPACE
- If Brains Are Computers, Who Designs the Software?
- Recursion Theorem and Logic
- Reducibility
- NP-Completeness
- Hierarchy Theorems
- Course Introduction and Overview
- Circuits
- NP-Completeness and the Cook-Levin Theorem
- Ladner's Theorem and Mahaney's Theorem
- IP = PSPACE
- A History of Philosophy: Ordinary Language Philosophy
- Oracle Turing Machines and P^NP
- Decision Problems for Automata and Grammars
- Space Complexity, PSPACE, Savitch's Theorem
- Provably Intractable Problems, Oracles
- Nondeterminism
- How Do We Communicate?: Language in the Brain, Mouth
- Probabilistic Computation, BPP
- Semantic Change: Computational Models and Linguistic Evolution
- Schizophrenia
- Don Quixote, Part II: Chapters XXXVI-LIII
- The psycholinguistics of bilingualism - simultaneous language acquisition
- Photorealism, Neo-Expressionism, and Postmodernism (ARTH2720, Lecture 22)
- Who Am I? According to Mandukya Upanishad - Part 1
- Teaching Critical Thinking in Neurological Education by Robert Friedland, MD