Categories
Tags
Computability
New post in Computability
Proove that Unions and intersections of recursively enumerable sets are also recursively enumerable
November 6th, 2022
computability
Project Euler's Problem Number 88
August 1st, 2022
algorithms
combinatorics
project-euler
computability
computational-complexity
Example of function which is not computable
August 1st, 2022
logic
computability
Reducing Pcp (Post's correspondence problem) to mPcp
April 26th, 2020
computability
Computable Function and Predicate Question
August 9th, 2020
logic
computer-science
computability
turing-machines
Unclear why (first order) satisfiability undecidable and not semi-decidable.
June 17th, 2020
computability
logic
Showing set is undecidable with Turing Machines
February 17th, 2020
turing-machines
computability
computer-science
An effective enumeration of recursive sets in increasing order
December 12th, 2020
recursion
computability
What is meant by "finite algorithm" in Turing's definition of the computable numbers?
August 1st, 2022
computability
turing-machines
Proof that $\textit{INFINITE}_{\text{DFA}}$ is decidable.(Sipser Q.4.10)
August 1st, 2022
computational-complexity
turing-machines
formal-languages
computability
Prove every infinite recursively enumerable subset of $\Bbb N$ contains an infinite recursive subset
May 18th, 2020
logic
computability
recursion
computer-science
Semi-decidability of First Order Logic
August 1st, 2022
computability
first-order-logic
logic
Diagonalization on turing machines and proofs. Where does the argument fail?
June 22nd, 2021
turing-machines
computability
proof-explanation
logic
Proof of undecidability of $FINITE_{\text{TM}}$ and $USELESS_{\text{TM}}$
August 1st, 2022
formal-languages
computability
turing-machines
Reducing a Decidability Problem to the Halting Problem
August 1st, 2022
turing-machines
computability
automata
Turing machines that compute $\pi$
September 12th, 2020
arithmetic
recursive-algorithms
computability
Convert NFA to DFA
March 25th, 2020
finite-automata
computability
automata
Convert the regular expression to a NFA
April 21st, 2020
regular-expressions
automata
computability
regular-language
finite-automata
Which way is best to solve: $T(n)=5T(n/5) + n\;?$
June 1st, 2020
recursion
asymptotics
notation
computability
two way infinite turing machine?
December 31st, 2020
computer-science
computability
turing-machines
Show that the language is regular - Closure
March 4th, 2020
regular-language
automata
computability
Every infinite recursive set has a recursively enumerable subset which is not recursive.
August 1st, 2022
logic
computability
Prove a relation is primitive recursive, x is prime?
June 13th, 2020
computability
logic
recursion
Is there a version of turing-completeness for total programming languages?
March 9th, 2020
turing-machines
computability
formal-languages
if A is turing-recognizable, and A is mapping reducible to complement of A, A is decidable
December 10th, 2020
computability
turing-machines
Turing machine to replace consecutive 1's with 0's
August 1st, 2022
computability
logic
turing-machines
finite-state-machine
What's time complexity of algorithm for "Word Break"?
August 22nd, 2020
dynamic-programming
computability
recurrence-relations
asymptotics
recursive-algorithms
Relationship between the Turing Machine and RAM Models
November 27th, 2020
turing-machines
computability
Example for 2 disjoint languages that cannot be separated by a decidable language
December 26th, 2020
computability
Most computationally intensive algorithm.
April 24th, 2020
computability
computer-science
algorithms
←
1
2
3
4
5
6
→