由买买提看人间百态

boards

本页内容为未名空间相应帖子的节选和存档,一周内的贴子最多显示50字,超过一周显示500字 访问原贴
CS版 - What is this course for?
相关主题
Tools for inference of regular grammars and finite state automata一点感想Re: 罗马尼亚版神雕侠侣 Re: 美国的小朋友真牛啊
P != NP 被证出来了,同学们推荐几本理论的书吧
关于CS的一个问题How to organize the algorithm
工科算法编程较多,想系统学点计算机课程。选computer theory有用吗?请问一个图的分解问题
半路转得计算机硕士找lab volunteer求教~!under的automata & formal language 自学难吗?
给力: a claimed proof for P==NP用LTL能表达(a b)*吗?
arXiv又放出神作:NP=P (by 国防科大)计算的美丽--图灵奖的第一个40年
急问:关于journal paper proof 之后修改的问题有人了解UC Merced,这个地方如何?
相关话题的讨论汇总
话题: what话题: course话题: theory话题: languages话题: polynomial
进入CS版参与讨论
1 (共1页)
z****r
发帖数: 276
1
Hi,all,
I am a newcomer to CS. Now I don't know what this course of Theory of
Computation is for. I mean if you want to focus in embedded system, is it
necessary to choose it?
The details of it;
Phrase structure grammars and languages. Turing machines. Relation of
languages to automata. Solvable and unsolvable problems. Theoretical
limitations of computers. Algorithmic complexity theory. Polynomial
reducibility. The classes P and NP. Correctness proofs.
Thanks for your help
s***e
发帖数: 1490
2
no

【在 z****r 的大作中提到】
: Hi,all,
: I am a newcomer to CS. Now I don't know what this course of Theory of
: Computation is for. I mean if you want to focus in embedded system, is it
: necessary to choose it?
: The details of it;
: Phrase structure grammars and languages. Turing machines. Relation of
: languages to automata. Solvable and unsolvable problems. Theoretical
: limitations of computers. Algorithmic complexity theory. Polynomial
: reducibility. The classes P and NP. Correctness proofs.
: Thanks for your help

r*******e
发帖数: 4
3

yes

【在 z****r 的大作中提到】
: Hi,all,
: I am a newcomer to CS. Now I don't know what this course of Theory of
: Computation is for. I mean if you want to focus in embedded system, is it
: necessary to choose it?
: The details of it;
: Phrase structure grammars and languages. Turing machines. Relation of
: languages to automata. Solvable and unsolvable problems. Theoretical
: limitations of computers. Algorithmic complexity theory. Polynomial
: reducibility. The classes P and NP. Correctness proofs.
: Thanks for your help

y***n
发帖数: 1594
4
我觉得还是有用的, 这是一个非常基础的东西, 我是自习, 为了考Sub, 虽然现在还是不
时很懂.

【在 r*******e 的大作中提到】
:
: yes

l******r
发帖数: 1642
5
If you only want a master degree, grab a job, forget about it.
If U want to be a Ph.D., an expert, go take it.
Remember movie Matrix? That's what it is....



【在 y***n 的大作中提到】
: 我觉得还是有用的, 这是一个非常基础的东西, 我是自习, 为了考Sub, 虽然现在还是不
: 时很懂.

1 (共1页)
进入CS版参与讨论
相关主题
有人了解UC Merced,这个地方如何?半路转得计算机硕士找lab volunteer求教~!
Algorithm 课程及教材选择疑问 (转载)给力: a claimed proof for P==NP
半路出家CS应该上如下一些初级课程么?arXiv又放出神作:NP=P (by 国防科大)
MS选校求助:Upeen MCIT vs UTD CS急问:关于journal paper proof 之后修改的问题
Tools for inference of regular grammars and finite state automata一点感想Re: 罗马尼亚版神雕侠侣 Re: 美国的小朋友真牛啊
P != NP 被证出来了,同学们推荐几本理论的书吧
关于CS的一个问题How to organize the algorithm
工科算法编程较多,想系统学点计算机课程。选computer theory有用吗?请问一个图的分解问题
相关话题的讨论汇总
话题: what话题: course话题: theory话题: languages话题: polynomial