xuebaunion@vip.163.com

3551 Trousdale Rkwy, University Park, Los Angeles, CA

留学生论文指导和课程辅导

无忧GPA：https://www.essaygpa.com

工作时间：全年无休-早上8点到凌晨3点

扫码添加客服微信

扫描添加客服微信

数学证明代写-HPS391

时间：2021-04-03

Activity 9: An Introduction to Turing Machines

HPS391 Rebels who Count: History of Mathematics Since 1700

MAT391 History of Mathematics since 1700

Winter 2021, Instructor: Sylvia Nickerson

Maximum points: 38/38

1 Introduction to Turing Machines

During the International Congress of Mathematicians in Paris in 1900 David

Hilbert (1862–1943), one of the leading mathematicians of the last century,

proposed a list of problems for the following generations to ponder. On the

list was whether the axioms of arithmetic are consistent, a question which

would have profound consequences for the foundations of mathematics. Con-

tinuing in this direction, in 1928 Hilbert proposed the decision problem (das

Entscheidungsproblem), which asked whether there was a standard proce-

dure that can be applied to decide whether a given mathematical state-

ment is true. In a revolutionary paper “On Computable Numbers, with an

Application to the Entscheidungsproblem” published in 1936, Alan Turing

(1912–1954) proved that the decision problem had no solution, and in doing

so he outlined the rudimentary ideas which form the basis for the mod-

ern programmable computer. Today his construction is known as a Turing

machine.

The goal of this project is to read a few excerpts from Turing’s original

paper1 and understand how to read and write simple instructions for a

Turing Machine. After carefully reading the attached pages, answer the

following:

(Task 1) Describe the workings of a Turing machine (referred to as a “com-

puting machine” in the original paper). [5 points]

(Task 2) What is the precise output of the machine in Example 1. In

your answer draw the output on the tape, as well as the binary decimal

1Turing, A.M., “On Computable Numbers with an Application to the Entschei-

dungsproblem,” Proceedings of the London Mathematical Society, 42 (1936), pp. 230–265.

1

represented and its precise real number equivalent. [6 points]

(Task 3) Design a Turing machine which generates the following output.

Be sure to justify your answer. [6 points]

010010100101001 . . .

(Task 4) Describe the behavior of the following machine, which begins with

a blank tape, with the machine in configuration α. [4 points]

Configuration Behavior

m-config. symbol operation final m-config.

α none R P1 β

α 1 R P0 β

α 0 HALT (none)

β 1 R P1 α

β 0 R P0 α

ON COMPUTABLE NUMBERS, WITH AN APPLICATION TO

THE ENTSCHEIDUNGSPROBLEM

By A. M. Turing.

1. Computing Machines.

We have said that the computable numbers are those whose decimals are

calculable by finite means. This requires more explicit definition. No real at-

tempt will be made to justify the definitions given until we reach §9. For present

I shall only say that the justification lies in the fact that the human memory is

necessarily limited.

We may compare a man in the process of computing a real number to a

machine which is only capable of a finite number of conditions q1, q2, . . ., qR,

which will be called the “m-configurations”. The machine is supplied with a

“tape” (the analogue of paper) running through it, and divided into sections

(called “squares”) each capable of bearing a “symbol”. At any moment there

is just one square, say the r-th, bearing the symbol S(r) which is “in the

machine”. We may call this square the “scanned square”. The symbol on the

scanned square may be called the “scanned symbol”. The “scanned symbol” is

the only one of which the machine is, so to speak, “directly aware”. However,

by altering its m-configuration the machine can effectively remember some of

the symbols it has “seen” (scanned) previously. The possible behaviour of

the machine at any moment is determined by the m-configuration qn and the

2

scanned symbol S(r). This pair qn, S(r) will be called the “configuration”;

thus the configuration determines the possible behaviour of the machine. In

some of the configurations in which the scanned square is blank (i.e. bears no

symbol) the machine writes down a new symbol on the scanned square; in other

configurations it erases the scanned symbol. The machine may also change the

square which is being scanned, but only by shifting it one place to right or left.

In addition to any of these operations the m-configuration may be changed.

Some of the symbols written down will form the sequence of figures which is

the decimal of the real number which is being computed. The others are just

