/explore
|
You are here 
|
blog.computationalcomplexity.org | ||
| | | | |
pressron.wordpress.com
Abstract: Machine and language models of computation differ so greatly in the computational complexity properties of their representation that they form two distinct classes that cannot be directly compared in a meaningful way. While machine models are self-contained, the properties of the language models indicate that they require a computationally powerful collaborator, and are better... |
|
| | | | | ||
| | | | |
windowsontheory.org
(Also available as a pdf file. Apologies for the many footnotes, feel free to skip them.) Computational problems come in all different types and from all kinds of applications, arising from engineering as well the mathematical, natural, and social sciences, and involving abstractions such as graphs, strings, numbers, and more. The universe of potential algorithms... |
|
| | | | | ||
| | | | |
www.scottaaronson.com
|
|
| | | | | ||
| | | | |
alanrendall.wordpress.com
The theorem of the title is about dividing smooth functions by other smooth functions or, in other words, representing a given smooth function in terms of products of other smooth functions. A large part of the account which follows is based on that in the book 'Normal Forms and Unfoldings for Local Dynamical Systems' by... |
|
| | | |||
