RSS

Com­puter Science

TagLast edit: 4 Aug 2020 21:48 UTC by Collisteru

The study of computers and algorithms from both practical and theoretical standpoints. Often considered to be a subset of mathematics, particularly its more theoretical considerations. A thorough understanding of computer science is necessary to understand AI, and indeed, the modern world.

An­a­lyz­ing the Prob­lem GPT-3 is Try­ing to Solve

adamShimi6 Aug 2020 21:58 UTC
16 points
2 comments4 min readLW link

Think like an ed­u­ca­tor about code quality

adamzerner27 Mar 2021 5:43 UTC
44 points
8 comments8 min readLW link

[Question] What is the ev­i­dence on the Church-Tur­ing Th­e­sis?

Morpheus19 Sep 2021 11:34 UTC
15 points
18 comments1 min readLW link

Ver­ifi­ca­tion and Transparency

DanielFilan8 Aug 2019 1:50 UTC
34 points
6 comments2 min readLW link
(danielfilan.com)

A proof of Löb’s the­o­rem in Haskell

cousin_it19 Sep 2014 13:01 UTC
52 points
8 comments3 min readLW link

Al­gorith­mic Progress in Six Domains

lukeprog3 Aug 2013 2:29 UTC
38 points
32 comments1 min readLW link

[LINK] Judea Pearl wins 2011 Tur­ing Award

[deleted]15 Mar 2012 16:32 UTC
32 points
2 comments1 min readLW link

We Need Browsers as Platforms

jefftk9 Feb 2021 15:40 UTC
15 points
8 comments1 min readLW link
(www.jefftk.com)

Bet­ter Pass­word Peppering

Yoav Ravid24 Aug 2021 10:19 UTC
5 points
9 comments3 min readLW link

Gödel’s Le­gacy: A game with­out end

Hazard28 Jun 2020 18:50 UTC
39 points
10 comments12 min readLW link

The jour­ney of mod­els of Su­per-Tur­ing com­pu­ta­tion, Part I

Donta Lee9 Mar 2022 16:24 UTC
3 points
0 comments2 min readLW link

Al­gorith­mic Mea­sure of Emer­gence v2.0

interstice10 Mar 2022 20:26 UTC
14 points
2 comments4 min readLW link

The jour­ney of mod­els of Su­per-Tur­ing com­pu­ta­tion, Part III.

Donta Lee22 Apr 2022 14:18 UTC
1 point
2 comments11 min readLW link

And My Ax­iom! In­sights from ‘Com­putabil­ity and Logic’

TurnTrout16 Jan 2019 19:48 UTC
42 points
17 comments8 min readLW link

Worse Than Random

Eliezer Yudkowsky11 Nov 2008 19:01 UTC
41 points
102 comments12 min readLW link

The Golden Age of Data

Collisteru4 Aug 2020 21:35 UTC
5 points
0 comments4 min readLW link

Fun With DAGs

johnswentworth13 May 2018 19:35 UTC
14 points
21 comments6 min readLW link

Al­gorithms as Case Stud­ies in Rationality

abramdemski14 Feb 2011 18:27 UTC
38 points
40 comments6 min readLW link

AI co­op­er­a­tion is already stud­ied in academia as “pro­gram equil­ibrium”

cousin_it30 Jul 2012 15:22 UTC
60 points
44 comments1 min readLW link

Run­ning the Stack

lionhearted26 Sep 2019 16:03 UTC
35 points
8 comments2 min readLW link

Von Neu­mann’s cri­tique of au­tomata the­ory and logic in com­puter science

Ben Pace26 May 2019 4:14 UTC
29 points
4 comments3 min readLW link

How to es­cape from your sand­box and from your hard­ware host

PhilGoetz31 Jul 2015 17:26 UTC
43 points
28 comments1 min readLW link

The Na­ture of Logic

Eliezer Yudkowsky15 Nov 2008 6:20 UTC
34 points
12 comments10 min readLW link

What I got out of ‘Al­gorithms to Live By’

rk11 Apr 2018 16:35 UTC
25 points
1 comment19 min readLW link

Why Gra­di­ents Van­ish and Explode

