📑 Table of Contents

Berikut merupakan daftar ilmuwan komputer berdasarkan nama belakangnya.

Lihat pula

A

sunting

B

sunting

C

sunting

D

sunting

E

sunting

F

sunting

G

sunting

H

sunting

I

sunting

J

sunting

K

sunting

L

sunting

M

sunting

N

sunting

O

sunting

P

sunting

R

sunting

S

sunting

T

sunting

U

sunting

V

sunting

W

sunting

Y

sunting

Z

sunting

Lihat pula

sunting

📚 Artikel Terkait di Wikipedia

Ilmu komputer teoretis

for Computational Molecular Biology. Diakses tanggal 18 August 2012. Dean, Walter (2021). Zalta, Edward N. (ed.). Computational Complexity Theory (Edisi

Sosiologi komputasional

Sosiologi Komputasional (Inggris: Computational sociology) atau disebut juga dengan Sosiologi Komputasi adalah sebuah cabang ilmu sosiologi yang menggunakan

Christos Papadimitriou

Athena, Stanford, dan UCSD. Papadimitriou adalah penulis buku teks Computational Complexity, salah satu buku teks yang paling banyak digunakan dalam teori

Garis besar kombinatorik

Probability and Computing Computational Complexity Designs, Codes and Cryptography Discrete Analysis Discrete and Computational Geometry Discrete Applied

Logaritma

ISBN 978-0-7641-1972-9, chapter 17, hlm. 275 Wegener, Ingo (2005), Complexity theory: exploring the limits of efficient algorithms, Berlin, New York: Springer-Verlag

Autopoiesis

of information and complexity. In other words, we can describe autopoietic systems as those producing more of their own complexity than the one produced

Sistem adaptif kompleks

Complex adaptive systems: an introduction to computational models of social life. Princeton studies in complexity. Princeton, N.J: Princeton University Press

Determinan

Peñaranda 2016, §1.1 Fang, Xin Gui; Havas, George (1997). "On the worst-case complexity of integer Gaussian elimination" (PDF). Proceedings of the 1997 international