rough notes to “assist the memory”. It will only be these rough notes which

will be liable to erasure.

It my contention that these operations include all those which are used in

the computation of a number. The defense of this contention will be easier

when the theory of the machines is familiar to the reader. In the next section

I therefore proceed with the development of the theory and assume that it is

understood what is meant by “machine”, “tape”, “scanned”, etc.

2. Definitions.

Automatic machines.

If at each stage the motion of a machine (in the sense of §1)is completely

determined by the configuration, we shall call the machine an “automatic ma-

chine” (or a-machine).

For some purposes we might use machines (choice machines or c-machines)

whose motion is only partially determined by the configuration (hence the use of

the word “possible” in §1). When such a machine reaches one of these ambigu-

ous configurations, it cannot go on until some arbitrary choice has been made

by an external operator. This would be the case if we were using machines to

deal with axiomatic systems. In this paper I deal only with automatic machines,

and will therefore often omit the prefix a-.

Computing machines.

If an a-machine prints two kinds of symbols, of which the first kind (called

figures) consists entirely of 0 and 1 (the others being called symbols of the

second kind), then the machine will be called a computing machine. If the

machine is supplied with a blank tape and set in motion, starting from the

correct initial m-configuration the subsequence of the symbols printed by it

which are of the first kind will be called the sequence computed by the machine.

The real number whose expression as a binary decimal is obtained by prefacing

this sequence by a decimal point is called the number printed by the machine.

At any stage of the motion of the machine, the number of the scanned

3

square, the complete sequence of all symbols on the tape, and them-configuration

will be said to describe the complete configuration at that stage. The changes

of the machine and tape between successive complete configurations will be

called the moves of the machine.

3. Examples of computing machines.

I. A machine can be constructed to compute the sequence 010101 . . .. The

machine is to have the four m-configurations “b”, “c”, “f”, “e” and is capable

of printing “0” and “1”. The behaviour of the machine is described in the

following table in which “R” means “the machine moves so that it scans the

square immediately on the right of the one it was scanning previously”. Similarly

for “L”. “E” means “the scanned symbol is erased and “P” stands for “prints”.

This table (and all succeeding tables of the same kind) is to be understood to

mean that for a configuration described in the first two columns the operations

in the third column are carried out successively, and the machine then goes

over into the m-configuration described in the last column. When the second

column is blank, it is understood that the behaviour of the third and fourth

columns applies for any symbol and for no symbol. The machine starts in the

m-configuration b with a blank tape. (Example 1).

Configuration Behaviour

m-config. symbol operation final m-config.

b none P0, R c

c none R e

e none P1, R f

f none R b

If (contrary to the description §1) we allow the letters L, R to appear more

than once in the operations column we can simplify the table considerably.

Configuration Behaviour

m-config. symbol operation final m-config.

b none P0 b

b 0 R, R, P1 b

b 1 R, R, P0 b

2 Turing Machines: Induction and Recursion

The logic behind the modern programmable computer owes much to Turing’s

“computing machines,” discussed in the first section. Since the state of the

4

machine, or m-configuration as called by Turing, can be altered according

to the symbol being scanned, the operation of the machine can be changed

depending on what symbols have been written on the tape, and affords

the machine a degree of programmability. The program consists of the list

of configurations of the machine and its behavior for each configuration.

Turing’s description of his machine, however, did not include memory in

its modern usage for computers, and symbols read on the tape could not

be stored in any separate devise. Using a brilliant design feature for the

tape, Turing achieves a limited type of memory for the machine, which

allows it to compute many arithmetic operations. The numbers needed for

a calculation are printed on every other square of the tape, while the squares

between these are used as “rough notes to ‘assist the memory.’ It will only

be these rough notes which will be liable to erasure” [1, p. 232].

Turing continues: The convention of writing the figures only on alternate

squares is very useful: I shall always make use of it. I shall call the one se-

quence of alternate squares F -squares, and the other sequence E-squares. The

symbols on E-squares will be liable to erasure. The symbols on F -squares form

a continuous sequence. . . . There is no need to have more than one E-square

between each pair of F -squares: an apparent need of more E-squares can be

satisfied by having a sufficiently rich variety of symbols capable of being printed

on E-squares [1, p. 235].

