MATH
Login Or Sign up

List Question

15
83
Views

partial recursive functions

Published on
#turing-machines #finite-state-machine
223
Views

Quantifying the "Complexity" or "Strength" of Axiomatic Systems

Published on
#axioms #turing-machines #incompleteness
38
Views

Problem understanding Turing Halting problem

Published on
#turing-machines
2k
Views

Constructing Turing machine for $L=\{a^n b^m, m\%n=0\}$

Published on
#computer-science #computational-complexity #formal-languages #turing-machines
125
Views

proving why can't a P-Complete language exist in log-logarithmic space

Published on
#computational-complexity #computational-mathematics #turing-machines
627
Views

minimal vertex cover and P=NP

Published on
#graph-theory #algorithms #computational-complexity #computability #turing-machines
261
Views

Finding an algorithm that after removing k edges we get an acyclic graph

Published on
#graph-theory #algorithms #computational-complexity #computability #turing-machines
515
Views

Prove that if L is decidable then half(L) is decidable too

Published on
#computer-science #automata #regular-language #turing-machines #decidability
84
Views

Could the halting problem be computed in GlooP?

Published on
#computational-mathematics #turing-machines
16
Views

The problem of determining whether a given context-free grammar generates the empty string

Published on
#context-free-grammar #turing-machines
49
Views

Turing decidability

Published on
#formal-languages #turing-machines
118
Views

What are some theorems or hypotheses that can be tested by a two-symbol low-state Turing machine?

Published on
#sequences-and-series #reference-request #soft-question #recreational-mathematics #turing-machines
3.1k
Views

Is a language $L$ recursive, if it and its complement $L^c$ are both recursively enumerable?

Published on
#formal-languages #automata #turing-machines
66
Views

A multiple choice on formal languages, Turing machines and automata

Published on
#formal-languages #automata #turing-machines
336
Views

How exactly do diophantine polynomial equations map to turing machines?

Published on
#number-theory #diophantine-equations #computability #turing-machines #decidability

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.