# computers

Published articles for computers.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## Introducing DevReading.com

DevFeed: [Introducing DevReading.com](<https://devfeed.tech/articles/introducing-devreading-com-40703.md>)

Original publisher: [Read original article](<https://radek.io/posts/introducing-devreading-com/>)

Published: 2024-04-24T00:00:00Z

Content type: article

Language: en

Sources: [Radek Pazdera](<https://devfeed.tech/sources/radek-pazdera.md>)

Topics: [Computing](<https://devfeed.tech/topics/computing.md>), [Development](<https://devfeed.tech/topics/development.md>), [Programming](<https://devfeed.tech/topics/programming.md>)

Tags: [book](<https://devfeed.tech/tags/book.md>), [books](<https://devfeed.tech/tags/books.md>), [computers](<https://devfeed.tech/tags/computers.md>), [dev](<https://devfeed.tech/tags/dev.md>), [programming](<https://devfeed.tech/tags/programming.md>), [technical](<https://devfeed.tech/tags/technical.md>)

### AI overview

The article introduces DevReading.com, a site for browsing computer books and other technical titles by interests, topics, technology stacks, and languages. It argues that broad bookstore categories, weak title keywords, and low-effort AI-generated books make relevant technical reading harder to find.

### Source excerpt

Discover Your Next Technical Read

## Big Tablets Are Coming

DevFeed: [Big Tablets Are Coming](<https://devfeed.tech/articles/big-tablets-are-coming-37886.md>)

Original publisher: [Read original article](<https://www.evanmiller.org/big-tablets-are-coming.html>)

Author: Evan Miller

Published: 2016-12-05T06:10:00Z

Content type: opinion

Language: en

Sources: [Evan Miller](<https://devfeed.tech/sources/evan-miller.md>)

Topics: [Microsoft](<https://devfeed.tech/topics/microsoft.md>)

Tags: [apple](<https://devfeed.tech/tags/apple.md>), [computers](<https://devfeed.tech/tags/computers.md>), [desktop](<https://devfeed.tech/tags/desktop.md>), [microsoft](<https://devfeed.tech/tags/microsoft.md>), [tablet](<https://devfeed.tech/tags/tablet.md>), [work](<https://devfeed.tech/tags/work.md>)

### AI overview

An opinion piece reflecting on the Microsoft Surface Studio and Apple's anticipated giant iPad. It argues that large, desk-oriented computers may appeal to people who want to work productively in increasingly distracting open offices.

### Source excerpt

Reflections on the Microsoft Surface Studio and Apple's inevitable giant iPad: Big Tablets Are Coming

## The Halting Problem

DevFeed: [The Halting Problem](<https://devfeed.tech/articles/the-halting-problem-40751.md>)

Original publisher: [Read original article](<https://radek.io/posts/the-halting-problem/>)

Published: 2014-07-27T00:00:00Z

Content type: article

Language: en

Sources: [Radek Pazdera](<https://devfeed.tech/sources/radek-pazdera.md>)

Topics: [Computer science](<https://devfeed.tech/topics/computer-science.md>), [Algorithm](<https://devfeed.tech/topics/algorithm.md>), [Math and Logic](<https://devfeed.tech/topics/math-and-logic.md>)

Tags: [algorithm](<https://devfeed.tech/tags/algorithm.md>), [computer-science](<https://devfeed.tech/tags/computer-science.md>), [computers](<https://devfeed.tech/tags/computers.md>), [halting-problem](<https://devfeed.tech/tags/halting-problem.md>), [infinite](<https://devfeed.tech/tags/infinite.md>), [input](<https://devfeed.tech/tags/input.md>), [logic](<https://devfeed.tech/tags/logic.md>), [loops](<https://devfeed.tech/tags/loops.md>), [program](<https://devfeed.tech/tags/program.md>), [reduction](<https://devfeed.tech/tags/reduction.md>)

### AI overview

The article explains Alan Turing's halting problem: no general method can always determine whether an arbitrary program will halt or run forever. It describes the problem's connection to undecidability, diagonalization, and reductions, and briefly discusses Turing's work with Alonzo Church.

### Source excerpt

And other things computers cannot solve

## Letter to a young programmer

DevFeed: [Letter to a young programmer](<https://devfeed.tech/articles/letter-to-a-young-programmer-38894.md>)

Original publisher: [Read original article](<http://neopythonic.blogspot.com/2013/10/letter-to-young-programmer.html>)

Author: Guido van Rossum (noreply@blogger.com)

Published: 2013-10-25T02:19:00Z

Content type: opinion

Language: en

Sources: [Guido van Rossum](<https://devfeed.tech/sources/guido-van-rossum.md>)

Topics: [Python](<https://devfeed.tech/topics/python.md>), [Programming](<https://devfeed.tech/topics/programming.md>), [Programming language](<https://devfeed.tech/topics/programming-language.md>)

Tags: [computers](<https://devfeed.tech/tags/computers.md>), [programming](<https://devfeed.tech/tags/programming.md>), [programming-language](<https://devfeed.tech/tags/programming-language.md>), [python](<https://devfeed.tech/tags/python.md>)

### AI overview

Guido van Rossum encourages a young person interested in Python to pursue programming, dream ambitiously, and use computers and robots to create things.

### Source excerpt

Dear (insert name here), I heard you enjoy a certain programming language named Python. Programming is a wonderful activity. I am a little jealous that you have access to computers at your age; when I grew up I didn't even know what a computer was! I was an electronics hobbyist though, and my big dream was to build my own electronic calculator from discrete components. I never did do that, but I did build several digital clocks, and it was amazing to build something that complex and see it work. I hope you dream big too -- programmers can make computers (and robots!) do amazing things, and this is a great time to become a programmer. Just imagine how much faster computers will be in five or ten years, and what you will be able to do with your skills then! --Guido van Rossum (inventor of Python)

## Peter Norvig: The 100,000-student classroom

DevFeed: [Peter Norvig: The 100,000-student classroom](<https://devfeed.tech/articles/peter-norvig-the-100-000-student-classroom-40594.md>)

Original publisher: [Read original article](<http://www.ted.com/talks/peter_norvig_the_100_000_student_classroom.html>)

Author: Peter Norvig

Published: 2012-06-24T00:00:00Z

Content type: article

Language: en

Sources: [Peter Norvig](<https://devfeed.tech/sources/peter-norvig.md>)

Topics: [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [intelligence](<https://devfeed.tech/topics/intelligence.md>)

Tags: [computers](<https://devfeed.tech/tags/computers.md>), [conference](<https://devfeed.tech/tags/conference.md>), [education](<https://devfeed.tech/tags/education.md>), [global-issues](<https://devfeed.tech/tags/global-issues.md>), [interactive](<https://devfeed.tech/tags/interactive.md>), [internet](<https://devfeed.tech/tags/internet.md>), [talk](<https://devfeed.tech/tags/talk.md>), [talks](<https://devfeed.tech/tags/talks.md>), [ted](<https://devfeed.tech/tags/ted.md>), [video](<https://devfeed.tech/tags/video.md>)

### AI overview

Peter Norvig discusses teaching an artificial intelligence class to 175 students in person and more than 100,000 students through an interactive webcast, explaining what he learned about teaching a global classroom.

### Source excerpt

My talk at the TED conference. Six minute video.

## Turing Machines--A Primer

DevFeed: [Turing Machines--A Primer](<https://devfeed.tech/articles/turing-machines-a-primer-40218.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2011/07/04/turing-machines-a-primer/>)

Published: 2011-07-04T16:35:44Z

Content type: tutorial

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Automaton](<https://devfeed.tech/topics/automaton.md>), [function](<https://devfeed.tech/topics/function.md>)

Tags: [acceptance](<https://devfeed.tech/tags/acceptance.md>), [computability-theory](<https://devfeed.tech/tags/computability-theory.md>), [computers](<https://devfeed.tech/tags/computers.md>), [concepts](<https://devfeed.tech/tags/concepts.md>), [decidability](<https://devfeed.tech/tags/decidability.md>), [halting-problem](<https://devfeed.tech/tags/halting-problem.md>), [input](<https://devfeed.tech/tags/input.md>), [machine](<https://devfeed.tech/tags/machine.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [primer](<https://devfeed.tech/tags/primer.md>), [process](<https://devfeed.tech/tags/process.md>), [pushdown-automata](<https://devfeed.tech/tags/pushdown-automata.md>), [state](<https://devfeed.tech/tags/state.md>), [symbols](<https://devfeed.tech/tags/symbols.md>), [turing-machines](<https://devfeed.tech/tags/turing-machines.md>)

### AI overview

This tutorial introduces Turing machines as a model of computation. It defines their states, tape symbols, input symbols, initial state, accepting and rejecting states, and transition function, then explains how the tape, read-write head, state transitions, and halting behavior work.

### Source excerpt

We assume the reader is familiar with the concepts of determinism and finite automata, or has read the corresponding primer on this blog. The Mother of All Computers Last time we saw some models for computation, and saw in turn how limited they were. Now, we open Pandrora's hard drive: Definition: A Turing machine is a tuple $ (S, \Gamma, \Sigma, s_0, F, \tau)$, where $ S$ is a set of states, $ \Gamma$ is a set of tape symbols, including a special blank symbol $ b$, $ \Sigma \subset \Gamma$ is a set of input symbols, not including $ b$, $ s_0$ is the initial state, $ A \subset S$ is a set of accepting states, $ R \subset S$ is a set of rejecting states, $ \tau: S - (A \cup R) \times \Gamma \to S \times \Gamma \times \left \{ L, R \right \}$ is a partial function called the transition function, where $ L, R$ correspond to "left shift" and "right shift," respectively.