[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/sci/ - Science & Math

Search:


View post   

>> No.10894531 [View]
File: 15 KB, 198x198, AFCE9E50-AB6C-4552-84B4-5A7A6803B36B.gif [View same] [iqdb] [saucenao] [google]
10894531

>>10893539
Nah. I double majored in math and CS at a school that was top 20 for both, and now I’m in grad for TCS. It’s literally just a math department with some extra funding since there are collabs with every discipline under the sun. CS is a good place if you like pure math

>> No.10876065 [View]
File: 15 KB, 198x198, 6F4F33D1-ECAF-40B6-9EA7-AAD910E9C848.gif [View same] [iqdb] [saucenao] [google]
10876065

>>10874921
But getting into industry is a much lower bar for entry..
That and entry level industry work isn’t exactly the hardest position in the world. Especially in engineering industry, where you trade math and science for “good business relations with the clientele.” Engineering is just the new business tech degree with math slapped on that companies don’t even really want to use outside of R&D...which is full of PhD’s doing the actual engineering and undergrads + masters doing the implementation work.
t. did industry for 2 years and then went to grad and found it way more interesting

>> No.10852478 [View]
File: 15 KB, 198x198, DB4776BF-03B0-43C2-8008-991AA6ABF86D.gif [View same] [iqdb] [saucenao] [google]
10852478

>>10849725
>Church did most of the math
No he didn’t. While TM’s and lambda calculus are both equivalent in computing power, they express computation in two distinct ways that reveal important results. Lambda calculus was important in the field of compilers to understand computation as a set of rules on symbols (think the y combinator and its role in specifying recursion and fixed point phenomena). Turing machines modeled instructions as data, gave a intuitive way to represent mechanical computation and physical realizability of the computer. Both of them showed with these models that the halting problem is undecidable via diagonal arguments. They were both prolific logicians
Von Neumann was a brilliant scientist, but he had his name attached to a lot of things he really didn’t contribute much to. The “von Neumann architecture” was literally just an electrical specification of turing’s model, except incredibly inefficient since there was only one bus that that could only read or only write in a specific step. The model we use is actually the Harvard architecture, which had dedicated read busses and write busses.
Also, neither Church nor Turing were the biggest hard hitters in TCS despite being named fathers of modern CS. Cook, Lovasz, Kolmogorov, Sipser, Rabin, Karp, Dijkstra, Komlosh, Zemereti, etc. are all people who pushed the field way forward to the point where theory is way more sophisticated than the simple models that church and Turing devised. A good number of those TCS researchers and current ones are lgbt, funnily enough, but they’re better at mathematics than you and I would ever be, and as far as I can tell, they didn’t get there on “diversity points.”

Navigation
View posts[+24][+48][+96]