Computing machinery and intelligence
From MaRDI portal
Cited in
(28)- Thought experiments in the Jefferson-Turing controversy: a Kuhnian perspective
- Galilean resonances: the role of experiment in Turing’s construction of machine intelligence
- Exploring the constraints on artificial general intelligence: a game-theoretic model of human vs machine interaction
- Algorithmic economics: incomputability, undecidability and unsolvability in economics
- Trouble with computation: a refutation of digital ontology
- Mario Bunge and contemporary cognitive science
- Statistical computational learning
- Artificial intelligence in biological modelling
- Artificial intelligence: philosophical and epistemological perspectives
- Disaster incident analysis via algebra stories
- Challenges and opportunities for twenty first century Bayesian econometricians: a personal view
- Model-based abductive cognition: what thought experiments teach us
- Accepted proofs: objective truth, or culturally robust?
- A note on Turing's three pioneering initiatives and on their interplays
- Turing tests with Turing machines
- The chess example in Turing's mind paper is really about ambiguity
- Turing's influence on programming. Book extract from ``The dawn of software engineering: from Turing to Dijkstra [Zbl 1328.68010]
- What kind of machine is the mind?
- The mathematics of adversarial attacks in AI -- why deep learning is unstable despite the existence of stable neural networks
- Deep learning, transformers and graph neural networks: a linear algebra perspective
- Efficient XAI: a low-cost data reduction approach to SHAP interpretability
- The AI definition and a program which satisfies this definition
- Augmenting intelligence: the convergence of ML/LLMs and statistics
- DNN verification, reachability, and the exponential function problem
- Numerical methods, complexity, and epistemic hierarchies
- Nash equilibria and undecidability in generic physical interactions -- a free energy perspective
- Universal approximation results for neural networks with non-polynomial activation function over non-compact domains
- Designing explainable cognitive systems and explaining neural networks with plastic dynamical systems
This page was built for publication: Computing machinery and intelligence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6654554)
