Formal sciences形式科学

Count sketch 001 Roundoff 002 Shift-and-invert 003 Directed graph 004 Graph theory 005 Forward checking 006 Compact operator 007 Borel sigma-algebra 008 Right-hand rule 009 Monotone operator 010 Roundoff error 011 Overflow and underflow 012 Spectral graph theory 013 Constraint satisfaction 014 Mixing time 015 Sparse graph 016 Bayesian regression 017 Randomness extractor 018 Queueing theory 019 Sequential rejection rule 020 Tolerance factor 021 Tolerance interval 022 Ties-to-even 023 Residual error 024 Proper scoring rules 025 MDL principle 026 Compression length 027 Cellular automaton 028 Conditional independence 029 ARCH 030 Hits@K 031 Quadratic distortion 032 Theory of Linear Arithmetic 033 Feasibility non-emptiness 034 Ambiguity set 035 Weight normalization 036 Robust likelihood 037 Undecidability 038 Completeness under Turing reducibility 039 Turing reduction 040 Recursively enumerable language 041 Rice’s theorem 042 Computability theory 043 Cantor’s diagonal argument 044 Numerical optimization 045 Forward–backward algorithm 046 Expectation–Maximization 047 Practical Identifiability 048 Pseudo-true parameter 049 Homogeneous solution 050