Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > Oracles and advice as measurements
Publication

Publications

Oracles and advice as measurements

Title
Oracles and advice as measurements
Type
Article in International Conference Proceedings Book
Year
2008
Authors
Beggs, E
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Costa, JF
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. View Authenticus page Without ORCID
Loff, B
(Author)
Other
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Tucker, JV
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Conference proceedings International
Pages: 33-+
7th International Conference on Unconventional Computation/International Workshop on Computing with Biomolecules
Vienna, AUSTRIA, AUG 25-28, 2008
Other information
Authenticus ID: P-007-NG4
Abstract (EN): In this paper we will try to understand how oracles and advice functions, which are mathematical abstractions in the theory of computability and complexity, can be seen as physical measurements in Classical Physics. First, we consider how physical measurements are a natural external source of information to an algorithmic computation, using a simple and engaging case study, namely: Hoyle's algorithm for calculating eclipses at Stonehenge. Next, we argue that oracles and advice functions can help us understand how the structure of space and time has information content that can be processed by Turing machines. Using an advanced case study from Newtonian kinematics, we show that non-uniform complexity is an adequate framework for classifying feasible computations by Turing machines interacting with an oracle in Nature, and that by classifying the information content of such a natural oracle, using Kolmogorov complexity, we obtain a hierarchical structure based on measurements, advice classes and information.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 3
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same authors

Computational complexity with experiments as oracles. II. Upper bounds (2009)
Article in International Scientific Journal
Beggs, E; Costa, JF; Loff, B; Tucker, JV
Computational complexity with experiments as oracles (2008)
Article in International Scientific Journal
Beggs, E; Costa, JF; Loff, B; Tucker, JV
Recommend this page Top
Copyright 1996-2025 © Faculdade de Direito da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-07-21 at 20:39:17 | Privacy Policy | Personal Data Protection Policy | Whistleblowing