Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Light
Dark
System
A New Measure of the Difficulty of Problems
Cristian S. Calude
,
Elena Calude
,
Michael J. Dinneen
Type:
Article
Publication Date:
2006-02-01
Citations:
26
View Publication
Share
Locations
Soft Computing -
View
Similar Works
Action
Title
Year
Authors
+
The Collatz Conjecture: A Case Study in Mathematical Problem Solving
2022
Maher Ali RUsho
+
The 3x+1 Problem: An Overview
2021
Jeffrey C. Lagarias
+
The 3x+1 Problem: An Overview
2021
Jeffrey C. Lagarias
+
P vs. NP and Riemann Hypothesis Solution (Revised)
2013
Andrew Nassif
+
Challenging Math Problems
2015
Terry Stickels
+
An Equivalent Problem to the Collatz Conjecture
2016
Islem Ghaffor
+
The Problem With Maths
2007
Zuraimi Binti Zainuddin
+
A Cornucopia of Famous Problems
2013
Béla Bajnok
+
Open Problems and Conjectures
1993
V. L. Kocic
G. Ladas
+
Unfolding the Labyrinth: Open Problems Mathematics and Other Areas of Science
2006
Florentín Smarandache
Victor Christianto
Fu Yuhua
Radi I. Khrapko
John A. Hutchison
+
Problems with mathematics
2022
Margot Prior
+
PDF
Chat
The Complexity of Goldbach's Conjecture
2020
Frank Vega
+
PDF
Chat
The Complexity of Goldbach's Conjecture
2020
Frank Vega
+
PDF
Chat
The Complexity of Goldbach's Conjecture
2020
Frank Vega
+
PDF
Chat
The Complexity of Goldbach's Conjecture
2020
Frank Vega
+
PDF
Chat
The Complexity of Goldbach's Conjecture
2020
Frank Vega
+
PDF
Chat
The Complexity of Goldbach's Conjecture
2020
Frank Vega
+
Conjectures and open questions
2004
Yann Bugeaud
+
Open problems
2016
Vladimir V. Tkachuk
+
Open problems
2004
David Ruelle
Works That Cite This (16)
Action
Title
Year
Authors
+
The Riemann Hypothesis
2013
Cristian Dumitrescu
+
The complexity of Euler’s integer partition theorem
2012
Cristian S. Calude
Elena Calude
Melissa S. Queen
+
PDF
Chat
Information: The Algorithmic Paradigm
2009
Cristian S. Calude
+
PDF
Chat
Generic algorithms for halting problem and optimal machines revisited
2016
Laurent Bienvenu
Damien Desfontaines
Alexander Shen
+
Computing with Randomness
2018
Armin Alaghi
John P. Hayes
+
Generic algorithms for halting problem and optimal machines revisited
2017
Laurent Bienvenu
Damien Desfontaines
Alexander Shen
+
Evaluating the Complexity of Mathematical Problems: Part 1
2009
Cristian S. Calude
Elena Calude
+
Evaluating the Complexity of Mathematical Problems: Part 2
2009
Cristian S. Calude
Elena Calude
+
Inductive Complexity of Goodstein’s Theorem
2012
Joachim Hertel
+
How Much Information Can There Be in a Real Number?
2012
Gregory J. Chaitin
Works Cited by This (8)
Action
Title
Year
Authors
+
Mathematical Developments Arising from Hilbert Problems
1976
Felix E. Browder
+
The 3<i>x</i>+ 1 Problem and its Generalizations
1985
Jeffrey C. Lagarias
+
Hilbert's Tenth Problem.
1995
Martin Davis
Yuri Matiyasevich
+
Ueber raumgleiche Polyeder
1900
M. Dehn
+
The mathematical century: the 30 greatest problems of the last 100 years
2004
+
The Riemann Hypothesis
2003
Karl Sabbagh
+
PDF
Chat
Thoughts on the riemann hypothesis
2004
Gregory J. Chaitin
+
Computing a Glimpse of Randomness
2002
Cristian S. Calude
Michael J. Dinneen
Chi-Kou Shu