User:Hagerty7/Books/Computational Learning Theory Vol1
 | The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
 | You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
| This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] | ||||||||
Computational Learning Theory[edit]
Sub-Fields and Technical Enclosures[edit]
- INTRODUCTION
- Computational learning theory
- THEORY OF COMPUTATION
- Theory of computation
- Church–Turing thesis
- Turing machine
- Turing completeness
- Lambda calculus
- Combinatory logic
- Μ-recursive function
- Markov algorithm
- Register machine
- THEORY OF COMPUTATION
- COMPUTATIONAL COMPLEXITY THEORY
- Computational complexity theory
- Complexity
- Complexity class
- Computational problem
- Decision problem
- Function problem
- Counting problem (complexity)
- Optimization problem
- Promise problem
- Blum axioms
- DTIME
- P (complexity)
- EXPTIME
- NTIME
- NP (complexity)
- PP (complexity)
- Co-NP
- NEXPTIME
- Time complexity
- DSPACE
- L (complexity)
- PSPACE
- EXPSPACE
- NSPACE
- NL (complexity)
- BPP (complexity)
- ZPP (complexity)
- RP (complexity)
- AC (complexity)
- NC (complexity)
- FP (complexity)
- FNP (complexity)
- TFNP
- PLS (complexity)
- PPA (complexity)
- PPAD (complexity)
- BQP
- QMA
- Sharp-P
- IP (complexity)
- Arthur–Merlin protocol
- Interactive proof system
- ALL (complexity)
- Time hierarchy theorem
- Space hierarchy theorem
- Reduction (complexity)
- Polynomial-time reduction
- Log-space reduction
- Complete (complexity)
- P-complete
- NP-hardness
- NP-intermediate
- NP-completeness
- P versus NP problem
- Combinatorial explosion
- Cobham's thesis
- Big O notation
- L-notation
- List of complexity classes
- List of computability and complexity topics
- VAPNIK-CHERVONENKIS THEORY
- Vapnik–Chervonenkis theory
- VAPNIK-CHERVONENKIS THEORY
- EMPIRICAL PROCESSES
- Empirical process
- Stochastic process
- Random variable
- Central limit theorem
- Empirical measure
- Measure (mathematics)
- Measurable function
- Domain of a function
- Probability space
- Random element
- Random measure
- Probability measure
- Empirical probability
- Independence (probability theory)
- Independent and identically distributed random variables
- Indicator function
- Law of large numbers
- Uniform convergence
- Glivenko–Cantelli theorem
- Convergence of random variables
- Donsker's theorem
- Gaussian process
- Convergence of measures
- Brownian bridge
- Slutsky's theorem
- Covering number
- Dudley's theorem