Computability in Europe 2006
Logical Approaches to Computational Barriers

Print current page  Print this page

Invited Plenary Talk:
Can general relativistic computers break the Turing barrier?

Speaker: István Németi
Author(s): István Németi and Andréka Hajnal
Presentation: cie06presentation.pdf

Abstract

- Can general relativistic computers break the Turing barrier? - Are
there final limits to human knowledge? - Limitative results versus
human creativity (paradigm shifts). - Godel's logical results in
comparison/combination with Godel's relativistic results. - Can
Hilbert's
programme be carried through after all? We re-evaluate these questions
in view of latest results/paradigm shifts in physics and cosmology. 


websites: Arnold Beckmann 2006-04-20 Valid HTML 4.01! Valid CSS! eXTReMe Tracker hit counters by www.free-counters.net