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.

Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter2: Equations And Inequalities
Section2.4: Complex Numbers
Problem 61E
icon
Related questions
Question
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
x(f(0)f(1)f(2)....) = y mod 1.
Transcribed Image Text: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 x(f(0)f(1)f(2)....) = y mod 1.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning