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,...
| Main Author: | |
|---|---|
| Format: | article |
| Language: | eng |
| Published: |
2012
|
| Online Access: | http://hdl.handle.net/10400.1/1060 |
| Country: | Portugal |
| Oai: | oai:sapientia.ualg.pt:10400.1/1060 |