Relativistic computers and non-uniform complexity theory

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2509, Issue , 2002, Pages 287-299

  Wiedermann, Jiří ^a   van Leeuwen, Jan ^b  

^a INSTITUTE OF COMPUTER SCIENCE   (Czech Republic)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATION THEORY; MACHINERY;

ARITHMETICAL HIERARCHY; FINITE TIME; MALAMENT-HOGARTH SPACE-TIME; NONUNIFORM COMPLEXITY; POLYNOMIAL SPACE; RECENT RESEARCHES; THEORETIC ANALYSIS; THEORETICAL PHYSICS;

TURING MACHINES;

EID: 79251629791     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45833-6_24     Document Type: Conference Paper

References (21)

1. J. L. Balcázar, J. Díaz, J. Gabarró: Structural complexity I, Second Edition, Springer-Verlag, Berlin, 1995.
2. R. Beigel, Query-limited reducibilities, PhD thesis, Department of Computer Science, Stanford University, Stanford, 1995, available at www.eccc.uni-trier.de/eccclocal/ECCC-Theses/beigel.html.
3. M. Blum, F. Cucker, M. Shub, M. Smale: Complexity and real computation. Springer, New York, 1997, 453 p.
4. M. Burgin: How we know what technology can do, Communications of the ACM 44 (2001) 83-88.
5. C.S. Calude, Pavlov, B.: Coins, quantum measurements, and Turing’s barrier, Technical Report CDMTCS-170, University of Auckland, New Zealand, December 2001.
6. J. Earman, J. Norton: Infinite pains: The trouble with supertasks, in A. Morton and S.P. Stich (eds.), P. Benacerraf and his critics, Philosophers and Their Critics Vol 8, Blackwell Publ., Oxford (UK)/Cambridge (MA), 1996, Ch 11, pp 231-261.
7. G. Etesi, I. Németi: Non-Turing computations via Malament-Hogarth spacetimes, Int. J. Theor. Phys. 41 (2002) 341-370, see also: http://arXiv.org/abs/grqc/0104023.
8. J.D. Hamkins, A. Lewis: Infinite time Turing machines, Journal of Symbolic Logic Vol. 65, No. 2, pp. 567-6-4, 2000.
9. L.A. Hemaspaandra, M. Ogihara: The complexity theory companion, Springer- Verlag, Berlin, 2002.
10. J. Hogarth: Non-Turing computers and non-Turing computability, in D. Hull, M. Forbes and R.M. Burian (eds.), 1994 Biennial Meeting of the Philosophy of Science Association (PSA 1994), Proceedings Vol. One, Philosophy of Science Association, East Lansing, 1994, pp 126-138.
11. J. Hopcroft, R. Motwani, and J.D. Ullman: Introduction to automata theory, languages and computation, 2nd Edition, Addison-Wesley, Reading, MA, 2000.
12. R.M. Karp, R.J. Lipton: Some connections between non-uniform and uniform complexity classes, in Proc. 12th Annual ACM Symposium on the Theory of Computing (STOC’80), 1980, pp. 302-309.
13. J.D. Norton: What can we learn about ontology of space and time from the theory of relativity?, PhilSci Archive (http://philsci-archive.pitt.edu/), ID: PITT-PHILSCI00000138, 2001.
14. H. Rogers Jr, Theory of recursive functions and effective computability, McGraw- Hill, New York, 1967.
15. A.M. Turing: On computable numbers, with an application to the Entscheidungsproblem, Proc. London Math. Soc., 42-2 (1936) 230-265; A correction, Proc. London Math. Soc, 43 (1937), pp. 544-546.
16. A.M. Turing: Systems of logic based on ordinals, Proc. London Math. Soc. Series 2, 45 (1939), pp. 161-228.
17. J. van Leeuwen, J. Wiedermann: The Turing machine paradigm in contemporary computing, in: B. Enquist and W. Schmidt (Eds.), Mathematics unlimited - 2001 and beyond, Springer-Verlag, 2001, pp. 1139-1155.
18. J. van Leeuwen, J. Wiedermann: Beyond the Turing limit: evolving interactive systems, in: L. Pacholski, P. Ružička (Eds.), SOFSEM’01: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics, Lecture Notes in Computer Science Vol. 2234, Springer-Verlag, Berlin, 2001, pp. 90–109.
19. P. Wegner: Why interaction is more powerful than algorithms, C. ACM 40, (1997) 315-351.
20. J. Wiedermann, J. van Leeuwen: Emergence of super-Turing computing power in artificial living systems, in: J. Kelemen, P. Sosík(Eds.), Artificial Life 2001, 6- th European Conference (ECAL 2001), Lecture Notes in Artificial Intelligence, Springer-Verlag, Berlin, 2001, pp. 55-65.
21. L. Wischik: A formalisation of non-finite computation, dissertation submitted to the University of Cambridge towards the degree of Master of Philosophy, June 1997 (available at: www.wischik.com/lu/philosophy/non-finite-computation.html).