Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

CIE
2006
Springer

favoriteEmaildiscussreport

72views Applied Computing» more CIE 2006»

Can General Relativistic Computers Break the Turing Barrier?

13 years 10 months ago

Can General Relativistic Computers Break the Turing Barrier?

Download www.math-inst.hu

István Németi, Hajnal Andréka

Real-time Traffic

Applied Computing | CIE 2006 |

claim paper

Related Content

» From Logic to Physics How the Meaning of Computation Changed over Time

» Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds

» Breaking the simulation barrier SRAM evaluation through norm minimization

» Recognizing Objects in Adversarial Clutter Breaking a Visual CAPTCHA

» HigherDimensional Affine Registration and Vision Applications

» The soft heap an approximate priority queue with optimal error rate

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2006
Where	CIE
Authors	István Németi, Hajnal Andréka

Comments (0)