Functionals Using Bounded Information and the Dynamics of Algorithms

We consider computable functionals mapping the Baire space into the set of integers. By continuity, the value of the functional on a given function depends only on a "critical" finite part of this function. Care: there is in general no way to compute this critical finite part without query...

Celý popis

Podrobná bibliografia

Vydané v:	2012 27th Annual IEEE Symposium on Logic in Computer Science s. 345 - 354
Hlavní autori:	Grigorieff, S., Valarcher, P.
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.06.2012
Predmet:	Abstract state machines Abstracts Algorithm design and analysis Computational modeling Computer science Heuristic algorithms Operational semantics Semantics Theory of Algorithms Topology Type 2 computability
ISBN:	1467322636, 9781467322638
ISSN:	1043-6871
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!