Naukri Code 360
  • Learn
    • Guided paths

      A complete preparation guide to prepare for coding interviews in a structured manner

  • Contests & Events
    • Contest

      Participate to improve contest rating & standout

    • Challenges

      Participate in time based coding challenges to level up and win rewards

    • Events

      New stars

      Attend webinars, workshops & compete in coding events

  • Interview prep
    • Interview experiences

      Real life interview experiences of fresher & experienced candidates

    • Interview guide

      Interview bundle to prepare for most aspiring companies

    • Coding interview prep plan

      Prepare for upcoming interview with our daily coding plan

    • Videos

      Discover videos featuring expert advice and practical tips

  • Practice
    • Interview problem

      Practice with real coding interview questions

    • Web development projects & problems

      Build impressive web development projects for a standout resume

    • Problem of the day

      Solve today’s problem—see top solutions, appear in leaderboard

    • Popular problems list

      Curated coding problem lists for cracking interviews at aspiring companies

    • Mock test series

      Practice for real interview screening rounds by taking mock tests

  • Resources

      Community

    • Campus

      Connect with friends, seniors & alumni from your campus.

    • Public discussions

      Connect with coders across the globe & discuss on various topics.

    • Knowledge center

    • Library

      Well thought articles on coding for all levels

    • Online IDE

      See all compilers
      compiler-redirection-icon
    • C compiler

    • Javascript compiler

    • C++ compiler

    • Python compiler

    • Java compiler

    • Ruby compiler

Naukri Logo

Problem of the day

Login
polygon-arrow
home
Naukri Code 360
expand-more
Library
expand-more
Theory of Computation
expand-more
Turing Machine
Browse Categories
Last updated: Mar 10, 2022

Turing Machine

Share:
Turing machine was invented in 1936 by Alan Turing. It is a computational model, like Finite Automata (FA), Pushdown automata (PDA), which works on unrestricted grammar. The Turing machine is the most powerful computation model when compared with FA and PDA.
Automata Turing Machine
This article will cover the topic of the Turing Machine and its formal definition with some examples.
Author Soumya Agrawal
1 upvote
Turing Machine in TOC HARD
Turing Machine in TOC is a hypothetical computing machine that can read, write, and erase symbols on a tape-based on a set of rules.
Author GAZAL ARORA
1 upvote
Variations of Turing Machine MEDIUM
In this article, we will learn about the variations of Turing Machine, including multi-tape, non-deterministic, and universal Turing Machines, along with their applications.
Author Sanjana kumari
0 upvotes
Multi-tape Turing Machine EASY
Multi-tape Turing machines are an extension of the Turing machine with multiple tapes, allowing more efficient computation and parallel processing of data.
Author Anant Dhakad
0 upvotes
Non-Deterministic Turing Machine
In this article, we will learn about Non-deterministic Turing machines and its definition.
Author Anant Dhakad
0 upvotes
Chomsky Hierarchy in Theory of Computation(TOC) EASY
The Chomsky hierarchy is a system for classifying formal grammars and languages in computer science and linguistics.
Author Sanjana kumari
3 upvotes
Library:
Java
Python
C Programming Language
C++ Programming Language
Cloud Computing
Node JS
Machine Learning
Deep Learning
Big Data
Operating System
Go Language
C#
Ruby
Amazon Web Services
Microsoft Azure
Google Cloud Platform
Data Warehousing
Internet of Things
Get the tech career you deserve faster with Coding Ninjas courses
User rating 4.7/5
1:1 doubt support
95% placement record
Our courses
Follow us on
Contact us
1800-123-3598
code360@codingninjas.com
Download the naukri app