Alan M. Turing 23.juni 1912 – 7.juni 1954 Dette dokumentet inneholder oversikt over bøker og filmer relatert til Alan M.Turings liv og virke. Alle er til utlån i Informatikkbiblioteket og andre avdelinger ved Univers

Source URL: folk.uio.no

CAPTCHA: Using Hard AI Problems For Security Luis von Ahn1 , Manuel Blum1 , Nicholas J. Hopper1 , and John Langford2 1 Computer Science Dept., Carnegie Mellon University, Pittsburgh PA 15213, USA

Source URL: hunch.net

• Computational neuroscience
• Human-based computation
• Complexity classes
• CAPTCHA
• Computer security
• Computer vision
• Internet bot
• Turing test
• Artificial general intelligence
• Luis von Ahn
• Artificial intelligence
• NP

The Birth of Object Orientation: the Simula Languages⋆ Ole-Johan Dahl Dept. of Informatics, University of Oslo, Norway Abstract. The development of the programming languages Simula I and Simula 67 is briefly described.

Source URL: www.olejohandahl.info

• Software engineering
• Computer programming
• Programming language theory
• Procedural programming languages
• Object-oriented programming languages
• Turing Award laureates
• Simula
• Ole-Johan Dahl
• Programming paradigms
• Object-oriented programming
• ALGOL
• Kristen Nygaard

Logical Depth and Physical Complexity Charles H. Bennett IBM Research, Yorktown Heights NY 10598, USA ppin The Universal Turing Machine– a Half-Century Survey, edited by Rolf Herken, Oxford University Press (

Source URL: web.archive.org

Alan Turing and Meta-Puzzles タ メ

Source URL: www.utp.or.jp

WISKUNDETIJDSCHRIFT VOOR JONGEREN Beroep: codekraker bij de MIVD Turing: grondlegger van de informatica

Source URL: www.pyth.eu

A Model Checking Perspective on White-Box Testing Helmut Veith Technische Universität Wien

Source URL: icst2015.ist.tu-graz.ac.at

• Formal methods
• Logic in computer science
• Software engineering
• Helmut Veith
• Computer science
• Computer programming
• Debugging
• Veith
• Formal verification
• Turing Award
• Assertion
• Model checking

arXiv:1410.5401v2 [cs.NE] 10 DecNeural Turing Machines Alex Graves Greg Wayne Ivo Danihelka

Source URL: arxiv.org

Who Can Name the Bigger Number? Scott Aaronson∗ 1999 In an old joke, two noblemen vie to name the bigger number. The first, after ruminating for hours, triumphantly announces ”Eighty-three!” The second,

Source URL: www.scottaaronson.com

• Theory of computation
• Computability theory
• Busy beaver
• Computable function
• Computability
• Turing machine
• Halting problem
• Hypercomputation
• Computable number
• Algorithm
• Alan Turing
• Ackermann function

Feedback Turing Computability, and Turing Computability as Feedback Nathanael L. Ackerman Cameron E. Freer

Source URL: cfreer.org