AI & ChatGPT searches , social queriess for BERKELEY ALGORITHM
Search references for BERKELEY ALGORITHM. Phrases containing BERKELEY ALGORITHM
See searches and references containing BERKELEY ALGORITHM!
Search references for BERKELEY ALGORITHM. Phrases containing BERKELEY ALGORITHM
See searches and references containing BERKELEY ALGORITHM!BERKELEY ALGORITHM
Method of clock synchronisation
The Berkeley algorithm is a method of clock synchronisation in distributed computing which assumes no machine has an accurate time source. It was developed
Berkeley_algorithm
Coordination of independent clocks
trivial; the server will dictate the system time. Cristian's algorithm and the Berkeley algorithm are potential solutions to the clock synchronization problem
Clock_synchronization
Method for clock synchronization
synchronisation, which optimises the method by itself. Allan variance Berkeley algorithm Clock synchronization Daytime Protocol, older time synchronization
Cristian's_algorithm
Sequence of operations for a task
In mathematics and computer science, an algorithm (/ˈælɡərɪðəm/ ) is a finite sequence of mathematically rigorous instructions, typically used to solve
Algorithm
An algorithm is a fundamental set of rules or defined procedures that are typically designed and used to be a simpler way to solve a specific problem
List_of_algorithms
Public university in Berkeley, California
The University of California, Berkeley (UC Berkeley, Berkeley, Cal, or California) is a public land-grant research university in the Southside and Northside
University of California, Berkeley
University_of_California,_Berkeley
American computer scientist (born 2000)
University of California, Berkeley. She was named as one of 2019 Science Forbes 30 Under 30 for her work developing classical algorithms which matched the performance
Ewin_Tang
American mathematician
theorist at the University of California, Berkeley. He is most notable for his research in the theory of algorithms, for which he received the 1985 ACM Turing
Richard_M._Karp
American computer scientist and educator
science at the University of California, Berkeley. His research is in the design and analysis of algorithms, with work in combinatorial optimization,
Satish_B._Rao
Quantum algorithm for integer factorization
Shor's algorithm is a quantum algorithm for finding the prime factors of an integer. It was developed in 1994 by the American mathematician Peter Shor
Shor's_algorithm
Algorithm that employs a degree of randomness as part of its logic or procedure
A randomized algorithm is an algorithm that employs a degree of randomness as part of its logic or procedure. The algorithm typically uses uniformly random
Randomized_algorithm
Subset of artificial intelligence
intelligence concerned with the development and study of statistical algorithms that can learn from data and generalize to unseen data, and thus perform
Machine_learning
Vector quantization algorithm minimizing the sum of squared deviations
efficient heuristic algorithms converge quickly to a local optimum. These are usually similar to the expectation–maximization algorithm for mixtures of Gaussian
K-means_clustering
Unix operating system
The Berkeley Software Distribution (BSD), also known as Berkeley Unix, is a discontinued Unix operating system developed and distributed by the Computer
Berkeley Software Distribution
Berkeley_Software_Distribution
American mathematician (1940–2019)
Berkeley. Berlekamp was widely known for his work in computer science, coding theory and combinatorial game theory. Berlekamp invented an algorithm to
Elwyn_Berlekamp
Algorithm in graph theory
Floyd–Warshall algorithm (also known as Floyd's algorithm, the Roy–Warshall algorithm, the Roy–Floyd algorithm, or the WFI algorithm) is an algorithm for finding
Floyd–Warshall_algorithm
Indian–American academic (born 1959)
co-author of a textbook on algorithms. Vazirani received a BS from MIT in 1981 and received his Ph.D. in 1986 from UC Berkeley under the supervision of
Umesh_Vazirani
Algorithm for solving a puzzle or game in the fewest possible moves
God's algorithm of the Rubik cube is a notion originating in discussions of ways to solve the Rubik's Cube puzzle, but which can also be applied to other
God's_algorithm
Type of algorithm, produces approximately correct solutions
central to many informed search algorithms and optimization techniques for AI: A* Search Algorithm The A* search algorithm is one of the most popular heuristic
Heuristic_(computer_science)
Competitive algorithm for searching a problem space
genetic algorithm (GA) is a metaheuristic inspired by the process of natural selection that belongs to the larger class of evolutionary algorithms (EA) in
Genetic_algorithm
Laboratory Berkeley, California, and Oakland, California, US
Lawrence Berkeley National Laboratory (LBNL, Berkeley Lab) is a federally funded research and development center in the hills of Berkeley, California,
Lawrence Berkeley National Laboratory
Lawrence_Berkeley_National_Laboratory
Indian mathematician (born 1956)
Karmarkar's algorithm. He is listed as an ISI highly cited researcher. He invented one of the first provably polynomial time algorithms for linear programming
Narendra_Karmarkar
Method for evaluating indefinite integrals
In symbolic computation, the Risch algorithm is a method of indefinite integration used in some computer algebra systems to find antiderivatives. It is
Risch_algorithm
Lossless compression algorithm
(stylized as DEFLATE, and also called Flate) is a lossless data compression algorithm that uses a combination of LZ77 and Huffman coding. It was designed by
Deflate
Algorithm for finding sub-text location(s) inside a given sentence in Big O(n) time
In computer science, the Knuth–Morris–Pratt algorithm (or KMP algorithm) is a string-searching algorithm that searches for occurrences of a "word" W within
Knuth–Morris–Pratt_algorithm
Technological phenomenon with social implications
Algorithmic bias describes systematic and repeatable harmful tendency in a computerized sociotechnical system to create "unfair" outcomes, such as "privileging"
Algorithmic_bias
Algorithm for finding max graph matchings
In graph theory, the blossom algorithm is an algorithm for constructing maximum matchings on graphs. The algorithm was developed by Jack Edmonds in 1961
Blossom_algorithm
Process of converting plaintext to ciphertext
encryption scheme usually uses a pseudo-random encryption key generated by an algorithm. It is possible to decrypt the message without possessing the key but
Encryption
American mathematician (1928–2023)
Post–Turing model and co-developed the Davis–Putnam–Logemann–Loveland (DPLL) algorithm, which is foundational for Boolean satisfiability solvers. Davis won the
Martin_Davis_(mathematician)
Lebanese-American physician and researcher
assessment lab for cardiovascular algorithms. Obermeyer is a founding faculty member of the University of California, Berkeley–University of California, San
Ziad_Obermeyer
American mathematician
bin-packing algorithms. After being awarded his PhD by MIT, he spent one year as a postdoctoral researcher at the University of California, Berkeley, and then
Peter_Shor
American quantum computing company
which is based in Berkeley, California, also develops a cloud platform called Forest that enables programmers to execute quantum algorithms. Rigetti Computing
Rigetti_Computing
American computer scientist (born 1984)
Institute in Berkeley, California, then Princeton University and the Institute for Advanced Study. He specialises in sketching and streaming algorithms. Nelson
Jelani_Nelson
Indian-American computer scientist
approximation algorithms, hardness of approximation and statistics. He is a professor of computer science at the University of California at Berkeley. After
Prasad_Raghavendra
Dutch mathematician (born 1949)
Lenstra–Lenstra–Lovász lattice basis reduction algorithm (in 1982); Developing a polynomial-time algorithm for solving a feasibility integer programming
Hendrik_Lenstra
Professor of computer science
queries using the L* algorithm. This algorithm addresses the problem of identifying an unknown set. In essence, this algorithm is a way for programs
Dana_Angluin
Grouping a set of objects by similarity
analysis refers to a family of algorithms and tasks rather than one specific algorithm. It can be achieved by various algorithms that differ significantly
Cluster_analysis
Algorithm for computing trigonometric, hyperbolic, logarithmic and exponential functions
short for coordinate rotation digital computer, is a simple and efficient algorithm to calculate trigonometric functions, hyperbolic functions, square roots
CORDIC
Practice and study of secure communication techniques
of algorithms that carry out the encryption and the reversing decryption. The detailed operation of a cipher is controlled both by the algorithm and
Cryptography
Algorithm in mathematics
computing and bioinformatics, the Baum–Welch algorithm is a special case of the expectation–maximization algorithm used to find the unknown parameters of a
Baum–Welch_algorithm
Machine learning algorithm
The junction tree algorithm (also known as 'Clique Tree') is a method used in machine learning to extract marginalization in general graphs. In essence
Junction_tree_algorithm
Root-finding algorithm
to as Fast InvSqrt() or by the hexadecimal constant 0x5F3759DF, is an algorithm that estimates 1 / x {\textstyle 1/{\sqrt {x}}} , the reciprocal (or multiplicative
Fast_inverse_square_root
American computer scientist and mathematician
is the discoverer of several graph theory algorithms, including his strongly connected components algorithm, and co-inventor of both splay trees and Fibonacci
Robert_Tarjan
Biased assessment of an algorithm
Algorithm aversion is defined as a "biased assessment of an algorithm which manifests in negative behaviors, and attitudes towards the algorithm compared
Algorithm_aversion
Algorithm that can return a valid solution to a problem even if interrupted
an anytime algorithm is an algorithm that can return a valid solution to a problem even if it is interrupted before it ends. The algorithm is expected
Anytime_algorithm
Indian American professor of computer science (born 1957)
centered around the design of algorithms, together with work on computational complexity theory, cryptography, and algorithmic game theory. During the 1980s
Vijay_Vazirani
American technology entrepreneur and scientist
graduating senior) in at least a century among over 6000 graduates from UC Berkeley. He has been featured in the San Francisco Chronicle, ABC News, Times of
Ritankar_Das
System with multiple networked computers
as "distributed system", "distributed programming", and "distributed algorithm" originally referred to computer networks where individual computers were
Distributed_computing
Ethiopian computer scientist (born 1991)
working in algorithms and artificial intelligence. She is an assistant professor of computer science at the University of California, Berkeley. Previously
Rediet_Abebe
Software that maintains time synchronization
Election Algorithm for a Distributed Clock Synchronization Program (Technical report). Computer Science Division (EECS) University of California, Berkeley. CSD-86-275
Timed
Computer program for complexity reduction of digital logic circuits
ESPRESSO algorithm, developed by Brayton et al. at the University of California, Berkeley. It is a resource and performance efficient algorithm aimed at
Espresso heuristic logic minimizer
Espresso_heuristic_logic_minimizer
The term "auction algorithm" applies to several variations of a combinatorial optimization algorithm which solves assignment problems, and network optimization
Auction_algorithm
2016 non-fiction book by Tom Griffiths and Brian Christian
Algorithms to Live By: The Computer Science of Human Decisions is a 2016 non-fiction book by Brian Christian and Tom Griffiths. The book explores the heuristics
Algorithms_to_Live_By
American computer scientist
Discrete Ham-Sandwich Theorems: Provably Good Algorithms for Routing and Packing Problems". UC Berkeley. Retrieved 19 May 2014. Advisor: Clark D. Thompson
Prabhakar_Raghavan
Computer Science Institute in Berkeley. Sinclair’s research interests include the design and analysis of randomized algorithms, computational applications
Alistair_Sinclair
page lists notable alumni and students of the University of California, Berkeley. Alumni who also served as faculty are listed in bold font, with degree
List of University of California, Berkeley alumni
List_of_University_of_California,_Berkeley_alumni
Computational geometry problem
systematic study of the computational complexity of geometric algorithms. Randomized algorithms that solve the problem in linear time are known, in Euclidean
Closest pair of points problem
Closest_pair_of_points_problem
Algorithm for matrix multiplication
In computer science, Cannon's algorithm is a distributed algorithm for matrix multiplication for two-dimensional meshes first described in 1969 by Lynn
Cannon's_algorithm
American computer scientist (born 1961)
peer-reviewed technical papers on algorithms for Robotics, Automation, and social information filtering. Goldberg leads the UC Berkeley Automation Sciences Lab
Ken_Goldberg
American mathematician (1921–2008)
economist. He was a professor emeritus at the University of California, Berkeley, affiliated with the departments of mathematics, economics, and industrial
David_Gale
American mathematician (1914–2005)
statistics. Dantzig is known for his development of the simplex algorithm, an algorithm for solving linear programming problems, and for his other work
George_Dantzig
Chinese-American computer scientist and mathematician
optimization ... algorithm of INGRES [Wong and Youssefi, 1976] "Eugene Wong - Convocation". "Ph.D. Dissertations - Eugene Wong". EECS at UC Berkeley. Retrieved
Eugene_Wong
American mathematician
research at the University of California, Berkeley. She is known for her work on approximation algorithms, particularly for facility location, covering
Dorit_S._Hochbaum
Algorithmic management is a term used to describe certain labor management practices in the contemporary digital economy. In scholarly uses, the term
Algorithmic_management
Image-based volume rendering technique
with object-based techniques. In its basic form, the volume ray casting algorithm comprises four steps: Ray casting. For each pixel of the final image,
Volume_ray_casting
Canadian mathematician and computer scientist
floating-point bugs. He also developed the Kahan summation algorithm, an important algorithm for minimizing error introduced when adding a sequence of
William_Kahan
mathematics at University of California, Berkeley, and a mathematician faculty senior scientist at the Lawrence Berkeley National Laboratory. His research focuses
Per-Olof_Persson
Computer scientist and entrepreneur
Limitations and Possibilities of Algorithmic Mechanism Design (PhD dissertation). University of California, Berkeley. Retrieved 19 May 2026. Papadimitriou
Yaron_Singer
Line-clipping algorithm
Liang–Barsky algorithm (named after You-Dong Liang and Brian A. Barsky) is a line clipping algorithm first published in early 1984. The Liang–Barsky algorithm uses
Liang–Barsky_algorithm
Producing images of 3D scenes
rendering equation. Real-time rendering uses high-performance rasterization algorithms that process a list of shapes and determine which pixels are covered by
Rendering_(computer_graphics)
Method in computer arithmetic
space use in hardware to perform the same functions as floating-point algorithms, by reusing the exponent; some operations over multiple values between
Block_floating_point
Open-source software for large language model inference
multimodal models. Originally developed at the University of California, Berkeley's Sky Computing Lab, the project is centered on PagedAttention, a memory-management
VLLM
Machine learning technique
introduced the view of boosting algorithms as iterative functional gradient descent algorithms. That is, algorithms that optimize a cost function over
Gradient_boosting
American professor of chemistry
Energy Nanosciences Institute. At Lawrence Berkeley National Laboratory, Whaley is a member of the Quantum Algorithms Team for Chemical Sciences in the research
K._Birgitta_Whaley
Ray-box intersection method
In computer graphics, the slab method is an algorithm used to solve the ray-box intersection problem in case of an axis-aligned bounding box (AABB), i
Slab_method
Italian-American computer scientist (born 1954)
also developed a pseudorandom generator at this time, the Blum-Micali algorithm. Micali, Goldwasser, and Charles Rackoff invented interactive proofs in
Silvio_Micali
Theoretical computer scientist
mathematician known for her research in computational complexity theory and algorithms. She is currently the Steven and Renee Finn Career Development Associate
Virginia_Vassilevska_Williams
Statistician
piece of machine learning technologies, the k-Nearest Neighbor (k-NN) algorithm. She was a Fellow of the Institute of Mathematical Statistics. In her
Evelyn_Fix
Arbiter on a node in a packet switching communication network
also called packet scheduler, queueing discipline (qdisc) or queueing algorithm, is an arbiter on a node in a packet switching communication network.
Network_scheduler
Indian computer scientist (1962–2009)
Berkeley in Berkeley, California, United States in 1988, under the supervision of Richard M. Karp. Motwani joined Stanford soon after U.C. Berkeley.
Rajeev_Motwani
Swedish computer scientist
He is a co-founder and CEO of Databricks and an adjunct professor at UC Berkeley. He coauthored several influential papers, including Apache Mesos and Apache
Ali_Ghodsi
American mathematician and billionaire (1938–2024)
are known to be quantitative investors, using mathematical models and algorithms to make investment gains from market inefficiencies. Due to the long-term
Jim_Simons
American physicist and statistician
Carnegie Mellon University in Pittsburgh. Shalizi is co-author of the CSSR algorithm, which exploits entropy properties to efficiently extract Markov models
Cosma_Shalizi
Mathematical function, inverse of an exponential function
commonplace in scientific formulae, and in measurements of the complexity of algorithms and of geometric objects called fractals. They help to describe frequency
Logarithm
Book by Stuart J. Russell and Peter Norvig
information about the working of algorithms in AI. The book's chapters span from classical AI topics like searching algorithms and first-order logic, propositional
Artificial Intelligence: A Modern Approach
Artificial_Intelligence:_A_Modern_Approach
Open source software security toolkit library
to know many of the low-level details of encryption or authentication algorithms. Extensive documentation in the form of a 400+ page programming manual
Cryptlib
Concept in computer science
assumptions, no algorithm can always reach consensus in bounded time. In practice it is highly unlikely to occur. The Paxos consensus algorithm by Leslie Lamport
Consensus_(computer_science)
American mathematician (1935–2020)
graph theory, the Coffman–Graham algorithm for approximate scheduling and graph drawing, and the Graham scan algorithm for convex hulls. He also began
Ronald_Graham
Computational problem in graph theory
"Finally, a Fast Algorithm for Shortest Paths on Negative Graphs". Quanta Magazine. Retrieved 25 January 2023. "FOCS 2022". focs2022.eecs.berkeley.edu. Retrieved
Maximum_flow_problem
UC Berkeley research lab
University of California, Berkeley lab focused on big data analytics located in Soda Hall. The name stands for the Algorithms, Machines and People Lab
AMPLab
American mathematician (1905–1991)
Lehmer was born in Berkeley, California, to Derrick Norman Lehmer, a professor of mathematics at the University of California, Berkeley, and Clara Eunice
D._H._Lehmer
release). D-Wave Systems. 2019-09-24. Retrieved 2020-05-04. "Quantum Algorithms". www.cogniframe.com. Retrieved 2019-09-24. Saffman, Mark (4 October 2016)
List of companies involved in quantum computing, communication or sensing
List_of_companies_involved_in_quantum_computing,_communication_or_sensing
Climatological research institute
The Berkeley Earth analysis uses a new methodology and was tested against much of the same data as NOAA and NASA. The group uses an algorithm that attaches
Berkeley_Earth
Computer vision researcher
received popular press coverage, including a pop-song generator and an algorithm to suggest fashion improvements. Prior to joining the University of Toronto
Sanja_Fidler
Algorithm for polynomial evaluation
mathematics and computer science, Horner's method (or Horner's scheme) is an algorithm for polynomial evaluation. It is named after William George Horner, although
Horner's_method
Scheduling algorithm for the network scheduler
Robin (DRR), also Deficit Weighted Round Robin (DWRR), is a scheduling algorithm for the network scheduler. DRR is, similar to weighted fair queuing (WFQ)
Deficit_round_robin
Method in machine learning
learning (ML) ensemble meta-algorithm designed to improve the stability and accuracy of ML classification and regression algorithms. It also reduces variance
Bootstrap_aggregating
Algorithm for labeling clusters on a grid
The Hoshen–Kopelman algorithm is a simple and efficient algorithm for labeling clusters on a grid, where the grid is a regular network of cells, with
Hoshen–Kopelman_algorithm
American computer scientist
main areas of research are compiler optimization, scheduling theory and algorithm analysis and design. Simons has worked for technology regulation since
Barbara_Simons
Israeli computer scientist
quantum computing. She is known for her works on quantum algorithms. The Aharonov–Jones–Landau algorithm is named after her. Aharonov was born in Washington
Dorit_Aharonov
BERKELEY ALGORITHM
BERKELEY ALGORITHM
Boy/Male
American, Anglo, Australian, British, Christian, English, Irish
From the Birch Tree Meadow; Place Name; Where Birches Grow
Boy/Male
American, Anglo, Australian, British, English, Irish
From the Birch Tree Meadow; Place Name; Where Birches Grow
Boy/Male
English Irish
The birch tree meadow. Also see Barclay and Burke.
Boy/Male
American, Australian, British, Chinese, English
From the Birch Tree Meadow; Place Name; Where Birches Grow
Boy/Male
Scottish
From Berkeley.
Boy/Male
Anglo Saxon Irish English Shakespearean
From the birch meadow.
Boy/Male
English
Birch valley; birch tree meadow.
Surname or Lastname
English
English : habitational name from any of the various places, in Kent, Oxfordshire, and Sussex, named Beckley, from the Old English byname Becca (see Beck 4) + Old English lēah ‘woodland clearing’.Altered spelling of the South German and Swiss topographic names Bächle, Bächli (see Bach 1).Richard Beckley was one of the free planters who assented to the ‘Fundamental Agreement’ of the New Haven Colony on June 4, 1639.
Surname or Lastname
English
English : habitational name from Berkeley in Gloucestershire, named in Old English with be(o)rc ‘birch’ + lēah ‘woodland clearing’. Compare Scottish Barclay.Jewish (American) : assimilated form of Berkowitz.
Surname or Lastname
Americanized spelling of Swiss German Bürki, or an altered spelling of Berke (see Berke 2).Possibly an Americanized spelling of Hungarian Berki, a habitational name from a village called Berki, in Pest county, or a topographic name from berek ‘marsh wi
Americanized spelling of Swiss German Bürki, or an altered spelling of Berke (see Berke 2).Possibly an Americanized spelling of Hungarian Berki, a habitational name from a village called Berki, in Pest county, or a topographic name from berek ‘marsh with groves’.English : unexplained.
Surname or Lastname
English (mainly West Yorkshire and Lancashire)
English (mainly West Yorkshire and Lancashire) : from any of several places so named in Staffordshire, Cheshire, Derbyshire, Cumbria, and elsewhere (see Blakely).
Surname or Lastname
English
English : variant spelling of Burley.Probably an altered spelling of Swiss German Beerli, from a short form of the Germanic personal name Berilo, from Old High German bero ‘bear’.Possibly an Anglicized spelling of French Berlet, from a diminutive of Berle, a topographic name from Old French berle ‘water parsnip’ (of Celtic origin, compare Welsh berur, Gaelic biorar ‘watercress’), or perhaps an occupational name for a grower of the plant.
Girl/Female
British, English
Pale-skinned; Dark
Surname or Lastname
Altered form of Swiss and South German Bürkle, Bürkli (see Burkle).English
Altered form of Swiss and South German Bürkle, Bürkli (see Burkle).English : variant of Berkeley.
Surname or Lastname
English
English : habitational name from a place in Cheshire named Bulkeley, from Old English bulluc ‘bullock’ + lēah ‘woodland clearing’.Peter Bulkeley (1583–1659), Puritan divine, who came from Bedfordshire, England, was a founder of Concord, MA, in 1636.
Boy/Male
American, Anglo, Australian, British, English
From the Dark Meadow; Pale Meadow
Boy/Male
English
From the light meadow; from the dark meadow.
Surname or Lastname
English
English : habitational name from Beeley in Derbyshire, which is named with the Old English personal names Bēage (female) or Bēga (male) + lēah ‘woodland clearing’.
Surname or Lastname
English
English : variant of Berkeley.Jewish (Ashkenazic) : assimilated form of Berkowitz.
Surname or Lastname
English
English : variant spelling of Byerly.Americanized spelling of German Beyerle.
BERKELEY ALGORITHM
BERKELEY ALGORITHM
Girl/Female
Muslim
Glory of the Moon
Boy/Male
American, Anglo, Australian, British, Chinese, Christian, Czechoslovakian, Danish, Dutch, English, Finnish, French, German, Greek, Hebrew, Irish, Latin, Portuguese, Spanish, Swedish, Swiss
Fortunate; Happy; Name of a Saint; Lucky; Successful
Male
English
 English name derived from the Old French word lance, LANCE means "lance (the weapon)." Compare with another form of Lance.
