Nov 25 2017 13:17 UTC

Thomas Klimpel subscribed to Numerical Analysis

Nov 25 2017 13:16 UTC

Thomas Klimpel scited Fast and Stable Pascal Matrix Algorithms

Nov 24 2017 10:44 UTC

Thomas Klimpel scited Kullback-Leibler Principal Component for Tensors is not NP-hard

Nov 24 2017 08:45 UTC

Thomas Klimpel subscribed to Data Structures and Algorithms

Nov 24 2017 08:45 UTC

Thomas Klimpel subscribed to Distributed, Parallel, and Cluster Computing

Nov 24 2017 08:44 UTC

Thomas Klimpel subscribed to Computational Geometry

Nov 13 2017 09:24 UTC

Thomas Klimpel scited Minimum Circuit Size, Graph Isomorphism, and Related Problems

Nov 07 2017 10:35 UTC

Thomas Klimpel scited Interactions of Computational Complexity Theory and Mathematics

Oct 26 2017 21:51 UTC

Thomas Klimpel scited Evidence of an exponential speed-up in the solution of hard optimization problems

Oct 24 2017 20:24 UTC

Thomas Klimpel scited Satisfiability in multi-valued circuits

Oct 24 2017 20:24 UTC

Thomas Klimpel scited Theoretical Computer Science for the Working Category Theorist

Oct 06 2017 09:44 UTC

Sep 27 2017 09:13 UTC

Thomas Klimpel scited The structure of information: from probability to homology

Sep 27 2017 09:09 UTC

Thomas Klimpel scited Designing Strassen's algorithm

Sep 27 2017 09:02 UTC

Thomas Klimpel scited The Orthogonal Vectors Conjecture for Branching Programs and Formulas

Jul 27 2017 09:19 UTC

Thomas Klimpel scited Aspects of Chaitin's Omega

Jul 27 2017 09:15 UTC

Jul 11 2017 23:30 UTC

Thomas Klimpel scited Accelerated Stochastic Power Iteration

May 12 2017 07:42 UTC

Thomas Klimpel scited Lyapunov Exponents for the Intermittent Transition to Chaos

Apr 21 2017 21:26 UTC

Thomas Klimpel scited A Survey and Discussion of Memcomputing Machines

Apr 20 2017 07:15 UTC

Thomas Klimpel scited Evaluating gambles using dynamics

Feb 23 2017 08:25 UTC

Thomas Klimpel scited Compression Complexity

Jan 18 2017 00:20 UTC

Thomas Klimpel scited On the Complexity of L-reachability

Jan 02 2017 13:10 UTC

Thomas Klimpel scited A Ghost at $\omega_1$

This paper [appeared][1] in February 2016 in the peer reviewed interdisciplinary journal Chaos by the American Institute of Physics (AIP).

It has been reviewed publicly by amateurs both [favorably][2] and [unfavorably][3]. The favorable review took the last sentence of the abstract ("These invalidate a commonly cited argument for bounded utility functions.") as the main message of the paper. The unfavorable review regards this merely as a side argument, and instead evaluates "this paper, which claims to present a new and preferred way (compared to expected utility) of evaluating gambles, as well as major rethinking of economic theory" on the basis that it would propose a revolutionary new perspective on decision theory.

[1]: http://scitation.aip.org/content/aip/journal/chaos/26/2/10.1063/1.4940236

[2]: http://chat.stackexchange.com/transcript/message/36749024#36749024

[3]: https://www.reddit.com/r/badeconomics/comments/44823o/econophysics_comes_to_rescue_evaluating_gambles/