0% found this document useful (0 votes)
195 views

CS701 - Theory of Computation Assignment No.1: Instructions

This document outlines a virtual university assignment for the course CS701 - Theory of Computation. It contains two questions. The first question asks students to design a Turing machine in three ways to recognize a language of strings of 1s in an exponential function, and provide snapshots of the machine in JFLAP software. The second question requires students to read a research paper on moral reasoning in autonomous systems and critically elaborate on two topics discussed in the paper in their own words. The assignment is due by November 30th and any plagiarism or late submissions will not be accepted. Students should contact the provided email with any questions.

Uploaded by

Ihsanullah Khan
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
195 views

CS701 - Theory of Computation Assignment No.1: Instructions

This document outlines a virtual university assignment for the course CS701 - Theory of Computation. It contains two questions. The first question asks students to design a Turing machine in three ways to recognize a language of strings of 1s in an exponential function, and provide snapshots of the machine in JFLAP software. The second question requires students to read a research paper on moral reasoning in autonomous systems and critically elaborate on two topics discussed in the paper in their own words. The assignment is due by November 30th and any plagiarism or late submissions will not be accepted. Students should contact the provided email with any questions.

Uploaded by

Ihsanullah Khan
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Virtual University of Pakistan MS (CS), Fall 2020

CS701 – Theory of Computation

Assignment No.1
Maximum Marks: 50

Due Date: 30 November 2020

Instructions
The purpose of this assignment is to give your hands-on practice. It is expected that
students will solve the assignment themselves. The following rules will apply during the
evaluation of the assignment.

 Cheating from any source will result in zero marks in the


assignment.
 Any student found cheating in any of the two assignments submitted would be
awarded "F" grade in the course.
 No assignment after due date will be accepted through email

Question No. 1 (20 + JFLAP Snapshot = 5) = 25 marks)


Design a Turing Machine (TM) in the following three ways of descriptions that decide the
2n+1:
language L = {12 n ≥ 0}, the language consisting of all strings of 1s in given
exponential function.

1. The Formal description of the Turing machine


2. Implementation level description of the Turing machine
3. The high-level description of the TM

Some example words of the language are as

follows:

a. 11
b. 11111111
c. 11111111111111111111111111111111
Virtual University of Pakistan MS (CS), Fall 2020

Note: Turing Machine must be creating in JFLAP software. The tutorial link of
JFLAP has already been sent via course announcement. The snapshots of the
Turing machine diagram and testing accepting/rejecting strings must be pasted
in the assignment.

Question No. 2 (15+10 = 25 marks)


Read the research paper entitled “Against the moral Turing test: accountable design
and the moral reasoning of autonomous systems” and answer the following
questions:

1) How can you describe” Human performance versus moral performance?’ as


discussed in the paper? Elaborate it critically in your own words.

2) What arguments have been expressed” Whose morality is tested? Verification


and design responsibility? Elaborate it critically in your own words.

Please download above Research paper that has attached with an


assignment zip file.

Note: Plagiarism will be checked for each question. Please answer the
questions in your own words and marks will be awarded based on your
answer and plagiarism report.

For any query about the assignment, contact at [email protected]

You might also like