Non-computability, unpredictability, and financial markets
One of the most significant achievements from theoretical computer science was to show that there are non-computable problems, which can- not be solved through algorithms. Although the formulation of such prob- lems is mathematical, they often can be interpreted as problems derived from other elds,...
| Autor principal: | |
|---|---|
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2012
|
| Texto completo: | http://hdl.handle.net/10400.1/1060 |
| País: | Portugal |
| Oai: | oai:sapientia.ualg.pt:10400.1/1060 |