Transcomputational problem

id: transcomputational-problem-293-12165352
title: Transcomputational problem
text: In computational complexity theory, a transcomputational problem is a problem that requires processing of more than 1093 bits of information. Any number greater than 1093 is called a transcomputational number. The number 1093, called Bremermann's limit, is, according to Hans-Joachim Bremermann, the total number of bits processed by a hypothetical computer the size of the Earth within a time period equal to the estimated age of the Earth. The term transcomputational was coined by Bremermann.
brand slug: wiki
category slug: encyclopedia
description: Class of computational problems
original url: https://en.wikipedia.org/wiki/Transcomputational_problem
date created:
date modified: 2023-08-11T19:49:50Z
main entity: {"identifier":"Q4461978","url":"https://www.wikidata.org/entity/Q4461978"}
image:
fields total: 13
integrity: 14

Related Entries

Explore Next Part