Have a Turing Machine? Can it solve linear algebraic equations?

Click For Summary
SUMMARY

The discussion centers on the Turing Machine, a theoretical construct from the 1930s that embodies the principles of computation. It is established that while no physical Turing Machine exists, all modern computers are implementations of its principles. The conversation also touches on the complexity of programming a Turing Machine, likening it to Assembly language. Additionally, a unique conceptualization of a Turing Machine using goldfish as memory and processing units is presented, alongside links to a software simulation and an explanatory resource on Turing's concepts.

PREREQUISITES
  • Understanding of Turing Machine principles
  • Familiarity with Assembly language programming
  • Basic knowledge of linear algebraic equations
  • Awareness of computational theory
NEXT STEPS
  • Explore Turing Machine implementations in various programming languages
  • Study the principles of computational theory in depth
  • Learn about Assembly language programming techniques
  • Investigate practical applications of linear algebra in computer science
USEFUL FOR

This discussion is beneficial for computer science students, theoretical computer scientists, and anyone interested in the foundations of computation and programming languages.

Thecla
Messages
137
Reaction score
10
TL;DR
Has anybody built one?
I don't understand the Turing Machine. Amazingly this hypothetical device, designed in the 1930s can do everything the most powerful computers can do today, but it would just take much longer. Has anybody ever built one just to solve a simple linear algebraic equation? How long would the tape be to feed into the device to solve this equation?
 
Computer science news on Phys.org
1. A Turing machine is not really a thing - it's more like a set of principles. Those principles can be implemented into a physical device in a pretty much infinite number of ways.
2. Every computer ever built is one form of implementation that meets the requirements to be a Turing machine.

The closest thing you might find to programming a Turimg machine might be Assembly language - though even that is much more complex.

I have - on my mental drawing board - a computer made of goldfish. Goldfish are the memory and processor.
 
  • Like
Likes   Reactions: 256bits

Similar threads

  • · Replies 9 ·
Replies
9
Views
3K
Replies
29
Views
5K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K
Replies
3
Views
4K
Replies
9
Views
3K
Replies
12
Views
10K
  • · Replies 2 ·
Replies
2
Views
2K