Let’s examine the Englishman’s use of these two types of squares. De-

termine the output of the following Turing machine, which begins with the

tape

X . . .

and the scanner at the far left, reading the symbol X.

Configuration Behavior

m-config. symbol operation final m-config.

a X R a

a 1 R, R a

a blank P(1), R, R, P(1), R, R, P(0) b

b X E, R c

b other L b

c 0 R, P(X), R a

c 1 R, P(X), R d

d 0 R, R e

d other R, R d

e blank P(1) b

e other R, R e

5

Recall the meaning of the following symbols used for operations.

• R: Move one position to the right.

• L: Move one position to the left.

• E: Erase the currently scanned square

• P( ): Print whatever is in parentheses in the current square.

(Task 5) What is the precise output of the machine as it just finishes

configuration a and enters configuration b for the first time? Justify your

answer. [4 points]

(Task 6) What is the precise output of the machine as it just finishes

configuration a and enters configuration b for the second time? Justify your

answer. [4 points]

(Task 7) What is the precise output of the machine as it just finishes

configuration a and enters configuration b for the third time? Justify your

answer. [4 points]

(Task 8) Guess what the output of the machine is as it just finishes con-

figuration a and enters configuration b for the n-th time. Use induction to

prove that your guess is correct. Be sure to carefully write the details of this

proof by induction. [5 points]

Imagine a Turing machine, which when given two arbitrary natural numbers,

n and m, will compute the product n ·m. Suppose that the machine begins

with the tape

A 1 1 . . . 1 1 B 1 1 . . . 1 1 C

where the number of ones between A and B is n, the number of ones between

B and C is m, and the machine begins scanning the tape at the far left,

reading the symbol A. The output of the machine should be:

A 1 . . . 1 B 1 . . . 1 C 1 1 . . . 1 D

where the number of ones between C and D is n ·m.

If T denotes the Turing machine which multiplies n and m together, so

that the value of T (n, m) is n ·m, then for n ∈ N,

T (n, 1) = n

and for m ∈ N, m ≥ 2, we have

T (n, m) = T (n, m− 1) + n.

6

Such an equation provides an example of a recursively defined function, an

important topic in computer science. In this case, the algorithm for multi-

plication, T , is defined in terms of addition, a more elementary operation.

REFERENCES:

[1] Turing, A. M., “On Computable Numbers with An Application to the

Entscheidungsproblem,” Proceedings of the London Mathematical Society,

42, 1936, pp. 230–265.

7

学霸联盟

HPS391 Rebels who Count: History of Mathematics Since 1700

MAT391 History of Mathematics since 1700

Winter 2021, Instructor: Sylvia Nickerson

Maximum points: 38/38

1 Introduction to Turing Machines

During the International Congress of Mathematicians in Paris in 1900 David

Hilbert (1862–1943), one of the leading mathematicians of the last century,

proposed a list of problems for the following generations to ponder. On the

list was whether the axioms of arithmetic are consistent, a question which

would have profound consequences for the foundations of mathematics. Con-

tinuing in this direction, in 1928 Hilbert proposed the decision problem (das

Entscheidungsproblem), which asked whether there was a standard proce-

dure that can be applied to decide whether a given mathematical state-

ment is true. In a revolutionary paper “On Computable Numbers, with an

Application to the Entscheidungsproblem” published in 1936, Alan Turing

(1912–1954) proved that the decision problem had no solution, and in doing

so he outlined the rudimentary ideas which form the basis for the mod-

ern programmable computer. Today his construction is known as a Turing

machine.

The goal of this project is to read a few excerpts from Turing’s original

paper1 and understand how to read and write simple instructions for a

Turing Machine. After carefully reading the attached pages, answer the

following:

(Task 1) Describe the workings of a Turing machine (referred to as a “com-

puting machine” in the original paper). [5 points]

(Task 2) What is the precise output of the machine in Example 1. In

your answer draw the output on the tape, as well as the binary decimal

1Turing, A.M., “On Computable Numbers with an Application to the Entschei-

dungsproblem,” Proceedings of the London Mathematical Society, 42 (1936), pp. 230–265.

1

represented and its precise real number equivalent. [6 points]

(Task 3) Design a Turing machine which generates the following output.

