1,164 research outputs found
Testing the labour theory of value: An exchange
Exchange on open letters on the methodologies for testing price value correlations
2000-luvun marxilaisuus
Paul Cockshott vaatii työväenliikettä kohtaamaan oikeiston talousopit silmästä silmään ja kehittämään niiden haastajaksi omista luokkaeduistaan ponnistavaa teoriaa 1800-luvulla kehitetyn poliittisen taloustieteen pohjalta. Cockshottin mukaan tähän tehtävään kuuluu myös sen kuvaaminen, miten tulevaisuuden sosialistinen talousjärjestelmä on tarkoitus järjestää. On irtauduttava Länsi-Euroopan marxilaisuudelle tyypillisestä spekulatiivis-filosofisesta menetelmästä ja hyödynnettävä muun muassa tilastollisen mekaniikan ja laskettavuuden teorian kaltaisia tieteenhaaroja sosialistista suunnitelmataloutta hahmoteltaessa
2000-luvun marxilaisuus
Paul Cockshott vaatii työväenliikettä kohtaamaan oikeiston talousopit silmästä silmään ja kehittämään niiden haastajaksi omista luokkaeduistaan ponnistavaa teoriaa 1800-luvulla kehitetyn poliittisen taloustieteen pohjalta. Cockshottin mukaan tähän tehtävään kuuluu myös sen kuvaaminen, miten tulevaisuuden sosialistinen talousjärjestelmä on tarkoitus järjestää. On irtauduttava Länsi-Euroopan marxilaisuudelle tyypillisestä spekulatiivis-filosofisesta menetelmästä ja hyödynnettävä muun muassa tilastollisen mekaniikan ja laskettavuuden teorian kaltaisia tieteenhaaroja sosialistista suunnitelmataloutta hahmoteltaessa
Gain advantage (title translated from the Persian)
21st Century Marxism - Paul Cockshott<br></br>
In certain respects the situation of Marxism in the early 21st century has much in common
with that in the late 19th century. In both cases Marxism is faced with a world in which
the capitalist mode of production dominates. During what Hobsbawm called the ‘shorter
20th century’, the period from 1914 to 1990, world politics centered round the epochal
struggle between capitalist and socialist economic systems, and that reality gave to
Marxism a quite different character than in its first period 1948-1914
The SCC and the SICSA multi-core challenge
Two phases of the SICSA Multi-core Challenge have
gone past. The first challenge was to produce concordances of
books for sequences of words up to length N; and the second
to simulate the motion of N celestial bodies under gravity. We
took both challenges on the SCC, using C and the Linux Shell.
This paper is an account of the experiences gained. It also gives
a shorter account of the performance of other systems on the
same set of problems, as they provide benchmarks against which
the SCC performance can be compared with
Comments on the 'China model'
This paper reviews the articles by Pan and by Zhu on the China Model. The review of Pan is critical, that of Zhu sympathetic. Pan is criticised for taking an unquestioning attitude towards state supporting ideologies and failing to adequately account for the effects of changes in family structure and class structure in China over the past 50 years. The reviewer broadly agrees with Zhu's comments about a future steady state economy. The article provides statistical data from the recent economic and demographic histories of China and Japan to back up the general conclusions drawn by Zhu
Non-classical computing: feasible versus infeasible
Physics sets certain limits on what is and is not computable. These limits are very far from having been reached by current technologies. Whilst proposals for hypercomputation are almost certainly infeasible, there are a number of non classical approaches that do hold considerable promise. There are a range of possible architectures that could be implemented on silicon that are distinctly different from the von Neumann model. Beyond this, quantum simulators, which are the quantum equivalent of analogue computers, may be constructable in the near future
A 2D processing algorithm for detecting landmines using Ground Penetrating Radar data
Ground Penetrating Radar(GPR) is one of a number
of technologies that have been used to improve landmine
detection efficiency. The clutter environment within the first
few cm of the soil where landmines are buried, exhibits strong
reflections with highly non-stationary statistics. An antipersonnel
mine(AP) can have a diameter as low as 2cm whereas many
soils have very high attenuation frequencies above 3GHZ. The
landmine detection problem can be solved by carrying out system
level analysis of the issues involved to synthesise an image
which people can readily understand. The SIMCA (’SIMulated
Correlation Algorithm’) is a technique that carries out correlation
between the actual GPR trace that is recorded at the field and the
ideal trace which is obtained by carrying out GPR simulation.
The SIMCA algorithm firstly calculates by forward modelling a
synthetic point spread function of the GPR by using the design
parameters of the radar and soil properties to carry out radar
simulation. This allows the derivation of the correlation kernel.
The SIMCA algorithm then filters these unwanted components
or clutter from the signal to enhance landmine detection. The
clutter removed GPR B scan is then correlated with the kernel
using the Pearson correlation coefficient. This results in a image
which emphasises the target features and allows the detection of
the target by looking at the brightest spots. Raising of the image
to an odd power >2 enhances the target/background separation.
To validate the algorithm, the length of the target in some cases
and the diameter of the target in other cases, along with the
burial depth obtained by the SIMCA system are compared with
the actual values used during the experiments for the burial depth
and those of the dimensions of the actual target. Because, due
to the security intelligence involved with landmine detection and
most authors work in collaboration with the national government
military programs, a database of landmine signatures is not
existant and the authors are also not able to publish fully their
algorithms. As a result, in this study we have compared some of
the cleaned images from other studies with the images obtained
by our method, and I am sure the reader would agree that our
algorithm produces a much clearer interpretable image
Are there new models of computation? Reply to Wegner and Eberbach
Wegner and Eberbach[Weg04b] have argued that there are fundamental limitations
to Turing Machines as a foundation of computability and that these can be overcome
by so-called superTuring models such as interaction machines, the [pi]calculus and the
$-calculus. In this paper we contest Weger and Eberbach claims
- …
