Problem: Prove that there exist functions f: N -> N that are not effectively computable. (Note - don't ask to see such a function because how could we describe it without trying to resort to an algorithm for the mapping?)

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Please written by computer source 

Notation:
f: S -> T means f is a function with domain S and codomain T
The cardinality of the set N (the set of positive integers) is xo. (x is the first
letter in the Hebrew alphabet, pronounced "aleph".)
If S and T are finite with |S| = m and |T| = n, then the number of functions f: S -> T is
nm (consult a discrete structures book). This formula applies to infinite sets as well.
Hence the number of functions f: N -> N is *o*o.
Fact: A set with cardinality xoo is an uncountable set. [For you mathematicians, *0*0
is equal to the cardinality of the power set of N, 2%o, which is also the cardinality of
the set of real numbers.]
Definition: a function f is called effectively computable if there is an algorithm to
compute the function, that is, an algorithm that, when given the value of n, allows
one to compute the value of f(n).
Problem: Prove that there exist functions f: N -> N that are not effectively
computable. (Note - don't ask to see such a function because how could we
describe it without trying to resort to an algorithm for the mapping?)
Transcribed Image Text:Notation: f: S -> T means f is a function with domain S and codomain T The cardinality of the set N (the set of positive integers) is xo. (x is the first letter in the Hebrew alphabet, pronounced "aleph".) If S and T are finite with |S| = m and |T| = n, then the number of functions f: S -> T is nm (consult a discrete structures book). This formula applies to infinite sets as well. Hence the number of functions f: N -> N is *o*o. Fact: A set with cardinality xoo is an uncountable set. [For you mathematicians, *0*0 is equal to the cardinality of the power set of N, 2%o, which is also the cardinality of the set of real numbers.] Definition: a function f is called effectively computable if there is an algorithm to compute the function, that is, an algorithm that, when given the value of n, allows one to compute the value of f(n). Problem: Prove that there exist functions f: N -> N that are not effectively computable. (Note - don't ask to see such a function because how could we describe it without trying to resort to an algorithm for the mapping?)
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Modular arithmetic
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education