MATH
Login Or Sign up

List Question

15
96
Views

What is a data structure, in terms of computability theory?

Published on
#computer-science #computability
59
Views

Can $S_R(A)$ always be embedded into $S_R(\mathbb{N})$?

Published on
#abstract-algebra #group-theory #permutations #symmetric-groups #computability
94
Views

Coarsenings of the topology on $2^\omega$ with $F_\sigma$ (sub)base

Published on
#general-topology #computability #descriptive-set-theory #descriptive-complexity
156
Views

confusion of halting problem

Published on
#discrete-mathematics #computer-science #computability
80
Views

Separation axiom implied by semidecidability of comparison

Published on
#general-topology #computability #separation-axioms #decidability
41
Views

A transitive closure axiom for a machine operating system.

Published on
#soft-question #computer-science #computability #computational-mathematics #axioms
85
Views

Is there any infinitesimal number both definable and computable?

Published on
#computability
50
Views

Prove that $\{p: U(p,p)\downarrow\}\equiv_m K_e=\{p:\phi_p()\downarrow\}$

Published on
#logic #recursion #computability #recursive-algorithms
57
Views

Decidability of $2^a \bmod a^3$?

Published on
#number-theory #modular-arithmetic #computability #decidability
105
Views

Analogue of Turing recognizable languages

Published on
#computability #formal-languages #turing-machines
149
Views

Does "recursive" mean the same in "recursive functions" and in definition of Fibonacci function?

Published on
#computer-science #recursion #computability
127
Views

Are "forgetful" and "mindful" Turing machines equivalent?

Published on
#computability #turing-machines
507
Views

How can a subset be undecidable?

Published on
#elementary-set-theory #logic #computability
59
Views

Is $\{\langle M \rangle \mid \exists K \forall w\; \text{M(w) halt with less than K steps}\} \in RE$?

Published on
#computability #turing-machines
43
Views

Is $\{\langle M \rangle \mid \exists P \;\text{(p is polynom)}\; \forall w\; \text{M(w) halt with less than p(|w|) steps}\} \in RE$?

Published on
#computational-complexity #computability #turing-machines

Trending Questions

Popular # Hahtags

second-order-logic numerical-methods puzzle logic probability number-theory winding-number real-analysis integration calculus complex-analysis sequences-and-series proof-writing set-theory functions homotopy-theory elementary-number-theory ordinary-differential-equations circles derivatives game-theory definite-integrals elementary-set-theory limits multivariable-calculus geometry algebraic-number-theory proof-verification partial-derivative algebra-precalculus

Popular Questions

Copyright © 2021 JogjaFile Inc.