in Set Theory & Algebra
238 views
0 votes
0 votes
We say that a function is computable if there is a computer program that finds the values of this function. Use question $37$ and $38$ to show that there are functions that are not computable.
in Set Theory & Algebra
by
238 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true