The limits of computation

Ji, Z; Xia, M

The limits of computation

Ji, Z

Xia, M

Permalink

Publisher:: Science China Press., Co. Ltd.
Publication Type:: Journal Article
Citation:: Kexue Tongbao/Chinese Science Bulletin, 2016, 61, (4-5), pp. 404-408
Issue Date:: 2016-02-01

Closed Access

	Filename	Description	Size
	10.1360-N972015-01363.pdf	Published version	608.54 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Ji, Z https://orcid.org/0000-0002-7659-3178
dc.contributor.author	Xia, M
dc.date.accessioned	2022-02-26T07:08:03Z
dc.date.available	2022-02-26T07:08:03Z
dc.date.issued	2016-02-01
dc.identifier.citation	Kexue Tongbao/Chinese Science Bulletin, 2016, 61, (4-5), pp. 404-408
dc.identifier.issn	0023-074X
dc.identifier.issn	2095-9419
dc.identifier.uri	http://hdl.handle.net/10453/154879
dc.description.abstract	The powerful idea of computation has accompanied the development of human civilization, has deeply changed the way we live and work, and has accelerated the advancement of many areas of sciences. In this article, we explore the power and limits of computation from several different perspectives. We will discuss topics from the models of computation and Church-Turing thesis, to the impact of the P versus NP problem and quantum computing on our understanding of the limits of computation. More concretely, we will explore the computability and the halting problem, the efficiency problem of computation, the P versus NP problem. We then move on to the discussion of quantum computation, quantum algorithm for factoring and its implications, quantum simulation and the relation between quantum and classical computations.
dc.language	en
dc.publisher	Science China Press., Co. Ltd.
dc.relation.ispartof	Kexue Tongbao/Chinese Science Bulletin
dc.relation.isbasedon	10.1360/N972015-01363
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject.classification	Geochemistry & Geophysics
dc.title	The limits of computation
dc.type	Journal Article
utslib.citation.volume	61
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - QSI - Centre for Quantum Software and Information
utslib.copyright.status	closed_access	*
dc.date.updated	2022-02-26T07:08:01Z
pubs.issue	4-5
pubs.publication-status	Published
pubs.volume	61
utslib.citation.issue	4-5

Abstract:

The powerful idea of computation has accompanied the development of human civilization, has deeply changed the way we live and work, and has accelerated the advancement of many areas of sciences. In this article, we explore the power and limits of computation from several different perspectives. We will discuss topics from the models of computation and Church-Turing thesis, to the impact of the P versus NP problem and quantum computing on our understanding of the limits of computation. More concretely, we will explore the computability and the halting problem, the efficiency problem of computation, the P versus NP problem. We then move on to the discussion of quantum computation, quantum algorithm for factoring and its implications, quantum simulation and the relation between quantum and classical computations.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/154879