/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Q1E Give an example in the spirit of... [FREE SOLUTION] | 91影视

91影视

Log out

Learning Materials

Features

Discover

Chapter 0: Q1E (page 1)

Give an example in the spirit of the recursion theorem of a program in a real programming language (or a reasonable approximation thereof) that prints itself out.

Short Answer

Expert verified

Example of Recursive Equation: rw=tR.w

Step by step solution

01

Introduction Recursion

Recursion is the phenomena where a particular function repeatedly calls itself until reach to base condition (terminating point).

02

Defining Recurrence relation

First let us assume two Turing Machine T and R such that:

  • T compute a function t:鈭�*脳鈭�*鈫�鈭�*
  • R compute a function t:鈭�*鈫�鈭�*

We will create TM R based on T :

For every string w ,

rw=tR.w

So, we our recursion program will have to work like:

SELF=onanyinput

  • Obtain own description SELF through recursion theorem
  • Print SELF
03

Writing LISP Program

Use LISP programming language which is compatible for recursion theorem.

Following LISP program is in spirit of recursion:

defineSELFlambdaw

listwlistquotequotew

)

(quote(lambda(w)

(list w(quote quote)w)

))

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with 91影视!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Show that for any two languages AandB , a language J exists, where A鈮�TJandB鈮�TJ.

Let 鈭�=0,1. Let B be the collection of strings that contain at least one 1 in their second half. In other words,

a. Give a PDA that recognizes B

b. Give a CFG that generates B .

Prove that there exists an undecidable subset of 1*.

Give a counterexample to show that the following construction fails to prove Theorem 1.49, the closure of the class of regular languages under the star operationLet N1=Q1,危,未1,q1,F1 recognize . Construct N=Q1,危,未,q1,F as follows. Nis supposed to recognize A*1.

a. The states of Nare the states of N1.

b. The start state ofN is the same as the start state ofN1 .

c. . F=q1鈭�F1.The accept states are the old accept states plus its start state.

d. Define未so that for any and any a鈭�危蔚, 未q,a=(未1q,aq6鈭�F1ora6=蔚未1q,a鈭�q1q鈭�F1anda=蔚

Show that the single-tape TMs that cannot write on the portion of the tape containing the input string recognize only regular languages.
See all solutions

Recommended explanations on Computer Science Textbooks

Cybersecurity in Computer Science

Read Explanation

Issues in Computer Science

Read Explanation

Fintech

Read Explanation

Theory of Computation

Read Explanation

Data Structures

Read Explanation

Computer Organisation and Architecture

Read Explanation
View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.