Recursion and topology on 2≤ω for possibly infinite computations

Autores
Becher, V.; Grigorieff, S.
Año de publicación
2004
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
Fil:Becher, V. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
Fuente
Theor Comput Sci 2004;322(1 SPEC ISS):85-136
Materia
Computer science
Problem solving
Set theory
Theorem proving
Topology
Turing machines
Computable maps
Infinite words
Metric spaces
Computability and decidability
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by/2.5/ar
Repositorio
Biblioteca Digital (UBA-FCEN)
Institución
Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
OAI Identificador
paperaa:paper_03043975_v322_n1SPECISS_p85_Becher
Acceder
id BDUBAFCEN_a21e1768ed679b172466272fb59b0c04
oai_identifier_str paperaa:paper_03043975_v322_n1SPECISS_p85_Becher
network_acronym_str BDUBAFCEN
repository_id_str 1896
network_name_str Biblioteca Digital (UBA-FCEN)
spelling Recursion and topology on 2≤ω for possibly infinite computationsBecher, V.Grigorieff, S.Computer scienceProblem solvingSet theoryTheorem provingTopologyTuring machinesComputable mapsInfinite wordsMetric spacesComputability and decidabilityFil:Becher, V. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.2004info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfhttp://hdl.handle.net/20.500.12110/paper_03043975_v322_n1SPECISS_p85_BecherTheor Comput Sci 2004;322(1 SPEC ISS):85-136reponame:Biblioteca Digital (UBA-FCEN)instname:Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturalesinstacron:UBA-FCENenginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by/2.5/ar2025-09-04T09:48:37Zpaperaa:paper_03043975_v322_n1SPECISS_p85_BecherInstitucionalhttps://digital.bl.fcen.uba.ar/Universidad públicaNo correspondehttps://digital.bl.fcen.uba.ar/cgi-bin/oaiserver.cgiana@bl.fcen.uba.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:18962025-09-04 09:48:39.007Biblioteca Digital (UBA-FCEN) - Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturalesfalse
dc.title.none.fl_str_mv Recursion and topology on 2≤ω for possibly infinite computations
title Recursion and topology on 2≤ω for possibly infinite computations
spellingShingle Recursion and topology on 2≤ω for possibly infinite computations
Becher, V.
Computer science
Problem solving
Set theory
Theorem proving
Topology
Turing machines
Computable maps
Infinite words
Metric spaces
Computability and decidability
title_short Recursion and topology on 2≤ω for possibly infinite computations
title_full Recursion and topology on 2≤ω for possibly infinite computations
title_fullStr Recursion and topology on 2≤ω for possibly infinite computations
title_full_unstemmed Recursion and topology on 2≤ω for possibly infinite computations
title_sort Recursion and topology on 2≤ω for possibly infinite computations
dc.creator.none.fl_str_mv Becher, V.
Grigorieff, S.
author Becher, V.
author_facet Becher, V.
Grigorieff, S.
author_role author
author2 Grigorieff, S.
author2_role author
dc.subject.none.fl_str_mv Computer science
Problem solving
Set theory
Theorem proving
Topology
Turing machines
Computable maps
Infinite words
Metric spaces
Computability and decidability
topic Computer science
Problem solving
Set theory
Theorem proving
Topology
Turing machines
Computable maps
Infinite words
Metric spaces
Computability and decidability
dc.description.none.fl_txt_mv Fil:Becher, V. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
description Fil:Becher, V. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
publishDate 2004
dc.date.none.fl_str_mv 2004
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/20.500.12110/paper_03043975_v322_n1SPECISS_p85_Becher
url http://hdl.handle.net/20.500.12110/paper_03043975_v322_n1SPECISS_p85_Becher
dc.language.none.fl_str_mv eng
language eng
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by/2.5/ar
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by/2.5/ar
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv Theor Comput Sci 2004;322(1 SPEC ISS):85-136
reponame:Biblioteca Digital (UBA-FCEN)
instname:Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
instacron:UBA-FCEN
reponame_str Biblioteca Digital (UBA-FCEN)
collection Biblioteca Digital (UBA-FCEN)
instname_str Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
instacron_str UBA-FCEN
institution UBA-FCEN
repository.name.fl_str_mv Biblioteca Digital (UBA-FCEN) - Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
repository.mail.fl_str_mv ana@bl.fcen.uba.ar
_version_ 1842340704909524992
score 12.623145

Publicaciones similares