Be sure to justify your answer. [6 points]

010010100101001 . . .

(Task 4) Describe the behavior of the following machine, which begins with

a blank tape, with the machine in configuration α. [4 points]

Configuration Behavior

m-config. symbol operation final m-config.

α none R P1 β

α 1 R P0 β

α 0 HALT (none)

β 1 R P1 α

β 0 R P0 α

ON COMPUTABLE NUMBERS, WITH AN APPLICATION TO

THE ENTSCHEIDUNGSPROBLEM

By A. M. Turing.

1. Computing Machines.

We have said that the computable numbers are those whose decimals are

calculable by finite means. This requires more explicit definition. No real at-

tempt will be made to justify the definitions given until we reach §9. For present

I shall only say that the justification lies in the fact that the human memory is

necessarily limited.

We may compare a man in the process of computing a real number to a

machine which is only capable of a finite number of conditions q1, q2, . . ., qR,

which will be called the “m-configurations”. The machine is supplied with a

“tape” (the analogue of paper) running through it, and divided into sections

(called “squares”) each capable of bearing a “symbol”. At any moment there

is just one square, say the r-th, bearing the symbol S(r) which is “in the

machine”. We may call this square the “scanned square”. The symbol on the

scanned square may be called the “scanned symbol”. The “scanned symbol” is

the only one of which the machine is, so to speak, “directly aware”. However,

by altering its m-configuration the machine can effectively remember some of

the symbols it has “seen” (scanned) previously. The possible behaviour of

the machine at any moment is determined by the m-configuration qn and the

2

scanned symbol S(r). This pair qn, S(r) will be called the “configuration”;

thus the configuration determines the possible behaviour of the machine. In

some of the configurations in which the scanned square is blank (i.e. bears no

symbol) the machine writes down a new symbol on the scanned square; in other

configurations it erases the scanned symbol. The machine may also change the

square which is being scanned, but only by shifting it one place to right or left.

In addition to any of these operations the m-configuration may be changed.

Some of the symbols written down will form the sequence of figures which is

the decimal of the real number which is being computed. The others are just

rough notes to “assist the memory”. It will only be these rough notes which

will be liable to erasure.

It my contention that these operations include all those which are used in

the computation of a number. The defense of this contention will be easier

when the theory of the machines is familiar to the reader. In the next section

I therefore proceed with the development of the theory and assume that it is

understood what is meant by “machine”, “tape”, “scanned”, etc.

2. Definitions.

Automatic machines.

If at each stage the motion of a machine (in the sense of §1)is completely

determined by the configuration, we shall call the machine an “automatic ma-

chine” (or a-machine).

For some purposes we might use machines (choice machines or c-machines)

whose motion is only partially determined by the configuration (hence the use of

the word “possible” in §1). When such a machine reaches one of these ambigu-

ous configurations, it cannot go on until some arbitrary choice has been made

by an external operator. This would be the case if we were using machines to

deal with axiomatic systems. In this paper I deal only with automatic machines,

and will therefore often omit the prefix a-.

Computing machines.

If an a-machine prints two kinds of symbols, of which the first kind (called

figures) consists entirely of 0 and 1 (the others being called symbols of the

second kind), then the machine will be called a computing machine. If the

machine is supplied with a blank tape and set in motion, starting from the

correct initial m-configuration the subsequence of the symbols printed by it

which are of the first kind will be called the sequence computed by the machine.

The real number whose expression as a binary decimal is obtained by prefacing

this sequence by a decimal point is called the number printed by the machine.

At any stage of the motion of the machine, the number of the scanned

3

square, the complete sequence of all symbols on the tape, and them-configuration

will be said to describe the complete configuration at that stage. The changes

of the machine and tape between successive complete configurations will be

called the moves of the machine.

3. Examples of computing machines.

I. A machine can be constructed to compute the sequence 010101 . . .. The

machine is to have the four m-configurations “b”, “c”, “f”, “e” and is capable

of printing “0” and “1”. The behaviour of the machine is described in the

following table in which “R” means “the machine moves so that it scans the

square immediately on the right of the one it was scanning previously”. Similarly

for “L”. “E” means “the scanned symbol is erased and “P” stands for “prints”.

