tags:

views:

12

answers:

0
Q: 

Deciding finite prefix language of a real number

why is the language of finite prefixes of the number pi decidable by a TM whereas it is false to say there is a TM for any real number that which decides the finite prefixes of that given number?

related questions

Is there a term for a finite state machine that is guaranteed to halt?
what practical proofs are there about the Turing completeness of neural nets? what nns can execute code/algorithms?
Turing Model Vs Von Neuman model
why there can't be a program that checks another program
How to create a Turing machine that takes a single digit decimal number from 0 - 9 and output the cube
What is the relationship between Turing Machine & Modern Computer ?
Turing machine halting problem
A Turing Machine Question
What are the useful limits of Linear Bounded Automata compared to Turing Machines?
How does a non deterministic turing machine work?
Universal Turing Machine Problems
Designing a Turing Machine's state table
Turing machine adding two numbers
Decidability of Machines
A Decidability Question
Turing machines of prime number
Turing Machine Code Golf
How to argue that if we could solve the halting problem, then we could solve busy beaver?
Turing Machine Instruction Table
How can I simulate a turing machine?
Is computing theory useful for programmers?
How to create a turing machine that serves as function calculator for x^y
Multiple levels of infinity
How do you apply Theoretical Computer Science?
What is Turing Complete?