Loop(M,x) is the problem of trying to decide if algorithm M goes into an infinite loop when given x as its input. Loop(M,x) wants to output true (or "accept" if you want to be more formal) if M goes into an infinite loop when given x as input, and output false (or "reject") if M(x) does not infinite loop. Given that there is no Accept(M,x) algorithm that works for all M and x, show by giving a pseudocode reduction that there is no Loop(M,x) algorithm that works for all M and x. Hint: It will be similar to the Halt reduction.

Loop(M,x) is the problem of trying to decide if algorithm M goes into an infinite loop when given x as its input. Loop(M,x) wants to output true (or "accept" if you want to be more formal) if M goes into an infinite loop when given x as input, and output false (or "reject") if M(x) does not infinite loop. Given that there is no Accept(M,x) algorithm that works for all M and x, show by giving a pseudocode reduction that there is no Loop(M,x) algorithm that works for all M and x. Hint: It will be similar to the Halt reduction.

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

See similar textbooks

Similar questions

Write this using java Write a complete version of the Bresenham Midpoint algorithm to handle ALL slope values. m = 0 m > 0 m < 0 m = 1 m > 1 swap the rolls of x and y m < 1 m = infinity ( needs special test case) Include appropriate tests for ‘special case’ conditions. Insteadof “WritePixel” write to the screen the coordinates of the pixel that would be drawn.
Here is my question that my professor gave to me as a homework from my algorithm's class. Use asymptotic notations to describe the running times of the nested loops below. You may assume that n is a power of 2. i =1 while i <= n j =i while j >= 1 <body of the inner while loop> // Needs Θ(1) time. j =j / 2 i= i * 2
Information is present in the screenshot and below. Based on that need help in solving the code for this problem in python. The time complexity has to be as less as possible (nlogn or n at best, no n^2). Apply divide-and-conquer algorithm in the problem. Make sure all test cases return expected outputs. Hint: Apply bisection method/modules Output FormatOutput contains a line with two space-separated integers W_a and W_b.- W_a is the maximum matchups won by Hamiltonia- W_b is the maximum matchups won by Burrgadia. Sample Input 03 554402410 Sample Output 03 0 Sample Input 15 4833485183 Sample Output 12 2 Sample Input 27 81028121912601319851 Sample Output 27 0 The actual code """Solves a test case Parameters:a : int - number of leaders in Hamiltoniab : int - number of leaders in Burrgadias_i : array-like - rap proficiencies of Hamiltonia's leadersr_j : array-like - rap proficiencies of Burrgadia's leaders Returns:win_a : int - number of…
Algorithm to An iterative solution to Towers of Hanoi.in: triplet S = s0, s1, s2 representing the current game stateout: triplet R = r0, r1, r2 representing the new game statelocal: pole indices a, b, z ∈ {0, 1, 2}; disc numbers g, h ∈ [2, n]; last(Q) = Q|Q|−1, if1 ≤ |Q|, otherwise, last(Q) = +∞
Describe an algorithm that given two regular expressions R1 and R2 outputs YES if andonly if every string generated by R1 is also generated by R2. (I.e., output YES exactlywhen the set of strings generated by R1 is a subset of the set of strings generated by R2.)
Simplistic Algorithms with a Fixed Number of Integers (with C++) Write a program that takes three integers and outputs them in reverse order of how they were entered. For example, if the user enters 39, 51, 16 then the program should output 16, 51, 39.
Santa needs to start preparing for the coming Christmas. He has one bag that canhold a maximum of Mkg in gifts’ weight. Each gift gi has a weight wi, and obviouslySanta wants to take the maximum number of gifts he can hold.Given the weight and value of n gifts and the total weight, M, the bag can hold,Santa needs you to design an algorithm that tells him which gifts he should put in hisbag such that the total number of gifts is maximized given that the total weight ofthe selected gifts should not exceed M. What is the worst-case running time of youralgorithm? Justify your answer.
Information is present in the screenshot and below. Based on that need help in solving the code for this problem in python. The time complexity has to be as less as possible (nlogn or n at best, no n^2). Apply divide-and-conquer algorithm in the problem. Make sure all test cases return expected outputs by providing output screenshots. Provide screenshots Hint: Apply bisection method/modules Output FormatOutput contains a line with two space-separated integers W_a and W_b.- W_a is the maximum matchups won by Hamiltonia- W_b is the maximum matchups won by Burrgadia. Sample Input 03 554402410 Sample Output 03 0 Sample Input 15 4833485183 Sample Output 12 2 Sample Input 27 81028121912601319851 Sample Output 27 0 The actual code """Solves a test case Parameters:a : int - number of leaders in Hamiltoniab : int - number of leaders in Burrgadias_i : array-like - rap proficiencies of Hamiltonia's leadersr_j : array-like - rap proficiencies of…
Let n be a positive integer, and consider the following algorithm segment. for i := 1 to n for j := 1 to i [Statements in body of inner loop. None contain branching statements that lead outside the loop.] next j next i How many times will the inner loop be iterated when the algorithm is implemented and run?
Consider the following problem: given a list of integers N and an individual integer n, is there any element of N that is a factor of n? (1) There is a semi-decision procedure for the problem. If your answer is true, try to describe the procedure in English or pseudocode for learning purposes. Group of answer choices True False
You are now the professor. Which of the steps to develop an iterative algorithm did the student fail to do correctly in the following code? How? How would you fix it?algorithm Eg(I) pre-cond: I is an integer. post-cond: Outputs Ij=1 j .begins = 0i = 1while( i ≤ I )loop-invariant: Each iteration adds the nextterm giving that s = ij=1 j .s = s +ii = i + 1end loopreturn(s )end algorithm
This problem compares the running times of the following two algorithms for multiplying:algorithm KindergartenAdd(a, b) pre-cond: a and b are integers. post-cond: Outputs a × b.