<div class="csl-bib-body">
<div class="csl-entry">Benavente-Fokina, E. (2024, July 23). <i>On structures with non-computable presentations</i> [Conference Presentation]. AMS-UMI International Joint Meeting 2024, Palermo, Italy.</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/210027
-
dc.description.abstract
In computable structure theory, one usually measures the complexity of a structure
by identifying the structure with its atomic diagram. The structure is then computable if so is
its atomic diagram. The notion naturally relativises to non-computable oracles. However, for
structures without computable presentations, a finer way to measure the complexity is sometimes
more natural and suitable.
In this talk we discuss different approaches to measure the complexity of non-computable
structures and explain several of our recent results.
en
dc.description.sponsorship
FWF - Österr. Wissenschaftsfonds
-
dc.language.iso
en
-
dc.subject
computable structure
en
dc.subject
positive structure
en
dc.subject
computably enumerable structure
en
dc.title
On structures with non-computable presentations
en
dc.type
Presentation
en
dc.type
Vortrag
de
dc.relation.grantno
P 36781-N
-
dc.type.category
Conference Presentation
-
tuw.publication.invited
invited
-
tuw.project.title
Strukturen durch Lernen Klassifizieren
-
tuw.researchTopic.id
A3
-
tuw.researchTopic.name
Fundamental Mathematics Research
-
tuw.researchTopic.value
100
-
tuw.publication.orgunit
E104-02 - Forschungsbereich Computational Logic
-
tuw.author.orcid
0000-0002-4598-458X
-
tuw.event.name
AMS-UMI International Joint Meeting 2024
en
tuw.event.startdate
23-07-2024
-
tuw.event.enddate
26-07-2024
-
tuw.event.online
On Site
-
tuw.event.type
Event for scientific audience
-
tuw.event.place
Palermo
-
tuw.event.country
IT
-
tuw.event.presenter
Benavente-Fokina, Ekaterina
-
wb.sciencebranch
Informatik
-
wb.sciencebranch
Mathematik
-
wb.sciencebranch.oefos
1020
-
wb.sciencebranch.oefos
1010
-
wb.sciencebranch.value
5
-
wb.sciencebranch.value
95
-
item.languageiso639-1
en
-
item.openairetype
conference paper not in proceedings
-
item.grantfulltext
none
-
item.fulltext
no Fulltext
-
item.cerifentitytype
Publications
-
item.openairecristype
http://purl.org/coar/resource_type/c_18cp
-
crisitem.author.dept
E104-02 - Forschungsbereich Computational Logic
-
crisitem.author.orcid
0000-0002-4598-458X
-
crisitem.author.parentorg
E104 - Institut für Diskrete Mathematik und Geometrie
