Marxian Reproduction Prices Versus Prices of Production: Probability and Convergence

I shall argue two main points. The first is that although Marx is conventionally taken to have formulated two different theories of price in the the three volumes of Capital, labour values in volume I and prices of production in volume III, there is actually a third theory, hidden inside the reproduction schemes of volume II. This theory is not explicit, but can be logically deduced from the constraints that he presents on simple reproduction. It is not a theory of individual prices, but a theory of relative sectoral prices. I will go on to argue that this theory of sectoral prices allows us to make probabilistic arguments about the relative likely-hood that either production prices or labour values will operate at the level of reproduction schemes. This paper provides a measure on the configuration space associated with Marxian prices of production and labour values. By use of random matrix techniques it shows that the solutions space associated with prices of production is similar to that associated with classical labour values. In the latter part of the paper, a sample of reproduction schemes is simulated over time, under assumptions of capital movement, to see whether such systems dynamically converge on prices of production. It is found that some converge, and some fail to converge

Mises, Kantorovich and Economic Computation

An article that reviews the work of Kantorovich in the light of von Mises claim that rational calculations were impossible without markets. It gives a tutorial introduction to the use of Kantorovich's methods, compares his approach to that of Dantzig. An assesment is given of the extent to which new interior point methods of linear programming strengthen or weaken Kantorovich's claims.Kantorovich, Linear-programming, von-Mises

Against Hayek

Presents a critical analysis of Hayek in the light of modern computability and economic computability theory.Hayek, Computability, Socialism

Sraffa's reproduction prices versus prices of production: probability and convergence

The article argues that the reproduction prices introduced in the first chapter of Sraffa's book are not necessarily compatible with the profit equalising prices that form the substance of the book. It uses probabilistic arguments about how probable it is that reproduction prices will approximate to profit equalising prices. By use of random matrix techniques, it shows that the solutions space associated with prices of production is similar to that associated with classical labour values. In the latter part of the article, a random sample of reproduction schemes is simulated over time, under assumptions of capital movement, to see whether such systems dynamically converge on profit equalising prices. It is found that some converge and some fail to converge

A 3D Reconstruction Algorithm for the Location of Foundations in Demolished Buildings

The location of foundations in a demolished building can be accomplished by undertaking a Ground Penetrating Radar (GPR) survey and then to use the GPR data to generate 3D isosurfaces of what was beneath the soil surface using image reconstruction. The SIMCA ('SIMulated Correlation Algorithm') algorithm is a technique based on a comparison between the trace that would be returned by an ideal point reflector in the soil conditions at the site and the actual trace. During an initialization phase, SIMCA carries out radar simulation using the design parameters of the radar and the soil properties. The trace which would be returned by a target under these conditions is then used to form a kernel. Then SIMCA takes the raw data as the radar is scanned over the ground and removes clutter using a clutter removal technique. The system correlates the kernel with the data by carrying out volume correlation and produces 3D images of the surface of subterranean objects detected. The 3D isosurfaces are generated using MATLAB software. The validation of the algorithm has been accomplished by comparing the 3D isosurfaces produced by the SIMCA algorithm, Scheers algorithm and REFLEXW commercial software. Then the depth and the position in the x and y directions as obtained using MATLAB software for each of the cases are compared with the corresponding values approximately obtained from original Architect's drawings of the buildings

Architecture Without Explicit Locks for Logic Simulation on SIMD Machines

The presentation describes an architecture for logic simulation that takes advantages of the features of multi-core SIMD architectures. It uses neither explicit locks nor queues, using instead oblivious simulation. Data structures are targeted to efficient SIMD and multi-core cache operation. We demonstrate high levels of parallelisation on Xeon Phi and AMD multi-core machines. Performance on a Xeon Phi is comparable to or better than on a 1000 core Blue Gene machine

Architecture Without Explicit Locks for Logic Simulation on SIMD Machines

The presentation describes an architecture for logic simulation that takes advantages of the features of multi-core SIMD architectures. It uses neither explicit locks nor queues, using instead oblivious simulation. Data structures are targeted to efficient SIMD and multi-core cache operation. We demonstrate high levels of parallelisation on Xeon Phi and AMD multi-core machines. Performance on a Xeon Phi is comparable to or better than on a 1000 core Blue Gene machine

A Software Retina for Egocentric & Robotic Vision Applications on Mobile Platforms

We present work in progress to develop a low-cost highly integrated camera sensor for egocentric and robotic vision. Our underlying approach is to address current limitations to image analysis by Deep Convolutional Neural Networks, such as the requirement to learn simple scale and rotation transformations, which contribute to the large computational demands for training and opaqueness of the learned structure, by applying structural constraints based on known properties of the human visual system. We propose to apply a version of the retino-cortical transform to reduce the dimensionality of the input image space by a factor of ex100, and map this spatially to transform rotations and scale changes into spatial shifts. By reducing the input image size accordingly, and therefore learning requirements, we aim to develop compact and lightweight egocentric and robot vision sensor using a smartphone as the target platfor