http://iet.metastore.ingenta.com
1887

Computability

Computability

For access to this article, please select a purchase option:

Buy chapter PDF
$16.00
(plus tax if applicable)
Buy Knowledge Pack
10 chapters for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Handbook of Mathematical Models for Languages and Computation — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

This theory makes use of Turing machines to demonstrate the mathematical limits of computation. Indeed, any computation beyond the power of Turing machines is also beyond the computer power. The Turing machine represents a relatively simple language -defining model. Consider Turing machines as computers of functions over nonnegative integers and demonstrates the existence of functions whose computation cannot be specified by any procedure.

Chapter Contents:

  • 9.1 Functions computed by Turing machines
  • 9.2 Mathematical theory of computability: an introduction

Inspec keywords: Turing machines; computability

Other keywords: computer power; nonnegative integers; mathematical limits; turing machines; computation; computability

Subjects: Automata theory; Formal logic

Preview this chapter:
Zoom in
Zoomout

Computability, Page 1 of 2

| /docserver/preview/fulltext/books/pc/pbpc026e/PBPC026E_ch9-1.gif /docserver/preview/fulltext/books/pc/pbpc026e/PBPC026E_ch9-2.gif

Related content

content/books/10.1049/pbpc026e_ch9
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address