Male
French
French form of Roman Latin Valerianus, VALÉRIAN means "to be healthy, to be strong."
Girl/Female
Norse
Peaceful ruler.
Boy/Male
Italian Latin Spanish American
Savior.
Female
English
(Greek ΟφÎλια): Feminine form of Greek Ophelos, OPHELIA means "help." This name was used by Shakespeare for an ill-omened character in Hamlet.
Girl/Female
Hindu, Indian
Mountain
Girl/Female
Hindu, Indian, Kannada
Morning Star
Boy/Male
Indian
Sign of Love
BERKELEY ALGORITHM
BERKELEY ALGORITHM
BERKELEY ALGORITHM
BERKELEY ALGORITHM
BERKELEY ALGORITHM
n.
Alt. of Algorithm
n.
The doctrine that external bodies may be reduced to mind and ideas in a mind; any doctrine opposed to materialism or phenomenalism, esp. a system that maintains the immateriality of the soul; idealism; esp., Bishop Berkeley's theory of idealism.
n.
The art of calculating by nine figures and zero.
n.
The art of calculating with any species of notation; as, the algorithms of fractions, proportions, surds, etc.
a.
Of or relating to Bishop Berkeley or his system of idealism; as, Berkeleian philosophy.
n.
The doctrine, in opposition to the materialists, that all which exists is spirit, or soul -- that what is called the external world is either a succession of notions impressed on the mind by the Deity, as maintained by Berkeley, or else the mere educt of the mind itself, as taught by Fichte.