声明：本pdf来自网络，仅供学习用，不可用于商业用途。 深度学习，大牛作品，希望对大家有用

首次尝试获取用于计算超体积和超体积贡献的公开 MATLAB 代码。 该实现可用于 2D 和 3D。 对于 4D 及更高版本，它不是那么有效，但它确实产生了正确的结果。 非常欢迎贡献。 该代码也可在 RODEOlib sourceforge 项目中使用和维护。

Fotran 经典书籍，数值计算相关。帮了我不少忙。值得推荐

这个是MIT的edx中Introduction to Computer Science and Programming Using Python 计算机科学及python编程导论课程的的教材，这个是最新版本，我在网上找了三四天才找到的，是2013年8月份的，绿色封皮那个。

目录: 01. A first Course in Logic An Introduction To Model Theory Proof Theory Computability And Complexity - Shawn Hedman(djvu) 02. Advanced Complexity Theory Lctn - Madhu Sudan(pdf) 03. Algorithm and Complexity Lctn - Herbert S. Wilf(pdf) 04. Algorithms and Theory of Computation Handbook - Mikhail J. Atallah(djvu) 05. An Introduction to Formal Language Theory that Integrates Experimentation and Proof - Allen Stoughton(pdf) 06. An Introduction To Recursive Function Theory -Nigel Cutland(pdf) 07. An Introduction to the Theory of Computation - Eitan Gurari(pdf) 08. CLASSICAL RECURSION THEORY The Theory of Functions and Sets of Natural Numbers - Piergiorgio Odifreddi(djvu) 09. Complexity of Algorithms Lctn - Peter Gacs(pdf) 10. Computation Complexity Lctn - Laszlo Lovasz(pdf) 11. Computational Complexity - Christos Papadimitriou(djvu) 12. Computational Complexity A Conceptual Perspective - Oded Goldreich(pdf) 13. Computational Complexity A Modern Approach - Sanjeev Arora(pdf) 14. Computers And Intractability A Guide To The Theory Of Np-Completeness - Michael Garey(djvu) 15. Elementary Recursion Theory and its Applications to Formal Systems - Saul Kripke(pdf) 16. Elemnts Of The Theory Of Computation 2d ed - Harry Lewis(djvu) 17. Essentials of Theoretical Computer Science - F. D. Lewis(pdf) 18. Goldreich O. Introduction to Complexity Theory (lectures, 1999)(T)(375s)(djvu) 19. Goldreich O. Introduction to complexity theory, lecture notes (1999)(375s)(pdf) 20. Introduction To Automata Theory Languages , and Computation - John Hopcroft(djvu) 21. Introduction to Complexity Theory Lecture Notes - Oded Goldreich(pdf) 22. Introduction To The Theory Of Computation - Michael Sipser(djvu) 23. Kolmogorov Complexity and Computational Complexity - Osamu Watanabe(djvu) 24. Lecture Notes for Introduction to Theory of Computation - Robert Daley(pdf) 25. Lecture Notes On Algorithm Analysis And Computation Complexity 4th ed - Ian Parberry(pdf) 26. Lewis H.R., Pa

Deep Learning (Adaptive Computation and Machine Learning series) Ian Goodfellow is Research Scientist at OpenAI. Yoshua Bengio is Professor of Computer Science at the Université de Montréal. Aaron Courville is Assistant Professor of Computer Science at the Université de Montréal.

该项目使用 Hadoop-Mapreduce 对大约 3000 只纳斯达克股票进行了股票波动率计算。 该项目是作为纽约州立大学布法罗大学 Vipin Chaudhary 博士的 CSE587-数据密集型计算（2015 年Spring）课程的一部分实施的

design con paper，s参数到TDR转换的计算公式

网络资源，仅为分享。 Introduction to Theory of Computation Contents Preface vi 1 Introduction 1 1.1 Purpose and motivation . . . . . . . . . . . . . . . . . . . . . 1 1.1.1 Complexity theory . . . . . . . . . . . . . . . . . . . . 2 1.1.2 Computability theory . . . . . . . . . . . . . . . . . . . 2 1.1.3 Automata theory . . . . . . . . . . . . . . . . . . . . . 3 1.1.4 This course . . . . . . . . . . . . . . . . . . . . . . . . 3 1.2 Mathematical preliminaries . . . . . . . . . . . . . . . . . . . 4 1.3 Proof techniques . . . . . . . . . . . . . . . . . . . . . . . . . 7 1.3.1 Direct proofs . . . . . . . . . . . . . . . . . . . . . . . 8 1.3.2 Constructive proofs . . . . . . . . . . . . . . . . . . . . 9 1.3.3 Nonconstructive proofs . . . . . . . . . . . . . . . . . . 10 1.3.4 Proofs by contradiction . . . . . . . . . . . . . . . . . . 11 1.3.5 The pigeon hole principle . . . . . . . . . . . . . . . . . 12 1.3.6 Proofs by induction . . . . . . . . . . . . . . . . . . . . 13 1.3.7 More examples of proofs . . . . . . . . . . . . . . . . . 15 Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 2 Finite Automata and Regular Languages 21 2.1 An example: Controling a toll gate . . . . . . . . . . . . . . . 21 2.2 Deterministic finite automata . . . . . . . . . . . . . . . . . . 23 2.2.1 A first example of a finite automaton . . . . . . . . . . 26 2.2.2 A second example of a finite automaton . . . . . . . . 28 2.2.3 A third example of a finite automaton . . . . . . . . . 29 2.3 Regular operations . . . . . . . . . . . . . . . . . . . . . . . . 31 2.4 Nondeterministic finite automata . . . . . . . . . .

Introduction to the theory of computation 是由MIT教授MICHAEL SIPSER 写的经典教材，通俗易懂。