Logo Questions Linux Laravel Mysql Ubuntu Git Menu
HTML CSS JAVASCRIPT SQL PYTHON PHP BOOTSTRAP JAVA JQUERY R React Kotlin
 

New posts in turing-machines

How to determine if a language is recursive or recursively enumerable?

recursion computer-science context-free-grammar turing-machines

What it means lambda calculus is equivalent to turing machine

functional-programming computation-theory lambda-calculus turing-machines computability

Are .NET's regular expressions Turing complete?

.net regex computer-science turing-machines turing-complete

What is the difference between recursive and recursively enumerable languages

computer-science theory computation-theory turing-machines formal-languages

Can a hypergraph represent a nondeterministic Turing machine?

theory distributed graph-theory turing-machines

Turing completeness of lambda calculus?

theory turing-machines turing-complete computability

chomsky hierarchy and programming languages

programming-languages context-free-grammar turing-machines formal-languages chomsky-hierarchy

Is a Turing machine a real device or an imaginary concept?

theory turing-machines

Difference between Turing-Decidable and Co-Turing-Decidable

theory turing-machines computation-theory

When is theoretical computer science useful?

theory turing-machines halting-problem computation

I do not understand the concept of Non Deterministic Turing Machine [closed]

algorithm state turing-machines non-deterministic

What's a Turing machine?

computer-science theory turing-machines computability

Why can Conway’s Game of Life be classified as a universal machine?

theory turing-machines turing-complete computability

Turing machine vs Von Neuman machine

computer-science cpu-architecture turing-machines von-neumann

When have you come upon the halting problem in the field? [closed]

language-agnostic field theory turing-machines halting-problem

What is Turing Complete?

theory turing-machines turing-complete
« Newer Entries