This table (and all succeeding tables of the same kind) is to be understood to

mean that for a configuration described in the first two columns the operations

in the third column are carried out successively, and the machine then goes

over into the m-configuration described in the last column. When the second

column is blank, it is understood that the behaviour of the third and fourth

columns applies for any symbol and for no symbol. The machine starts in the

m-configuration b with a blank tape. (Example 1).

Configuration Behaviour

m-config. symbol operation final m-config.

b none P0, R c

c none R e

e none P1, R f

f none R b

If (contrary to the description §1) we allow the letters L, R to appear more

than once in the operations column we can simplify the table considerably.

Configuration Behaviour

m-config. symbol operation final m-config.

b none P0 b

b 0 R, R, P1 b

b 1 R, R, P0 b

2 Turing Machines: Induction and Recursion

The logic behind the modern programmable computer owes much to Turing’s

“computing machines,” discussed in the first section. Since the state of the

4

machine, or m-configuration as called by Turing, can be altered according

to the symbol being scanned, the operation of the machine can be changed

depending on what symbols have been written on the tape, and affords

the machine a degree of programmability. The program consists of the list

of configurations of the machine and its behavior for each configuration.

Turing’s description of his machine, however, did not include memory in

its modern usage for computers, and symbols read on the tape could not

be stored in any separate devise. Using a brilliant design feature for the

tape, Turing achieves a limited type of memory for the machine, which

allows it to compute many arithmetic operations. The numbers needed for

a calculation are printed on every other square of the tape, while the squares

between these are used as “rough notes to ‘assist the memory.’ It will only

be these rough notes which will be liable to erasure” [1, p. 232].

Turing continues: The convention of writing the figures only on alternate

squares is very useful: I shall always make use of it. I shall call the one se-

quence of alternate squares F -squares, and the other sequence E-squares. The

symbols on E-squares will be liable to erasure. The symbols on F -squares form

a continuous sequence. . . . There is no need to have more than one E-square

between each pair of F -squares: an apparent need of more E-squares can be

satisfied by having a sufficiently rich variety of symbols capable of being printed

on E-squares [1, p. 235].

Let’s examine the Englishman’s use of these two types of squares. De-

termine the output of the following Turing machine, which begins with the

tape

X . . .

and the scanner at the far left, reading the symbol X.

Configuration Behavior

m-config. symbol operation final m-config.

a X R a

a 1 R, R a

a blank P(1), R, R, P(1), R, R, P(0) b

b X E, R c

b other L b

c 0 R, P(X), R a

c 1 R, P(X), R d

d 0 R, R e

d other R, R d

e blank P(1) b

e other R, R e

5

Recall the meaning of the following symbols used for operations.

• R: Move one position to the right.

• L: Move one position to the left.

• E: Erase the currently scanned square

• P( ): Print whatever is in parentheses in the current square.

(Task 5) What is the precise output of the machine as it just finishes

configuration a and enters configuration b for the first time? Justify your

answer. [4 points]

(Task 6) What is the precise output of the machine as it just finishes

configuration a and enters configuration b for the second time? Justify your

answer. [4 points]

(Task 7) What is the precise output of the machine as it just finishes

configuration a and enters configuration b for the third time? Justify your

answer. [4 points]

(Task 8) Guess what the output of the machine is as it just finishes con-

figuration a and enters configuration b for the n-th time. Use induction to

prove that your guess is correct. Be sure to carefully write the details of this

proof by induction. [5 points]

Imagine a Turing machine, which when given two arbitrary natural numbers,

n and m, will compute the product n ·m. Suppose that the machine begins

with the tape

A 1 1 . . . 1 1 B 1 1 . . . 1 1 C

where the number of ones between A and B is n, the number of ones between

B and C is m, and the machine begins scanning the tape at the far left,

reading the symbol A. The output of the machine should be:

A 1 . . . 1 B 1 . . . 1 C 1 1 . . . 1 D

where the number of ones between C and D is n ·m.

If T denotes the Turing machine which multiplies n and m together, so

that the value of T (n, m) is n ·m, then for n ∈ N,

T (n, 1) = n

and for m ∈ N, m ≥ 2, we have

T (n, m) = T (n, m− 1) + n.

6

Such an equation provides an example of a recursively defined function, an

