chapter

The Non-computable

Author:

Domenico TaliaAuthors Info & Claims

From Algorithms to Thinking Machines: The New Digital Power

October 2023

https://doi.org/10.1145/3603178.3603190

Published: 20 October 2023 Publication History

Get Access

References

[1]

M. Davis. 1973. Hilbert’s tenth problem is unsolvable. Am. Math. Mon. 80, 3, 233–269.

Crossref

Google Scholar

[2]

C. de Marcken. 2003. Computational Complexity of Air Travel Planning. ITA Software.

Google Scholar

[3]

J. F. DeFranco and J. Voas. January. 2023. Machining a sixth sense: Intuition. Computer 56, 1, 14–15.

Crossref

Google Scholar

[4]

H. L. Dreyfus and S. E. Dreyfus. 2009. Why computers may never think like people. In Readings in the Philosophy of Technology, Vol. 89. Rowman & Littlefield Publishers, 375–390.

Google Scholar

[5]

F. Faggin. 2022. Irriducibile - La coscienza, la vita, i computer e la nostra natura. Mondadori.

Google Scholar

[6]

M. Jolly. 2011. The Concept of Intuition in Artificial Intelligence. University of Lisbon.

Google Scholar

[7]

T. D. Kieu. 2003. Computing the non-computable. Contemp. Phys. 44, 1, 51–71.

Crossref

Google Scholar

[8]

C. Koch. May. 2001. Final Report of the Workshop “Can a Machine be Conscious.” The Swartz Foundation. [Online]. Retrieved February 21, 2023 from http://www.theswartzfoundation.org/abstracts/2001˙summary.asp.

Google Scholar

[9]

A. N. Kolmogorov. 1963. On tables of random numbers. Sankhyā Ser. A. 25, 369–375.

Google Scholar

[10]

R. J. Marks II. 2022. Non-Computable You: What You Do That Artificial Intelligence Never Will. Discovery Institute Press, Seattle.

Google Scholar

[11]

D. Martin. 1958. Computability and Unsolvability. McGraw-Hill, New York.

Google Scholar

[12]

M. Minsky. 1991. Conscious machines. In Machinery of Consciousness, Proceedings of the 75th Anniversary Symposium on Science in Society. National Research Council of Canada.

Google Scholar

[13]

R. Penrose. 2016. The Emperor’s New Mind: Concerning Computers, Minds and the Laws of Physics. Oxford University Press.

Google Scholar

[14]

J. R. Searle. 2000. Consciousness. Ann. Rev. Neurosci. 23, 1, 557–578.

Crossref

Google Scholar

[15]

H. A. Simon. 1995. Explaining the ineffable: AI on the topics of intuition, insight and inspiration. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, Vol. 1. Morgan Kaufmann, 939–948.

Google Scholar

[16]

H. Wang. 1974. From Mathematics to Philosophy. Routledge, London.

Google Scholar

Recommendations

Time-symmetric Turing machines for computable involutions
Highlights
- A time-symmetric Turing machine always computes an involution (also called an involutory function or a self-inverse function).
Abstract
A reversible Turing machine is a forward and backward deterministic Turing machine, which has been an expressive model of reversible computation. It is obvious that every reversible Turing machine computes an injective function under a ...
Representation of left-computable ε-random reals

In this paper we introduce the notion of @e-universal prefix-free Turing machine (@e is a computable real in (0,1]) and study its halting probability. The main result is the extension of the representability theorem for left-computable random reals to ...
Graph representation functions computable by finite automata

We consider a simple model for representing a graph in computer memory in which every vertex is assigned a word in a finite alphabet - vertex code - and the adjacency of two vertices is a function Ψ of their codes. The function Ψ is called the ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

From Algorithms to Thinking Machines: The New Digital Power

October 2023

308 pages

ISBN:9798400708572

DOI:10.1145/3603178

Author:
Domenico Talia
University of Calabria

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 October 2023

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Chapter

Appears in

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
10
Total Downloads

Downloads (Last 12 months)10
Downloads (Last 6 weeks)9

Reflects downloads up to 02 Feb 2025

Other Metrics

View Author Metrics

Citations

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Chapter

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

References

Recommendations

Time-symmetric Turing machines for computable involutions

Representation of left-computable ε-random reals

Graph representation functions computable by finite automata

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Appears in

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations