Abstract
A natural notion of computational formalism is here characterized by elaborating on the algebraic approach with Uniformly Reflexive Structures. Namely by dealing with the undefined within a first-order theory admitting partial functions. Here, quite generally, we obtain several limitative theorems about the computational formalisms.
Get full access to this article
View all access options for this article.