important topic in computer science. In this case, the algorithm for multi-

plication, T , is defined in terms of addition, a more elementary operation.

REFERENCES:

[1] Turing, A. M., “On Computable Numbers with An Application to the

Entscheidungsproblem,” Proceedings of the London Mathematical Society,

42, 1936, pp. 230–265.

7

学霸联盟

- 留学生代写
- Python代写
- Java代写
- c/c++代写
- 数据库代写
- 算法代写
- 机器学习代写
- 数据挖掘代写
- 数据分析代写
- Android代写
- html代写
- 计算机网络代写
- 操作系统代写
- 计算机体系结构代写
- R代写
- 数学代写
- 金融作业代写
- 微观经济学代写
- 会计代写
- 统计代写
- 生物代写
- 物理代写
- 机械代写
- Assignment代写
- sql数据库代写
- analysis代写
- Haskell代写
- Linux代写
- Shell代写
- Diode Ideality Factor代写
- 宏观经济学代写
- 经济代写
- 计量经济代写
- math代写
- 金融统计代写
- 经济统计代写
- 概率论代写
- 代数代写
- 工程作业代写
- Databases代写
- 逻辑代写
- JavaScript代写
- Matlab代写
- Unity代写
- BigDate大数据代写
- 汇编代写
- stat代写
- scala代写
- OpenGL代写
- CS代写
- 程序代写
- 简答代写
- Excel代写
- Logisim代写
- 代码代写
- 手写题代写
- 电子工程代写
- 判断代写
- 论文代写
- stata代写
- witness代写
- statscloud代写
- 证明代写
- 非欧几何代写
- 理论代写
- http代写
- MySQL代写
- PHP代写
- 计算代写
- 考试代写
- 博弈论代写
- 英语代写
- essay代写
- 不限代写
- lingo代写
- 线性代数代写
- 文本处理代写
- 商科代写
- visual studio代写
- 光谱分析代写
- report代写
- GCP代写
- 无代写
- 电力系统代写
- refinitiv eikon代写
- 运筹学代写
- simulink代写
- 单片机代写
- GAMS代写
- 人力资源代写
- 报告代写
- SQLAlchemy代写
- Stufio代写
- sklearn代写
- 计算机架构代写
- 贝叶斯代写
- 以太坊代写
- 计算证明代写
- prolog代写
- 交互设计代写
- mips代写
- css代写
- 云计算代写
- dafny代写
- quiz考试代写
- js代写
- 密码学代写
- ml代写
- 水利工程基础代写
- 经济管理代写
- Rmarkdown代写
- 电路代写
- 质量管理画图代写
- sas代写
- 金融数学代写
- processing代写
- 预测分析代写
- 机械力学代写
- vhdl代写
- solidworks代写
- 不涉及代写
- 计算分析代写
- Netlogo代写
- openbugs代写
- 土木代写
- 国际金融专题代写
- 离散数学代写
- openssl代写
- 化学材料代写
- eview代写
- nlp代写
- Assembly language代写
- gproms代写
- studio代写
- robot analyse代写
- pytorch代写
- 证明题代写
- latex代写
- coq代写
- 市场营销论文代写
- 人力资论文代写
- weka代写
- 英文代写
- Minitab代写
- 航空代写
- webots代写
- Advanced Management Accounting代写
- Lunix代写
- 云基础代写
- 有限状态过程代写
- aws代写
- AI代写
- 图灵机代写
- Sociology代写
- 分析代写
- 经济开发代写
- Data代写
- jupyter代写
- 通信考试代写
- 网络安全代写
- 固体力学代写
- spss代写
- 无编程代写
- react代写
- Ocaml代写
- 期货期权代写
- Scheme代写
- 数学统计代写
- 信息安全代写
- Bloomberg代写
- 残疾与创新设计代写
- 历史代写
- 理论题代写
- cpu代写
- 计量代写
- Xpress-IVE代写
- 微积分代写
- 材料学代写
- 代写
- 会计信息系统代写
- 凸优化代写
- 投资代写
- F#代写
- C#代写
- arm代写
- 伪代码代写
- 白话代写
- IC集成电路代写
- reasoning代写
- agents代写
- 精算代写
- opencl代写
- Perl代写
- 图像处理代写
- 工程电磁场代写
- 时间序列代写
- 数据结构算法代写
- 网络基础代写
- 画图代写
- Marie代写
- ASP代写
- EViews代写
- Interval Temporal Logic代写
- ccgarch代写
- rmgarch代写
- jmp代写
- 选择填空代写
- mathematics代写
- winbugs代写
- maya代写
- Directx代写
- PPT代写
- 可视化代写
- 工程材料代写
- 环境代写
- abaqus代写
- 投资组合代写
- 选择题代写
- openmp.c代写
- cuda.cu代写
- 传感器基础代写
- 区块链比特币代写
- 土壤固结代写
- 电气代写
- 电子设计代写
- 主观题代写
- 金融微积代写
- ajax代写
- Risk theory代写
- tcp代写
- tableau代写
- mylab代写
- research paper代写
- 手写代写
- 管理代写
- paper代写
- 毕设代写
- 衍生品代写
- 学术论文代写
- 计算画图代写
- SPIM汇编代写
- 演讲稿代写
- 金融实证代写
- 环境化学代写
- 通信代写
- 股权市场代写
- 计算机逻辑代写
- Microsoft Visio代写
- 业务流程管理代写
- Spark代写
- USYD代写
- 数值分析代写
- 有限元代写
- 抽代代写
- 不限定代写
- IOS代写
- scikit-learn代写
- ts angular代写
- sml代写
- 管理决策分析代写
- vba代写
- 墨大代写
- erlang代写
- Azure代写
- 粒子物理代写
- 编译器代写
- socket代写
- 商业分析代写
- 财务报表分析代写
- Machine Learning代写
- 国际贸易代写
- code代写
- 流体力学代写
- 辅导代写
- 设计代写
- marketing代写
- web代写
- 计算机代写
- verilog代写
- 心理学代写
- 线性回归代写
- 高级数据分析代写
- clingo代写
- Mplab代写
- coventorware代写
- creo代写
- nosql代写
- 供应链代写
- uml代写
- 数字业务技术代写
- 数字业务管理代写
- 结构分析代写
- tf-idf代写
- 地理代写
- financial modeling代写
- quantlib代写
- 电力电子元件代写
- atenda 2D代写
- 宏观代写
- 媒体代写
- 政治代写
- 化学代写
- 随机过程代写
- self attension算法代写
- arm assembly代写
- wireshark代写
- openCV代写
- Uncertainty Quantificatio代写
- prolong代写
- IPYthon代写
- Digital system design 代写
- julia代写
- Advanced Geotechnical Engineering代写
- 回答问题代写
- junit代写
- solidty代写
- maple代写
- 光电技术代写
- 网页代写
- 网络分析代写
- ENVI代写
- gimp代写
- sfml代写
- 社会学代写
- simulationX solidwork代写
- unity 3D代写
- ansys代写
- react native代写
- Alloy代写
- Applied Matrix代写
- JMP PRO代写
- 微观代写
- 人类健康代写
- 市场代写
- proposal代写
- 软件代写
- 信息检索代写
- 商法代写
- 信号代写
- pycharm代写
- 金融风险管理代写
- 数据可视化代写
- fashion代写
- 加拿大代写
- 经济学代写
- Behavioural Finance代写
- cytoscape代写
- 推荐代写
- 金融经济代写
- optimization代写
- alteryxy代写
- tabluea代写
- sas viya代写
- ads代写
- 实时系统代写
- 药剂学代写
- os代写
- Mathematica代写
- Xcode代写
- Swift代写
- rattle代写
- 人工智能代写
- 流体代写
- 结构力学代写
- Communications代写
- 动物学代写
- 问答代写
- MiKTEX代写
- 图论代写
- 数据科学代写
- 计算机安全代写
- 日本历史代写
- gis代写
- rs代写
- 语言代写
- 电学代写
- flutter代写
- drat代写
- 澳洲代写
- 医药代写
- ox代写
- 营销代写
- pddl代写
- 工程项目代写
- archi代写
- Propositional Logic代写
- 国际财务管理代写
- 高宏代写
- 模型代写
- 润色代写
- 营养学论文代写
- 热力学代写
- Acct代写
- Data Synthesis代写