Recursion and topology on 2≤ω for possibly infinite computations

Mostrar todas las versiones(3)

Fil:Becher, V. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.

Guardado en:
Detalles Bibliográficos
Autores principales: Becher, V., Grigorieff, S.
Formato: Artículo publishedVersion
Publicado: 2004
Materias:
Computer science
Problem solving
Set theory
Theorem proving
Topology
Turing machines
Computable maps
Infinite words
Metric spaces
Computability and decidability
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_03043975_v322_n1SPECISS_p85_Becher
https://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_03043975_v322_n1SPECISS_p85_Becher_oai
Aporte de:
Repositorio Digital de la Universidad de Buenos Aires (UBA) de Universidad de Buenos Aires
id I28-R145-paper_03043975_v322_n1SPECISS_p85_Becher_oai
record_format dspace
spelling I28-R145-paper_03043975_v322_n1SPECISS_p85_Becher_oai2024-08-16 Becher, V. Grigorieff, S. 2004 Fil:Becher, V. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. application/pdf http://hdl.handle.net/20.500.12110/paper_03043975_v322_n1SPECISS_p85_Becher info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar Theor Comput Sci 2004;322(1 SPEC ISS):85-136 Computer science Problem solving Set theory Theorem proving Topology Turing machines Computable maps Infinite words Metric spaces Computability and decidability Recursion and topology on 2≤ω for possibly infinite computations info:eu-repo/semantics/article info:ar-repo/semantics/artículo info:eu-repo/semantics/publishedVersion https://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_03043975_v322_n1SPECISS_p85_Becher_oai
institution Universidad de Buenos Aires
institution_str I-28
repository_str R-145
collection Repositorio Digital de la Universidad de Buenos Aires (UBA)
topic Computer science
Problem solving
Set theory
Theorem proving
Topology
Turing machines
Computable maps
Infinite words
Metric spaces
Computability and decidability
spellingShingle Computer science
Problem solving
Set theory
Theorem proving
Topology
Turing machines
Computable maps
Infinite words
Metric spaces
Computability and decidability
Becher, V.
Grigorieff, S.
Recursion and topology on 2≤ω for possibly infinite computations
topic_facet Computer science
Problem solving
Set theory
Theorem proving
Topology
Turing machines
Computable maps
Infinite words
Metric spaces
Computability and decidability
description Fil:Becher, V. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
format Artículo
Artículo
publishedVersion
author Becher, V.
Grigorieff, S.
author_facet Becher, V.
Grigorieff, S.
author_sort Becher, V.
title Recursion and topology on 2≤ω for possibly infinite computations
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
publishDate 2004
url http://hdl.handle.net/20.500.12110/paper_03043975_v322_n1SPECISS_p85_Becher
https://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_03043975_v322_n1SPECISS_p85_Becher_oai
work_keys_str_mv AT becherv recursionandtopologyon2ōforpossiblyinfinitecomputations
AT grigorieffs recursionandtopologyon2ōforpossiblyinfinitecomputations
_version_ 1809357002460102656

Ejemplares similares