AI Chat AI Image Generator AI Video Text to Speech

An effective version of definability in metric model theory

03/04/2020

∙

by Nazanin Roshandel Tavana, et al.

∙

∙

In this paper, a computably definable predicate is defined and characterized. Then, it is proved that every separable infinite-dimensional Hilbert structure in an effectively presented language is computable. Moreover, every definable predicate in these structures is computable.

page 1

page 2

page 3

page 4

research

∙ 05/29/2023

The characterization of infinite Eulerian graphs, a short and computable proof

In this paper we present a short proof of a theorem by Erdős, Grünwald a...

0 Nicanor Carrasco-Vargas, et al. ∙

research

∙ 11/06/2017

The Fréchet distance of surfaces is computable

We show that the Fréchet distance of two-dimensional parametrised surfac...

0 Eike Neumann, et al. ∙

research

∙ 10/29/2019

Effective Wadge Hierarchy in Computable Quasi-Polish Spaces

We define and study an effective version of the Wadge hierarchy in compu...

0 Victor Selivanov, et al. ∙

research

∙ 10/19/2015

On the Computability of AIXI

How could we solve the machine learning and the artificial intelligence ...

0 Jan Leike, et al. ∙

research

∙ 08/09/2022

Incompleteness for stably computable formal systems

We prove, for stably computably enumerable formal systems, direct analog...

0 Yasha Savelyev, et al. ∙

research

∙ 02/20/2023

On minimal easily computable dimension group algebras

Finite semisimple commutative group algebras for which all the minimal i...

0 E. J. García-Claro, et al. ∙

research

∙ 05/02/2022

Relatively acceptable notation

Shapiro's notations for natural numbers, and the associated desideratum ...

0 Nikolay Bazhenov, et al. ∙