Matthew Barnett9 Aug 2019 2:54 UTC
25 points
9 comments3 min readLW link

[Question] Use-cases for com­pu­ta­tions, other than run­ning them?

johnswentworth19 Jan 2020 20:52 UTC
29 points
6 comments2 min readLW link

Fast Minds and Slow Computers

jacob_cannell5 Feb 2011 10:05 UTC
34 points
91 comments5 min readLW link

Al­gorith­mic Similarity

LukasM23 Aug 2019 16:39 UTC
27 points
10 comments11 min readLW link

Quan­tum com­put­ing for the de­ter­mined (Link)

XiXiDu13 Jun 2011 17:42 UTC
23 points
5 comments1 min readLW link

On See­ing Through ‘On See­ing Through: A Unified The­ory’: A Unified Theory

gwern15 Jun 2019 18:57 UTC
26 points
0 comments1 min readLW link
(www.gwern.net)

A Can­di­date Com­plex­ity Measure

interstice31 Dec 2017 20:15 UTC
16 points
8 comments3 min readLW link

[Question] The uni­ver­sal­ity of com­pu­ta­tion and mind de­sign space

alanf12 Sep 2020 14:58 UTC
1 point
7 comments1 min readLW link

On the Fence? Ma­jor in CS

talisman7 May 2009 4:26 UTC
21 points
59 comments2 min readLW link

Per­cep­trons Explained

lifelonglearner14 Feb 2020 17:34 UTC
13 points
2 comments1 min readLW link
(owenshen24.github.io)

Words Aren’t Type Safe

Hazard19 Jun 2019 20:34 UTC
21 points
12 comments3 min readLW link

The Weighted Ma­jor­ity Algorithm

Eliezer Yudkowsky12 Nov 2008 23:19 UTC
22 points
96 comments10 min readLW link

[Link] Scott Aaron­son on Why Philoso­phers Should Care About Com­pu­ta­tional Complexity

DanielVarga15 Aug 2011 22:51 UTC
31 points
2 comments1 min readLW link

Can our uni­verse con­tain a perfect simu­la­tion of it­self?

Hazard20 May 2018 2:08 UTC
6 points
6 comments3 min readLW link

Sel­ling Nonapples

Eliezer Yudkowsky13 Nov 2008 20:10 UTC
50 points
78 comments7 min readLW link

Im­pli­ca­tions of Quan­tum Com­put­ing for Ar­tifi­cial In­tel­li­gence Align­ment Research

22 Aug 2019 10:33 UTC
23 points
3 comments13 min readLW link

Re­think­ing Batch Normalization

Matthew Barnett2 Aug 2019 20:21 UTC
20 points
5 comments8 min readLW link

The halt­ing prob­lem is overstated

Yair Halberstadt16 Aug 2021 5:26 UTC
15 points
13 comments3 min readLW link

No one knows what Peano ar­ith­metic doesn’t know

cousin_it16 Dec 2011 21:36 UTC
28 points
54 comments1 min readLW link

Moore’s Law, AI, and the pace of progress

Veedrac11 Dec 2021 3:02 UTC
118 points
39 comments24 min readLW link

Com­putabil­ity and Complexity

5 Feb 2022 14:53 UTC
21 points
4 comments11 min readLW link
(www.metaculus.com)

Why ra­tio­nal­ists should care (more) about free software

RichardJActon23 Jan 2022 17:31 UTC
66 points
43 comments5 min readLW link

[Question] In­fo­haz­ards, hack­ing, and Brick­ing—how to for­mal­ize these con­cepts?

Yitz10 Mar 2022 16:42 UTC
4 points
11 comments4 min readLW link

Op­ti­miz­ing crop plant­ing with mixed in­te­ger lin­ear pro­gram­ming in Stardew Valley

hapanin5 Apr 2022 18:42 UTC
28 points
1 comment6 min readLW link

[Question] Are “non-com­putable func­tions” always hard to solve in prac­tice?

Morpheus20 Dec 2021 16:32 UTC
3 points
3 comments1 min readLW link

De­con­fus­ing Lan­dauer’s Principle

euanmclean27 May 2022 17:58 UTC
44 points
12 comments15 min readLW link
No comments.