Forecasting black holes in Abstract geometrical computation is highly unpredictable

Jérôme Durand-Lose

Description

Forecasting black holes in Abstract geometrical computation is highly unpredictable Forecasting black holes in Abstract geometrical computation is highly unpredictable Jerome Durand-Lose Laboratoire d'Informatique Fondamentale d'Orleans, Universite d'Orleans, Orleans, FRANCE TAMC, Beijing, 2006

• abstract geometrical


• highly unpredictable


• forecasting black


• laboratoire d'informatique fondamentale d'orleans


• ?02-membership

Informations

• Publié par: pefav
• Nombre de lectures: 28
• Langue: English

Extrait

Forecasting black holes in Abstract geometrical computation is highly unpredictable
Forecasting black holes in
Abstract geometrical computation is
highly unpredictable
J´eroˆme Durand-Lose
Laboratoire d’Informatique Fondamentale d’Orl´eans,
´Universit´e d’Orl´eans, Orleans, FRANCE
TAMC, Beijing, 2006Forecasting black holes in Abstract geometrical computation is highly unpredictable
1 Introduction
2 Definitions
03 Σ -Membership2
04 Σ -Hardness2
5 ConclusionForecasting black holes in Abstract geometrical computation is highly unpredictable
Introduction
1 Introduction
2 Definitions
03 Σ -Membership2
04 Σ -Hardness2
5 ConclusionForecasting black holes in Abstract geometrical computation is highly unpredictable
Introduction
Discrete lines in cellular automata
[Boccara et al., 1991, Fig. 7]
[Lindgren and Nordahl, 1990, Fig. 3]Forecasting black holes in Abstract geometrical computation is highly unpredictable
Introduction
Discrete lines in cellular automata
[Hordijk et al., 2001, Fig. 7]
[Siwak, 2001, Fig. 5]Forecasting black holes in Abstract geometrical computation is highly unpredictable
Introduction
Abstracting signal machines
Space (Z) Space (R)
Time (N)
+
Time (R )Forecasting black holes in Abstract geometrical computation is highly unpredictable
Introduction
Accumulating is now possible
Infinitely many steps in finite time
Infinite computation in finite time?Forecasting black holes in Abstract geometrical computation is highly unpredictable
Introduction
Black hole model
Observer
[Hogarth, 2000]
[Etesi and Nemeti, 2002]
1 Observer at the “edge”Forecasting black holes in Abstract geometrical computation is highly unpredictable
Introduction
Black hole model
Observer
[Hogarth, 2000]
[Etesi and Nemeti, 2002]
1 Observer at the “edge”
2 Machine sent into the black hole infinitely acceleratedForecasting black holes in Abstract geometrical computation is highly unpredictable
Introduction
Black hole model
Observer
[Hogarth, 2000]
[Etesi and Nemeti, 2002]
1 Observer at the “edge”
2 Machine sent into the black hole infinitely accelerated
3 Message sent by the machine received by the observer
within a bounded delay