Problem 21. Prove that a real number y is computable if and only if there is a computable function f : Z+ → {0, 1} such that a(f(0)f(1)f(2)...) = y mod 1.
Problem 21. Prove that a real number y is computable if and only if there is a computable function f : Z+ → {0, 1} such that a(f(0)f(1)f(2)...) = y mod 1.
Linear Algebra: A Modern Introduction
4th Edition
ISBN:9781285463247
Author:David Poole
Publisher:David Poole
Chapter1: Vectors
Section1.1: The Geometry And Algebra Of Vectors
Problem 24EQ
Related questions
Question
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
Recommended textbooks for you
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning