Theory of computation

Can a machine think like a human?

Imagine you're trying to organize a massive library with millions of books. You want to find a specific book quickly and efficiently.

A Turing machine is like an incredibly smart librarian who can follow simple rules to sort and find books on a never-ending shelf, no matter how large the library gets.

Example

The librarian (Turing machine) checks the first book, then follows the rules to decide if it needs to be moved to the right or left shelf, repeating this process until the book is found.

Remember this

A Turing machine represents the most powerful model of computation, capable of solving any problem that can be precisely defined.

Text adapted from Wikipedia, licensed under CC BY-SA 4.0.

Related concepts

Artificial general intelligence

Can we teach machines to think like us?

Chinese room

Chinese Room thought experiment challenges strong AI hypothesis

Problem of universals

Universals question independent existence

Logical positivism

Logical positivism's verification principle claims only empirically verifiable statements are meaningful

Theory of forms

Plato's Theory of Forms posits abstract perfect Forms are more real than physical copies

logical positivism collapsed

Logical positivism collapsed because its verification principle couldn't verify itself, undermining its own foundation

Swipe through 100 ML concepts daily

Open Pocket Polymath