1 citations · 3 across the 6 of their papers we have counts for
7 papers
Learning the undecidable from networked systems
Felipe S. Abrahão, Ítala M. Loffredo D'Ottaviano, Klaus Wehmuth +2
This article presents a theoretical investigation of computation beyond the Turing barrier from emergent behavior in distributed systems. In particular, we present an algorithmic n…
Some Thoughts on Hypercomputation
Apostolos Syropoulos
Hypercomputation is a relatively new branch of computer science that emerged from the idea that the Church--Turing Thesis, which is supposed to describe what is computable and what…
On a total function which overtakes all total recursive functions
N. C. A. da Costa, F. A. Doria
This paper discusses a function that is frequently presented as a simile or look-alike of the so-called ``counterexample function to P=NP,'' that is, the function that collects all…
A lemma on a total function defined over the Baker-Gill-Solovay set of polynomial Turing machines
N. C. A. da Costa, F. A. Doria
If we establish that the counterexample function for P=NP, if total, overtakes all total recursive functions when extended over all Turing machines, then what happens to the same c…
On the consistency of with fragments of ZFC whose own consistency strength can be measured by an ordinal assignment
N. C. A. da Costa, F. A. Doria
We formulate the hypothesis in the case of the satisfiability problem as a sentence, out of which we can construct a partial recursive function so that…
The Atiyah-Singer index theorem and the gauge field copy problem
Adonai S. Sant'Anna, Newton C. A. da Costa, Francisco A. Doria
K-theory allows us to define an analytical condition for the existence of `false' gauge field copies through the use of the Atiyah-Singer index theorem. After establishing that res…