**4**

votes

**1**answer

112 views

### Is DNC/DNR stronger than “prompt” non-computability?

We propose a (probably not new) definition. Let $\varphi_e$ be an effective enumeration of the partial computable functions.
A total function $f$ is promptly non-computable (PNC) [or promptly non-...

**0**

votes

**1**answer

126 views

### Computability of prime difference function

Consider the following function $f: \omega\to \{0,1\}$:
Set $f(n) = 1$ if for all $k\in \omega$ there are prime numbers $p,q > k$ such that $n = p-q$; and set $f(n) = 0$ otherwise.
(Trivially, if ...

**9**

votes

**2**answers

774 views

### Non null Turing antichain

This interesting question resulted from a query of Mushfeq: In ZFC, can we find a non null set of pairwise Turing incomparable reals?

**4**

votes

**0**answers

112 views

### Can non-computable real numbers be defined without making use of any notions from computability theory

I am not sure if this type of question is appropriate for "mathoverflow.net", but I will take the chance. Are there any examples of (well-known or interesting) problems in geometry which ask for the ...

**4**

votes

**1**answer

127 views

### Analogy of $\omega$-models in constructive mathematics

I apologize that this question is a bit vague, however that is partially the point.
In subsystems of second order arithmetic, one considers $\omega$-models, these are models of $\mathsf{RCA}_0$ whose ...

**6**

votes

**0**answers

241 views

### The least admissible above a dominating real

Let $\mathbb{P}$ be the usual forcing which adds a dominating real: conditions in $\mathbb{P}$ are pairs $(p, f)$ with $p:\omega\rightarrow\omega$ finite partial and $f:\omega\rightarrow\omega$ total, ...

**2**

votes

**1**answer

189 views

### Is every computable real primitively recursively computable?

Let N be the set of all positive integers and let P(n),Q(n) be a pair of general recursive mappings of N into itself such that for all pairs h,k of distinct positive integers, the absolute value of (P(...

**4**

votes

**0**answers

114 views

### Undecidability of the existential theory

Do you know if I can find the proof that the existential theory of $\mathbb{Z}$ with the structure of addition , divisibility and the relation $(\exists s \in \mathbb{Z})m=np^s$ is undecidable, ...

**1**

vote

**1**answer

97 views

### floating point representation via the perspective of TTE/computable analysis

Floating point numbers are not compatible with the usual theory of type 2 theory of effectivity (TTE), and not even the real-RAM model; there are functions that are computable in one model but not ...

**4**

votes

**1**answer

75 views

### Is every pair of writable reals one-tape-ITTM-computable?

I've been reading this paper, in which authors prove that not all ITTM-computable functions $\Bbb R\rightarrow\Bbb R$ are 1-tape-computable, but if we put some restriction on the output of the ...

**1**

vote

**2**answers

142 views

### Precise interpretability strength of $\mathcal P_{DF}(\omega)$ and $L_{\omega_1^{CK}}$

I am curious about the relationship between the definable power set of $\omega$ and the $\omega_1^{CK}$th level of the constructible sets $L$.
In short, $\omega_1^{CK}$ is the least nonrecursive ...

**0**

votes

**2**answers

150 views

### Undecidable set of problems [closed]

Is there some set of problems, for which determining if given problem is decidable or not is itself undecidable?

**6**

votes

**2**answers

321 views

### Is every non-empty $\Delta_0$ set provably the range of some primitive recursive function?

Suppose $A(x)$ is a $\Delta_0$ formula defining a non-empty set of natural numbers. It's an easy theorem that there is a primitive recursive function $f:\mathbb{N} \rightarrow \mathbb{N}$ such that $...

**-1**

votes

**1**answer

253 views

### Are limits decidable? Should definitions be decidable? [closed]

This question is about the Turing computability of the $\epsilon-N$ definition of a limit of an infinite sequence $S$. First, a proposition:
There cannot exist a Turing Machine $M$ which, given a ...

**3**

votes

**0**answers

108 views

### Oracle queries asked in parallel

Definition: Assume that $\phi(q)$ is of the form $\exists y \leq 2^{p(n)} \varphi(q,y)$, where $p$ is a polynomial and $n = |q|$ (i.e. $n$ is the length of the binary representation of $q$). Then a ...

**1**

vote

**2**answers

341 views

### Recent progress on the busy beaver problem? [closed]

Has there been any progress on the Busy beaver problem in the last few years? It seems like there hasn't been much work done on the problem since 2010. Is there anything amateurs can do to solve the ...

**7**

votes

**0**answers

183 views

### $\alpha$-minimal degrees for singular $\alpha$

An important question in $\alpha$-recursion theory is whether there is a minimal $\alpha$-degree at $\alpha=\aleph_\omega.$
Question 1. Who first introduced the above question, and where can I find ...

**-1**

votes

**1**answer

107 views

### recursively enumerable sets [closed]

A set $S$ said to be recursively enumerable if There is an algorithm that enumerates the members of $S$. That means that its output is simply a list of the members of $S$: $s_1$, $s_2$, $s_3$, ... . ...

**10**

votes

**1**answer

211 views

### Is an explicit $c$ known to lead to a noncomputable Julia set?

Braverman & Yampolsky have shown that there exist noncomputable Julia sets,
i.e., there exist $c \in \mathbb{C}$ such that the Julia set of $f(z) = c + z^2$
is not computable.
"A set is computable,...

**7**

votes

**2**answers

352 views

### Topological tameness beyond the Gandy-Harrington topology

The Gandy-Harrington topology on $\omega^\omega$ is the topology generated by all lightface $\Sigma^1_1$ sets; that is, all sets which are continuous-in-the-usual-sense images of $\omega^\omega$.
...

**1**

vote

**0**answers

125 views

### Analogue break down between complexity theory and computability theory

Motivated by my post, Is there a program for theory of incompleteness in NP, much of NP-completeness theory has been heavily influenced by computability theory for which we were successful in proving ...

**6**

votes

**1**answer

256 views

### Can ITTM recognize a non-measurable set?

Throughout the question ITTM refers to Hamkins' infinite Turing machines, though I will be interested in results related to stronger models.
Recently I was wondering, is it consistent that there is ...

**4**

votes

**1**answer

190 views

### Induction and nonstandard halting times of standard machines

For a nonstandard model of enough arithmetic - say, $\mathcal{N}\models I\Sigma_1$ - we can define the set of halting times of standard machines relative to $\mathcal{N}$: $$SH(\mathcal{N})=\{n\in\...

**6**

votes

**1**answer

141 views

### Minimal degrees of structures

For this question, a structure means a first-order structure in a computable language with domain $\omega$; a copy of a structure $\mathcal{A}$ is a structure $\mathcal{B}\cong\mathcal{A}$.
Given a ...

**11**

votes

**0**answers

393 views

### Decidability of $x^3+y^3+z^3 = c$

I wondering if it is known whether the following problem is algorithmically decidable or undecidable by Turing machines: given an integer c, determine if there are integers $(x,y,z)$ such that $x^3+y^...

**1**

vote

**0**answers

179 views

### Seeking reference to result in this talk by Voevodsky [duplicate]

In this presentation by Vladimir Voevodsky [1], he mentions a result that there is a formula over the natural numbers with a single free variable such that one can prove that there is no algorithmic ...

**6**

votes

**1**answer

196 views

### Degree of unsolvability of finding a open approximation to a Borel set, given its Borel code

It is well known that every Borel set has the property of Baire. That is, for every Borel set $B$, there is an open set $U$ and a sequence of dense open sets $D_n$ such that for every $x\in \cap_n ...

**7**

votes

**1**answer

107 views

### A decision problem for clones

E. Post proved that there are only countably many clones on a two-element set (classes of operations closed under superposition and containing all projections). All these clones are finitely ...

**7**

votes

**1**answer

281 views

### Can you decide whether the commutator subgroup of a f.p. group is f.g?

Is the following algorithmic problem known to be decidable/undecidable?
Input: a finite group presentation $P$.
Decide: is the commutator subgroup of the group presented by $P$ finitely generated?

**3**

votes

**1**answer

180 views

### Inverse Ackermann Function

The inverse Ackermann function is defined over the natural numbers as follows: ($[x]$ means that we round up x to the nearest integer, while $\log^*$ is the iterated log function discussed here: http:/...

**4**

votes

**1**answer

302 views

### Hamkins infinite time Turing machines: dovetailing ordinal time

It is claimed in the Hamkins and Lewis founding article "Infinite time Turing machines" (proof of the gap existence theorem 3.4) that for $\omega$ steps of a computation of a machine performing a ...

**14**

votes

**1**answer

409 views

### Computer software for periods

Kontsevich and Zagier define a period as an integral of a rational function (over $\mathbb{Q}$) defined on a $\mathbb{Q}$-semialgebraic set. They conjecture that if two periods are equal, then the ...

**12**

votes

**1**answer

638 views

### Continuous functions and 2-bushy trees

The following problem was asked by Joe Miller in the fall of 2010 at a bar in Madison.
A subtree $T \subseteq 4^{< \omega}$ is $2$-bushy if for some node $\sigma \in T$, every node above $\sigma$ ...

**3**

votes

**1**answer

155 views

### A question on many-one reducibility

Let $\phi_0,\phi_1,\phi_2,\ldots$ be an acceptable programming system. For each $x\in\mathbb{N}$, let $W_x$ the domain of $\phi_x$, and let $K=\{x\in\mathbb{N}:W_x\neq\emptyset\}$. Is there a ...

**2**

votes

**2**answers

171 views

### Computable Categories in the most direct sense?

While there is a lot of work in category related to notions of realizability and computability, etc... I've failed to find work on categories that are computable in the sense of having object and ...

**6**

votes

**1**answer

220 views

### What is known about the boundary between Richardson's theorem and the Tarski-Seidenberg theorem?

Tarski proved that equalities and inequalities in can be decided over $\mathbb{R}[x].$ Richardson proved that adding composition with the sine and exponential functions caused the problem to become ...

**12**

votes

**0**answers

324 views

### The topos for forcing in computability theory

My understanding is that forcing (such as Cohen forcing) can be described via a topos. For example this nlab article on forcing describes forcing as a "the topos of sheaves on a suitable site."
My ...

**0**

votes

**1**answer

214 views

### Is there a nontrivial maximally recursive function? [closed]

Say that a (recursive) function $f:\Bbb N\rightarrow\Bbb N$ is maximally recursive if, for all $n\in\Bbb N$, the value $f(n+1)$ can be calculated only by first knowing $f(n)$. A rather trivial example ...

**7**

votes

**2**answers

243 views

### Recent trends in effective analysis

The references listed at http://en.wikipedia.org/wiki/Computable_analysis have all been published 30-15 years ago. Are the approaches which these references expose still up-to-date and relevant to the ...

**7**

votes

**2**answers

377 views

### Decidability of diophantine equation in a theory

Given a theory $T \subseteq \operatorname{Th}(\mathbb{N})$, define the decision problem $D_T$ as follows:
Given a polynomial $p$ with integer coefficients and variables $\bar{x}$, decide whether
...

**25**

votes

**0**answers

706 views

### On certain representations of algebraic numbers in terms of trigonometric functions

Let's say that a real number has a simple trigonometric representation, if it can be represented as a product of zero or more rational powers of positive integers and zero or more (positive or ...

**5**

votes

**2**answers

340 views

### TM and abstract algebra

Usually, during lectures Turing Machines are firstly introduced from an informal point of view (for example, in this way: http://en.wikipedia.org/wiki/Turing_machine#Informal_description) and then ...

**1**

vote

**2**answers

242 views

### Is there a pairing function from countable ordinals to $\mathbb N$? [closed]

It is well-known that there is a computable pairing function $<\ >:\mathbb N^2\to \mathbb N$. Let $X$ be some reasonable class of countable ordinals ($\omega_1^{CK}$, $\epsilon_0$, $\omega^\...

**11**

votes

**1**answer

594 views

### Is forcing computable?

By results similar to Tennenbaum's theorem we know that there exist no computable models of $ZF$. But suppose we are given, as a sort of oracle, access to some model of $ZF$ (e.g. we can make oracle ...

**12**

votes

**1**answer

606 views

### Is there a known primitive recursive upper bound on the nth “Zhang prime”

(This question is pure curiosity. Feel free to close it if you feel it is not appropriate for mathoverflow.)
In 2013 Zhang showed that there are infinitely many pairs of primes which are less that ...

**5**

votes

**0**answers

70 views

### TCAs (total combinatory algebras) with oracles

Is there a natural, non-trivial example of a TCA (total combinatory algebra, cf. pca) with a natural notion of an oracle?

**0**

votes

**0**answers

85 views

### Counting path generating sentences in a specific formal language

Given a formal grammar of a language or an Turing machine of the language, can we count the path that generating sentences of the language?
For example, we know that if the grammar is context-free ...

**4**

votes

**1**answer

120 views

### Is below every cohesive set a 1-generic?

A set $X$ is called cohesive for $(R_i)_{i\in \mathbb{N}}$ if it is infinite and for each $i$ we have $X\subseteq^* R_i$ or $X\subseteq^* \overline{R_i}$. (Where $X\subseteq^*Y$ means that $X$ is ...

**2**

votes

**3**answers

320 views

### Prove existence of different programs printing each other code

How to prove that there exist two different programs A and B such that A printing code of B and B printing code of A without giving actual examples of such programs?
Update: We could prove via Kleene'...

**9**

votes

**1**answer

398 views

### Busy beaver function vs low Turing degrees

Let $BB(n)$ denote busy beaver function. It's well known that $BB(n)$ dominates all computable functions (I'm quite certain it includes partial computable functions too). However, I was wondering if ...